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 forcing preserves cardinals and cofinalities

Statement

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

Then M and the generic extension M[G] have the same ordinals, the same cofinality function, and the same cardinals: for every ordinal δ∈M, cf⁡M[G](δ)=cf⁡M(δ) (Cofinality cf⁡(α), and regular and singular cardinals), and every M-cardinal remains a cardinal of M[G].

The proof is the source's cardinal-preservation argument after Lemma 15.19: if a regular ground cardinal became singular, a cofinal map of shorter length would already lie in the extension by the head of the product alone, and that head is chain-condition forcing on its regular cardinals.

Facts & Assumptions

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

[F2]

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

[F3]

For a transitive ZF model M containing a forcing order Q and its order, 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)

[F4]

If a set forcing P is λ+-closed and Q is λ+-cc, then every function f:λ→M in M[G×H] already lies in M[H]. (A closed Easton tail adds no short sequences across its chain-condition head)

[F5]

If θ is regular and P is θ-cc, then forcing with P preserves every ground-model cofinality at least θ and every ground-model cardinal at least θ. (Chain conditions preserve high cofinalities and ccc preserves cardinals)

[F7]

Forcing with a nonempty preorder preserves the ordinals, and over a transitive ZFC ground model the generic extension satisfies ZFC: ordinals, cofinalities and cardinal minima are computed in it by its own Replacement. (Forcing preserves ordinals, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)

[F8]

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

Proof

1.1

Fix the data of the statement, so that M⊆M[G] are transitive models with the same ordinals and M[G]⊨ZF, and let δ∈M be an ordinal.

F7given
1.2

For every infinite ground regular cardinal λ the factorization P(F)≅P≤λ×P>λ holds in M. The coordinate projections G>λ and G≤λ of G are M-generic: if D⊆P≤λ is dense and D∈M, then the set of conditions p∈P(F) with p≤λ∈D is dense in P(F) and lies in M, so G meets it and G≤λ meets D; the same computation with a dense D⊆P>λ handles the tail. Hence M[G]=M[G>λ][G≤λ].

F2F3
2.1

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 an infinite regular cardinal of M[G] and hence also of M: if cf⁡M(δ)<δ then M[G] would contain a cofinal map cf⁡M(δ)→δ by [F7], making δ singular in M[G]. So δ is an infinite regular cardinal of M with δ<κ, and by step 1.2 the lemma [F4] applies with the δ+-closed tail P>δ and the δ+-cc head P≤δ, giving f∈M[G≤δ]. Thus cf⁡M[G≤δ](κ)≤δ, while [F5] at θ=δ+≤κ gives cf⁡M[G≤δ](κ)=cf⁡M(κ)=κ>δ, a contradiction.

F1F6F7F8step 1.2
3.1

Every ground cardinal remains a cardinal of M[G]. Suppose not, and let κ be the least ground cardinal with ∣κ∣M[G]=μ<κ. By step 2.1, κ cannot be regular in M: an ordinal regular in the ZFC extension is a cardinal there. Thus κ is a singular ground cardinal, hence a limit cardinal, and the ground cardinals below it are cofinal in it. Choose a ground cardinal ν with μ<ν<κ. Minimality of κ makes ν a cardinal of M[G]. A bijection κ→μ in M[G] restricts to an injection ν→μ, since ν⊆κ and ν is an ordinal of M[G]; hence ∣ν∣M[G]≤μ<ν, a contradiction.

F1F7step 2.1
3.2

All ground cofinalities are preserved. Let κ=cf⁡M(δ) and fix a strictly increasing cofinal g:κ→δ in M, so that cf⁡M[G](δ)≤κ because g still has unbounded range 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′ has cofinal range in κ: given β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](κ)≤η<κ would hold, contradicting step 2.1 since κ is ground regular; therefore cf⁡M[G](δ)=κ=cf⁡M(δ).

F6F8step 2.1
4.1

Steps 3.2 and 3.1 show that M and M[G] have the same ordinals, the same cofinality function on the ordinals of M, and the same cardinals, which is the statement. ∎

step 3.23.1

Depends on

Used by

Dependency tree · two levels

64 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