Ordinal number

Lore & Background

Ordinal numbers were introduced by Georg Cantor in 1883 to accommodate infinite sequences and classify derived sets, which he had previously introduced in 1872 while studying the uniqueness of trigonometric series. The definition generalizes the process of enumerating a finite set by successively labeling each element with the least natural number not previously used. For infinite sets, ordinals are defined as a linearly ordered class that includes the natural numbers and has the property that every non-empty collection of ordinals has a least element, allowing the definition of ω (omega) as the least element greater than every natural number, followed by ω+1, ω+2, etc.

The Zermelo–Fraenkel set theory asserts that for any set of ordinals, there exists another ordinal greater than all of them. The collection of all ordinals is not a set but a proper class, a fact that resolves the Burali-Forti paradox. A linear order where every non-empty subset has a least element is called a well-order, and the axiom of choice implies that every set can be well-ordered. Given two well-ordered sets, one is isomorphic to an initial segment of the other, and the isomorphism is unique, allowing a unique ordinal (its order type) to be associated with each well-ordered set.

Ordinals are distinct from cardinal numbers, which measure the size of sets. While the distinction is not apparent on finite sets, different infinite ordinals can correspond to sets having the same cardinal. Ordinals can be added, multiplied, and exponentiated, though none of these operations are commutative. The concept of well-ordering enables transfinite induction: if a statement about an ordinal is not universally true, it must have a least counterexample.

Reader's Guide

Ordinal numbers are a cornerstone of set theory and transfinite mathematics. Their significance lies in providing a rigorous framework for extending the concept of counting and ordering beyond the finite, enabling mathematicians to reason about infinite sequences and processes. The well-ordering property—that every non-empty collection of ordinals has a least element—grounds the principle of transfinite induction, a powerful generalization of mathematical induction that allows proofs over all ordinals. This is essential in areas such as topology, analysis, and logic, where constructions often involve transfinite recursion.

The legacy of ordinals includes their role in resolving foundational paradoxes like the Burali-Forti paradox, which arises from considering the set of all ordinals. The Zermelo–Fraenkel set theory's resolution—that the collection of all ordinals is a proper class, not a set—illustrates the careful distinctions needed in axiomatic set theory. Ordinals also clarify the difference between order and size: while cardinal numbers measure the size of sets, ordinals capture the structure of well-orders, allowing different ordinals to have the same cardinality. This distinction is crucial in infinite mathematics, where, for example, ω and ω+1 have the same cardinality but different order types. The operations of ordinal addition, multiplication, and exponentiation, though non-commutative, provide a rich algebraic structure that models nested induction and iterative processes, as seen in ordinals like ω² or ω^ω.

Did You Know?

• Ordinals were introduced by Georg Cantor in 1883 to accommodate infinite sequences and classify derived sets.
• The collection of all ordinals is not a set but a proper class, resolving the Burali-Forti paradox.
• Ordinals can be added, multiplied, and exponentiated, but none of these operations are commutative.
• Different infinite ordinals can correspond to sets having the same cardinal number.