Transfinite induction

Transfinite induction is the extension of mathematical induction to well-ordered sets beyond the natural numbers — particularly to the ordinals. Where ordinary induction proves a property for all natural numbers by establishing a base case and an inductive step, transfinite induction proves a property for all ordinals by establishing that the property holds at zero, is preserved under successor ordinals, and is preserved at limit ordinals when it holds for all smaller ordinals.

The principle is a theorem of ZFC, derivable from the Axiom of Replacement and the well-ordering of the ordinals. It is the proof-theoretic counterpart to transfinite recursion: where recursion constructs objects stage by stage, induction proves properties stage by stage. The two principles together form the methodological backbone of modern set theory, enabling proofs that span the entire cumulative hierarchy.

Transfinite induction is not merely a technical tool; it is the licensing mechanism for reasoning about the infinite. Without it, the infinite remains a realm of metaphor and paradox; with it, the infinite becomes a domain of rigorous proof. The first major application was Gerhard Gentzen's 1936 consistency proof for Peano Arithmetic, which used transfinite induction up to the ordinal ε₀ — a landmark result that inaugurated ordinal analysis and established the modern field of proof theory.

Transfinite induction is the passport that finitary reasoning uses to enter the infinite. It does not eliminate the gap between the finite and the transfinite; it bureaucratizes it, transforming awe into procedure.