Q.If , and , then .
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 →The problem asks us to verify a statement involving Cartesian products and set union. By directly calculating the Cartesian products and , and then finding their union, we find that the given statement is true.
The core concept here is the Cartesian product of sets, which creates ordered pairs, and the union of sets, which combines elements. We are asked to evaluate an expression involving both operations and compare it to a given set.
A key property that simplifies such problems is the distributive law of Cartesian products over set union. This property states that for any sets , , and :
This means we can either first find the union of and and then take its Cartesian product with , or we can find the Cartesian products and separately and then take their union. Both approaches will yield the same result. We will demonstrate this by calculating both sides of the equation.
Let's break down the calculation step-by-step.
-
Identify the given sets:
We are given three sets:
-
Calculate :
The Cartesian product consists of all possible ordered pairs where and .
For each element in , we pair it with every element in :
- For :
- For :
- For : Combining these, we get:
-
Calculate :
Similarly, consists of all possible ordered pairs where and .
- For :
- For :
- For : Combining these, we get:
-
Calculate :
The union of two sets combines all unique elements from both sets. In this case, the elements are ordered pairs. We list all pairs from and , ensuring we do not repeat any pair that appears in both sets.
Pairs from :
Pairs from :
Notice that the pairs , , and are present in both and . When forming the union, we include them only once. …
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.