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 there is exactly one ordinal with
Statement
Let and be ordinals (Ordinal (von Neumann)) with . Then there is exactly one ordinal with
namely the order type of the set of ordinals lying in but not in , 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 : strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities and ). Subtraction on the other side does not exist in general: there is no ordinal at all with , since is a limit ordinal for every while is a successor.
No choice principle is used.
Facts & Assumptions
Given: Ordinals , that is . Every subset of a well-order carries the inherited order, again a well-order (Well-order and well-ordered set).
for every well-order and every initial segment of it (claim (b) of is the order type of followed by ).
Every well-order is order isomorphic to exactly one ordinal, its order type (Every well-order has a unique order type).
An initial segment is a downward closed subset (Initial segment of a well-order); an ordinal is a transitive set strictly well ordered by , so it is a well-order (Ordinal (von Neumann), Well-order and well-ordered set).
if and only if or (Basic closure properties of ordinals, claim (f)); exactly one of , , holds (Trichotomy and well-ordering of the ordinals).
Left cancellation: implies ; and is a limit ordinal whenever is (claims (b) and (g) of Monotonicity of ordinal and : strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities and , with as in Ordinal addition ).
Proof
is an initial segment of the well-order : it is a subset of because , and it is downward closed in because gives by transitivity of .
For an ordinal the identity is an order isomorphism of onto , so by the uniqueness in [L2].
Put , which exists by [L2] since is a subset of the well-order ; then [L1] applied to and gives .
If also then , so by [L5]; hence exactly one such exists, and it is .
Remarks
The proof is a picture. is a copy of followed by whatever is left, and "whatever is left" is . Clause (b) of is the order type of followed by 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 cannot be dropped. always holds (claim (b) of Monotonicity of ordinal and : strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities and ), so forces . 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 satisfies uses only that is a limit ordinal, which is claim (g) of Monotonicity of ordinal and : strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities and , and that is a successor. Right subtraction, when it exists, is also not unique: , so the equation has at least two solutions (FALSE: implies ).
Where it is used. Existence of the remainder in For every ordinal is with , 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 with and each a nonzero natural number, in exactly one way).
Depends on
- Ordinal addition $\alpha + \beta$
- 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 + \beta = \beta$ and $1 \cdot \beta = \beta$
- $\alpha + \beta$ is the order type of $\alpha$ followed by $\beta$
- Every well-order has a unique order type
- Initial segment of a well-order
- Well-order and well-ordered set
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Ordinal (von Neumann)
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
- Ordinal arithmetic (Wikipedia) (standard reference, not scraped)
- T. Jech, Set Theory, 3rd millennium ed., Ch. 2 (Ordinal numbers) (standard reference, not scraped)