Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

ω1\omega_1 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

Statement

Let ω1=(ω)\omega_1 = \aleph(\omega) (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)). Then:

(a) The bridge. An ordinal α\alpha (Ordinal (von Neumann)) injects into N\mathbb{N} if and only if α\alpha is at most countable (Finite, countably infinite, countable, uncountable).

(b) ω1\omega_1 is uncountable.

(c) Every ordinal αω1\alpha \in \omega_1 is at most countable; so ω1\omega_1 is the least uncountable ordinal.

(d) ω1\omega_1 is a cardinal, that is an initial ordinal (Cardinal (initial ordinal) and cardinality): no αω1\alpha \in \omega_1 is equinumerous with ω1\omega_1.

(e) ω1\omega_1 is a limit ordinal (Successor and limit ordinals).

All of this is a theorem of ZF and uses no choice principle. That matters here and is stated deliberately: Hartogs: an ordinal that does not inject into a given set is choice free, Every subset of an at most countable set is at most countable and A nonempty set is at most countable iff it is a surjective image of N\mathbb{N} are choice free, so ω1\omega_1 and every property listed above exist in ZF alone. The cost begins two items later on this page, at the boundedness theorem for at most countable subsets of ω1\omega_1, which genuinely needs countable choice.

Facts & Assumptions

Given: ω1=(ω)\omega_1 = \aleph(\omega), the least ordinal admitting no injection into N=ω\mathbb{N} = \omega (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega), Hartogs: an ordinal that does not inject into a given set).

[L1]

(A)\aleph(A) is the least ordinal that does not inject into AA; in particular every ordinal strictly below (A)\aleph(A) does inject into AA, and (A)\aleph(A) does not. The construction is choice free (Hartogs: an ordinal that does not inject into a given set).

[L2]

AA is finite when AnA \approx n for some nNn \in \mathbb{N}, countably infinite when ANA \approx \mathbb{N}, at most countable when one of the two holds, and uncountable when neither does (Finite, countably infinite, countable, uncountable, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L3]

Every subset of an at most countable set is at most countable, and no choice principle is used (Every subset of an at most countable set is at most countable).

[L4]

A nonempty set AA is at most countable if and only if there is a surjection NA\mathbb{N} \to A, and no choice principle is used (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, Injection, surjection, bijection).

[L5]

An injection f:XYf : X \to Y is a bijection of XX onto f[X]Yf[X] \subseteq Y, and \approx is symmetric and transitive (Injection, surjection, bijection, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L6]

An ordinal κ\kappa is a cardinal when no ακ\alpha \in \kappa satisfies ακ\alpha \approx \kappa (Cardinal (initial ordinal) and cardinality).

[L7]

Every ordinal is exactly one of 00, a successor, or a limit (Successor and limit ordinals); μ+=μ{μ}\mu^{+} = \mu \cup \{\mu\} is an ordinal, μν\mu \subseteq \nu iff μν\mu \in \nu or μ=ν\mu = \nu, and μμ\mu \notin \mu (Basic closure properties of ordinals); trichotomy holds (Trichotomy and well-ordering of the ordinals).

[L8]

Every natural number is an ordinal, ω\omega is an ordinal and a limit ordinal, and nωn \subseteq \omega for nωn \in \omega (ω\omega is the least limit ordinal, The natural numbers N\mathbb{N} (von Neumann)).

Proof

technique · direct
1.1

Claim (a), forwards: if f:αNf : \alpha \to \mathbb{N} is injective then αf[α]N\alpha \approx f[\alpha] \subseteq \mathbb{N} by [L5], and f[α]f[\alpha] is at most countable by [L3], so α\alpha is at most countable by [L2] and transitivity of \approx.

L2L3L5
1.2

Claim (a), backwards: if α\alpha is at most countable then αn\alpha \approx n for some nNn \in \mathbb{N} or αN\alpha \approx \mathbb{N}; a bijection αn\alpha \to n followed by the inclusion nNn \subseteq \mathbb{N} is an injection αN\alpha \to \mathbb{N} by [L8], and a bijection αN\alpha \to \mathbb{N} is one outright.

L2L5L8
1.3

ωω1\omega \in \omega_1: the identity is an injection ωN\omega \to \mathbb{N}, so ωω1\omega \ne \omega_1 by [L1]; and ω1ω\omega_1 \in \omega or ω1=ω\omega_1 = \omega would give ω1ω\omega_1 \subseteq \omega by [L7] and hence an injection ω1N\omega_1 \to \mathbb{N} by inclusion, which [L1] forbids; so ωω1\omega \in \omega_1 by trichotomy.

