Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-04 (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 6 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, Cohen 1963: ZF does not prove the Axiom of Choice, Feferman 1965: ZF does not prove that a free ultrafilter on the naturals exists, Gödel 1938: ZF does not refute the Axiom of Choice, Halpern and Lévy 1971: the Boolean prime ideal theorem does not imply the Axiom of Choice and Schechter 2006: Kelley's cofinite proof yields BPI, not the Axiom of Choice. 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.

Refuted: every limit ordinal has an at most countable cofinal subset — ω1\omega_1 has none, assuming countable choice

Statement refuted

False claim: every limit ordinal has an at most countable cofinal subset (Cofinal subset of an ordinal, Finite, countably infinite, countable, uncountable).

The claim is plausible because every limit ordinal a reader meets first does have one. ω\omega is cofinal in itself and at most countable; and every at most countable limit ordinal λ\lambda is cofinal in itself and at most countable, so the claim holds for all of them, and ω+ω\omega + \omega and ω2\omega^{2} are among them, both being shown at most countable earlier on this page. Whether ωω\omega^{\omega} and ε0\varepsilon_0 are at most countable is a question no item on these pages settles, so neither is offered here as an instance.

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). The first uncountable ordinal ω1\omega_1 (The first uncountable ordinal ω1:=(ω)\omega_1 := \aleph(\omega)) refutes the claim: it is a limit ordinal, and no at most countable subset of it is cofinal in it.

The hypothesis is not removable, and the item states it in the title: without a choice principle the refutation itself fails, since consistently with ZF the ordinal ω1\omega_1 is the supremum of an ω\omega-sequence of at most countable ordinals. That is recorded in Choice ledger for this page: ω1\omega_1 exists in ZF, and the boundedness theorem does not.

Facts & Assumptions

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

[L1]

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

[L2]

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

Counterexample

technique · direct
1.1

The claim does hold for every at most countable limit ordinal λ\lambda: the set λ\lambda itself is a subset of λ\lambda, it is at most countable by hypothesis, and it is cofinal in λ\lambda by [L1], since every ξλ\xi \in \lambda satisfies ξξλ\xi \le \xi \in \lambda. In particular it holds at λ=ω\lambda = \omega by [L4].

L1L4
1.2

ω1\omega_1 is a limit ordinal by [L2], so it is an instance of the claim.

L2
2.1

No at most countable Cω1C \subseteq \omega_1 is cofinal in ω1\omega_1, by [L3]; so the claim fails at ω1\omega_1.

step 1.2L1L3
3.1

Therefore ω1\omega_1 is a limit ordinal with no at most countable cofinal subset, and the claim that every limit ordinal has one is false.

step 2.1step 1.2step 1.1

Remarks

What separates ω1\omega_1 from the countable limit ordinals. A limit ordinal is always cofinal in itself, so the claim can only fail when the ordinal is itself uncountable. ω1\omega_1 is the least uncountable 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), so it is the first place where the claim can fail at all, and under ACω\mathrm{AC}_\omega it does fail there.

The refutation carries the hypothesis it uses. 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 is stated under ACω\mathrm{AC}_\omega and spends it at exactly one step, so this counterexample inherits the same cost. A page that quotes this item must carry ACω\mathrm{AC}_\omega forward into its own statement; Choice ledger for this page: ω1\omega_1 exists in ZF, and the boundedness theorem does not is the ledger, and it names the model in which the conclusion fails outright.

What is deliberately not said at this point in the reading order. In the later vocabulary this item says cf(ω1)>ω\operatorname{cf}(\omega_1)>\omega, or that ω1\omega_1 is regular. The cofinality and regular/singular vocabulary is introduced later in Cofinality cf(α)\operatorname{cf}(\alpha), and regular and singular cardinals , so this earlier example stays in the subset language of Cofinal subset of an ordinal. Nothing is lost: the applications, such as the non-normality of the deleted Tychonoff plank, use exactly the subset form.

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: 83 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