Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)verified 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 α\alpha be an ordinal (Ordinal (von Neumann)).

  • α\alpha is a successor ordinal when α=β+=β{β}\alpha = \beta^{+} = \beta \cup \{\beta\} for some ordinal β\beta, which is then an ordinal by Basic closure properties of ordinals;
  • α\alpha is a limit ordinal when α0\alpha \ne 0 and α\alpha is not a successor ordinal.

Every ordinal is therefore exactly one of: 00, 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 α=β+\alpha = \beta^{+} then βα\beta \in \alpha and every ξα\xi \in \alpha satisfies ξβ\xi \le \beta, so β\beta is the largest element of α\alpha and is determined by α\alpha. In particular β+=γ+\beta^{+} = \gamma^{+} forces β=γ\beta = \gamma.
  • Union characterisation. For a nonzero ordinal α\alpha: α\alpha is a limit ordinal if and only if α=α\alpha = \bigcup \alpha, and α\alpha is a successor if and only if αα\bigcup \alpha \in \alpha, in which case α=(α)+\alpha = (\bigcup \alpha)^{+}. For the successor case, (β{β})=(β)β=β\bigcup(\beta \cup \{\beta\}) = (\bigcup \beta) \cup \beta = \beta, because ββ\bigcup \beta \subseteq \beta by transitivity. For the limit case, αα\bigcup \alpha \subseteq \alpha always holds by transitivity, and conversely, given ξα\xi \in \alpha, the ordinal ξ+\xi^{+} satisfies ξ+α\xi^{+} \in \alpha: by Trichotomy and well-ordering of the ordinals the alternatives are ξ+=α\xi^{+} = \alpha, excluded because α\alpha is not a successor, and αξ+\alpha \in \xi^{+}, which gives αξ\alpha \in \xi or α=ξ\alpha = \xi and hence αα\alpha \in \alpha using ξα\xi \in \alpha and transitivity, excluded by Basic closure properties of ordinals; so ξξ+α\xi \in \xi^{+} \in \alpha puts ξα\xi \in \bigcup \alpha. The hypothesis α0\alpha \ne 0 cannot be dropped, since 0=0\bigcup 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.
  • 00 is not a limit ordinal here. Some texts include it, so that "limit ordinal" means "α=α\alpha = \bigcup \alpha" outright. The convention adopted is the more widely used one, and it is the one that makes "00, successor, limit" a genuine three way split.
  • The least limit ordinal is ω\omega (ω\omega is the least limit ordinal), so the distinction is invisible below ω\omega: every natural number is either 00 or a successor. That is precisely why ordinary induction on N\mathbb{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 11 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 20 results over 10 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