Alphabeta Math
RemarkRemark: 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.

Orientation for intermediate models and complete subalgebras

Remarks

Let M be a transitive ZF ground model. Suppose BC are nontrivial complete Boolean algebras in M and the inclusion BC is a Boolean embedding preserving all joins computed in M. Thus it preserves zero, one, complements, finite meets and finite joins as well as those ground-model joins. This is the complete-subalgebra convention: completeness refers to ground subsets, not all external subsets. See Completeness, regular opens, and order continuity. If H is M-generic for C+=C{0}, then G=HB is M-generic for B+ and

MM[G]M[H].

Here is the full argument for this direction. A Boolean forcing filter contains 1. If b0,b1HB, directedness gives cH below both. Their Boolean meet is above c, hence belongs to H by upward closure; it is nonzero and belongs to B. This proves directedness of G; nonemptiness and upward closure follow as well.

For any ground dense DB+, its join in B is 1: otherwise the nonzero complement of that join has a refinement dD, which would lie below both the join and its complement. The complete inclusion therefore makes its join in C also 1. For each nonzero cC, some dD has cd0. If all those meets were zero, c would lie below every ¬d, hence below the complement of their join, namely zero. Thus E={eC+:dD (ed)} is a ground dense set in C+. H meets E, and upward closure puts the corresponding d in H. So G meets D, proving genericity without any maximal-antichain selection or AC.

Each B+-name is also a C+-name. Induction on its subname relation shows that its value by G equals its value by H: every coefficient belongs to B, and therefore belongs to G exactly when it belongs to H; the induction hypothesis identifies all selected subname values. The definition Valuation of names and M[G] now gives M[G]M[H]. The ground inclusion and ZF model assertions follow from Generic extensions satisfy ZF and preserve ground-model Choice, using its choice-free branch. If M satisfies AC, its separately qualified branch gives ZFC for both extensions. A complete subalgebra equal to C gives G=H; the two-element subalgebra gives the trivial generic and intermediate model M.

The converse claim that every intermediate model arises from a complete subalgebra is not asserted here. It requires a different theorem. In particular this argument does not infer that the inclusion B+C+ has dense range.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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