Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-07-26 (claude-opus-5)
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.

Successor and limit ordinals

Definition

Let α be an ordinal (Ordinal (von Neumann)).

  • α is a successor ordinal when α=β+=β∪{β} for some ordinal β, which is then an ordinal by Basic closure properties of ordinals;
  • α is a limit ordinal when α≠0 and α is not a successor ordinal.

Every ordinal is therefore exactly one of: 0, a successor ordinal, or a limit ordinal. The three cases are the three clauses of a definition or a proof by transfinite recursion or induction over the ordinals.

Remarks

  • The predecessor of a successor is unique. If α=β+ then β∈α and every ξ∈α satisfies ξ≤β, so β is the largest element of α and is determined by α. In particular β+=γ+ forces β=γ.
  • Union characterisation. For a nonzero ordinal α: α is a limit ordinal if and only if α=⋃α, and α is a successor if and only if ⋃α∈α, in which case α=(⋃α)+. For the successor case, ⋃(β∪{β})=(⋃β)∪β=β, because ⋃β⊆β by transitivity. For the limit case, ⋃α⊆α always holds by transitivity, and conversely, given ξ∈α, the ordinal ξ+ satisfies ξ+∈α: by Trichotomy and well-ordering of the ordinals the alternatives are ξ+=α, excluded because α is not a successor, and α∈ξ+, which gives α∈ξ or α=ξ and hence α∈α using ξ∈α and transitivity, excluded by Basic closure properties of ordinals; so ξ∈ξ+∈α puts ξ∈⋃α. The hypothesis α≠0 cannot be dropped, since ⋃0=0.
  • Closure under successor. The previous paragraph says exactly that a nonzero ordinal is a limit if and only if it is closed under the successor operation. That is the form in which limit ordinals are recognised in practice.
  • 0 is not a limit ordinal here. Some texts include it, so that "limit ordinal" means "α=⋃α" outright. The convention adopted is the more widely used one, and it is the one that makes "0, successor, limit" a genuine three way split.
  • The least limit ordinal is ω (ω is the least limit ordinal), so the distinction is invisible below ω: every natural number is either 0 or a successor. That is precisely why ordinary induction on N needs only a base case and a successor step, while induction over the ordinals needs a limit clause as well.

Depends on

Used by

…and 12 more results.

Dependency tree · two levels

9 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