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, , so singular does not mean of countable cofinality
Example
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Then
so is singular (Cofinality , 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 and no shorter one will do, and what rules out a shorter one is the boundedness theorem for (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), which is where is spent.
Facts & Assumptions
Given: The Axiom of Countable Choice. Write for the first uncountable ordinal (The first uncountable ordinal ).
at a limit ordinal ; every is an infinite cardinal; the operation is strictly increasing; (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , The clauses at , at a successor and at a limit determine exactly one operation , in ZF, and — assuming the Axiom of Choice — exactly one operation ; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and ).
is uncountable, is a cardinal, is a limit ordinal, and every ordinal in it is at most countable ( 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 , every at most countable is bounded below : lies in and dominates every member 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).
A nonempty set is at most countable if and only if it is a surjective image of (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable).
For a limit ordinal : is an infinite cardinal, and every cofinal satisfies ; also is the least length of a cofinal map into (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained, Cofinality , and regular and singular cardinals, Cofinal subset of an ordinal).
For a well-orderable set , is the least ordinal equinumerous with , equinumerous sets receive the same one, and exactly when 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, and ).
Every infinite cardinal is a limit ordinal, and a cardinal is infinite exactly when (Every natural number and are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with in the finite sense equal to in the cardinal sense, is the least limit ordinal).
Ordinals satisfy trichotomy; iff or ; the union of a set of ordinals is its least upper bound; every nonempty set of ordinals has an -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
The set exists by Replacement and is cofinal in : is a limit ordinal by [L2], so by [L1] and every lies in some ; moreover is injective by the strict increase in [L1], so and by [L7], [L2] and [L1].
The cofinality is not smaller than . Put ; it is an infinite cardinal by [L6] and [L8], since is an infinite cardinal and hence a limit ordinal. If then by [L3], so by [L8], and [L6] supplies a cofinal . For each let be the -least with , which exists by [L1] and [L9] and is determined rather than chosen. Then is a nonempty at most countable subset of by [L5], so by [L4], and every lies in by [L1] and [L9]. But , and cofinality of would give some with , which [L9] forbids. So .
By [L6] applied to the cofinal set of step 1.1, .
Steps 2.1 and 1.2 give by [L9]; and by the strict increase in [L1], since by [L2], so is singular with uncountable cofinality by [L2].
Remarks
Why countable choice appears, and where exactly. It is used once, at [L4]: without it, can consistently be the supremum of an -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 . The singular cardinal computed in , computed from the cofinal map 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 , uncountable, while the cardinal is still singular because is far below .
The pattern behind both computations. For a limit ordinal the family restricted to is cofinal in , so always. The work is entirely in the lower bound, and it is a statement about rather than about : it asks how short a family can be and still reach .
Depends on
- Cofinality $\operatorname{cf}(\alpha)$, and regular and singular cardinals
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- The successor cardinal $\kappa^{+}$, the alephs $\aleph_\alpha$, the beths $\beth_\alpha$, successor and limit cardinals, and the identifications $\aleph_0 = \omega$ and $\aleph_1 = \omega_1$
- The clauses at $0$, at a successor and at a limit determine exactly one operation $\alpha \mapsto \aleph_\alpha$, in ZF, and — assuming the Axiom of Choice — exactly one operation $\alpha \mapsto \beth_\alpha$; each value is an infinite cardinal, each is strictly increasing and continuous at limits, and $\alpha \le \aleph_\alpha$
- For every set $A$ the Hartogs number $\aleph(A)$ is a cardinal, and for every cardinal $\kappa$ it is the least cardinal strictly above $\kappa$; this is a theorem of ZF
- The first uncountable ordinal $\omega_1 := \aleph(\omega)$
- $\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
- 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
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Finite, countably infinite, countable, uncountable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- Successor and limit ordinals
- Cofinal subset of an ordinal
- Cardinal (initial ordinal) and cardinality
- 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
- Every natural number and $\omega$ are cardinals, every infinite cardinal is a limit ordinal, and on the natural numbers the cardinal operations are the published finite counting operations, with $\lvert A \rvert$ in the finite sense equal to $\lvert A \rvert$ in the cardinal sense
- $\omega$ is the least limit ordinal
- Basic closure properties of ordinals
- Trichotomy and well-ordering of the ordinals
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
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
- UCL, Axiomatic Set Theory, Ch. 4: Cardinal Arithmetic (standard reference, not scraped)
- Cofinality (Wikipedia) (standard reference, not scraped)
- Regular cardinal (Wikipedia) (standard reference, not scraped)