Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Forcing theorem

Statement

For every fixed membership formula φ, forcing is uniformly definable from P and its name parameters over a transitive ZF ground model M and satisfies the truth lemma for every M-generic G. If externally an M-generic filter through every condition is available, then

pMφ(τ)G (G is M-generic and pG  M[G]φ(τG)).

The definability assertion is a scheme indexed by fixed formulas. Existence of generics is an extra hypothesis for the displayed semantic characterization, not for the forcing predicate or truth lemma. ZF suffices.

Facts & Assumptions

Given: A transitive ZF model M, its nonempty forcing preorder P, and a fixed formula with names in M.

[F1]

Atomic forcing is well-founded and definable proves atomic definability on set cones.

[F2]

Forcing relation for all formulas extends definability through each fixed formula and specifies negation.

[F3]

Monotonicity, density, and decision for forcing supplies density closure and persistence.

[F4]

Truth lemma proves the semantic equivalence with existence of a forcing condition in a given generic.

Proof

1.1

Atomic relations are definable by F1. At conjunction and negation insert the already obtained subformula predicates into the clauses in F2; at an existential quantify over the definable class of M-names and over the set P. This gives a fixed first-order predicate for each fixed formula. Every parameter is P, its order, or one of the name arguments. F4 then supplies the truth lemma for this very internally defined predicate.

F1F2F4
2.1

If pMφ and G is M-generic containing p, the right-to-left direction of F4 makes φ true in M[G]. This implication needs no assumption that any generic exists.

F4step 1.1
2.2

Suppose p does not force φ. By density closure F3 the conditions forcing φ cannot be dense below p. Hence some qp has no stronger condition forcing φ, which says qM¬φ by F2. The extra generic-existence hypothesis supplies an M-generic G containing q; upward closure puts p in G. F4 makes ¬φ true there. Thus the asserted truth in every generic through p fails.

F2F3F4step 1.1
3.1

Steps 2.1 and 2.2 give both directions of the display. The argument selected only one generic under the stated existence hypothesis; it did not select generics simultaneously or infer their existence from definability. Formula construction used an external finite induction, so no uniform truth predicate for the universe or AC was assumed.

step 2.1step 2.2

Depends on

Used by

Dependency tree · two levels

10 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