Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 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 conditions and proper posets

Definition

Let P be a nonempty preorder, let θ be a regular cardinal with PHθ, and let M be a countable elementary submodel of a structure (Hθ,,<θ,P,) containing all displayed parameters, where <θ is a fixed well-order of Hθ. A condition qP is (M,P)-generic if, for every dense DP with DM, the set DM is predense below q. Spelled out in the stronger-is-smaller convention, this means

rq  sDM such that r and s are compatible in P.

For pPM, an (M,P)-master condition below p is an (M,P)-generic q satisfying qp. Neither genericity nor mastery requires qM, and genericity does not require q itself to belong to every dense set.

The preorder P is proper in the master-condition formulation if, for every sufficiently large regular θ, every such countable elementary M, and every pPM, there is an (M,P)-master condition below p. Here “sufficiently large” means that some regular θ0 works for every regular θθ0. Adding the well-order makes the Skolem-closure convention explicit. The equivalent club-of-models and generic-extension formulations are assertions, not definitions, and are proved in the next item.

This item only fixes predicates and quantifiers, so it makes no selection and uses no instance of Choice. Existence of the countable elementary models and of master conditions is invoked only by later theorems under their declared axiom bases.

Depends on

Used by

Dependency tree · two levels

12 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