Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 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.

The Easton-support product of higher Cohen forcings

Definition

Let F be an Easton function (Easton functions on regular cardinals). A condition in the Easton-support product P(F) is a function p with values in {0,1} whose domain is a set of triples (κ,α,β) with κ∈dom⁡(F), α<κ and β<F(κ), subject to the Easton support condition

∣{ (κ,α,β)∈dom⁡(p):κ≤γ }∣  <  γfor every infinite regular cardinal γ.

Each coordinate κ carries the Cohen order Add⁡(κ,F(κ))=Fn⁡(F(κ)×κ,2,<κ) (Cohen, collapse, and Lévy-collapse forcing orders), so the fibre pκ(α,β)=p(κ,α,β) is a partial function κ×F(κ)→2 of domain size <κ. A condition p is stronger than q, written p≤q, exactly when p⊇q: stronger conditions extend functions, and the empty function is the largest condition. When dom⁡(F) is a set, P(F) is a set; when dom⁡(F) is a proper class, P(F) is a proper class and its conditions are still sets. The support condition at γ=κ gives ∣dom⁡(pκ)∣<κ for every κ∈dom⁡(F).

For an infinite regular λ (Cofinality cf⁡(α), and regular and singular cardinals), the initial segment and the tail are the restrictions

p≤λ=p↾{(κ,α,β):κ≤λ},p>λ=p↾{(κ,α,β):κ>λ},

with P≤λ={p≤λ:p∈P(F)} and P>λ={p>λ:p∈P(F)}. Each condition splits uniquely into these two restrictions, and each restriction retains every support bound. Conversely, a head condition and a tail condition have disjoint domains, so their union is a function. For every infinite regular γ, its triples with κ≤γ form the union of two sets each of cardinality below γ, which again has cardinality below γ. Thus union is the inverse of the map p↦(p≤λ,p>λ), and both maps preserve extension. This proves the isomorphism P(F)≅P≤λ×P>λ of forcing orders. P≤λ is the Easton product of the fibres with κ≤λ, P>λ the Easton product of the fibres with κ>λ, and both split by first coordinate exactly as displayed.

Depends on

Used by

Dependency tree · two levels

12 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