Ordinal Numbers — Mathematics Knowledge System

Overview

Ordinal numbers extend the natural numbers 0, 1, 2, 3, ... past every finite number, giving a precise way to describe the 'position' of an element in a well-ordered set rather than just how many elements there are. After all the finite ordinals comes ω, the first infinite ordinal (the order type of the naturals themselves), then ω+1, ω+2, ..., then ω·2, ω·3, ..., then ω², and onward without end. In the von Neumann construction, each ordinal IS the set of all ordinals strictly less than it — so 0 = ∅, 1 = {0}, 2 = {0,1}, and ω = {0,1,2,...} — which makes '<' between ordinals literally the same as '∈'. Every ordinal is either 0, a successor (α+1 for some ordinal α), or a limit ordinal (one with no immediate predecessor, like ω); this trichotomy is exactly what licenses transfinite induction and recursion.

Intuition

Think of ordinals as labeled positions in a queue that never has to end. The first few positions are 0, 1, 2, 3, ... — the usual counting numbers. But suppose you let an infinite queue of people finish, and THEN someone new joins at the very end: their position is ω, a genuinely new number that comes 'after all the finite ones.' You can keep going: ω+1, ω+2, ... and then let another infinite group finish to reach ω+ω = ω·2, and so on forever. Every ordinal is exactly the collection of positions that come strictly before it — position 3 IS the set {0,1,2}, and position ω IS the set {0,1,2,3,...} of every finite position. This is why ordinals split cleanly into three kinds: zero (no predecessor at all), successors (immediately after one specific ordinal, like 5 after 4), and limits (reached only by 'gathering up' an entire infinite run of predecessors at once, like ω).

Formal Definition

Definition

A set α is an ordinal (in the von Neumann sense) if α is transitive (every element of α is also a subset of α) and α is well-ordered by ∈. Ordinals are compared by α < β iff α ∈ β, and every ordinal α equals the set of all ordinals strictly less than itself: α = {β : β < α}. Every ordinal is exactly one of: 0 (the empty set), a successor α+1 = α ∪ {α} for a unique ordinal α, or a limit ordinal λ = sup{β : β < λ}, meaning λ ≠ 0 and λ has no largest element below it.

\alpha = \{\beta : \beta < \alpha\}

Von Neumann ordinal: each ordinal is the set of smaller ordinals

\alpha < \beta \iff \alpha \in \beta

Ordinal comparison is set membership

\alpha + 1 = \alpha \cup \{\alpha\}

Successor ordinal

\lambda \text{ is a limit ordinal} \iff \lambda \neq 0 \text{ and } \lambda = \sup_{\beta < \lambda} \beta

Limit ordinal: no immediate predecessor

0 = \emptyset,\quad 1 = \{0\},\quad 2 = \{0,1\},\quad \omega = \{0,1,2,\ldots\}

First few ordinals

Notation

Notation	Meaning
$\omega$	The first infinite ordinal — the order type of the natural numbers 0,1,2,3,...
$\alpha+1$	The successor of ordinal α, equal to α ∪ {α}
$\sup_{\beta<\lambda}\beta$	The supremum (least upper bound) of a set of ordinals, used to define limit ordinals
$\mathrm{Ord}$	The (proper) class of all ordinal numbers
$\omega \cdot 2$	Ordinal multiplication: ω followed by another full copy of ω, i.e. ω+ω

Properties

Trichotomy

\forall \alpha,\beta \in \mathrm{Ord},\; \alpha < \beta \lor \alpha = \beta \lor \beta < \alpha

Well-ordering of the ordinals

\text{Every nonempty class of ordinals has a least element}

Every ordinal is 0, a successor, or a limit

\forall \alpha,\; \alpha = 0 \lor \exists \beta(\alpha=\beta+1) \lor \alpha \text{ is a limit}

Ordinal addition is not commutative

1 + \omega = \omega \neq \omega + 1

Burali-Forti paradox

\text{The collection of all ordinals is not itself a set}

Condition: If it were a set Ω, Ω would be an ordinal greater than every ordinal in Ω, including itself — a contradiction

Applications

Ordinals measure termination of recursive algorithms and term-rewriting systems whose recursion depth is not literally finite in a naive sense, via 'ordinal ranking' arguments in proof theory.

Worked Examples

5 = 4 ∪ {4}, the successor of 4.
$5 = 4+1$
ω has no immediate predecessor — no single finite ordinal n has n+1=ω — so it is a limit ordinal.
$\omega = \sup\{0,1,2,\ldots\}$
ω+3 = (ω+2)+1, the successor of ω+2.
$\omega+3 = (\omega+2)+1$

Answer: 5 is a successor ordinal, ω is a limit ordinal, and ω+3 is a successor ordinal.

Practice Problems

Difficulty 5/10

Which of the following is a limit ordinal?

7ω+1ω·20

Difficulty 6/10

Using the von Neumann definition, write out the ordinal 3 explicitly as a set, and state what element it contains that ordinal 2 does not.

Difficulty 7/10

Explain informally why the class of all ordinals cannot itself be a set (the Burali-Forti paradox).

Common Mistakes

Common Mistake

Treating ordinal arithmetic as commutative, the way natural-number arithmetic is.

Ordinal addition and multiplication are NOT commutative in general: 1+ω=ω but ω+1≠ω, and 2·ω=ω but ω·2≠ω. Order matters because ordinals encode sequencing, not just quantity.

Common Mistake

Confusing ordinals with cardinals, thinking ω and ω+1 have 'different sizes.'

ω and ω+1 have the SAME cardinality (both countably infinite, ℵ₀) — they differ only in order type/position, not in size. Ordinals track order; cardinals track size.

Quiz

Historical Background

Georg Cantor introduced ordinal numbers in the 1880s while developing transfinite set theory, needing a way to extend counting past the finite numbers to describe the order types of well-ordered sets built by iterating a 'next element' operation indefinitely. His original definitions were informal set-theoretic order types; John von Neumann, in 1923, gave the now-standard definition in which every ordinal is simply the set of all smaller ordinals, making the theory fully rigorous within axiomatic set theory (ZFC) and eliminating the need for a separate primitive notion of 'order type.' The theory of ordinals became foundational to set theory's development, underlying transfinite induction/recursion, the cumulative hierarchy of sets, and later, the definition of cardinal numbers as special ordinals (the least ordinal of each cardinality).

1883
Cantor introduces transfinite ordinal numbers while studying well-ordered sets
Georg Cantor
1897
Cantor develops the theory of alephs and ordinal arithmetic further
Georg Cantor
1923
Von Neumann gives the modern set-theoretic definition: each ordinal is the set of all smaller ordinals
John von Neumann

Summary

Ordinals generalize counting past the finite numbers: 0,1,2,...,ω,ω+1,...,ω·2,...,ω²,....
Von Neumann's definition: each ordinal is the set of all smaller ordinals, so α<β iff α∈β.
Every ordinal is exactly one of: 0, a successor α+1, or a limit ordinal (no immediate predecessor).
Ordinal arithmetic is not commutative: 1+ω=ω≠ω+1, and 2·ω=ω≠ω·2.
The class of all ordinals is not itself a set (Burali-Forti paradox) — it is a proper class.

References

WebsiteWikipedia — Ordinal number
BookJech, T. Set Theory, 3rd ed., Ch. 2.