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.
Sweet density transfers along complete suborders
Statement
Assume ZFC. Let be a complete suborder of (write ), let be a sweetness model, and let be subsets of whose union is dense in . Write for the canonical dense completion map, and use Shelah's quotient convention
Suppose and forces . Then some have the following uniform property: for every there is with which forces . Moreover, the union of all for which such a exists is dense below . This is the full two-part conclusion of Claim 7.4 of the source, in the library order.
Facts & Assumptions
Given: ZFC and the objects and quotient convention in the Statement.
Shelah sweetness models for forcing: satisfies the sequential clause and the transfer clause, and its -classes are downward directed. The same definition says that is a complete suborder of when its order and incompatibility are inherited from and every maximal antichain of remains maximal in .
Choice-free regular open completion of forcing preorders (with forcing equivalence as in Forcing equivalence and Boolean completion) and Completeness, regular opens, and order continuity: the canonical map preserves order, preserves and reflects compatibility, and has order-dense image. It need not be injective or reflect the original order.
By the displayed quotient convention, is monotone in and upward closed in : if and , then implies .
The Axiom of Choice supplies choices from nonempty witness sets. Under this assumption Zorn's lemma gives a maximal element of any nonempty poset in which every chain has an upper bound.
Proof
Fix the canonical surjection where , For fixed , the indices as varies are unbounded, so occurs arbitrarily late; in particular .
The Boolean conditions and are compatible in : the quotient hypothesis applied to says exactly that they are compatible.
For each , use [F4] to choose with so that, whenever there exists for which no satisfies and , the chosen has that property. The admissible set is nonempty: choose a bad witness if one exists, and otherwise use itself.
There is with and . Indeed step 1.2 gives a nonzero in . Density of supplies with . Then and are compatible, so compatibility reflection in [F2] supplies a common strengthening in . Finally density of supplies with . Order preservation gives , while .
There is such that every has compatible with . Apply the comparable form of the transfer clause to at . It supplies such that every has some with . Hence and , so witnesses the required Boolean compatibility.
The sequence extends to the diagonal witness: since and refines for all , the sequential clause applied to the sequence with last term gives with and for every .
Since , step 3.1 makes compatible with . We claim that some in forces . Otherwise the quotient convention makes dense below in . Apply [F4] to the poset of antichains contained in , ordered by inclusion: the empty antichain is present and unions bound chains because any two elements of a chain union occur together in one antichain. Obtain a maximal such . It is predense below : otherwise a condition below incompatible with all of has a strengthening in that could be added. Apply the same argument to antichains of containing to obtain a maximal antichain of . Every member of is incompatible with : if such an were compatible with , a common strengthening in would be compatible with some member of the predense antichain below , contradicting that is an antichain. By completeness of the suborder [F1], is maximal in . But a common Boolean strengthening of and is incompatible with every member of (by the definition of ) and every member of (because they are incompatible with ), contradicting maximality in . This proves the claim. Now choose below from the dense union of the . Then and ; by upward closure in [F3], it also forces every with into the quotient.
Choose with , possible by step 1.1. Then satisfies and, since , forces ; so is not bad at level . By step 2.1 the existence of a bad witness at level would have forced to be bad, hence no is bad for : for every there is with and . Thus the pair has the uniform property required in part (1) of the Statement.
Let . Given , the hypothesis holds by monotonicity [F3], so the argument of steps 1.2 through 5.1 with in place of produces such that every , in particular , has a condition below forcing ; The uniform property below implies the one below since every witness below is below , so this is included in . Hence meets every strengthening of and is dense below .
The steps above establish both conclusions of the Statement.
Depends on
Used by
Dependency tree · two levels
47 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)