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.
Cofinality , and regular and singular cardinals
Definition
Let be an ordinal (Ordinal (von Neumann)). The cofinality of is
cofinal range meaning that is a cofinal subset of (Cofinal subset of an ordinal): every satisfies for some . That such a least ordinal exists, and that a witnessing map of that length may be taken strictly increasing, is For every ordinal there is a least ordinal admitting a map with cofinal range, and that map may always be taken strictly increasing, and both are theorems of ZF. So is defined at every ordinal, without any choice principle.
Regular and singular. An infinite cardinal — a cardinal (Cardinal (initial ordinal) and cardinality) with (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations), for instance any (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ) — is
- regular when ;
- singular when .
The two cases are exhaustive by definition, and by ; 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 ↗ singular means exactly , since always holds.
Remarks
Why regularity is defined for cardinals and not for ordinals. The definition of applies to every ordinal, and it must, because the construction quantifies over maps into of every length. But is an uninteresting condition on a general ordinal: it fails at and at for reasons that have nothing to do with size, and it holds only at , at , and at infinite cardinals, where it is exactly the regularity defined above and so fails at every singular one. Calling an ordinal regular would therefore say nothing new, which is why the words are attached to cardinals here.
What a singular cardinal is, in one sentence. A cardinal that is reachable from below by fewer than steps: there is a strictly increasing family of ordinals below , indexed by an ordinal strictly shorter than , whose supremum is . That is exactly the failure of regularity, and is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal exhibits a cardinal for which it happens.
Why being a regular cardinal is a theorem and not part of the definition. Regularity is defined through , so building " is regular" into the definition would make the definition refer to itself. The statement is true, and it is ; 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 ↗; it is recorded here as the item that discharges the naming obligation of this definition, and nothing above depends on it.
Only one notion of "cofinal" exists in this library. Cofinal subset of an ordinal introduces cofinal subsets, because the boundedness theorem for needs them, and deliberately introduces neither the cofinality function nor the regular/singular vocabulary. Both are introduced here, and the definition above is written in exactly that item's terms, so no second notion is created.
Depends on
- For every ordinal $\alpha$ there is a least ordinal $\beta$ admitting a map $\beta \to \alpha$ with cofinal range, and that map may always be taken strictly increasing
- Cofinal subset of an ordinal
- Ordinal (von Neumann)
- Cardinal (initial ordinal) and cardinality
- Cardinal sum $\kappa \oplus \lambda$, product $\kappa \otimes \lambda$ and exponentiation $\kappa^{\lambda}$, and why they are written apart from the ordinal operations
- 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$
Used by
- Assuming the Axiom of Choice: κ < κ^cf(κ) for every infinite cardinal κ, and cf(2^κ) > κ; in particular cf(2^ℵ₀) > ℵ₀ Corollary
- Every uncountable cardinal is singular in Gitik's model Corollary
- C-sequences and the upper and lower traces of minimal walks on omega-one Definition
- Closed unbounded subsets of ordinals Definition
- Closure, distributivity, and chain conditions for forcing orders Definition
- Cofinality strata, trace, and reflection Definition
- Easton functions on regular cardinals Definition
- Fine measures, strong compactness and supercompactness Definition
- Fleissner's HYP covering interface Definition
- Inaccessible and Mahlo cardinals Definition
- Reduced products, true cofinality and scales Definition
- Set-length Easton-support forcing iterations Definition
- The Easton-support product of higher Cohen forcings Definition
- The pseudointersection and tower numbers Definition
- κ-trees and the tree property Definition
- A two-coordinate Easton pattern Example
- An ordinal α with ℵ_α = α, built as the supremum of the tower ℵ₀, ℵ_ℵ₀, ℵ_ℵ_ℵ₀, …, and its cofinality is ℵ₀ Example
- Assuming countable choice, cf(ℵ_ω₁) = ℵ₁, so singular does not mean of countable cofinality Example
- Assuming the Axiom of Choice: ℶ₀ = ℵ₀, ℶ₁ = 2^ℵ₀ = | ℝ |, ℶ₂ = | P(ℝ) |, and ℶ_ω has cofinality ℵ₀ Example
- cf(ℵ_ω) = ℵ₀, computed from the cofinal map n ↦ ℵₙ Example
- FALSE: 2^ℵ₀ = ℵ_ω False statement
- FALSE: ℵ_α is regular for every ordinal α False statement
- ZF proves that omega one is regular False statement
- Basic bounding and dominating relations Lemma
- GCH counts Easton head conditions and subset names Lemma
- Regressive injections on nonreflecting sets of cardinals Lemma
- What each result on this page costs in choice, and where the continuum escapes what ZFC can decide Remark
- cf(α) ≤ α; cf(0) = 0 and cf(α + 1) = 1; for a limit ordinal λ the value cf(λ) is an infinite cardinal with cf(cf(λ)) = cf(λ), so it is regular; and every cofinal subset of λ has cardinality at least cf(λ), a value that is attained Theorem
- Easton's theorem for regular cardinals Theorem
- Every limit ordinal has cofinality omega in Gitik's model Theorem
- Every set is countable in the intermediate extension Theorem
- Necessary constraints on the regular-cardinal continuum function Theorem
- Set-sized Easton forcing preserves cardinals and cofinalities Theorem
- The new omega one is the old aleph omega Theorem
- The Prikry generic sequence changes cofinality to omega Theorem
- ℵ₀ is regular in ZF; assuming the Axiom of Choice every successor aleph ℵ_α+1 is regular; cf(ℵ_ω) = ℵ₀, so ℵ_ω is singular, and under choice it is the least singular infinite cardinal Theorem
Dependency tree · two levels
34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on 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)