In set theory, the Cartesian product is a fundamental concept used to combine elements of two sets in an ordered manner. It plays a crucial role in:
Unlike union or intersection, the Cartesian product focuses on forming ordered pairs.
The Cartesian product of two sets A and B is the set of all ordered pairs (a, b) such that:
a ∈ Ab ∈ BA × B = { (a, b) | a ∈ A and b ∈ B }
An ordered pair (a, b) means:
AB⚠ Important:
(a, b) ≠ (b, a)
Order matters.
Let:
A = {1, 2}
B = {a, b}
Then:
A × B = { (1, a), (1, b), (2, a), (2, b) }
B × A = { (a, 1), (a, 2), (b, 1), (b, 2) }
✔ Clearly:
A × B ≠ B × A
If:
n(A) = mn(B) = nThen:
n(A × B) = m × n
A = {1, 2, 3} → n(A) = 3
B = {x, y} → n(B) = 2
n(A × B) = 3 × 2 = 6
A × A
Example:
A = {1, 2}
A × A = { (1,1), (1,2), (2,1), (2,2) }
A × ∅ = ∅
∅ × A = ∅
✔ No ordered pairs possible
A = {1}
B = {a, b}
A × B = { (1,a), (1,b) }
A × B(x, y) in graphsA × B ≠ B × A)Cartesian product is written as A × B
Defined as:
{ (a, b) | a ∈ A and b ∈ B }Produces ordered pairs
Number of elements:
n(A × B) = n(A) × n(B)Important in relations, functions, and coordinate geometry