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.

Easton's theorem for regular cardinals

Statement

Let (M,C) be a GBC + Global Choice + GCH ground (Class-theoretic ground assumptions for Easton forcing), let F be a definable Easton class function defined on every infinite regular cardinal of M (Easton functions on regular cardinals), and let G be M-generic for the Easton class product P(F).

Then the generic union M[G] is a model of ZFC containing M, M[G] has the same ordinals, the same cardinals and the same cofinality function as M, and M[G]⊨2κ=F(κ) at every infinite regular cardinal κ of M. Consequently the three necessary conditions of Necessary constraints on the regular-cardinal continuum function, namely κ<2κ, monotonicity and cf⁡(2κ)>κ for infinite regular κ, are the only ZFC constraints on the values at regular cardinals in the corresponding relative-consistency construction: every Easton function on the regular cardinals of such a ground is realized by a class-generic extension.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground (M,C), a definable Easton class function F defined on every infinite regular cardinal of M, the class product P=P(F) and an M-generic filter G.

[F1]

M[G]=⋃λM[G≤λ] is a transitive model of ZFC containing M with exactly the ordinals of M, the class forcing relation satisfies the truth lemma, and every element of M[G] is the value of a P≤λ-name for some infinite regular λ. (The Easton class-generic union satisfies ZFC, Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

For every infinite regular λ, the head P≤λ is a set with the λ+-chain condition, the tail P>λ is λ+-closed, and P≤λ≅ the set-sized Easton product of the fibres with first coordinate ≤λ. (Easton head chain condition and tail closure)

[F3]

If a set-sized factor is λ+-closed and the other is λ+-cc, then every λ-sequence of ground-model elements in the product extension already lies in the extension by the cc factor. (A closed Easton tail adds no short sequences across its chain-condition head)

[F4]

If θ is a regular cardinal of M and a set forcing is θ-cc, then forcing with it preserves every ground-model cofinality ≥θ and every ground-model cardinal ≥θ. (Chain conditions preserve high cofinalities and ccc preserves cardinals)

[F5]

For a set-sized Easton function on a set of regular cardinals, forcing with its Easton product over a ZFC + GCH ground realizes 2κ=F(κ) at every regular κ of the domain and preserves cardinals and cofinalities. (Set-sized Easton realization on regular cardinals)

[F6]

In ZFC the continuum function at infinite regular cardinals satisfies κ<2κ, monotonicity and cf⁡(2κ)>κ. (Necessary constraints on the regular-cardinal continuum function)

[F7]

An Easton function has cardinal values, is nondecreasing, satisfies cf⁡(F(κ))>κ, and F(κ)>κ for every κ∈dom⁡(F), here the class of all infinite regular cardinals of M. (Easton functions on regular cardinals)

[F8]

GCH in the ground means 2ℵα=ℵα+1 for every ordinal α, and a countable transitive model of ZFC + V = L with its closure classes is an example of such a ground. (The successor cardinal κ+, the alephs ℵα, the beths ℶα, successor and limit cardinals, and the identifications ℵ0=ω and ℵ1=ω1, Class-theoretic ground assumptions for Easton forcing)

Proof

1.1

By [F1] M[G]⊨ZFC and M⊆M[G] have the same ordinals; fix an infinite regular κ of M. The head P≤κ is a set-sized Easton product with the κ+-chain condition and the tail P>κ is κ+-closed [F2]. Any subset of κ in M[G] has a name in a set stage M[G≤γ] for some infinite regular γ≥κ [F1], and the factorization P≤γ≅P≤κ×P(κ,γ] has κ+-closed second factor and κ+-cc first factor, so [F3] puts the subset already in M[G≤κ]. The set-sized realization theorem gives 2κ=F(κ) in M[G≤κ] [F5]. Thus the full extension has the same set of subsets of κ as that head extension.

F1F2F3F5
1.2

Every ground regular cardinal remains regular in M[G]: suppose κ is infinite and regular in M but not in M[G], and let δ=cf⁡M[G](κ)<κ with a cofinal f:δ→κ in M[G]. Then δ is regular in M[G] and therefore in M, since otherwise a ground cofinal map of shorter length would persist into M[G]; so δ is an infinite regular cardinal of M with δ<κ. By [F1] the function f lies in some stage M[G≤γ] with γ≥δ, and the factorization P≤γ≅P≤δ×P(δ,γ] has δ+-closed second factor and δ+-cc first factor [F2], so [F3] gives f∈M[G≤δ] and hence cf⁡M[G≤δ](κ)≤δ; but [F4] at θ=δ+≤κ gives cf⁡M[G≤δ](κ)=cf⁡M(κ)=κ>δ, a contradiction.

F1F2F3F4F9
2.1

Every ground cardinal remains a cardinal of M[G]: suppose κ is the least ground cardinal with ∣κ∣M[G]=μ<κ. By step 1.2, κ cannot be regular in M, since an ordinal that remains regular in the ZFC extension is a cardinal there. Thus κ is a singular ground cardinal, hence a limit cardinal; the ground cardinals below κ are cofinal in κ. Choose a ground cardinal ν with μ<ν<κ. Minimality of κ makes ν a cardinal in M[G], whereas a bijection κ→μ in M[G] restricts to an injection ν→μ, a contradiction. Hence all ground cardinals remain cardinals.

F1F9step 1.2
2.2

All ground cofinalities are preserved. Let κ=cf⁡M(δ) for an ordinal δ of M and fix a strictly increasing cofinal g:κ→δ in M; then cf⁡M[G](δ)≤κ because g is still cofinal in M[G]. If η=cf⁡M[G](δ)<κ, take a cofinal h:η→δ in M[G] and define h′:η→κ in M[G] by letting h′(ξ) be the least β<κ with h(ξ)≤g(β); then h′ is cofinal in κ, because for any β0<κ cofinality of h gives ξ<η with h(ξ)≥g(β0), hence g(h′(ξ))≥h(ξ)≥g(β0) and h′(ξ)≥β0 by strict increase of g. So cf⁡M[G](κ)≤η<κ, contradicting step 1.2 because κ is regular in M; therefore cf⁡M[G](δ)=cf⁡M(δ).

F9step 1.2
3.1

By step 1.1 the full extension and the head extension have the same subsets of each regular κ, and by step 2.1 F(κ) remains a cardinal; hence (2κ)M[G]=F(κ). Steps 2.1 and 2.2 therefore give a ZFC model M[G]⊇M with the ordinals, cardinals and cofinalities of M and with 2κ=F(κ) at every infinite regular cardinal; for the final clause, if F satisfies the three necessary conditions of [F6] then F is an Easton function in the sense of [F7] and the construction above realizes it, while conversely those necessary conditions must hold of 2κ by [F6]; the relative-consistency reading is the one of [F8]: a constructible GCH ground with its closure classes supplies the ground, so no more than the necessary conditions is required. This is the statement. ∎

step 1.1step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

71 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