Q.Let , , and . Verify that
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, so holds. Also, since and , every ordered pair in is also in , making a subset of .
Why This Works — The Core Idea
The Cartesian product is the set of all ordered pairs where and . When we intersect two sets before taking the product, we are restricting the second coordinate to elements that belong to both sets. On the other hand, taking the product first and then intersecting keeps only those pairs whose second coordinate is common to both original sets. These two processes yield exactly the same collection of pairs — that’s the distributive law.
For the subset part, if every element of is also in , and every element of is also in , then any pair automatically has its first coordinate in and its second in , so it belongs to .
Let’s verify both statements concretely.
(i)
Step 1: Compute
, . These sets have no common element, so
Step 2: Compute
The Cartesian product with an empty set is empty:
Step 3: Compute
,
Step 4: Compute
,
Step 5: Intersect and
Look for pairs that appear in both lists. The first set has second coordinates ; the second set has second coordinates . No pair can match because the second coordinates are disjoint.
Step 6: Compare
Both sides are , so the equality holds.
A common mistake is to think might be non-empty just because the sets look similar. Always check actual elements — here and share nothing.
(ii) is a subset of
Step 1: Check the sets …
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.