How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ordinal exponentiation exists and is unique, with the limit clause taken over so that
Statement
Fix an ordinal (Ordinal (von Neumann)). There is exactly one class function , defined at every ordinal , satisfying the three clauses
with the ordinal multiplication of Ordinal multiplication , and every value is an ordinal.
The limit clause runs over , and that restriction is not cosmetic. With the unrestricted clause the value would be one of the sets united, so would come out and in fact equal to , whereas raised to a limit must be . With the restriction above the single formula is correct for every , including , and no case split on is needed. For the restriction changes nothing, since then and .
This is the well-definedness obligation discharged before ordinal exponentiation is written down; the operation itself is named in the definition that follows. The proof is a theorem of ZF and uses no choice principle.
Facts & Assumptions
Given: A fixed ordinal and the axioms of ZF. No choice principle is assumed. For a function , is its range, and its restriction to .
Recursion along the ordinals: for a class function assigning a set to every function whose domain is an ordinal there is exactly one class function , defined at every ordinal, with for all (Transfinite recursion along the ordinals: a class rule determines exactly one operation defined at every ordinal).
Every ordinal is exactly one of: , a successor ordinal with uniquely determined, or a limit ordinal (Successor and limit ordinals).
is an ordinal for every set of ordinals, and is its least upper bound (claim (e) of Basic closure properties of ordinals).
is an ordinal whenever and are (Ordinal multiplication , Ordinal multiplication exists and is unique, and its values are ordinals).
Every nonempty set of ordinals has an -least element (Trichotomy and well-ordering of the ordinals), and is such a set whenever holds and is a property of ordinals.
Proof
Define a class function on functions whose domain is an ordinal by: if ; if ; and if is a limit ordinal.
The three cases are exhaustive and mutually exclusive by [L2], and is determined by , so is a well-determined set for every such and the rule is a formula.
By [L1] there is exactly one class function , defined at every ordinal, with for every ordinal .
Unwinding the three cases of : ; , since ; and for a limit , , because the domain of is and removing from it removes exactly the value at .
Every value is an ordinal: were not an ordinal for some , [L5] would give a least with not an ordinal, and each of the three cases refutes that, since is an ordinal, is an ordinal by [L4] because makes an ordinal, and at a limit the set united is a set of ordinals, so its union is an ordinal by [L3].
Uniqueness: a class function defined at every ordinal and satisfying the three displayed clauses satisfies for every , one case at a time, so by the uniqueness half of [L1].
Hence exactly one class function on the ordinals satisfies the three clauses, and all its values are ordinals.
Remarks
The value at , worked out, and what the naive clause breaks. By the clauses, and , and then for every ; at a limit the restricted union is , as it should be. Had the union run over all it would have contained , giving . That is not merely unattractive: it falsifies the exponent law of and ; and for exponentiation is strictly increasing with at , , , since makes the left side while the right side is . Many texts avoid the issue by splitting the definition into a case and a case ; the restricted clause is the same definition without the split.
The convention . The clause applies to every , so here. This is the convention that makes the successor clause uniform, and it is the one used in Ordinal exponentiation , with the conventions and and everywhere below.
This is ordinal, not cardinal, exponentiation. The two operations share the notation and disagree already at , which is here. Ordinal and cardinal are different operations that share one notation sets out the difference; FALSE: the ordinal is uncountable computes the value.
Depends on
- Transfinite recursion along the ordinals: a class rule determines exactly one operation defined at every ordinal
- Ordinal multiplication $\alpha \cdot \beta$
- Ordinal multiplication exists and is unique, and its values are ordinals
- Ordinal (von Neumann)
- Successor and limit ordinals
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 29 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Ordinal arithmetic (Wikipedia) (standard reference, not scraped)
- T. Jech, Set Theory, 3rd millennium ed., Ch. 2 (Ordinal numbers) (standard reference, not scraped)