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.
Set-sized Easton forcing preserves cardinals and cofinalities
Statement
Assume the Generalized Continuum Hypothesis, that is for every ordinal (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ). Let be a set-sized Easton function (Easton functions on regular cardinals), let be a transitive ground model of ZFC, and let be -generic for the set-sized Easton product of The Easton-support product of higher Cohen forcings.
Then and the generic extension have the same ordinals, the same cofinality function, and the same cardinals: for every ordinal , (Cofinality , and regular and singular cardinals), and every -cardinal remains a cardinal of .
The proof is the source's cardinal-preservation argument after Lemma 15.19: if a regular ground cardinal became singular, a cofinal map of shorter length would already lie in the extension by the head of the product alone, and that head is chain-condition forcing on its regular cardinals.
Facts & Assumptions
Given: GCH, a set-sized Easton function , a transitive ground model of ZFC, and an -generic filter for .
Under GCH the successor cardinals satisfy ; every singular cardinal is a limit cardinal, so the smaller cardinals are cofinal in it. (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and , ; 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)
For every infinite regular , the head has the -chain condition, the tail is -closed, and . (Easton head chain condition and tail closure)
For a transitive ZF model containing a forcing order and its order, a filter is -generic when for every dense with , a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)
If a set forcing is -closed and is -cc, then every function in already lies in . (A closed Easton tail adds no short sequences across its chain-condition head)
If is regular and is -cc, then forcing with preserves every ground-model cofinality at least and every ground-model cardinal at least . (Chain conditions preserve high cofinalities and ccc preserves cardinals)
at every ordinal; a cofinal map of length may be taken strictly increasing; an infinite cardinal is regular exactly when . (; 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)
Forcing with a nonempty preorder preserves the ordinals, and over a transitive ZFC ground model the generic extension satisfies ZFC: ordinals, cofinalities and cardinal minima are computed in it by its own Replacement. (Forcing preserves ordinals, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof
Fix the data of the statement, so that are transitive models with the same ordinals and , and let be an ordinal.
For every infinite ground regular cardinal the factorization holds in . The coordinate projections and of are -generic: if is dense and , then the set of conditions with is dense in and lies in , so meets it and meets ; the same computation with a dense handles the tail. Hence .
Every ground regular cardinal remains regular in . Suppose is infinite and regular in but not in , and let with a cofinal in . Then is an infinite regular cardinal of and hence also of : if then would contain a cofinal map by [F7], making singular in . So is an infinite regular cardinal of with , and by step 1.2 the lemma [F4] applies with the -closed tail and the -cc head , giving . Thus , while [F5] at gives , a contradiction.
Every ground cardinal remains a cardinal of . Suppose not, and let be the least ground cardinal with . By step 2.1, cannot be regular in : an ordinal regular in the ZFC extension is a cardinal there. Thus is a singular ground cardinal, hence a limit cardinal, and the ground cardinals below it are cofinal in it. Choose a ground cardinal with . Minimality of makes a cardinal of . A bijection in restricts to an injection , since and is an ordinal of ; hence , a contradiction.
All ground cofinalities are preserved. Let and fix a strictly increasing cofinal in , so that because still has unbounded range in . If , take a cofinal in and define in by letting be the least with . Then has cofinal range in : given , cofinality of gives with , hence and by strict increase of . So would hold, contradicting step 2.1 since is ground regular; therefore .
Steps 3.2 and 3.1 show that and have the same ordinals, the same cofinality function on the ordinals of , and the same cardinals, which is the statement. ∎
Depends on
- Easton functions on regular cardinals
- The Easton-support product of higher Cohen forcings
- Easton head chain condition and tail closure
- A closed Easton tail adds no short sequences across its chain-condition head
- Chain conditions preserve high cofinalities and ccc preserves 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
- Cofinality $\operatorname{cf}(\alpha)$, and regular and singular cardinals
- Forcing preserves ordinals
- ZFC and ordinal preservation for supplied transitive Boolean generic extensions
- Choice-free regular open completion of forcing preorders
- 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 Axiom of Choice
- Dense open sets and generic filters over a model
Used by
Dependency tree · two levels
64 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
- Thomas Jech, Set Theory, Chapter 15, cardinal preservation argument after Lemma 15.19, printed pp.234-235 (standard reference, not scraped)
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Corollary 56, PDF p.12 (standard reference, not scraped)