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.
Dense open sets and generic filters over a model
Definition
Use Forcing preorders, compatibility and filters: means stronger, and a filter is nonempty, upward closed and internally downward directed. A subset is dense if , and open if and imply .
For a transitive ZF model M containing P and its order, a filter is M-generic if for every dense with . The displayed density condition is the same inside and outside M: all its quantifiers range over the identical sets P and D, with identical order relation. No largest condition, countability or existence of a generic filter is assumed by the definition. When M is called countable, this means countable externally; its natural numbers agree with actual omega by Ordinals and omega in transitive models.
Depends on
Used by
- Generics over countable transitive models in ZF Corollary
- Atomic forcing relation Definition
- Martin's Axiom at a cardinal and Martin's Axiom Definition
- Master conditions and proper posets Definition
- Shelah's universal-meagre forcing Definition
- Cohen-name valuation and dense-set meeting Example
- Stems, direct extensions, and the generic sequence Example
- A closed Easton tail adds no short sequences across its chain-condition head Lemma
- Dense forcing name translations preserve forcing Lemma
- Generic Boolean filters select ground-model joins Lemma
- Monotonicity, density, and decision for forcing Lemma
- Normal Suslin-tree forcing is countably distributive Lemma
- Set-stage names and the forcing truth lemma for the Easton class product Lemma
- The Good-Tree-Watson symmetric model is closed under omega-sequences from the full extension Lemma
- Uniform head-antichain decisions below a class tail Lemma
- Atomless generic filters are not in the ground model Proposition
- Cohen coordinates are distinct and mutually generic Theorem
- Rasiowa–Sikorski with its choice use exposed Theorem
- Set-sized Easton forcing preserves cardinals and cofinalities Theorem
- Set-sized Easton realization on regular cardinals Theorem
- The Prikry generic sequence changes cofinality to omega Theorem
Dependency tree · two levels
5 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
- Karagila Forcing Definitions 1.2,1.7,1.9 and Exercise 1.10 pp2–4 (standard reference, not scraped)