An extension of mathematical induction to well-ordered sets indexed by ordinals: to prove a property P(α) for all ordinals α one shows P(0), proves that P(β) implies P(β+1) for any successor β+1, and for any limit ordinal λ shows that P(γ) holds for all γ < λ implies P(λ).

Principle

Well-ordering allows a three-part induction: base (zero), successor step, and limit step; closure under these steps propagates the property to all ordinals by transfinite recursion or induction.

Demonstration

Constructing the von Neumann cumulative hierarchy V_α or proving that every ordinal is either 0, a successor, or a limit uses transfinite induction: at a limit stage one verifies a property from the truth of the property on all earlier stages, enabling constructions and proofs across all ordinals.

Misapplication

Neglecting the limit step (treating only zero and successor steps) invalidates proofs on limit ordinals; applying transfinite induction to relations that are not well-ordered destroys the argument and can give false results.

Consequence

Transfinite induction and recursion permit definitions and proofs across arbitrarily large well-ordered index sets, underpinning ordinal and cardinal constructions, recursive definitions on classes, and many arguments in set theory and logic.

Reversal

On non-well-founded orders no transfinite induction is available; alternatively Noetherian induction addresses well-foundedness from the opposite finiteness perspective, and ordinary induction is the special finite-case analogue.

Boundary

Requires a well-ordered domain (ordinals or another well-ordered class); when working with proper classes or in weak set theories one must watch foundational limits (replacement, class recursion); it does not apply to partially ordered sets lacking well-orders.

Semantic Tension

Transfinite induction is often seen as a direct generalization of natural-number induction but differs crucially in the need for a separate limit stage; conflating the two can hide essential ordinal phenomena.

Synthesis

Transfinite induction generalizes the inductive paradigm to ordinals by combining base, successor, and limit verifications to propagate a property through every well-ordered stage, enabling definitions and proofs that reach beyond finite indices.