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.
Easton head chain condition and tail closure
Statement
Work in ZFC and 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 an Easton function and let be an infinite regular cardinal. Write , and as in The Easton-support product of higher Cohen forcings. Then:
(a) ;
(b) has the -chain condition, that is, every antichain of has cardinality below (Closure, distributivity, and chain conditions for forcing orders);
(c) is -closed: every descending sequence of conditions of with has a common lower bound in ; indeed every set of at most pairwise compatible conditions of has a common lower bound in ;
(d) the factorization holds: for a set-sized it is an isomorphism of the whole orders, and for a class Easton function it holds for every set-sized condition, with a set.
Facts & Assumptions
Given: ZFC + GCH, an Easton function , an infinite regular cardinal , and the Easton product with its head and tail .
Every -sized family of sets of cardinality below has a -sized delta subsystem, provided is infinite, is regular and for every ; in particular, for regular and , every family of many below- subsets has a -sized delta subsystem. (Generalized delta systems for small supports)
A delta system with root is a family whose pairwise intersections are exactly . (Delta systems and roots)
is -cc when every antichain of has cardinality below , and -closed when every descending sequence of length below has a common lower bound, an infinite regular cardinal. (Closure, distributivity, and chain conditions for forcing orders)
is the least cardinal above , and is the supremum of the with ; each infinite cardinal is an . (The successor cardinal , the alephs , the beths , successor and limit cardinals, and the identifications and )
For a regular infinite one has , so the supremum of fewer than ordinals below is again below . (; 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 cardinals with infinite, ; also when , whereas . (Absorption: for cardinals with infinite and , , and when )
Cardinal exponentiation satisfies and , and is monotone in the base, and in the exponent when the base is nonzero. (Commutativity, associativity, distributivity and monotonicity of and , the unit laws, the two exponent laws, and if and only if injects into )
A condition of is a partial function on triples with , , , values in , with fewer than triples having first coordinate for every infinite regular ; stronger conditions extend functions, and splits conditions by first coordinate. (The Easton-support product of higher Cohen forcings)
The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)
Proof technique: direct.
Proof
Under GCH every infinite cardinal satisfies , by [F4]. If , then . If for an infinite cardinal , then GCH gives and monotonicity gives for every , so again . If is a limit cardinal above , the successor cardinals for infinite are cofinal in , while each is at most ; thus . These cases prove clause (a) for every infinite regular .
Now let be a descending sequence in with , and put . The conditions form a -chain of functions, so is a function with values in , and every triple in its domain has first coordinate . Fix an infinite regular and let . Each by [F8], and . Regularity of gives , so (with the finite or empty cases immediate). For the set in question is empty. Hence and extends every , so is -closed, clause (c), in the sense of [F3]; the same cardinal bound applies to a pairwise compatible family of at most conditions, whose union is a function because the members agree on overlaps.
Consequently for every set with , and by [F6]; with Choice [F9], this bounds a union of many sets each of size at most by .
We prove clause (b) by contraposition. Suppose is an antichain with . By the support condition of [F8] at the regular cardinal , every has . For any fixed domain there are at most bit assignments. Thus there are distinct domains, since otherwise Choice [F9] and would bound by . Select one condition for each distinct domain. Now [F1] applies with , of step 1.1 and yields of size and a root with for distinct , in the sense of [F2].
The map takes at most values on by step 2.1, and a union of many classes each of size at most has size at most ; since , two distinct have .
For such the union is a function, because the domains meet exactly in and the two agree on ; all its triples still have first coordinate . Let be an infinite regular cardinal with and let and similarly . By [F8] both have cardinality below , and by [F6], the case of finite cardinalities being immediate since is infinite. Hence satisfies the support condition at every regular , and the bound at also implies the bound at every regular . Thus it is a condition of extending both and . This contradicts the antichain property of , so no antichain of has cardinality : every antichain has cardinality below , which is clause (b) by [F3].
Every condition of splits uniquely as with each restriction supported on its respective side of ; since the support condition at a regular refers only to triples with , the two parts are conditions of and respectively, every head-tail pair has disjoint domains and its union satisfies each support bound because the union of two sets of size below an infinite regular still has size below , and the extension order is preserved in both directions. Hence is an isomorphism when is a set, and for a class Easton function the same computation applies to each set-sized condition; is then a set, since its conditions are partial functions on the set of triples with of size below . This is clause (d) and completes the proof. [F8, given] ∎
Depends on
- The Easton-support product of higher Cohen forcings
- Closure, distributivity, and chain conditions for forcing orders
- Generalized delta systems for small supports
- Delta systems and roots
- $\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
- Commutativity, associativity, distributivity and monotonicity of $\oplus$ and $\otimes$, the unit laws, the two exponent laws, and $\kappa \le \lambda$ if and only if $\kappa$ injects into $\lambda$
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- 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
- GCH counts Easton head conditions and subset names Lemma
- Separation and Power Set in the Easton class extension Lemma
- Set-stage names and the forcing truth lemma for the Easton class product Lemma
- Uniform head-antichain decisions below a class tail Lemma
- Easton's theorem for regular cardinals Theorem
- Set-sized Easton forcing preserves cardinals and cofinalities Theorem
- Set-sized Easton realization on regular cardinals Theorem
Dependency tree · two levels
45 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 head/tail factorization (15.11)-(15.12), printed p.234 (standard reference, not scraped)
- Kameryn J. Williams, Math 655 Lecture Notes 2.2, Lemma 54, PDF p.11 (standard reference, not scraped)