Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Monotonicity, density, and decision for forcing

Statement

In ZF, for each fixed membership formula φ and tuple of names:

  • If pφ and qp, then qφ.
  • If {q:qφ} is dense below p, then pφ.
  • {q:qφ or q¬φ} is dense in P.

In addition, if G is M-generic, pG, and DM is dense below p, then GD. The same assertion applies to D{q:qp}.

Facts & Assumptions

Given: ZF, a nonempty forcing preorder P, and fixed names and a fixed formula. The final genericity assertion uses transitive ZF M containing P and its order.

[F1]

Forcing relation for all formulas defines conjunction, negation and existential forcing.

[F2]

Atomic forcing relation defines atomic forcing by common-extension and density conditions.

[F3]

Dense open sets and generic filters over a model defines density and nonempty, upward closed, internally directed generic filters.

Proof

1.1

Every atomic forcing clause persists to stronger conditions: in the subset clause the tested common extensions below q are a subset of those below p, and equality is the conjunction of two such requirements; membership restricts its tested extensions in the same way. For density closure of subset, given u,sσ and qp,s, choose aq forcing the subset, then apply its clause with that entry and common extension a. For equality, take a densely available condition forcing equality and perform this argument separately for each subset direction. For membership, given qp, first refine to a condition forcing membership and then refine once more to its equality/coefficient witness. These arguments prove atomic persistence and density closure.

F2F3
1.2

If D is dense below p, the set D={qD:qp}{q:qp} is dense in P. Indeed a condition compatible with p has a common extension, which can be refined into D; an incompatible condition already belongs to the second set. For D,pM, Separation makes DM. A generic G containing p meets D, and directedness prevents it from meeting its incompatible part. Thus it meets D{q:qp}.

F3
2.1

Induct on formula complexity for persistence and density closure. For conjunction, persistence holds for each conjunct by induction; if conjunction is forced densely, each conjunct is forced densely and hence at p by induction. For negation, no extension of p forcing ψ implies the same at every stronger condition. If negation is forced densely below p, a hypothetical qp forcing ψ has an extension r forcing its negation; persistence of ψ makes r force ψ, contradicting the negation clause at r itself.

F1step 1.1
3.1

For an existential, let W={r:σ (rψ(σ,τ))}. Forcing the existential means W is dense below p. It is then dense below every stronger condition, proving persistence. If conditions below p forcing the existential are dense below p, any qp has a refinement a below which W is dense, and hence a further refinement in W. Thus W is dense below p, proving density closure. Together with step 2.1, this completes the induction.

F1F3step 2.1
4.1

Given any p, either some qp forces φ, or no such q exists and p forces ¬φ by definition. This proves external decision density. When the parameters belong to M, Separation inside M instead forms the set decided by M; F1 does not identify that set with the external one for quantified formulas. No condition forces both φ and ¬φ, because p is one of its own extensions. All refinements used above are finitely many existential instantiations; no choice principle is used.

F1step 3.1

Depends on

Used by

Dependency tree · two levels

9 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