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.
Closure, distributivity, and chain conditions for forcing orders
Definition
Let be an infinite regular cardinal and let be a nonempty forcing preorder, with stronger conditions smaller. The order is -closed if every descending sequence of length has a common lower bound. It is -distributive if the intersection of every family of fewer than dense open subsets of is dense. It is -cc if every antichain has cardinality below .
Thus ccc is -cc. “Countably closed” or “-closed” means -closed: all countable descending chains have lower bounds. It does not mean -closed, which only addresses finite chains and is automatic for a preorder with its last member as a lower bound.
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
- Karagila, Forcing & Symmetric Extensions, Chapter 4 (standard reference, not scraped)