Q.Match the following sets for all sets , and :
Column I:
Column II:
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →This problem involves simplifying various set expressions using fundamental set algebra rules and properties of the Cartesian product. The key is to systematically apply definitions like and De Morgan's Laws, and for Cartesian products, to use their definition in terms of ordered pairs to demonstrate distributivity. The final matches are (i)-(b), (ii)-(c), (iii)-(a), (iv)-(f), (v)-(d), (vi)-(e).
The core idea behind solving this problem is to systematically simplify each expression in Column I using the fundamental laws of set algebra and the definitions of set operations. For expressions involving set difference and complement, converting them to expressions involving only union and intersection often makes simplification easier. For Cartesian products, we rely on their definition in terms of ordered pairs and how they interact with union and intersection.
Here are the key definitions and laws we will use:
- Set Difference:
- De Morgan's Laws:
- Double Complement:
- Absorption Laws:
- Distributive Laws:
- Cartesian Product:
Let's simplify each expression from Column I:
- Simplify
We start by simplifying the expression inside the outermost complement.
- First, apply the definition of set difference to :
* Now, we have $(A' \cup B') \cap A'$. Notice that $A'$ is common to both parts of the intersection. This is a direct application of the absorption law $X \cap (X \cup Y) = X$, where $X = A'$ and $Y = B'$.
* Finally, we apply the outermost complement:
This matches **(b) $A$** from Column II.
2. Simplify
Again, we simplify the expression inside the outermost complement first.
* Apply the definition of set difference to :
* Substitute this back into the expression:
* This is a direct application of the absorption law $X \cup (X \cap Y) = X$, where $X = B'$ and $Y = A'$.
* Finally, apply the outermost complement:
This matches **(c) $B$** from Column II.
3. Simplify
We will convert all set differences to intersections with complements.
* Convert :
* Convert $(B - C)$:
* Substitute these back into the original expression:
* Now, apply the definition of set difference $X - Y = X \cap Y'$ to this entire expression, where $X = (A \cap B')$ and $Y = (B \cap C')$:
* Apply De Morgan's Law to $(B \cap C')'$:
* Substitute this back:
* Now, distribute $(A \cap B')$ over the union $(B' \cup C)$:
* Since $B' \cap B' = B'$, the first term simplifies:
* This is another application of the absorption law $X \cup (X \cap Y) = X$, where $X = (A \cap B')$ and $Y = C$.
* Finally, convert $A \cap B'$ back to set difference:
This matches **(a) $A - B$** from Column II.
4. Simplify
Convert the set differences to intersections with complements.
* Convert :
* Convert $(C - B)$:
* Substitute these back into the original expression:
* Since intersection is associative and commutative, we can rearrange and group terms:
* Since $B' \cap B' = B'$:
* Convert this back to set difference:
This matches **(f) $(A \cap C) - B$** from Column II.
5. Simplify
The Cartesian product distributes over intersection. We can prove this by using the definition of ordered pairs.
* An element belongs to if and only if:
* By the definition of intersection, $y \in (B \cap C)$ means $y \in B$ and $y \in C$. So:
* We can rearrange the logical "and" statements: …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.