L1L5L7L8
2.1

Claim (b): ω1\omega_1 does not inject into N\mathbb{N} by [L1], so it is not at most countable by step 1.2, that is, it is uncountable.

step 1.2L1L2
2.2

Claim (c): every αω1\alpha \in \omega_1 injects into N\mathbb{N} by [L1], hence is at most countable by step 1.1; and by [L7] any uncountable ordinal γ\gamma satisfies ω1γ\omega_1 \le \gamma, since γω1\gamma \in \omega_1 would make γ\gamma at most countable.

step 1.1L1L7
3.1

Claim (d): suppose αω1\alpha \in \omega_1 satisfies αω1\alpha \approx \omega_1; then α\alpha is at most countable by step 2.2, so ω1\omega_1 is at most countable by [L2] and symmetry of \approx, contradicting step 2.1; hence ω1\omega_1 is a cardinal in the sense of [L6].

step 2.2step 2.1L2L5L6
3.2

Claim (e): ω10\omega_1 \ne 0 by step 1.3, since ωω1\omega \in \omega_1; and ω1\omega_1 is not a successor, for if ω1=δ+\omega_1 = \delta^{+} then ωδ+\omega \in \delta^{+} gives ωδ\omega \subseteq \delta by [L7], so δ\delta is a nonempty ordinal in ω1\omega_1 and is therefore at most countable by step 2.2, so [L4] supplies a surjection s:Nδs : \mathbb{N} \to \delta, and the function t:Nδ+t : \mathbb{N} \to \delta^{+} with t(0)=δt(0) = \delta and t(σ(n))=s(n)t(\sigma(n)) = s(n) is a surjection onto δ+=δ{δ}\delta^{+} = \delta \cup \{\delta\}, making ω1\omega_1 at most countable by [L4] and contradicting step 2.1; so ω1\omega_1 is a limit ordinal by [L7].

step 1.3step 2.2step 2.1L4L7L8
4.1

Claims (a) to (e) are established, and every step used only Hartogs: an ordinal that does not inject into a given set, Every subset of an at most countable set is at most countable and A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, all of which are choice free, so the whole statement is a theorem of ZF.

step 3.1step 3.2step 2.1step 2.2step 1.1step 1.2L1L3L4

Remarks

The bridge is the whole trick. Hartogs: an ordinal that does not inject into a given set produces the least ordinal that does not inject into N\mathbb{N}. What is wanted is the least uncountable ordinal. Claim (a) is what identifies the two notions on ordinals, and it is two lines in each direction; without it, quoting Hartogs for uncountability would be citing a theorem for a claim it does not make.

No choice, and why it is worth saying. A reader who has met ω1\omega_1 through cardinal arithmetic often expects the well-ordering theorem to be somewhere in the background. It is not. Hartogs' construction collects the order types of well-ordered subsets of N\mathbb{N}, and the well-ordering comes with each subset as part of the datum, so nothing is selected (Hartogs: an ordinal that does not inject into a given set, remarks). The first genuine choice principle on this page appears at Assuming countable choice: every at most countable subset of ω1\omega_1 is bounded below ω1\omega_1, so no at most countable subset of ω1\omega_1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, and Choice ledger for this page: ω1\omega_1 exists in ZF, and the boundedness theorem does not keeps the ledger.

"ω1\omega_1 is a cardinal" is a property of an ordinal, not an assignment of a size. Cardinal (initial ordinal) and cardinality separates the two: being an initial ordinal is choice free, whereas attaching a cardinality X|X| to an arbitrary set XX needs the Axiom of Choice. Claim (d) is the first, and only the first.

What is deliberately absent. Nothing here says ω1\omega_1 is regular, or computes its cofinality, or compares it with the size of P(N)\mathcal{P}(\mathbb{N}). Regularity of ω1\omega_1 is the boundedness theorem two items later and costs countable choice; the comparison with P(N)\mathcal{P}(\mathbb{N}) is the continuum hypothesis (The continuum hypothesis, and what this page does not prove) and is independent of ZFC.

Depends on

Used by

Cited to discharge well-definedness by The first uncountable ordinal ω₁ := ℵ(ω).

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 68 results over 23 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