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

ω\omega is the least limit ordinal

Statement

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

(i) for all m,nNm, n \in \mathbb{N}, mnm \in n if and only if m<nm < n;

(ii) every natural number is an ordinal (Ordinal (von Neumann)), and ω\omega is an ordinal;

(iii) ω\omega is a limit ordinal (Successor and limit ordinals);

(iv) every ordinal αω\alpha \in \omega is 00 or a successor ordinal, and consequently ω\omega is the least limit ordinal: ωγ\omega \subseteq \gamma, that is ωγ\omega \le \gamma, for every limit ordinal γ\gamma.

So the natural numbers are exactly the ordinals below ω\omega, and ω\omega 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 ω\omega a set at all (The natural numbers exist: a smallest inductive set).

Facts & Assumptions

Given: N=ω\mathbb{N} = \omega with 0=0 = \varnothing and σ(n)=n{n}\sigma(n) = n \cup \{n\} (The natural numbers N\mathbb{N} (von Neumann)), and the order mn    k(m+k=n)m \le n \iff \exists k\,(m + k = n), m<n    (mnm < n \iff (m \le n and mn)m \ne n) (Order on the natural numbers).

[L1]

ω\omega is inductive, that is 0ω0 \in \omega and nωσ(n)ωn \in \omega \Rightarrow \sigma(n) \in \omega, and ω\omega is contained in every inductive set (The natural numbers exist: a smallest inductive set).

[L2]

The induction principle: a subset of N\mathbb{N} containing 00 and closed under σ\sigma equals N\mathbb{N} (The principle of mathematical induction).

[L3]

m<n    σ(m)nm < n \iff \sigma(m) \le n (Discreteness: σ(n)\sigma(n) is the immediate successor).

[L4]

\le is a linear order on N\mathbb{N} with trichotomy, and 0m0 \le m for every mm because 0+m=m0 + m = m (\le is a linear order on N\mathbb{N}, Trichotomy of the order on N\mathbb{N}, Left identity for addition).

[L5]

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

[L6]

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

[L7]

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

[L8]

An ordinal is a transitive set strictly well ordered by \in, no ordinal is a member of itself, and a limit ordinal is a nonzero ordinal that is not of the form β+\beta^{+} (Ordinal (von Neumann), Basic closure properties of ordinals, Successor and limit ordinals).

[L9]

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

[L10]

For ordinals α,β\alpha, \beta: αβ\alpha \subseteq \beta if and only if αβ\alpha \in \beta or α=β\alpha = \beta, and any two ordinals are comparable under inclusion (claims (f) and (g) of Basic closure properties of ordinals); exactly one of αβ\alpha \in \beta, α=β\alpha = \beta, βα\beta \in \alpha holds, and αβ:    αβ\alpha \le \beta :\iff \alpha \subseteq \beta is the order under which sets of ordinals are well ordered, with strict part \in (Trichotomy and well-ordering of the ordinals).

Proof

technique · direct
1.1

For all m,nNm, n \in \mathbb{N}, mnm \le n if and only if m<σ(n)m < \sigma(n): from mnm \le n and n<σ(n)n < \sigma(n) ([L9]) transitivity gives m<σ(n)m < \sigma(n); conversely if m<σ(n)m < \sigma(n) and mnm \le n failed, then n<mn < m by trichotomy, so σ(n)m<σ(n)\sigma(n) \le m < \sigma(n) by [L3], which is impossible.

L3L4L9
1.2

ω\omega is a transitive set: the set S={nω:nω}S = \{n \in \omega : n \subseteq \omega\} contains 0=0 = \varnothing and is closed under σ\sigma, since nωn \subseteq \omega together with nωn \in \omega gives σ(n)=n{n}ω\sigma(n) = n \cup \{n\} \subseteq \omega; so S=ωS = \omega by [L2].

L2L1
2.1

Claim (i): the set T={nω:mn    m<n for every mω}T = \{n \in \omega : m \in n \iff m < n \text{ for every } m \in \omega\} contains 00, because mm \in \varnothing is false and m<0m < 0 is false, since 0m0 \le m always and m<0m < 0 would give m=0m = 0 by antisymmetry and then m<mm < m; and nTn \in T gives σ(n)T\sigma(n) \in T, because mσ(n)    (mn or m=n)    (m<n or m=n)    mn    m<σ(n)m \in \sigma(n) \iff (m \in n \text{ or } m = n) \iff (m < n \text{ or } m = n) \iff m \le n \iff m < \sigma(n); hence T=ωT = \omega by [L2].

step 1.1L2L4
3.1

Claim (ii) for natural numbers: fix nωn \in \omega; then nn 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 \in is irreflexive, transitive and trichotomous on nn by [L4] and every nonempty subset of nn has an \in-least element by [L5]; hence nn is an ordinal.

step 1.2step 2.1L4L5L6L8
3.2

Claim (ii) for ω\omega: ω\omega 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 ω\omega is an ordinal.

step 1.2step 2.1L4L5L8
4.1

Claim (iii): ω0\omega \ne 0 because 0ω0 \in \omega; and ω\omega is not a successor ordinal, since ω=β+\omega = \beta^{+} would give βω\beta \in \omega and hence σ(β)=β+=ωω\sigma(\beta) = \beta^{+} = \omega \in \omega because ω\omega is inductive, contradicting the fact that no ordinal is a member of itself; so ω\omega is a limit ordinal.

step 3.2L1L8
5.1

Claim (iv), first half: the ordinals α\alpha with αω\alpha \in \omega are exactly the natural numbers, each of which is 00 or of the form σ(m)=m+\sigma(m) = m^{+} with mm a natural number by [L7], hence 00 or a successor ordinal; so no ordinal \in-below ω\omega is a limit ordinal.

step 3.1step 4.1L7L8
6.1

Claim (iv), second half, which is where "least" is more than \in-minimality: let γ\gamma be any limit ordinal; ω\omega is an ordinal by step 3.2, so by comparability of ordinals under inclusion [L10] either ωγ\omega \subseteq \gamma or γω\gamma \subseteq \omega, and in the second case [L10] gives γω\gamma \in \omega or γ=ω\gamma = \omega; but γω\gamma \in \omega would make γ\gamma equal to 00 or to a successor ordinal by step 5.1, contradicting the definition of a limit ordinal in [L8], so γ=ω\gamma = \omega and ωγ\omega \subseteq \gamma again; hence ωγ\omega \subseteq \gamma, that is ωγ\omega \le \gamma in the ordering of [L10], for every limit ordinal γ\gamma, and since ω\omega 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\mathbb{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 \in. Once claim (i) is available, the two pictures of nn, 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 α\alpha with αω\alpha \in \omega, and that each is 00 or a successor. This is the precise sense in which N\mathbb{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=ωW = \omega.

Limits exist only because ω\omega does. The Axiom of Infinity is what makes ω\omega 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 γ\gamma is itself an inductive set, and so would witness Infinity outright: 0γ0 \in \gamma, because the \in-least element of a nonempty ordinal is \varnothing; and βγ\beta \in \gamma gives β+γ\beta^{+} \subseteq \gamma, hence β+γ\beta^{+} \in \gamma by claim (f) of Basic closure properties of ordinals unless β+=γ\beta^{+} = \gamma, 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 00 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ω}\omega = \bigcup \{n : n \in \omega\}.

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