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.

Replacement in the Easton class extension

Statement

Let (M,C) be a GBC + Global Choice + GCH ground, F a definable Easton class function with class product P=P(F) and G an M-generic filter (Class-theoretic ground assumptions for Easton forcing, Set-stage names and the forcing truth lemma for the Easton class product).

Then M[G] satisfies the Replacement scheme: for every fixed formula ψ(x,y,ρ⃗) and all set parameters ρ⃗G∈M[G], if M[G]⊨∀x∈a ∃!y ψ(x,y,ρ⃗G) for some a∈M[G], then the image {y:M[G]⊨∃x∈a ψ(x,y,ρ⃗G)} is a set of M[G]; indeed it is contained in the value of a ground set of witness names lying in one stage MP≤γ.

Facts & Assumptions

Given: a GBC + Global Choice + GCH ground, a definable Easton class function F, the class product P=P(F), an M-generic filter G, a fixed formula ψ(x,y,ρ⃗), parameter names ρ⃗ and a set a=τG∈M[G].

[F1]

Stages, names, valuation, definable class forcing and truth lemma for M[G]=⋃λM[G≤λ]. (Set-stage names and the forcing truth lemma for the Easton class product)

[F2]

Uniform decisions with witnesses: applied to the formula ∃y ψ(x,y,ρ⃗) and the tuples (σα,ρ⃗) for a ground enumeration ⟨σα:α<μ⟩ of dom⁡(τ) with μ≤λ, there are t∈G>λ and maximal antichains Wα⊆P≤λ such that each cell carries a recorded truth value and, when positive, a ground set name ρα,q with t∪q⊩ψ(σα,ρα,q,ρ⃗); the truth values are computed in M[G≤λ] and all witness names lie in one stage MP≤γ. (Uniform head-antichain decisions below a class tail)

[F3]

Separation and the bounded power-set clause hold in M[G], and each M[G≤λ] is a transitive model of ZFC with the same ordinals as M containing the stages below it, satisfying Choice. (Separation and Power Set in the Easton class extension, ZFC and ordinal preservation for supplied transitive Boolean generic extensions, Choice-free regular open completion of forcing preorders)

[F4]

The Axiom of Choice, so ground sets can be enumerated and images formed. (The Axiom of Choice)

Proof

1.1

Fix a=τG, choose an infinite regular λ above the stages of τ and ρ⃗ with μ:=∣dom⁡(τ)∣M<λ, and enumerate dom⁡(τ)=⟨σα:α<μ⟩∈M [F4]; then a⊆{σα,G:α<μ} and a,ρ⃗G∈M[G≤λ] by the valuation and stage clauses of [F1]. Assume M[G]⊨∀x∈a ∃!y ψ(x,y,ρ⃗G). This assertion concerns only the active values σα,G∈a; a name in dom⁡(τ) whose coefficient is not met by G may have a value outside a.

F1F4
1.2

Apply [F2] to the formula ∃y ψ(x,y,ρ⃗) and the tuples (σα,ρ⃗), obtaining t∈G>λ, maximal antichains Wα and, for every cell q∈Wα with a positive recorded value, a ground name ρα,q with t∪q⊩ψ(σα,ρα,q,ρ⃗). Put S={ρα,q:α<μ, q∈Wα, the value recorded at q is positive}, a ground set indexed by the set μ×⋃α<μWα [F3, F4]; by the last clause of [F2] there is an infinite regular γ with S⊆MP≤γ, and then {ρG:ρ∈S}={ρG≤γ:ρ∈S}∈M[G≤γ] by [F1].

F1F2F3F4
2.1

Every actual value lies in that image. Let x=σα,G∈a and let y be the unique element of M[G] with M[G]⊨ψ(x,y,ρ⃗G). The truth value of the existential instance was decided on the antichain Wα by the unique qα∈Wα∩G≤λ from [F2]. Its recorded value cannot be negative: then a condition of G extending t∪qα would force ¬∃y ψ(σα,y,ρ⃗), contradicting soundness in the actual extension and the existence of y. Hence the positive cell carries ρα,qα∈S and forces ψ(σα,ρα,qα,ρ⃗). Soundness gives M[G]⊨ψ(σα,G,ρα,qα,G,ρ⃗G), so uniqueness yields y=ρα,qα,G∈{ρG:ρ∈S}. Thus the image is a subset of this set and is itself a set of M[G] by Separation [F3].

F1F2F3step 1.2
3.1

Replacement follows since ψ, the parameters and a were arbitrary, and the proof shows in addition that the image is contained in the value of a ground set of witness names all of which lie in the single stage MP≤γ: this is the statement. ∎

step 1.2step 2.1

Depends on

Used by

Dependency tree · two levels

33 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