Cofinality, Cardinal Exponentiation, and the Singular Cardinals Hypothesis
Anchor (Master): Kunen 2011 *Set Theory* (College Publications) Ch. I §13 and the exercises on the gimel function and the Hausdorff/Bukovský-Hechler recursion, with §IV-V for Easton forcing on the regular continuum function; Jech 2003 *Set Theory* 3e (Springer) Ch. 5 (cardinal arithmetic, the gimel function ℷ(κ)=κ^{cf(κ)}, the singular-cardinals problem), Ch. 8 (Silver's theorem), and Ch. 24 (Shelah's pcf theory and the bound 2^{ℵ_ω} < ℵ_{ω_4}); Shelah 1994 *Cardinal Arithmetic* (Oxford) for the pcf development
Intuition Beginner
Some infinite sizes can be reached "from below" by a short climb, and some cannot. Picture a tall tower whose height is one of the infinite sizes from the previous unit. Now ask: how few steps do you need, each step landing on a shorter sub-height, so that the heights of your steps creep all the way up to the top with nothing left uncovered? That smallest number of steps is the tower's cofinality — its true "reaching length."
For the very first infinite size, the one matching the counting numbers, you genuinely need an endless run of steps: no finite stack of shorter heights ever catches up. So its reaching length is that same first infinite size. A size whose reaching length equals itself is called regular — it is sturdy, not sneakily approachable by a shorter climb.
But there is a stranger kind of size. Imagine stacking the sizes one infinite size, then the next, then the next, forever, and asking for the size that sits just above this whole endless list. You reach that ceiling with only a counting-number's worth of steps, even though the ceiling itself is a far larger infinity. A size you can sneak up on with a shorter climb than the size itself is called singular. The gap between "how big you are" and "how short a climb reaches you" is the secret that makes the arithmetic of these sizes hard, and it is what this unit is about.
Visual Beginner
A size is regular when the shortest climb that reaches it is as long as the size itself, and singular when a shorter climb already gets there. The picture below contrasts the two.
REGULAR size SINGULAR size
(first infinity) (the size just above
first, second, third, ... infinities)
top === top ===
| / / / <- only a counting-number
| needs a climb / / / of steps reaches the top
| as long as the / / /
| size itself 1st 2nd 3rd ... infinities as the steps
... (a short ladder reaches a tall tower)The next table records the reaching length (cofinality) of a few sizes. Write for the first infinite size, for the next, and for the size sitting just above the whole list .
| size | shortest climb that reaches it | regular or singular |
|---|---|---|
| (endless run of finite steps) | regular | |
| regular | ||
| regular | ||
| (the list of earlier infinities) | singular |
The key idea: a size is singular exactly when it is the top of a shorter list of smaller sizes. The first place this happens among the infinite sizes is , reached by a mere counting-number of steps.
Worked example Beginner
Let us see by hand why is reached by an endless-but-counting-number-long climb, that is, why its reaching length is .
Step 1. List the infinite sizes in order: the first is , the second , the third , and so on, one for each counting number.
Step 2. The size is defined to be the smallest size bigger than every entry on that list. So the list sits entirely below , and nothing is squeezed strictly between the whole list and .
Step 3. Use the list itself as your climb: step onto , then , then , taking one step per counting number. The heights of your steps grow without bound below and leave no room underneath, so they "reach" .
Step 4. Count the steps: there is exactly one step per counting number, so the climb has length , the first infinite size.
Step 5. Could a shorter climb work? A finite stack of sizes below has a single largest member, say , and stops there — it never passes , so it cannot reach the top. So no finite climb works, and the counting-number climb is the shortest.
What this tells us: has reaching length , far smaller than itself. That mismatch is exactly what "singular" means, and is the first singular infinite size.
Check your understanding Beginner
Formal definition Intermediate+
All of the following takes place inside ZFC; ordinals and transfinite recursion are as in 42.03.02, and cardinals, the aleph function, the absorption laws , cardinal exponentiation , and König's inequality are as in 42.03.03. The Axiom of Choice is assumed throughout.
Let be a limit ordinal. A set is cofinal (or unbounded) in if , that is, for every there is with . The cofinality of , written , is the least order type of a cofinal subset of [Kunen Ch. I §13]. Equivalently, is the least cardinal such that is the supremum of a -indexed increasing sequence with each . One sets and for successors; cofinality is interesting only at limits.
An infinite cardinal is regular if and singular if . Thus is regular (a cofinal subset of must be infinite), every successor cardinal is regular (proved below, using Choice), and is singular with . More generally, for a limit ordinal one has , so is singular precisely when .
The gimel function is , defined on infinite cardinals. König's theorem (next section) gives , so always; gimel is the single function to which all cardinal exponentiation reduces. A cardinal is a strong limit if for every . An uncountable cardinal that is both regular and a limit cardinal is (weakly) inaccessible, and a regular strong-limit uncountable cardinal is (strongly) inaccessible; these are the regular cardinals not reachable by the ordinary cardinal operations from below, and their existence is not provable in ZFC (cross-ref 42.03.09).
Counterexamples to common slips Intermediate+
"Every limit cardinal is singular." The first uncountable limit cardinal is singular, but an inaccessible cardinal is a regular limit cardinal. Limit-cardinal-hood concerns the aleph index being a limit ordinal; regularity concerns cofinality, a separate question.
" can be singular." No: , so is always a regular cardinal. A shortest cofinal climb cannot itself be shortened.
" could equal ." König forbids it: , and , so . The continuum can be but never any cardinal of countable cofinality.
"Easton's theorem decides the value of ." Easton's freedom applies only to regular cardinals. The singular case is governed by SCH and pcf theory, where ZFC theorems (Silver, Shelah) constrain the value sharply — the singular continuum function is not free.
Key theorem with proof Intermediate+
The organising fact is König's theorem: it converts the equality "the absorption laws collapse and " into the one genuine inequality that survives, and that inequality is precisely a statement about cofinality.
Theorem (König's theorem and the cofinality bound). For families of cardinals with for all , $$ \sum_{i \in I} \kappa_i < \prod_{i \in I} \lambda_i. $$ Consequently for every infinite cardinal , and therefore [Kunen Ch. I §13].
Proof. The inequality is routine, so the content is strictness; it suffices to show no is surjective. For each , the set of -th coordinates has size , so there is some omitted by every with in the -th block (the choice of across uses the Axiom of Choice). The function then satisfies whenever lies in the -th block, so and is not surjective.
For the corollary, let and write as an increasing union with each . Then (the sum is by the supremum and by absorption). Apply the inequality with for all : since , $$ \kappa = \sum_{i < \mu} \kappa_i < \prod_{i < \mu} \kappa = \kappa^\mu = \kappa^{\operatorname{cf}(\kappa)}. $$ Finally set and suppose . Writing with and applying the inequality with gives , a contradiction. Hence .
Bridge. König's theorem is the foundational reason cardinal exponentiation does not collapse the way addition and multiplication do: the absorption laws of 42.03.03 kill and , and this is exactly the residue that survives — a strict inequality reading off the cofinality of the exponential. It builds toward the gimel calculus below, where is the very quantity König bounds from below, and the central insight is that every hard question about is a question about cofinality: the case split that reduces exponentiation to gimel turns on whether the exponent lies below or above . The cofinality bound generalises Cantor's from 42.03.03 — Cantor's diagonal run once, König's diagonal run along an entire cofinal family — and is dual to the absorption collapse: putting these together, what addition forgets, exponentiation remembers exactly as a cofinality constraint. This appears again in Easton's theorem below, which shows monotonicity and this König bound are the only constraints on the regular continuum function, and in the Singular Cardinals Hypothesis, where the cofinality of a singular is the hinge on which turns.
Exercises Intermediate+
Advanced results Master
Exponentiation, freed of the additive collapse, reduces by cases to two data: the continuum function on regular cardinals and the gimel function at singulars. The first is free; the second is constrained by ZFC theorems whose discovery reshaped the subject.
Theorem 1 (the gimel reduction). For infinite cardinals , the value is computed recursively from the continuum function on regulars and the gimel function at singulars [Jech Ch. 5]. The Hausdorff formula peels successors, and the Bukovský-Hechler analysis treats the remaining cases by comparing with : for functions are bounded so ; for one gets when the lower exponentials stabilise, and otherwise ; for , . Every exponential is thus a finite expression in on regulars and at singulars.
Theorem 2 (Easton's theorem; the regular continuum function is free). Let be any class function from regular cardinals to cardinals satisfying (i) monotonicity and (ii) the König bound . Then there is a class forcing extension of any ground model of GCH in which for every regular [Kunen Ch. I §13]. Hence on regular cardinals, monotonicity and König are the complete list of ZFC constraints on ; the full forcing construction is developed in 42.03.08. Easton's theorem says nothing about singular cardinals, and the contrast is the entire point of the singular-cardinals problem.
Theorem 3 (the Singular Cardinals Hypothesis). SCH is the assertion that for every singular cardinal , if then , equivalently whenever is singular above the continuum [Jech Ch. 5]. SCH follows from GCH and, more sharply, holds above any cardinal where the continuum function below has stabilised; under SCH all of cardinal exponentiation is computed from the continuum function on regulars alone. The negation of SCH — a singular strong-limit with — is consistent only relative to large cardinals: Magidor first forced SCH at from a supercompact cardinal, and Gitik calibrated the exact consistency strength to a large cardinal in the region of a measurable of high Mitchell order, so the failure of SCH requires large cardinals (cross-ref 42.03.09).
Theorem 4 (Silver's theorem). SCH cannot first fail at a singular cardinal of uncountable cofinality [Jech Ch. 8]. Precisely, if is singular with and for stationarily many , then ; and the same for . The proof runs a generic-ultrafilter / elementary-submodel argument on the stationary set of approximating cardinals, transferring the GCH instances below up to itself. Silver's theorem is a pure ZFC theorem with no large-cardinal hypothesis, and it explains why all known failures of SCH are engineered at cardinals of cofinality , paradigmatically .
Theorem 5 (Shelah's pcf bound). If is a strong limit cardinal then [Shelah 1994]. This absolute ZFC bound emerges from pcf theory — the study of the possible cofinalities of ultraproducts of a set of regular cardinals — and stands in sharp contrast to Easton's complete freedom on the regular continuum function: the singular continuum function at is bounded by ZFC alone, even though each individual value is Easton-free. Inaccessible cardinals enter as the regular limit cardinals that pcf theory must treat as boundary cases, and the gap between (Silver) and (Shelah) marks the current frontier.
Synthesis. The foundational reason cardinal arithmetic splits into a free part and a constrained part is cofinality: the absorption laws of 42.03.03 discard all additive and multiplicative content, König's theorem leaves exactly the cofinality inequality , and this is exactly the seam along which the regular and singular cases diverge. The central insight is that on regular cardinals monotonicity and König exhaust the ZFC constraints — Easton's theorem makes on regulars a free class function — whereas at singulars the gimel function is pinned by genuine theorems: Silver's, that SCH cannot first fail at uncountable cofinality, and Shelah's pcf bound . These two regimes are dual: forcing (Easton, and the large-cardinal forcings breaking SCH, 42.03.08, 42.03.09) generates freedom by adding subsets, while pcf theory and Silver's reflection generate constraint by transferring information up a cofinal sequence — the bridge is that both read off the same cofinality datum that König first isolated. Putting these together, the entire modern theory of cardinal exponentiation is the theory of the gimel function, and the gimel function generalises the continuum problem of 42.03.03 from to every singular cardinal at once, with the independence of the regular values 42.03.08 on one side and the ZFC theorems of pcf on the other.
Full proof set Master
Proposition 1 (cofinality is a regular cardinal). For every limit ordinal , is a regular cardinal, and .
Proof. First is a cardinal: a cofinal subset of of order type exists, and if a cofinal subset of order type could be extracted by re-indexing along a bijection , contradicting minimality. For regularity, let with increasing cofinal , and let with increasing cofinal . The composite is increasing and cofinal: for pick with , then with , so . Thus , forcing .
Proposition 2 ( for limit ). If is a limit ordinal then ; in particular is singular iff , and .
Proof. The map is a strictly increasing continuous map with . If is cofinal of order type , then is cofinal in (continuity: any has , so some exceeds and ), of the same order type, so . Conversely a cofinal of order type projects to ; concretely, for let be the least with , then is cofinal in of order type , giving . Hence equality. With , gives .
Proposition 3 (regularity of successor cardinals). Under AC, every successor cardinal is regular.
Proof. Suppose , witnessed by an increasing cofinal in with . Then as a set of ordinals, so by the absorption law for cardinal sums of 42.03.03, , where Choice supplies the surjections assembled into a surjection . This contradicts , so .
Proposition 4 (König's inequality and the cofinality bound). If for all then ; consequently and .
Proof. For strictness it suffices that no is surjective. For each the -th coordinates of restricted to the -th block form a set of size , so some is omitted (Choice over ). The diagonal differs from every in coordinate when is in the -th block, so . For the corollary, with and gives . If then , impossible; so .
Proposition 5 (Hausdorff recursion). For all , .
Proof. If then and , so equality holds. Suppose . By Proposition 3, is regular, so every has (). Thus , a union of sets each of size , so . The reverse holds by monotonicity, since and with the product absorbing into the larger factor.
Proposition 6 (Silver's theorem, the uncountable-cofinality case). Let be singular with . If contains a closed unbounded set (indeed is stationary) in , then .
Proof (sketch at the level of the proof set). Fix an increasing continuous cofinal sequence with limit , and let be stationary in . To each associate the sequence . Using a uniform ultrafilter on extending the closed-unbounded filter, two subsets with are identified; the number of -classes is bounded by . On the stationary the values are successors, and Fodor's pressing-down lemma (available because makes the closed-unbounded filter -complete and normal) bounds the ultraproduct by . Reconstructing from its -class up to a set of size yields , and is Cantor. The hypothesis is essential: Fodor's lemma fails for , which is exactly why SCH is engineered at .
Connections Master
Cardinals and the arithmetic of the infinite
42.03.03is the direct prerequisite and the source of every tool used here: the absorption laws , the aleph and beth functions, cardinal exponentiation , and König's inequality in its sum-product form are proved there, and this unit is the cofinality refinement that42.03.03explicitly defers. That unit owns "exponentiation carries all the content"; this unit owns "the content is governed by cofinality," splitting it into the Easton-free regular case and the pcf-constrained singular case.Forcing and the independence of CH
42.03.08is the co-produced companion that supplies the forcing machinery behind Easton's theorem stated here: Cohen forcing adds subsets of a regular to make any prescribed value obeying monotonicity and the König bound, and the Easton product realises an entire class function on the regular cardinals at once. This unit states Easton's theorem and the freedom of the regular continuum function;42.03.08builds the generic extensions that prove it, and the Prikry-type forcings that break SCH at from large cardinals live at the boundary between the two units.Large cardinals and inaccessibility
42.03.09is the co-produced unit where the inaccessible cardinals introduced here as regular (strong) limit cardinals become first-class objects, and where the consistency strength of SCH is measured: Silver's theorem and Shelah's pcf bound are ZFC theorems, but their complement — actually forcing a singular strong-limit with — provably requires large cardinals (Magidor from supercompactness, Gitik's exact calibration). The regular-limit cofinality analysis of this unit is exactly the entry point to that hierarchy.
Historical & philosophical context Master
Cofinality enters set theory with Felix Hausdorff, whose 1908 Grundzüge einer Theorie der geordneten Mengen (Math. Ann. 65) introduced regular and singular cardinals, the cofinality of an order type, and the recursion that still bears his name; Hausdorff also formulated the generalized continuum hypothesis in the aleph form. Julius König's 1905 inequality [Kunen Ch. I §13], which gives , arose from a flawed attempt to refute the continuum hypothesis and survives as the one substantive ZFC constraint on the continuum function beyond Cantor's and monotonicity.
The freedom of the regular continuum function was settled by William Easton, whose 1970 Annals of Mathematical Logic paper used class forcing with an Easton-support product to realise any monotone, König-respecting class function on the regular cardinals as . The singular case proved far deeper. Jack Silver proved in 1974 that the (generalized) continuum hypothesis, and SCH, cannot first fail at a singular of uncountable cofinality [Jech Ch. 8], using generic ultrafilters and the stationary-set machinery; Fred Galvin and András Hajnal sharpened the bounds on shortly after. Menachem Magidor showed in 1977 that SCH at is consistent relative to a supercompact cardinal, and Moti Gitik calibrated its exact consistency strength, so the failure of SCH genuinely requires large cardinals. Saharon Shelah's pcf theory, presented in his 1994 Cardinal Arithmetic [Shelah 1994], produced the absolute bound for strong-limit , a ZFC theorem about an exponential that Easton's theorem shows is otherwise free below the singular level. The standard modern developments are Kunen's [Kunen Ch. I §13] and Jech's [Jech Ch. 5], from which the present treatment of cofinality, gimel, and the singular-cardinals problem is drawn.
Bibliography Master
@book{kunen2011set,
author = {Kunen, Kenneth},
title = {Set Theory},
series = {Studies in Logic},
volume = {34},
publisher = {College Publications},
year = {2011}
}
@book{jech2003set,
author = {Jech, Thomas},
title = {Set Theory},
edition = {3},
series = {Springer Monographs in Mathematics},
publisher = {Springer},
year = {2003}
}
@book{shelah1994cardinal,
author = {Shelah, Saharon},
title = {Cardinal Arithmetic},
series = {Oxford Logic Guides},
volume = {29},
publisher = {Oxford University Press},
year = {1994}
}
@article{koenig1905koenig,
author = {K{\"o}nig, Julius},
title = {Zum Kontinuum-Problem},
journal = {Mathematische Annalen},
volume = {60},
year = {1905},
pages = {177--180}
}
@article{hausdorff1908grundzuege,
author = {Hausdorff, Felix},
title = {Grundz{\"u}ge einer Theorie der geordneten Mengen},
journal = {Mathematische Annalen},
volume = {65},
year = {1908},
pages = {435--505}
}
@article{easton1970powers,
author = {Easton, William B.},
title = {Powers of regular cardinals},
journal = {Annals of Mathematical Logic},
volume = {1},
year = {1970},
pages = {139--178}
}
@article{silver1975singular,
author = {Silver, Jack},
title = {On the singular cardinals problem},
journal = {Proceedings of the International Congress of Mathematicians (Vancouver 1974)},
volume = {1},
year = {1975},
pages = {265--268}
}
@article{magidor1977singular,
author = {Magidor, Menachem},
title = {On the singular cardinals problem I},
journal = {Israel Journal of Mathematics},
volume = {28},
year = {1977},
pages = {1--31}
}