Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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 0<β<λ so that 0λ=0

Statement

Fix an ordinal α (Ordinal (von Neumann)). There is exactly one class function β↦eα(β), defined at every ordinal β, satisfying the three clauses

eα(0)=1,eα(β+)=eα(β)⋅α,eα(λ)=⋃{ eα(β):β∈λ and β≠0 }  (λ a limit ordinal),

with ⋅ the ordinal multiplication of Ordinal multiplication α⋅β, and every value eα(β) is an ordinal.

The limit clause runs over 0<β<λ, and that restriction is not cosmetic. With the unrestricted clause eα(λ)=⋃{eα(β):β∈λ} the value e0(0)=1 would be one of the sets united, so e0(ω) would come out ≥1 and in fact equal to 1, whereas 0 raised to a limit must be 0. With the restriction above the single formula is correct for every α, including α=0, and no case split on α is needed. For α≥1 the restriction changes nothing, since then eα(0)=1≤α=eα(1) and 1∈λ.

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 h, ran⁡(h) is its range, and h↾X its restriction to X.

[L1]

Recursion along the ordinals: for a class function G assigning a set to every function whose domain is an ordinal there is exactly one class function F, defined at every ordinal, with F(β)=G(F↾β) for all β (Transfinite recursion along the ordinals: a class rule determines exactly one operation defined at every ordinal).

[L2]

Every ordinal is exactly one of: 0, a successor ordinal δ+ with δ uniquely determined, or a limit ordinal (Successor and limit ordinals).

[L3]

⋃A is an ordinal for every set A of ordinals, and is its least upper bound (claim (e) of Basic closure properties of ordinals).

[L5]

Every nonempty set of ordinals has an ∈-least element (Trichotomy and well-ordering of the ordinals), and {ξ∈β0+:P(ξ)} is such a set whenever P(β0) holds and P is a property of ordinals.

Proof

technique · direct
1.1

Define a class function G on functions h whose domain is an ordinal β by: G(h)=1 if β=0; G(h)=h(δ)⋅α if β=δ+; and G(h)=⋃ran⁡(h↾(β∖{0})) if β is a limit ordinal.

construct
1.2

The three cases are exhaustive and mutually exclusive by [L2], and δ is determined by β=δ+, so G(h) is a well-determined set for every such h and the rule is a formula.

L2L4
2.1

By [L1] there is exactly one class function eα, defined at every ordinal, with eα(β)=G(eα↾β) for every ordinal β.

step 1.1step 1.2L1
3.1

Unwinding the three cases of G: eα(0)=G(∅)=1; eα(δ+)=(eα↾δ+)(δ)⋅α=eα(δ)⋅α, since δ∈δ+; and for a limit λ, eα(λ)=⋃{eα(β):β∈λ and β≠0}, because the domain of eα↾λ is λ and removing 0 from it removes exactly the value at 0.

step 2.1step 1.1
4.1

Every value is an ordinal: were eα(β0) not an ordinal for some β0, [L5] would give a least μ∈β0+ with eα(μ) not an ordinal, and each of the three cases refutes that, since 1 is an ordinal, eα(δ+)=eα(δ)⋅α is an ordinal by [L4] because δ∈μ makes eα(δ) an ordinal, and at a limit the set united is a set of ordinals, so its union is an ordinal by [L3].

step 3.1L2L3L4L5
4.2

Uniqueness: a class function t defined at every ordinal and satisfying the three displayed clauses satisfies t(β)=G(t↾β) for every β, one case at a time, so t=eα by the uniqueness half of [L1].

step 3.1step 2.1L1L2
5.1

Hence exactly one class function on the ordinals satisfies the three clauses, and all its values are ordinals.

step 4.1step 4.2step 3.1∎

Remarks

The value at α=0, worked out, and what the naive clause breaks. By the clauses, e0(0)=1 and e0(1)=e0(0)⋅0=1⋅0=0, and then e0(β)=0 for every β>0; at a limit λ the restricted union is ⋃{0}=0, as it should be. Had the union run over all β∈λ it would have contained e0(0)=1, giving e0(ω)=⋃{1,0}=1. That is not merely unattractive: it falsifies the exponent law αβ+γ=αβ⋅αγ of αβ+γ=αβ⋅αγ and (αβ)γ=αβ⋅γ; and for α>1 exponentiation is strictly increasing with β≤αβ at α=0, β=1, γ=ω, since 1+ω=ω makes the left side 0ω=1 while the right side is 01⋅0ω=0⋅1=0. Many texts avoid the issue by splitting the definition into a case α=0 and a case α>0; the restricted clause is the same definition without the split.

The convention 00=1. The clause eα(0)=1 applies to every α, so 00=1 here. This is the convention that makes the successor clause uniform, and it is the one used in Ordinal exponentiation αβ, with the conventions α0=1 and 00=1 and everywhere below.

This is ordinal, not cardinal, exponentiation. The two operations share the notation αβ and disagree already at 2ω, which is ω here. Ordinal αβ and cardinal κλ are different operations that share one notation sets out the difference; FALSE: the ordinal 2ω is uncountable computes the value.

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources