Alphabeta Math
TheoremStatement: 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.

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 ℵ0=ω and ℵ1=ω1), let M be a transitive ground model of ZFC, let F be a set-sized Easton function (Easton functions on regular cardinals) and let G be an M-generic filter for the set-sized Easton product P(F) (The Easton-support product of higher Cohen forcings).

Then:

(a) M and M[G] have the same ordinals, the same cofinality function and the same cardinals; and

(b) in M[G] the continuum function on dom⁡(F) is realized by F: for every κ∈dom⁡(F), (2κ)M[G]=F(κ), the ground-model cardinal F(κ) being still a cardinal of M[G].

The proof is the source's realization computation: the head alone carries every subset of κ in the extension and has at most F(κ) nice names for them, while the F(κ) many κ-columns of the generic are pairwise distinct by density.

Facts & Assumptions

Given: GCH, a transitive ground model M of ZFC, a set-sized Easton function F, and an M-generic filter G for P(F).

[F1]

M and M[G] have the same ordinals, the same cofinality function and the same cardinals, and every M-cardinal remains a cardinal of M[G]. (Set-sized Easton forcing preserves cardinals and cofinalities)

[F2]

An Easton function F has cardinal values, is nondecreasing, and satisfies cf⁡(F(κ))>κ for κ∈dom⁡(F), so F(κ)>κ and F(κ)≥κ+. (Easton functions on regular cardinals)

[F3]

For every infinite regular λ: P≤λ has the λ+-chain condition, P>λ is λ+-closed, and P(F)≅P≤λ×P>λ with head P≤λ and tail P>λ, both sets when F is set-sized. (Easton head chain condition and tail closure)

[F4]

A condition of P(F) is a partial function on the triples (κ,α,β), κ∈dom⁡(F), α<κ, β<F(κ), values in {0,1}, with fewer than γ triples of first coordinate ≤γ for every infinite regular γ, ordered by reverse inclusion; a condition of the head P≤κ therefore has fewer than κ triples, and the fibre at κ is Add⁡(κ,F(κ))=Fn⁡(F(κ)×κ,2,<κ). (The Easton-support product of higher Cohen forcings)

[F5]

A filter K⊆Q is M-generic when K∩D≠∅ for every dense D⊆Q with D∈M, a set being dense when below every condition it contains a stronger one. (Dense open sets and generic filters over a model)

[F6]

If a set-sized forcing P is λ+-closed and Q is λ+-cc, then for every M-generic G×H and every f:λ→M with f∈M[G×H] one has f∈M[H]; in particular the P-factor adds no new subsets of λ over the intermediate head extension M[H]. (A closed Easton tail adds no short sequences across its chain-condition head)

[F7]

Under GCH, for every κ∈dom⁡(F): ∣P≤κ∣=F(κ), and there are at most F(κ) nice P≤κ-names for subsets of κ. (GCH counts Easton head conditions and subset names)

[F8]

Every P-name forced to be a subset of a ground-model set A is forced equal to a nice name, that is, to a name {⟨aˇ,p⟩:a∈A, p∈Aa} with each Aa⊆P an antichain. (Nice-name reduction and the ccc counting bound, Nice names for subsets of a ground-model set)

[F9]

For each fixed formula the forcing relation is definable from P and the name parameters over M, p⊩φ(τ⃗) implies M[G]⊨φ(τ⃗G) for every M-generic G∋p, and every element of M[G] is the value of a name in M. (Forcing theorem, Forcing names and their rank, Check names without a largest condition)

[F10]

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

Proof

1.1

Fix κ∈dom⁡(F). Then κ is an infinite regular cardinal, F(κ) is a ground cardinal with F(κ)>κ and cf⁡(F(κ))>κ by [F2], and by [F1] the models M⊆M[G] have the same ordinals, cofinality function and cardinals, so κ keeps its cofinality and F(κ) is still a cardinal of M[G].

F1F2
1.2

The head and the tail are the factors of P(F) at κ: P(F)≅P≤κ×P>κ with P>κ κ+-closed, P≤κ κ+-cc and both set-sized [F3, F4]. The coordinate projections G>κ and G≤κ of G are M-generic: if D⊆P≤κ is dense and D∈M, then {p∈P(F):p≤κ∈D} is dense in P(F) and lies in M, so G meets it and G≤κ meets D, and symmetrically for the tail; hence M[G]=M[G>κ][G≤κ].

F3F4F5
2.1

(2κ)M[G]≤F(κ): let x∈M[G] with x⊆κ. Its characteristic function is a function κ→M in M[G], so x∈M[G≤κ] by [F6] applied to the pair P>κ, P≤κ of step 1.2. By [F9] there is a P≤κ-name σ∈M with σG≤κ=x. Form in M the usual name σ′ for σ∩κˇ; the top condition forces σ′⊆κˇ, and σG≤κ′=x. By [F8] there is a nice P≤κ-name τ∈M with τG≤κ=x. By [F7] the set of nice P≤κ-names for subsets of κ has at most F(κ) elements in M, and F(κ) is a cardinal of M[G] by step 1.1, so the assignment x↦ the ground well-order-least such τ, which is defined in M[G] using the well-order that [F10] gives in M, is an injection of the subsets of κ in M[G] into F(κ). Hence (2κ)M[G]≤F(κ).

F6F7F8F9F10step 1.1step 1.2
2.2

(2κ)M[G]≥F(κ): for each β<F(κ) form the P≤κ-name x˙β={⟨αˇ,p⟩:α<κ, p∈P≤κ, p(κ,α,β)=1}. Its value is a subset of κ. For each α<κ, the head conditions deciding the coordinate (κ,α,β) are dense, so α belongs to xβ:=val⁡G≤κ(x˙β) exactly when the generic column at (α,β) has bit 1. For distinct β,β′ and any head condition p∈P≤κ, choose α<κ not occurring in any triple of dom⁡(p), possible since ∣dom⁡(p)∣<κ. Then q=p∪{(κ,α,β)↦1,(κ,α,β′)↦0} is a head condition stronger than p with ∣dom⁡(q)∣<κ; adding these two coordinates also leaves the support bounds below κ intact. The condition q forces αˇ∈x˙β and αˇ∉x˙β′. Thus the head conditions forcing x˙β≠x˙β′ are dense. By [F9] the map β↦xβ is an injection of F(κ) into P(κ) in M[G], and (2κ)M[G]≥F(κ).

F4F5F9step 1.2
3.1

Steps 2.1 and 2.2 and the fact that F(κ) is a cardinal of M[G] give (2κ)M[G]=F(κ) for the fixed κ, and κ∈dom⁡(F) was arbitrary, so the continuum function on dom⁡(F) is realized; step 1.1 gives the preservation clause (a). This is the statement. ∎

step 1.1step 2.1step 2.2

Depends on

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