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.
Amalgamating two sweet models over a common complete subalgebra
Example
Let and be sweetness models whose complete Boolean algebras share a common complete subalgebra , with contained in and in . Then the amalgam is sweet: below each admitted pair in the canonical dense set there is a least admission modulus, and the equivalence relations obtained by shifting the two factor relations by that modulus have countably many downward-directed classes and satisfy the sweetness diagonal and transfer clauses. The canonical embeddings of and into the amalgam are complete, and is ccc because every sweet forcing is ccc.
Verification
Given: Sweetness models and , named complete embeddings of the complete algebra into both Boolean completions, and the positive forcing with those two images identified.
[F1] Shelah sweetness models for forcing: the sweetness clauses and the extension relation.
[F2] Sweet density transfers along complete suborders: the two-part uniformity and density conclusion of Claim 7.4 used to synchronize the quotient witnesses in both coordinates.
[F3] Shelah amalgamation preserves sweetness: the amalgam classes and the denseness of the amalgam data.
[F4] Sweet forcings are countable unions of directed sets and ccc: completeness of suborders and the sigma-directed decomposition.
The amalgam data are those of [F3]: consists of the pairs admitted by a common positive -condition and is ordered coordinatewise. Its canonical dense subset is The denseness assertion already includes the synchronization of the two quotient witnesses; it is not inferred from coordinatewise denseness alone.
For , let be the least such that every pair with is admitted. Existence is the double application of [F2] in the proof of [F3]: a countable directed cover of is used first for and then, after retaining the dense subfamily below the admission witness, for . Two reductions in the same directed piece have a common strengthening and hence admit the perturbed pair. The least number depends only on the two equivalence classes and admission, not on a chosen witness.
No partial-isomorphism extension theorem is needed. The theorem [F3] applies directly to the two named complete embeddings of the arbitrary common complete subalgebra . The weak-coordinate maps give complete canonical copies of both factors in the full amalgam, independently of whether those canonical conditions belong to the selected dense presentation .
If has in both coordinates, then the relevant factor classes are unchanged and minimality gives . Hence [F3] defines These relations refine with , have countably many classes, and every class is downward directed. In particular every two members of one -class are compatible. The diagonal and transfer assertions are the coordinatewise sweetness clauses combined with the same common-admission property; they are not consequences of pairwise compatibility alone.
The canonical embeddings are complete by the exact conclusion of [F3]; no countable-generation hypothesis on is present in that theorem.
Countable chain condition: the amalgam is sweet by [F3] and step 2.1, and a sweet forcing is a countable union of directed sets, hence ccc by [F4].
The steps above exhibit the intrinsic least modulus, the -classes, the two canonical complete embeddings and the ccc conclusion for the amalgam over an arbitrary common complete subalgebra, verifying the claimed instance.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Saharon Shelah, Can You Take Solovay's Inaccessible Away? (standard reference, not scraped)