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 realization on regular cardinals
Statement
Assume the Generalized Continuum Hypothesis (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and ), let be a transitive ground model of ZFC, let be a set-sized Easton function (Easton functions on regular cardinals) and let be an -generic filter for the set-sized Easton product (The Easton-support product of higher Cohen forcings).
Then:
(a) and have the same ordinals, the same cofinality function and the same cardinals; and
(b) in the continuum function on is realized by : for every , , the ground-model cardinal being still a cardinal of .
The proof is the source's realization computation: the head alone carries every subset of in the extension and has at most nice names for them, while the many -columns of the generic are pairwise distinct by density.
Facts & Assumptions
Given: GCH, a transitive ground model of ZFC, a set-sized Easton function , and an -generic filter for .
and have the same ordinals, the same cofinality function and the same cardinals, and every -cardinal remains a cardinal of . (Set-sized Easton forcing preserves cardinals and cofinalities)
An Easton function has cardinal values, is nondecreasing, and satisfies for , so and . (Easton functions on regular cardinals)
For every infinite regular : has the -chain condition, is -closed, and with head and tail , both sets when is set-sized. (Easton head chain condition and tail closure)
A condition of is a partial function on the triples , , , , values in , with fewer than triples of first coordinate for every infinite regular , ordered by reverse inclusion; a condition of the head therefore has fewer than triples, and the fibre at is . (The Easton-support product of higher Cohen forcings)
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-sized forcing is -closed and is -cc, then for every -generic and every with one has ; in particular the -factor adds no new subsets of over the intermediate head extension . (A closed Easton tail adds no short sequences across its chain-condition head)
Under GCH, for every : , and there are at most nice -names for subsets of . (GCH counts Easton head conditions and subset names)
Every -name forced to be a subset of a ground-model set is forced equal to a nice name, that is, to a name with each an antichain. (Nice-name reduction and the ccc counting bound, Nice names for subsets of a ground-model set)
For each fixed formula the forcing relation is definable from and the name parameters over , implies for every -generic , and every element of is the value of a name in . (Forcing theorem, Forcing names and their rank, Check names without a largest condition)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof
Fix . Then is an infinite regular cardinal, is a ground cardinal with and by [F2], and by [F1] the models have the same ordinals, cofinality function and cardinals, so keeps its cofinality and is still a cardinal of .
The head and the tail are the factors of at : with -closed, -cc and both set-sized [F3, F4]. The coordinate projections and of are -generic: if is dense and , then is dense in and lies in , so meets it and meets , and symmetrically for the tail; hence .
: let with . Its characteristic function is a function in , so by [F6] applied to the pair , of step 1.2. By [F9] there is a -name with . Form in the usual name for ; the top condition forces , and . By [F8] there is a nice -name with . By [F7] the set of nice -names for subsets of has at most elements in , and is a cardinal of by step 1.1, so the assignment the ground well-order-least such , which is defined in using the well-order that [F10] gives in , is an injection of the subsets of in into . Hence .
: for each form the -name . Its value is a subset of . For each , the head conditions deciding the coordinate are dense, so belongs to exactly when the generic column at has bit . For distinct and any head condition , choose not occurring in any triple of , possible since . Then is a head condition stronger than with ; adding these two coordinates also leaves the support bounds below intact. The condition forces and . Thus the head conditions forcing are dense. By [F9] the map is an injection of into in , and .
Steps 2.1 and 2.2 and the fact that is a cardinal of give for the fixed , and was arbitrary, so the continuum function on is realized; step 1.1 gives the preservation clause (a). This 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
- GCH counts Easton head conditions and subset names
- Set-sized Easton forcing preserves cardinals and cofinalities
- Nice-name reduction and the ccc counting bound
- Nice names for subsets of a ground-model set
- Dense open sets and generic filters over a model
- Forcing theorem
- Forcing names and their rank
- Check names without a largest condition
- 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
Used by
Dependency tree · two levels
52 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, the set-sized Easton calculation, printed p.234 (standard reference, not scraped)
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Theorem 58, PDF p.12 (standard reference, not scraped)