Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-14
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.

Master-condition characterizations

Statement

Let PM and M be as in the master-condition definition. For qP the following are equivalent:

  • (i) q is (M,P)-generic;
  • (ii) for every dense DM, qG˙DM;
  • (iii) qM[G˙]V=M;
  • (iv) qM[G˙]Ord=MOrd.

Here M[G]={x˙G:x˙M is a P-name}. Moreover, the club-of-countable-models formulation of properness is equivalent to the all-model formulation in sufficiently large structures (Hλ,,<λ,P,).

Facts & Assumptions

Given: ZFC, the displayed P,M,q, and the stronger-is-smaller forcing convention.

[F1]

(M,P)-genericity means that DM is predense below q for every dense DM. Master conditions and proper posets

[F2]

The forcing theorem supplies definability and the truth lemma for the formulas and names used below. Forcing theorem

[F3]

Forcing is persistent, every formula is densely decided, and truth on a dense set below a condition is equivalent to being forced by that condition. Monotonicity, density, and decision for forcing

[F4]

Downward Löwenheim--Skolem supplies elementary Skolem hulls containing specified parameters. Downward Löwenheim–Skolem with parameters

[A1]

AC supplies maximal antichains, well-orders of them, and the ambient well-orders/Skolem closures. The Axiom of Choice

Proof

1.1

Fix DM dense. If DM is predense below q, then conditions below q that extend a condition of DM are dense below q; F2 gives qG˙DM. Conversely, if some rq were incompatible with every member of DM, then r would force that intersection empty. This proves (1) if and only if (2).

F1F2F3
2.1

Assume (1). The inclusion MM[G]V follows from check names. For the reverse inclusion, let rq force that a name x˙M equals a ground object x. Define Dx˙ to contain (a) every s for which some ground object y satisfies sx˙=yˇ, and (b) every s below which no condition has property (a). This set is dense: from any condition, either an extension has property (a), or the original condition has property (b). By definability of forcing it belongs to M. Since Dx˙M is predense below q, some sDx˙M is compatible with r. It cannot have property (b), because a common extension with r would force x˙=xˇ while admitting no ground-value extension. Hence s has property (a); by elementarity its witness may be taken as some yM. A common extension of r and s forces both x˙=xˇ and x˙=yˇ, so x=yM. Thus q forces every ground member of M[G˙] to lie in M, proving (3). Statement (3) immediately implies (4), since ordinals are ground objects and check names give the opposite inclusion.

F1F2F3step 1.1
3.1

Assume (4), and let AM be a maximal antichain. In M, use A1 to fix a bijection e:ξA from an ordinal ξ, and form by mixing the name β˙ for the unique index of the member of AG˙. Then β˙M and qβ˙MOrd by (4). Consequently q forces e(β˙)AMG˙, so AM is predense below q. Every dense DM contains, by elementarity and A1, such a maximal antichain AM; hence DM is predense below q and (1) follows.

F1F2A1step 2.1
4.1

The all-model definition immediately gives the club formulation, since the countable elementary submodels of a fixed well-ordered Hμ structure form a club by F4 and A1. Conversely, suppose the good models contain a club in [Hμ]ω, where μ>2P. Represent a subclub as the models closed under a function F:Hμ<ωHμ. Choose λ>μ and a well-order <λ so that F may be taken as the <λ-least such witness. Every countable M(Hλ,,<λ,P,) is then closed under F, so N=MHμ is a good club model. Every subset of P, and hence every dense set or maximal antichain in M, belongs to Hμ; therefore DN=DM. An (N,P)-master below pPM is thus also an (M,P)-master. This proves the all-model formulation and completes both claimed equivalences. AC is used exactly for A1; no countable transitive model or generic filter is selected.

F1F4A1step 3.1

Depends on

Used by

Dependency tree · two levels

16 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