Q.Let and . Determine
The Cartesian product is the set of all ordered pairs where and . We systematically pair each element of the first set with every element of the second set.
The Cartesian product captures a fundamental idea: how do we combine two sets to form ordered pairs? Unlike ordinary set operations (union, intersection), the Cartesian product creates a new kind of object — pairs where order matters. The notation means "take every element from and pair it with every element from , in that order."
This matters because unless . The first coordinate always comes from the first set, the second from the second set. If has elements and has elements, then will have exactly ordered pairs.
Given and , let's work through each product.
(i) Finding
-
Pair each element of with each element of .
Start with :
- and
Next, :
- and
Finally, :
- and
-
Collect all pairs.
We have ordered pairs, as expected.
(ii) Finding
-
Now reverse the role: pair each element of with each element of .
Start with :
- , ,
Next, :
- , ,
-
Collect all pairs.
Again, ordered pairs.
Notice that in general. For instance, but (since ). The Cartesian product is not commutative.
(iii) Finding
-
Pair each element of with each element of itself.
From :
- and
From :
- and
-
Collect all pairs.
We have ordered pairs.
(iv) Finding
-
Pair each element of with each element of .
From :
- , ,
From :
- , ,
From :
- , ,
-
Collect all pairs.
We have ordered pairs.
When computing or , you can organize the pairs in a grid: rows indexed by the first coordinate, columns by the second. This visual structure makes it easy to verify you haven't missed any pairs.
The Cartesian products are:
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.