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.
A Suslin tree has a Suslin regular-open algebra
Statement
Let be a normal splitting Suslin tree and let be its reverse forcing order. In ZFC the regular-open completion is a nontrivial complete atomless ccc Boolean algebra satisfying the exact diagonal countable-distributivity law. Hence is a Suslin algebra.
Facts & Assumptions
Given: A normal splitting Suslin tree , its reverse forcing order , and AC.
A Suslin algebra is a nontrivial complete atomless ccc Boolean algebra satisfying the displayed diagonal distributive identity. The Suslin Hypothesis and Suslin algebras
The reverse order of a normal Suslin tree is ccc and -distributive. Normal Suslin-tree forcing is countably distributive
The regular-open completion has a dense nonzero embedding that preserves and reflects compatibility. Choice-free regular open completion of forcing preorders
Regular open sets form a complete Boolean algebra; their order is inclusion and finite meets are intersections. Regular open algebra in ZF
AC supplies simultaneous representatives below arbitrary nonzero Boolean antichains. The Axiom of Choice
Proof
By F3-F4, is a complete Boolean algebra and each has some tree condition with . Since is nonempty, its underlying space is nonempty, so the regular-open bounds and are distinct. Thus is nontrivial.
Let and choose with . Splitting supplies two distinct immediate tree successors of . They are incompatible, so F3 gives nonzero disjoint elements . Therefore , proving atomlessness.
Let be pairwise disjoint. By A1 and density of , choose with for every . If , compatibility of would make nonzero by F3, while it lies below . Thus the form a forcing antichain; they are distinct and F2 makes countable. Hence is ccc.
Fix a double sequence in and put and . Always . In any complete Boolean algebra, : the right side is below , and if bounds all , then bounds , giving . Suppose and choose with . For each , let contain the conditions such that either is incompatible with , or for some . This set is open. It is dense: if is compatible with , take ; since , the just-proved distributive identity makes some nonzero, and density of plus compatibility reflection gives an actual with . By F2 choose in every . Then incompatibility with is impossible. Let be the least with . Completeness gives , while , a contradiction. Therefore , so and the exact diagonal law holds.
Steps 1.1-2.3 give nontriviality, completeness, atomlessness, ccc, and precisely the identity in F1. Therefore is a Suslin algebra. AC is used only at step 2.2 for a set-indexed simultaneous selection and through the already declared distributivity supplier; the regular-open construction itself is choice free.
Depends on
Used by
- Kurepa equivalence Theorem
Dependency tree · two levels
21 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
- Monk, Set theory following Jech, Lemma 15.45 and complete proof, printed p. 278 (standard reference, not scraped)