Cartesian Product — Definition, Formula & Example
The Cartesian product of two sets is the set of every ordered pair you can form by taking the first entry from the first set and the second entry from the second set. It is also called the product set. If one set has 3 elements and the other has 2, you get 6 pairs.
For sets and , the Cartesian product is . Here if and only if and . The definition extends to sets: is the set of ordered -tuples with each . If either factor is empty, then .
Key Formula
Where:
- = Number of elements in the finite set A
- = Number of elements in the finite set B
- = Number of ordered pairs in the Cartesian product
Worked Example
Problem: Let and . List the elements of , count them, and decide whether .
Step 1: Pair each element of A with each element of B. The element from A always goes first.
Step 2: Count the pairs with the size rule. A has 3 elements and B has 2.
Step 3: Build B × A by putting the element of B first. It also has 6 pairs, but the pairs are different. For example, is in , while is in .
Answer: has 6 ordered pairs. , even though both sets have 6 elements.
Why It Matters
The coordinate plane is the Cartesian product , so every point is one of its elements. In a discrete math or intro proofs course, a relation from to is usually defined as a subset of , and a function as a relation that pairs each element of with exactly one element of . In probability, the sample space for rolling two dice is , which has 36 outcomes.
Common Mistakes
Mistake: Assuming because both sets always have the same number of elements.
Correction: The entries are ordered pairs, so . The two products are equal only when or when at least one of the sets is empty. Equal size does not mean the sets are equal.
