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.
Refuted: every limit ordinal has an at most countable cofinal subset — 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. is cofinal in itself and at most countable; and every at most countable limit ordinal is cofinal in itself and at most countable, so the claim holds for all of them, and and are among them, both being shown at most countable earlier on this page. Whether and 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 ()). The first uncountable ordinal (The first uncountable ordinal ) 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 is the supremum of an -sequence of at most countable ordinals. That is recorded in Choice ledger for this page: exists in ZF, and the boundedness theorem does not.
Facts & Assumptions
Given: The Axiom of Countable Choice (The Axiom of Countable Choice ()) and , the first uncountable ordinal (The first uncountable ordinal ).
is cofinal in when every satisfies for some (Cofinal subset of an ordinal).
is uncountable, every ordinal in is at most countable, and is a limit ordinal ( 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).
Assuming : no at most countable subset of is cofinal in (claim (b) of Assuming countable choice: every at most countable subset of is bounded below , so no at most countable subset of is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable).
is a limit ordinal and is at most countable, being ( is the least limit ordinal, Finite, countably infinite, countable, uncountable, The natural numbers (von Neumann)).
Counterexample
The claim does hold for every at most countable limit ordinal : the set itself is a subset of , it is at most countable by hypothesis, and it is cofinal in by [L1], since every satisfies . In particular it holds at by [L4].
is a limit ordinal by [L2], so it is an instance of the claim.
No at most countable is cofinal in , by [L3]; so the claim fails at .
Therefore is a limit ordinal with no at most countable cofinal subset, and the claim that every limit ordinal has one is false.
Remarks
What separates 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. is the least uncountable ordinal ( 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 it does fail there.
The refutation carries the hypothesis it uses. Assuming countable choice: every at most countable subset of is bounded below , so no at most countable subset of is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable is stated under and spends it at exactly one step, so this counterexample inherits the same cost. A page that quotes this item must carry forward into its own statement; Choice ledger for this page: 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 , or that is regular. The cofinality and regular/singular vocabulary is introduced later in Cofinality , 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
- Assuming countable choice: every at most countable subset of $\omega_1$ is bounded below $\omega_1$, so no at most countable subset of $\omega_1$ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
- Choice ledger for this page: $\omega_1$ exists in ZF, and the boundedness theorem does not
- Cofinal subset of an ordinal
- $\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
- The first uncountable ordinal $\omega_1 := \aleph(\omega)$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Finite, countably infinite, countable, uncountable
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Successor and limit ordinals
- $\omega$ is the least limit ordinal
- Ordinal (von Neumann)
- The natural numbers $\mathbb{N}$ (von Neumann)
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
- Cofinality (Wikipedia) (standard reference, not scraped)
- First uncountable ordinal (Wikipedia) (standard reference, not scraped)
- Axiom of countable choice (Wikipedia) (standard reference, not scraped)
- A. Karagila, Forcing course notes (2023) (standard reference, not scraped)