Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

For αβ\alpha \le \beta there is exactly one ordinal γ\gamma with α+γ=β\alpha + \gamma = \beta

Statement

Let α\alpha and β\beta be ordinals (Ordinal (von Neumann)) with αβ\alpha \le \beta. Then there is exactly one ordinal γ\gamma with

α+γ=β,\alpha + \gamma = \beta,

namely the order type of the set βα\beta \setminus \alpha of ordinals lying in β\beta but not in α\alpha, taken with the membership order (Every well-order has a unique order type).

This is subtraction on the left: the unknown sits on the right of the ++ sign, which is the side on which ordinal addition is strictly increasing and cancellative (Monotonicity of ordinal ++ and \cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1β=β1 \cdot \beta = \beta). Subtraction on the other side does not exist in general: there is no ordinal γ\gamma at all with γ+ω=ω+1\gamma + \omega = \omega + 1, since γ+ω\gamma + \omega is a limit ordinal for every γ\gamma while ω+1\omega + 1 is a successor.

No choice principle is used.

Facts & Assumptions

Given: Ordinals αβ\alpha \le \beta, that is αβ\alpha \subseteq \beta. Every subset of a well-order carries the inherited order, again a well-order (Well-order and well-ordered set).

[L1]

ot(W)=ot(I)+ot(WI)\mathrm{ot}(W) = \mathrm{ot}(I) + \mathrm{ot}(W \setminus I) for every well-order WW and every initial segment II of it (claim (b) of α+β\alpha + \beta is the order type of α\alpha followed by β\beta).

[L2]

Every well-order is order isomorphic to exactly one ordinal, its order type (Every well-order has a unique order type).

[L3]

An initial segment is a downward closed subset (Initial segment of a well-order); an ordinal is a transitive set strictly well ordered by \in, so it is a well-order (Ordinal (von Neumann), Well-order and well-ordered set).

[L4]

αβ\alpha \subseteq \beta if and only if αβ\alpha \in \beta or α=β\alpha = \beta (Basic closure properties of ordinals, claim (f)); exactly one of μν\mu \in \nu, μ=ν\mu = \nu, νμ\nu \in \mu holds (Trichotomy and well-ordering of the ordinals).

[L5]

Left cancellation: α+γ=α+γ\alpha + \gamma = \alpha + \gamma' implies γ=γ\gamma = \gamma'; and α+λ\alpha + \lambda is a limit ordinal whenever λ\lambda is (claims (b) and (g) of Monotonicity of ordinal ++ and \cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1β=β1 \cdot \beta = \beta, with ++ as in Ordinal addition α+β\alpha + \beta).

Proof

technique · direct
1.1

α\alpha is an initial segment of the well-order (β,)(\beta, \in): it is a subset of β\beta because αβ\alpha \le \beta, and it is downward closed in β\beta because xyαx \in y \in \alpha gives xαx \in \alpha by transitivity of α\alpha.

L3L4
1.2

For an ordinal μ\mu the identity is an order isomorphism of μ\mu onto μ\mu, so ot(μ)=μ\mathrm{ot}(\mu) = \mu by the uniqueness in [L2].

L2L3
2.1

Put γ=ot(βα)\gamma = \mathrm{ot}(\beta \setminus \alpha), which exists by [L2] since βα\beta \setminus \alpha is a subset of the well-order β\beta; then [L1] applied to W=βW = \beta and I=αI = \alpha gives β=ot(β)=ot(α)+ot(βα)=α+γ\beta = \mathrm{ot}(\beta) = \mathrm{ot}(\alpha) + \mathrm{ot}(\beta \setminus \alpha) = \alpha + \gamma.

step 1.1step 1.2L1L2L3
3.1

If also α+γ=β\alpha + \gamma' = \beta then α+γ=α+γ\alpha + \gamma' = \alpha + \gamma, so γ=γ\gamma' = \gamma by [L5]; hence exactly one such γ\gamma exists, and it is ot(βα)\mathrm{ot}(\beta \setminus \alpha).

step 2.1L5

Remarks

The proof is a picture. β\beta is a copy of α\alpha followed by whatever is left, and "whatever is left" is βα\beta \setminus \alpha. Clause (b) of α+β\alpha + \beta is the order type of α\alpha followed by β\beta says exactly that the order type of a well-order split at an initial segment is the sum of the two order types, so no recursion is needed at all.

Why the hypothesis αβ\alpha \le \beta cannot be dropped. αα+γ\alpha \le \alpha + \gamma always holds (claim (b) of Monotonicity of ordinal ++ and \cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1β=β1 \cdot \beta = \beta), so α+γ=β\alpha + \gamma = \beta forces αβ\alpha \le \beta. The theorem is therefore sharp: the equation is solvable exactly when the hypothesis holds.

The other-sided equation. The claim in the Statement that no γ\gamma satisfies γ+ω=ω+1\gamma + \omega = \omega + 1 uses only that γ+ω\gamma + \omega is a limit ordinal, which is claim (g) of Monotonicity of ordinal ++ and \cdot: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities 0+β=β0 + \beta = \beta and 1β=β1 \cdot \beta = \beta, and that ω+1=ω+\omega + 1 = \omega^{+} is a successor. Right subtraction, when it exists, is also not unique: 0+ω=1+ω=ω0 + \omega = 1 + \omega = \omega, so the equation γ+ω=ω\gamma + \omega = \omega has at least two solutions (FALSE: β<γ\beta < \gamma implies β+α<γ+α\beta + \alpha < \gamma + \alpha).

Where it is used. Existence of the remainder in For α>0\alpha > 0 every ordinal β\beta is αξ+ρ\alpha \cdot \xi + \rho with ρ<α\rho < \alpha, in exactly one way is a direct application, and that theorem in turn is what extracts the coefficients of a Cantor normal form (Cantor normal form: every nonzero ordinal is ωβ0c0++ωβk1ck1\omega^{\beta_0}\cdot c_0 + \cdots + \omega^{\beta_{k-1}}\cdot c_{k-1} with β0>>βk1\beta_0 > \cdots > \beta_{k-1} and each cic_i a nonzero natural number, in exactly one way).

Depends on

Used by

Dependency tree · next 3 levels

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