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.
is the least limit ordinal
Statement
Let be the natural numbers (The natural numbers (von Neumann)) with their usual order (Order on the natural numbers). Then:
(i) for all , if and only if ;
(ii) every natural number is an ordinal (Ordinal (von Neumann)), and is an ordinal;
(iii) is a limit ordinal (Successor and limit ordinals);
(iv) every ordinal is or a successor ordinal, and consequently is the least limit ordinal: , that is , for every limit ordinal .
So the natural numbers are exactly the ordinals below , and is the first ordinal at which induction acquires a limit clause.
Everything here is a theorem of ZF, and no choice principle is used. The only axiom beyond the basic ones that any of it needs is Infinity, which is what makes a set at all (The natural numbers exist: a smallest inductive set).
Facts & Assumptions
Given: with and (The natural numbers (von Neumann)), and the order , and (Order on the natural numbers).
is inductive, that is and , and is contained in every inductive set (The natural numbers exist: a smallest inductive set).
The induction principle: a subset of containing and closed under equals (The principle of mathematical induction).
is a linear order on with trichotomy, and for every because ( is a linear order on , Trichotomy of the order on , Left identity for addition).
Every nonempty subset of has a least element (The well-ordering principle).
Every natural number is a transitive set and satisfies (Every natural number is a transitive set and is not a member of itself).
Every nonzero natural number is for some natural number (Every nonzero natural number is a successor).
An ordinal is a transitive set strictly well ordered by , no ordinal is a member of itself, and a limit ordinal is a nonzero ordinal that is not of the form (Ordinal (von Neumann), Basic closure properties of ordinals, Successor and limit ordinals).
for every . This is established at step 1.3 of Trichotomy of the order on , where it is derived from and ; the reference is to that item's numbering, not to any step below.
For ordinals : if and only if or , and any two ordinals are comparable under inclusion (claims (f) and (g) of Basic closure properties of ordinals); exactly one of , , holds, and is the order under which sets of ordinals are well ordered, with strict part (Trichotomy and well-ordering of the ordinals).
Proof
For all , if and only if : from and ([L9]) transitivity gives ; conversely if and failed, then by trichotomy, so by [L3], which is impossible.
is a transitive set: the set contains and is closed under , since together with gives ; so by [L2].
Claim (i): the set contains , because is false and is false, since always and would give by antisymmetry and then ; and gives , because ; hence by [L2].
Claim (ii) for natural numbers: fix ; then is a transitive set by [L6], its elements are natural numbers by step 1.2, and on them membership is the strict order by step 2.1, so is irreflexive, transitive and trichotomous on by [L4] and every nonempty subset of has an -least element by [L5]; hence is an ordinal.
Claim (ii) for : is a transitive set by step 1.2 and membership is the strict order on it by step 2.1, so the same four properties hold by [L4] and [L5]; hence is an ordinal.
Claim (iii): because ; and is not a successor ordinal, since would give and hence because is inductive, contradicting the fact that no ordinal is a member of itself; so is a limit ordinal.
Claim (iv), first half: the ordinals with are exactly the natural numbers, each of which is or of the form with a natural number by [L7], hence or a successor ordinal; so no ordinal -below is a limit ordinal.
Claim (iv), second half, which is where "least" is more than -minimality: let be any limit ordinal; is an ordinal by step 3.2, so by comparability of ordinals under inclusion [L10] either or , and in the second case [L10] gives or ; but would make equal to or to a successor ordinal by step 5.1, contradicting the definition of a limit ordinal in [L8], so and again; hence , that is in the ordering of [L10], for every limit ordinal , and since is itself a limit ordinal by step 4.1 it is the least one.
Claims (i) to (iv) are established.
Remarks
Why claim (i) has to be proved. The published development builds the order on from addition (Order on the natural numbers) and never identifies it with membership; the identification is recorded there as a remark, not a theorem. Ordinals need it as a theorem, because the whole definition of an ordinal is phrased in terms of . Once claim (i) is available, the two pictures of , as "the number of predecessors" and as "the set of its predecessors", coincide.
The finite ordinals. Claims (ii) and (iv) say the natural numbers are exactly the ordinals with , and that each is or a successor. This is the precise sense in which is an initial segment of the ordinals, and it is why ordinary induction (The principle of mathematical induction) is the special case of Transfinite induction at .
Limits exist only because does. The Axiom of Infinity is what makes a set (The natural numbers exist: a smallest inductive set), and it is also what gives this lemma its content: ZF without Infinity cannot prove that any limit ordinal exists, assuming that theory consistent. The reason is that every limit ordinal is itself an inductive set, and so would witness Infinity outright: , because the -least element of a nonempty ordinal is ; and gives , hence by claim (f) of Basic closure properties of ordinals unless , which a limit ordinal excludes. Dropping an axiom is not the same as assuming its negation, and nothing here says that without Infinity every ordinal is or a successor: ZF itself extends ZF without Infinity and has limit ordinals. What is lost is any proof that one exists. The successor operation alone never produces a limit; a limit is always reached by taking a union, here .
Ordinal arithmetic is not developed here. Sums and products of ordinals, and the ordinals , and so on, are defined by transfinite recursion and would fit naturally after this item, but nothing on this page needs them, so they are left to a later page rather than introduced unused.
Depends on
- Successor and limit ordinals
- Ordinal (von Neumann)
- The natural numbers $\mathbb{N}$ (von Neumann)
- Order on the natural numbers
- The natural numbers exist: a smallest inductive set
- Every nonzero natural number is a successor
- Every natural number is a transitive set and is not a member of itself
- Discreteness: $\sigma(n)$ is the immediate successor
- Trichotomy of the order on $\mathbb{N}$
- $\le$ is a linear order on $\mathbb{N}$
- The principle of mathematical induction
- The well-ordering principle
- Left identity for addition
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
Used by
- Absorption: for cardinals κ, λ with κ infinite and λ ≤ κ, κ ⊕ λ = κ, and κ ⊗ λ = κ when λ ≠ 0 Corollary
- The clauses at 0, at a successor and at a limit determine exactly one operation α ↦ ℵ_α, in ZF, and — assuming the Axiom of Choice — exactly one operation α ↦ ℶ_α; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and α ≤ ℵ_α Corollary
- Refuted, assuming countable choice: every Hausdorff space built from ordinal spaces is normal. The deleted Tychonoff plank ((ω₁ + 1) × (ω + 1)) ∖ {(ω₁, ω)} is Hausdorff and not normal Counterexample
- Refuted: every limit ordinal has an at most countable cofinal subset — ω₁ has none, assuming countable choice Counterexample
- Cardinal (initial ordinal) and cardinality Definition
- Cardinal sum κ ⊕ λ, product κ ⊗ λ and exponentiation κ^λ, and why they are written apart from the ordinal operations Definition
- Ordinal addition α + β Definition
- The first uncountable ordinal ω₁ := ℵ(ω) Definition
- The order topology on an ordinal, with the half-open intervals (α, β] and the initial segments [0, β] as a basis Definition
- 1 + ω = ω and ω + 1 > ω, computed both from the recursion and as order types Example
- 2 · ω = ω while ω · 2 = ω + ω, pictured as order types Example
- An ordinal α with ℵ_α = α, built as the supremum of the tower ℵ₀, ℵ_ℵ₀, ℵ_ℵ_ℵ₀, …, and its cofinality is ℵ₀ Example
- Assuming countable choice, a strictly increasing ω-sequence of countable ordinals has a countable supremum, which is a countable limit ordinal below ω₁; the instance supₙ ω·(n+1) = ω² needs no choice Example
- Assuming countable choice, cf(ℵ_ω₁) = ℵ₁, so singular does not mean of countable cofinality Example
- Assuming the Axiom of Choice: ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀ = | ℝ |, ℶ₂ = | P(ℝ) |, and ℶ_ω has cofinality ℵ₀ Example
- cf(ℵ_ω) = ℵ₀, computed from the cofinal map n ↦ ℵₙ Example
- ℝ^* is homeomorphic to the unit circle by inverse stereographic projection, and ℕ^* is the ordinal space ω + 1 Example
- Solving ω + γ = ω· 2 and dividing ω² + ω + 3 by ω Example
- The Cantor normal form of (ω² + ω· 3 + 5) · ω², computed by the division algorithm Example
- ω + 1 as a convergent sequence together with its limit, and, assuming countable choice, [0, ω₁), in which every sequence lies inside an at most countable initial segment Example
- ω + ω is at most countable although it is not order isomorphic to ω: order type and cardinality are different invariants Example
- ω², ω^ω, and ε₀ = sup{ω, ω^ω, ω^ω^ω, …} satisfying ω^ε₀ = ε₀ Example
- ℵ₀ ⊕ ℵ₀ = ℵ₀ ⊗ ℵ₀ = ℵ₀, ℵ₁ ⊕ ℵ₀ = ℵ₁ and 5 ⊕ ℵ₀ = ℵ₀, computed from absorption and, in the countable cases, independently from the published bijection ω × ω ≈ ω Example
- FALSE: (β + γ)·α = β·α + γ·α for all ordinals False statement
- FALSE: ordinal addition is commutative False statement
- FALSE: ordinal multiplication is commutative False statement
- FALSE: the ordinal 2^ω is uncountable False statement
- FALSE: β < γ implies β + α < γ + α False statement
- FALSE: κ ⊕ μ = λ ⊕ μ implies κ = λ False statement
- Cantor normal form: every nonzero ordinal is ω^β₀· c₀ + ⋯ + ω^βₖ₋₁· cₖ₋₁ with β₀ > ⋯ > βₖ₋₁ and each cᵢ a nonzero natural number, in exactly one way Theorem
- cf(α) ≤ α; cf(0) = 0 and cf(α + 1) = 1; for a limit ordinal λ the value cf(λ) is an infinite cardinal with cf(cf(λ)) = cf(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf(λ), a value that is attained Theorem
- Every infinite cardinal is ℵ_α for exactly one ordinal α, in ZF; and, assuming the Axiom of Choice, every infinite set is equinumerous with exactly one aleph Theorem
- Every natural number and ω are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with | A | in the finite sense equal to | A | in the cardinal sense Theorem
- Hessenberg: κ ⊗ κ = κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ × κ Theorem
- On ω the ordinal + and · are the Peano operations: ω is closed under ordinal +, · and exponentiation, and for naturals m, n the ordinal m + n and m · n are the natural-number sum and product Theorem
- ω₁ is uncountable, every ordinal below it is at most countable, it is a cardinal and a limit ordinal, and its existence is a theorem of ZF Theorem
- ℵ₀ is regular in ZF; assuming the Axiom of Choice every successor aleph ℵ_α+1 is regular; cf(ℵ_ω) = ℵ₀, so ℵ_ω is singular, and under choice it is the least singular infinite cardinal Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 40 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
- Limit ordinal (Wikipedia) (standard reference, not scraped)
- Set-theoretic definition of natural numbers (Wikipedia) (standard reference, not scraped)
- Ordinal number (Wikipedia) (standard reference, not scraped)
- A. Marks, Set Theory (standard reference, not scraped)