Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 2ℵα=ℵα+1 for every ordinal α (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1). Let F be an Easton function and let λ be an infinite regular cardinal. Write P(F), P≤λ and P>λ as in The Easton-support product of higher Cohen forcings. Then:

(a) 2<λ=λ;

(b) P≤λ has the λ+-chain condition, that is, every antichain of P≤λ has cardinality below λ+ (Closure, distributivity, and chain conditions for forcing orders);

(c) P>λ is λ+-closed: every descending sequence ⟨pξ:ξ<δ⟩ of conditions of P>λ with δ<λ+ has a common lower bound in P>λ; indeed every set of at most λ pairwise compatible conditions of P>λ has a common lower bound in P>λ;

(d) the factorization P(F)≅P≤λ×P>λ holds: for a set-sized F it is an isomorphism of the whole orders, and for a class Easton function it holds for every set-sized condition, with P≤λ a set.

Facts & Assumptions

Given: ZFC + GCH, an Easton function F, an infinite regular cardinal λ, and the Easton product P(F) with its head P≤λ and tail P>λ.

[F1]

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 ρ=2<κ, every family of ρ+ many below-κ subsets has a ρ+-sized delta subsystem. (Generalized delta systems for small supports)

[F2]

A delta system with root r is a family whose pairwise intersections are exactly r. (Delta systems and roots)

[F3]

P is κ-cc when every antichain of P 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)

[F4]

μ+ is the least cardinal above μ, and 2<λ is the supremum of the 2μ with μ<λ; each infinite cardinal is an ℵ. (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1)

[F6]

For cardinals ν≤μ with μ infinite, μ⊕ν=μ; also μ⊗ν=μ when ν≠0, whereas μ⊗0=0. (Absorption: for cardinals κ,λ with κ infinite and λ≤κ, κ⊕λ=κ, and κ⊗λ=κ when λ≠0)

[F7]

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 λ)

[F8]

A condition of P(F) is a partial function on triples (κ,α,β) with κ∈dom⁡(F), α<κ, β<F(κ), values in {0,1}, with fewer than γ triples having first coordinate ≤γ for every infinite regular γ; stronger conditions extend functions, and p↦(p≤λ,p>λ) splits conditions by first coordinate. (The Easton-support product of higher Cohen forcings)

[F9]

The Axiom of Choice: every family of nonempty sets has a choice function. (The Axiom of Choice)

Proof technique: direct.

Proof

1.1

Under GCH every infinite cardinal μ satisfies 2μ=μ+, by [F4]. If λ=ℵ0, then 2<λ=sup⁡n<ω2n=ℵ0=λ. If λ=ν+ for an infinite cardinal ν, then GCH gives 2ν=λ and monotonicity gives 2μ≤λ for every μ<λ, so again 2<λ=λ. If λ is a limit cardinal above ℵ0, the successor cardinals μ+ for infinite μ<λ are cofinal in λ, while each is at most λ; thus 2<λ=sup⁡μ<λμ+=λ. These cases prove clause (a) for every infinite regular λ.

F4F7given
1.2

Now let ⟨pξ:ξ<δ⟩ be a descending sequence in P>λ with δ<λ+, and put p=⋃ξ<δpξ. The conditions form a ⊆-chain of functions, so p is a function with values in {0,1}, and every triple in its domain has first coordinate >λ. Fix an infinite regular γ>λ and let Aξ={(κ,α,β)∈dom⁡(pξ):κ≤γ}. Each ∣Aξ∣<γ by [F8], and ∣δ∣≤λ<γ. Regularity of γ gives σ:=sup⁡ξ<δ∣Aξ∣<γ, so ∣⋃ξ<δAξ∣≤∣δ∣⋅σ<γ (with the finite or empty cases immediate). For γ≤λ the set in question is empty. Hence p∈P>λ and p extends every pξ, so P>λ 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.

F3F5F6F8
2.1

Consequently 2∣r∣≤2<λ=λ for every set r with ∣r∣<λ, and λ⊗λ=λ by [F6]; with Choice [F9], this bounds a union of λ many sets each of size at most λ by λ.

F6F9step 1.1
2.2

We prove clause (b) by contraposition. Suppose W⊆P≤λ is an antichain with ∣W∣=λ+. By the support condition of [F8] at the regular cardinal λ, every p∈W has ∣dom⁡(p)∣<λ. For any fixed domain there are at most 2<λ=λ bit assignments. Thus there are λ+ distinct domains, since otherwise Choice [F9] and λ⊗λ=λ would bound ∣W∣ by λ. Select one condition for each distinct domain. Now [F1] applies with κ=λ, ρ=2<λ=λ of step 1.1 and yields W′⊆W of size λ+ and a root r with dom⁡(p)∩dom⁡(q)=r for distinct p,q∈W′, in the sense of [F2].

F1F2F8F9step 1.1
3.1

The map p↦p↾r takes at most 2∣r∣≤λ values on W′ by step 2.1, and a union of λ many classes each of size at most λ has size at most λ; since ∣W′∣=λ+>λ, two distinct p,q∈W′ have p↾r=q↾r.

step 2.1step 2.2
4.1

For such p,q the union p∪q is a function, because the domains meet exactly in r and the two agree on r; all its triples still have first coordinate ≤λ. Let γ be an infinite regular cardinal with γ≤λ and let Ap={(κ,α,β)∈dom⁡(p):κ≤γ} and similarly Aq. By [F8] both have cardinality below γ, and ∣Ap∪Aq∣≤∣Ap∣⊕∣Aq∣<γ by [F6], the case of finite cardinalities being immediate since γ is infinite. Hence p∪q satisfies the support condition at every regular γ≤λ, and the bound at λ also implies the bound at every regular γ>λ. Thus it is a condition of P≤λ extending both p and q. This contradicts the antichain property of W, so no antichain of P≤λ has cardinality λ+: every antichain has cardinality below λ+, which is clause (b) by [F3].

F3F6F8step 2.1step 3.1
5.1

Every condition of P(F) splits uniquely as p=p≤λ∪p>λ 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 P≤λ and P>λ 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 p↦(p≤λ,p>λ) is an isomorphism P(F)≅P≤λ×P>λ when dom⁡(F) is a set, and for a class Easton function the same computation applies to each set-sized condition; P≤λ 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] ∎

step 1.1step 2.2step 4.1step 1.2

Depends on

Used by

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