Ordered Pairs

Set Theory · Axiom Academy

The foundation of relations: pairs where order matters An ordered pair (a, b) consists of two elements where the first element a is distinguished from the second element b. The crucial property is: This means (1, 2) is fundamentally different from (2, 1), unlike the set 1, 2 which equals 2, 1 . In set theory, we can define ordered pairs using only sets. The most common definition is Kuratowski's: This clever construction ensures that we can recover both a and b, and more importantly, we can determine which is first and which is second. The singleton a marks the first element. The ordering in pairs allows us to represent relationships with direction: Examples where order is crucial: Coordinates: (3, 5) represents a different point than (5, 3) Fractions: the pair (numerator, denominator) matters Relationships: "x is the parent of y" is not the same as "y is the parent of x" Ordered pairs naturally extend to ordered triples, quadruples, and generally n-tuples: This allows us to work with coordinate systems in higher dimensions, database records with multiple fields, and any structure where order among multiple elements matters. The Cartesian product A × B is the set of all ordered pairs (a, b) where a ∈ A and b ∈ B: Example: If A = 1, 2 and B = x, y, z , then: A × B = (1,x), (1,y), (1,z), (2,x), (2,y), (2,z) Note that |A × B| = |A| · |B|, and generally A × B ≠ B × A.

This is the written version of the interactive lesson above. See the full Set Theory course.