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 and is not a successor ordinal.
Every ordinal is therefore exactly one of: , 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 cannot be dropped, since .
- 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.
- 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 ", 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 or a successor. That is precisely why ordinary induction on needs only a base case and a successor step, while induction over the ordinals needs a limit clause as well.
Depends on
Used by
- Assuming the Axiom of Choice: κ < κ^cf(κ) for every infinite cardinal κ, and cf(2^κ) > κ; in particular cf(2^ℵ₀) > ℵ₀ Corollary
- Ordinal addition exists and is unique: the clauses at 0, at a successor and at a limit determine one operation, and its values are ordinals Corollary
- Ordinal exponentiation exists and is unique, with the limit clause taken over 0 < β < λ so that 0^λ = 0 Corollary
- Ordinal multiplication exists and is unique, and its values are ordinals 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
- Cofinal subset of an ordinal Definition
- Ordinal addition α + β Definition
- Ordinal exponentiation α^β, with the conventions α⁰ = 1 and 0⁰ = 1 Definition
- Ordinal multiplication α · β Definition
- The closed long ray ω₁ × [0,1) under the lexicographic order, and the long line, with the order topology Definition
- The order topology on an ordinal, with the half-open intervals (α, β] and the initial segments [0, β] as a basis Definition
- The successor cardinal κ⁺, the alephs ℵ_α, the beths ℶ_α, successor and limit cardinals, and the identifications ℵ₀ = ω and ℵ₁ = ω₁ 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
- 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
- FALSE: (β + γ)·α = β·α + γ·α for all ordinals False statement
- FALSE: every sequentially compact space is compact 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
- On an ordinal with its order topology the sets [0,β] and (α,β] form a basis of clopen sets, the isolated points are exactly the non-limit ordinals, and the space is Hausdorff Lemma
- α · β is the order type of α × β ordered by last differences, that is β copies of α Lemma
- α + β is the order type of α followed by β Lemma
- ω is the least limit ordinal Lemma
- Assuming countable choice: every at most countable subset of ω₁ is bounded below ω₁, so no at most countable subset of ω₁ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable Theorem
- 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
…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
- Limit ordinal (Wikipedia) (standard reference, not scraped)
- Ordinal number (Wikipedia) (standard reference, not scraped)