Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)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.

ω is the least limit ordinal

Statement

Let N=ω be the natural numbers (The natural numbers N (von Neumann)) with their usual order (Order on the natural numbers). Then:

(i) for all m,n∈N, m∈n if and only if m<n;

(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 0 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: N=ω with 0=∅ and σ(n)=n∪{n} (The natural numbers N (von Neumann)), and the order m≤n  ⟺  ∃k (m+k=n), m<n  ⟺  (m≤n and m≠n) (Order on the natural numbers).

[L1]

ω is inductive, that is 0∈ω and n∈ω⇒σ(n)∈ω, and ω is contained in every inductive set (The natural numbers exist: a smallest inductive set).

[L2]

The induction principle: a subset of N containing 0 and closed under σ equals N (The principle of mathematical induction).

[L3]

m<n  ⟺  σ(m)≤n (Discreteness: σ(n) is the immediate successor).

[L4]

≤ is a linear order on N with trichotomy, and 0≤m for every m because 0+m=m (≤ is a linear order on N, Trichotomy of the order on N, Left identity for addition).

[L5]

Every nonempty subset of N has a least element (The well-ordering principle).

[L6]

Every natural number is a transitive set and satisfies n∉n (Every natural number is a transitive set and is not a member of itself).

[L7]

Every nonzero natural number is σ(m) for some natural number m (Every nonzero natural number is a successor).

[L8]

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).

[L9]

n<σ(n) for every n∈N. This is established at step 1.3 of Trichotomy of the order on N, where it is derived from n+σ(0)=σ(n) and σ(0)≠0; the reference is to that item's numbering, not to any step below.

[L10]

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

technique · direct
1.1

For all m,n∈N, m≤n if and only if m<σ(n): from m≤n and n<σ(n) ([L9]) transitivity gives m<σ(n); conversely if m<σ(n) and m≤n failed, then n<m by trichotomy, so σ(n)≤m<σ(n) by [L3], which is impossible.

L3L4L9
1.2

ω is a transitive set: the set S={n∈ω:n⊆ω} contains 0=∅ and is closed under σ, since n⊆ω together with n∈ω gives σ(n)=n∪{n}⊆ω; so S=ω by [L2].

L2L1
2.1

Claim (i): the set T={n∈ω:m∈n  ⟺  m<n for every m∈ω} contains 0, because m∈∅ is false and m<0 is false, since 0≤m always and m<0 would give m=0 by antisymmetry and then m<m; and n∈T gives σ(n)∈T, because m∈σ(n)  ⟺  (m∈n or m=n)  ⟺  (m<n or m=n)  ⟺  m≤n  ⟺  m<σ(n); hence T=ω by [L2].

step 1.1L2L4
3.1

Claim (ii) for natural numbers: fix n∈ω; then n 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 n by [L4] and every nonempty subset of n has an ∈-least element by [L5]; hence n is an ordinal.

step 1.2step 2.1L4L5L6L8
3.2

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.

step 1.2step 2.1L4L5L8
4.1

Claim (iii): ω≠0 because 0∈ω; 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.

step 3.2L1L8
5.1

Claim (iv), first half: the ordinals α with α∈ω are exactly the natural numbers, each of which is 0 or of the form σ(m)=m+ with m a natural number by [L7], hence 0 or a successor ordinal; so no ordinal ∈-below ω is a limit ordinal.

step 3.1step 4.1L7L8
6.1

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 0 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.

step 5.1step 4.1step 3.2L8L10
7.1

Claims (i) to (iv) are established.

step 2.1step 3.1step 3.2step 4.1step 5.1step 6.1∎

Remarks

Why claim (i) has to be proved. The published development builds the order on N 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 n, 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 0 or a successor. This is the precise sense in which N 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 W=ω.

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: 0∈γ, 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 0 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 ω=⋃{n:n∈ω}.

Ordinal arithmetic is not developed here. Sums and products of ordinals, and the ordinals ω+1, ω⋅2 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

Used by

Dependency tree · two levels

30 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources