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.

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

Statement

Assume the Axiom of Countable Choice ACω\mathrm{AC}_\omega (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). Let ω1\omega_1 be the first uncountable ordinal (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)). Then:

(a) Boundedness. Every at most countable (Finite, countably infinite, countable, uncountable) subset Aω1A \subseteq \omega_1 is bounded below ω1\omega_1: the ordinal supA=A\sup A = \bigcup A lies in ω1\omega_1 and satisfies αsupA\alpha \le \sup A for every αA\alpha \in A.

(b) No small cofinal set. No at most countable subset of ω1\omega_1 is cofinal in ω1\omega_1 (Cofinal subset of an ordinal).

(c) Suprema stay countable. If AA is an at most countable set of at most countable ordinals, then supA=A\sup A = \bigcup A is an at most countable ordinal.

The hypothesis is not decoration. ACω\mathrm{AC}_\omega is spent at exactly one step, step 1.2 below, and it is spent there only through Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega, whose own statement carries the same hypothesis. Everything else on this page, including the existence of ω1\omega_1 and all of ω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, is a theorem of ZF. The ledger is the choice-ledger remark at the end of this page.

Facts & Assumptions

Given: The Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), and ω1=(ω)\omega_1 = \aleph(\omega) (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)).

[L1]

A\bigcup A is an ordinal for every set AA of ordinals, and it is the least upper bound of AA; =0\bigcup \varnothing = 0; every element of an ordinal is an ordinal; μν\mu \subseteq \nu iff μν\mu \in \nu or μ=ν\mu = \nu; and μμ\mu \notin \mu (Basic closure properties of ordinals, Ordinal (von Neumann)).

[L2]

Exactly one of μν\mu \in \nu, μ=ν\mu = \nu, νμ\nu \in \mu holds for ordinals (Trichotomy and well-ordering of the ordinals).

[L3]

ω1\omega_1 is uncountable, every ordinal in ω1\omega_1 is at most countable, and ω1\omega_1 is a limit ordinal (ω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, Successor and limit ordinals).

[L4]

A nonempty set AA is at most countable if and only if there is a surjection NA\mathbb{N} \to A (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, The natural numbers N\mathbb{N} (von Neumann)).

[L5]

Assuming ACω\mathrm{AC}_\omega: if (An)nN(A_n)_{n \in \mathbb{N}} is a family of at most countable sets then nNAn\bigcup_{n \in \mathbb{N}} A_n is at most countable (Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega).

[L6]

CαC \subseteq \alpha is cofinal in α\alpha when every ξα\xi \in \alpha satisfies ξη\xi \le \eta for some ηC\eta \in C (Cofinal subset of an ordinal).

Proof

technique · direct
1.1

For a set AA of ordinals, A\bigcup A is an ordinal and is the least upper bound of AA, so αA\alpha \le \bigcup A for every αA\alpha \in A; and =0\bigcup \varnothing = 0.

L1
1.2

The one step that spends ACω\mathrm{AC}_\omega. Let AA be a nonempty at most countable set each of whose members is an at most countable set. By [L4] there is a surjection s:NAs : \mathbb{N} \to A; putting An=s(n)A_n = s(n) gives a family of at most countable sets indexed by N\mathbb{N}, with no selection made, and nNAn=A\bigcup_{n \in \mathbb{N}} A_n = \bigcup A because ss is onto AA; so A\bigcup A is at most countable by [L5].

L4L5
2.1

Claim (a): let Aω1A \subseteq \omega_1 be at most countable. Every αA\alpha \in A lies in ω1\omega_1 and hence is an at most countable ordinal by [L3], and αω1\alpha \subseteq \omega_1 by [L1], so Aω1\bigcup A \subseteq \omega_1 and A\bigcup A is an ordinal with Aω1\bigcup A \le \omega_1 by [L1]. If A=A = \varnothing then A=0ω1\bigcup A = 0 \in \omega_1 by step 1.1 and [L3], since ω1\omega_1 is a nonzero ordinal. If AA \ne \varnothing then A\bigcup A is at most countable by step 1.2, so Aω1\bigcup A \ne \omega_1 because ω1\omega_1 is uncountable by [L3], and therefore Aω1\bigcup A \in \omega_1 by [L1]. In both cases supA=Aω1\sup A = \bigcup A \in \omega_1 is an upper bound of AA by step 1.1.

step 1.1step 1.2L1L2L3
2.2

Claim (c): an at most countable set AA of at most countable ordinals has A\bigcup A an ordinal by [L1], equal to 00 when A=A = \varnothing and at most countable by step 1.2 otherwise; in either case supA=A\sup A = \bigcup A is an at most countable ordinal.

step 1.1step 1.2L1
3.1

Claim (b): suppose Aω1A \subseteq \omega_1 is at most countable and cofinal in ω1\omega_1; put β=A\beta = \bigcup A, which lies in ω1\omega_1 by step 2.1, so β+ω1\beta^{+} \in \omega_1 because ω1\omega_1 is a limit ordinal by [L3]; cofinality applied to β+\beta^{+} gives ηA\eta \in A with β+η\beta^{+} \le \eta, while ηβ\eta \le \beta by step 1.1, so β+ββ+\beta^{+} \le \beta \in \beta^{+} and hence ββ\beta \in \beta, which [L1] forbids.

step 2.1step 1.1L1L3L6
4.1

Claims (a), (b) and (c) are established, and the only appeal to a choice principle is the use of [L5] inside step 1.2.

step 3.1step 2.1step 2.2step 1.2L5

Remarks

Where exactly the choice is spent, and why it cannot be avoided here. Step 1.2 hands an N\mathbb{N}-indexed family of at most countable sets to Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega, and that theorem selects one enumeration of each member at once. Each ordinal α<ω1\alpha < \omega_1 has enumerations by N\mathbb{N}, in general many, and countability alone gives no rule for singling one out. Note that the family (An)(A_n) itself is produced without choice: it is ns(n)n \mapsto s(n) for a surjection ss that A nonempty set is at most countable iff it is a surjective image of N\mathbb{N} hands over, and that lemma is choice free.

The hypothesis is genuinely needed, not merely convenient. Without a choice principle the conclusion can fail outright: it is consistent with ZF, granted the consistency of ZF, that ω1\omega_1 is the supremum of an ω\omega-sequence of at most countable ordinals. That is the Feferman-Levy model, recorded in Choice ledger for this page: ω1\omega_1 exists in ZF, and the boundedness theorem does not with the external citation. So the boundedness proved here is not a fact about ω1\omega_1 alone; it is a fact about ω1\omega_1 plus ACω\mathrm{AC}_\omega.

What the statement deliberately avoids at this point in the reading order. The usual formulation is "ω1\omega_1 is a regular cardinal", using the cofinality function cf\operatorname{cf}. That vocabulary is introduced later in Cofinality cf(α)\operatorname{cf}(\alpha), and regular and singular cardinals , so the present theorem states the conclusion in the subset form available here: no at most countable subset is cofinal. That is exactly the form the applications need, for instance the non-normality of the deleted Tychonoff plank, where the countably many ordinals produced by a covering argument must be capped below ω1\omega_1.

Claim (c) restated. A supremum of at most countably many at most countable ordinals is at most countable. This is the same fact viewed without reference to ω1\omega_1, and it is the form used when the ambient ordinal is not ω1\omega_1 but some countable limit; see the worked increasing-sequence example on the companion examples page.

Depends on

Used by

Dependency tree · next 3 levels

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