Q.Let , and . Find
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 Cartesian product distributes over intersection and union: and . For the given sets, the results are and respectively.
The Cartesian product is the set of all ordered pairs where and . The key insight here is that the product operation distributes over set intersection and union — just like multiplication distributes over addition in arithmetic. This isn't a coincidence: both are binary operations that "pair" elements from two sets, and the distributive laws hold because the condition " is in and is in both and " is logically equivalent to " is in and is in " and " is in and is in ". We'll verify this explicitly.
Let's compute each part step by step.
-
Find first.
, . The only common element is , so .
-
Compute .
and . Form all ordered pairs with first element from and second element from :
- Compute and separately. : pair each element of with each element of :
: pair each element of with each element of :
- Find . The common ordered pairs between the two sets are those where the second coordinate is in both and — that is, . So we take all pairs with second element :
This matches exactly the result from part (i), confirming .
The distributive law always holds. You can skip computing both sides separately once you're confident — just find and take the product.
-
Find .
, , so .
-
Compute . …
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.