Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription) rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming countable choice, cf(ω1)=1\operatorname{cf}(\aleph_{\omega_1}) = \aleph_1, so singular does not mean of countable cofinality

Example

Assume the Axiom of Countable Choice ACω\mathrm{AC}_\omega (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). Then

cf(ω1)  =  1  <  ω1,\operatorname{cf}(\aleph_{\omega_1}) \;=\; \aleph_1 \;<\; \aleph_{\omega_1},

so ω1\aleph_{\omega_1} is singular (Cofinality cf(α)\operatorname{cf}(\alpha), and regular and singular cardinals) and its cofinality is uncountable (Finite, countably infinite, countable, uncountable).

This separates two conditions that the first singular example runs together. A singular cardinal is one reachable from below by a strictly shorter family; it need not be reachable by a countable one. Here the reaching family has length ω1\omega_1 and no shorter one will do, and what rules out a shorter one is the boundedness theorem for ω1\omega_1 (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), which is where ACω\mathrm{AC}_\omega is spent.

Facts & Assumptions

Given: The Axiom of Countable Choice. Write ω1\omega_1 for the first uncountable ordinal (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)).

[L2]
[L4]

Assuming ACω\mathrm{AC}_\omega, every at most countable Aω1A \subseteq \omega_1 is bounded below ω1\omega_1: supA=A\sup A = \bigcup A lies in ω1\omega_1 and dominates every member of AA (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).

[L5]

A nonempty set is at most countable if and only if it is a surjective image of N\mathbb{N} (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, Finite, countably infinite, countable, uncountable).

[L7]

For a well-orderable set XX, X\lvert X\rvert is the least ordinal equinumerous with XX, equinumerous sets receive the same one, and α=α\lvert \alpha\rvert = \alpha exactly when α\alpha is a cardinal (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used, Cardinal (initial ordinal) and cardinality, Equinumerous sets, ABA \approx B and ABA \preceq B).

[L9]

Ordinals satisfy trichotomy; αβ\alpha \subseteq \beta iff αβ\alpha \in \beta or α=β\alpha = \beta; the union of a set of ordinals is its least upper bound; every nonempty set of ordinals has an \in-least element; and every strictly increasing map of ordinals is injective (Trichotomy and well-ordering of the ordinals, Basic closure properties of ordinals, Injection, surjection, bijection).

Verification

technique · direct
1.1

The set C={α:αω1}C = \{\aleph_\alpha : \alpha \in \omega_1\} exists by Replacement and is cofinal in ω1\aleph_{\omega_1}: ω1\omega_1 is a limit ordinal by [L2], so ω1=C\aleph_{\omega_1} = \bigcup C by [L1] and every ζω1\zeta \in \aleph_{\omega_1} lies in some αC\aleph_\alpha \in C; moreover αα\alpha \mapsto \aleph_\alpha is injective by the strict increase in [L1], so Cω1C \approx \omega_1 and C=ω1=ω1=1\lvert C\rvert = \lvert \omega_1\rvert = \omega_1 = \aleph_1 by [L7], [L2] and [L1].

L1L2L7L9
1.2

The cofinality is not smaller than 1\aleph_1. Put β=cf(ω1)\beta = \operatorname{cf}(\aleph_{\omega_1}); it is an infinite cardinal by [L6] and [L8], since ω1\aleph_{\omega_1} is an infinite cardinal and hence a limit ordinal. If β<1\beta < \aleph_1 then β0\beta \le \aleph_0 by [L3], so β=0=ω\beta = \aleph_0 = \omega by [L8], and [L6] supplies a cofinal f:ωω1f : \omega \to \aleph_{\omega_1}. For each nωn \in \omega let αn\alpha_n be the \in-least αω1\alpha \in \omega_1 with f(n)αf(n) \in \aleph_\alpha, which exists by [L1] and [L9] and is determined rather than chosen. Then A={αn:nω}A = \{\alpha_n : n \in \omega\} is a nonempty at most countable subset of ω1\omega_1 by [L5], so γ=supAω1\gamma = \sup A \in \omega_1 by [L4], and every f(n)f(n) lies in αnγ\aleph_{\alpha_n} \subseteq \aleph_\gamma by [L1] and [L9]. But γω1\aleph_\gamma \in \aleph_{\omega_1}, and cofinality of ff would give some nn with γf(n)γ\aleph_\gamma \le f(n) \in \aleph_\gamma, which [L9] forbids. So 1β\aleph_1 \le \beta.

L1L2L3L4L5L6L8L9
2.1

By [L6] applied to the cofinal set of step 1.1, cf(ω1)C=1\operatorname{cf}(\aleph_{\omega_1}) \le \lvert C\rvert = \aleph_1.

step 1.1L6
3.1

Steps 2.1 and 1.2 give cf(ω1)=1\operatorname{cf}(\aleph_{\omega_1}) = \aleph_1 by [L9]; and 1<ω1\aleph_1 < \aleph_{\omega_1} by the strict increase in [L1], since 1ω11 \in \omega_1 by [L2], so ω1\aleph_{\omega_1} is singular with uncountable cofinality by [L2].

step 1.2step 2.1L1L2L9

Remarks

Why countable choice appears, and where exactly. It is used once, at [L4]: without it, ω1\omega_1 can consistently be the supremum of an ω\omega-indexed family of countable ordinals, and then the argument of step 1.2 collapses. That dependence is inherited, not introduced here — the published boundedness theorem carries the same hypothesis, and states so in its own title.

What "singular" does and does not mean. Singular says only cf(κ)κ\operatorname{cf}(\kappa) \ne \kappa. The singular cardinal computed in cf(ω)=0\operatorname{cf}(\aleph_\omega) = \aleph_0, computed from the cofinal map nnn \mapsto \aleph_n has countable cofinality, and a reader who meets only that example may take the two conditions to be the same. They are not: here the cofinality is 1\aleph_1, uncountable, while the cardinal is still singular because 1\aleph_1 is far below ω1\aleph_{\omega_1}.

The pattern behind both computations. For a limit ordinal λ\lambda the family αα\alpha \mapsto \aleph_\alpha restricted to λ\lambda is cofinal in λ\aleph_\lambda, so cf(λ)λ\operatorname{cf}(\aleph_\lambda) \le \lvert \lambda\rvert always. The work is entirely in the lower bound, and it is a statement about λ\lambda rather than about λ\aleph_\lambda: it asks how short a family can be and still reach λ\lambda.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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