Q.If and , form the sets and . Are these two products equal?
The Cartesian product is ordered: pairs each element of first with each element of , while reverses the order. Since , the two products are not equal.
The Cartesian product is the set of all ordered pairs where and . The word "ordered" is crucial: the pair is fundamentally different from unless . Think of coordinates on a plane — the point is not the same as .
When we form , we're asking: "What are all the ways to pick a first component from and a second component from ?" The reverse product asks the same question with roles swapped. Let's see what happens.
Forming
- List all ordered pairs where and . Since and , we pair each element of with the single element :
- Count the elements. We have and , so .
Forming
- List all ordered pairs where and . Now the first component comes from and the second from :
- Count the elements. Again, .
Comparing the two products
-
Check element-by-element equality.
For two sets to be equal, they must contain exactly the same elements. Compare:
The pair has in the first position and in the second. The pair has first and second. These are different ordered pairs because the order matters in the definition of an ordered pair.
-
Conclude.
Since no element of appears in (and vice versa), the two sets are disjoint. They have the same cardinality but completely different elements.
A common mistake is to think that because both products involve the same "ingredients" , they must be equal. But Cartesian products are sets of ordered pairs, and in general.
In general, only when or one of them is empty. The Cartesian product is not commutative.
The two products are not equal: and are disjoint 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.