Cartesian Products Intersection When Sets Share Elements
Let and be finite sets and let . We will show that the Cartesian products and have exactly elements in common.
A pair lies in both and exactly when:
- and , and also
- and .
Equivalently, this means and . Therefore the intersection satisfies
Now if , then the set has elements (since each coordinate can be any of the common elements).
So the cardinality of the intersection is
Important note (consistency check): The standard result gives common elements, not . The statement “ elements in common” matches the size of a power set (i.e., ), but not the intersection of Cartesian products.
Cartesian Product Basics (Sets and Elements)
Derive the intersection $(A×B)∩(B×A)$
- 1Step 1
A pair iff and .
- 2Step 2
means and ; means and .
- 3Step 3
From both conditions, and .
- 4Step 4
Thus .
- 5Step 5
If , then .
About the $2^n$ claim
For Cartesian products, the intersection size becomes . The expression is typical for power sets: , not for .
To connect with the common “” intuition, observe:
- counts ordered pairs of common elements, giving outcomes.
- counts subsets of common elements, giving outcomes.
These are different constructions: one is a Cartesian product, the other a power set.
We can state this cleanly with keywords:
- Cartesian product
- Intersection of sets
- Power set
- Cardinality
Common-element counts: Cartesian products vs power set
For , the intersection size of Cartesian products is , while is the power set size.
FAQ / Edge cases
Intersection of Cartesian Products
Knowledge Check
If , what is ?