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.
Normal Suslin-tree forcing is countably distributive
Statement
Let be a normal Suslin tree and order by reverse tree order, so extensions in the tree are stronger forcing conditions. In ZFC, is ccc and -distributive (equivalently, the intersection of every countable family of dense open subsets is dense). Consequently forcing with adds no new -sequences of ordinals.
Facts & Assumptions
Given: A normal Suslin tree ; is its reverse forcing order. Assume AC.
-distributive means that every countable family of dense open subsets has dense intersection, and ccc means that every antichain is countable. Closure, distributivity, and chain conditions for forcing orders
A dense set contains an extension of every condition, and an open set contains every stronger extension of each of its members. Dense open sets and generic filters over a model
Normality extends every node to each higher tree level. Normal and splitting trees
A Suslin tree has height , countable levels, and no uncountable antichain. Aronszajn, Suslin and special trees
Two nodes below a common tree extension are comparable, and strict tree order raises height. Tree predecessors and compatibility
Under countable choice every countable subset of is bounded below . Assuming countable choice: every at most countable subset of is bounded below , so no at most countable subset of is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
Under AC, Zorn's lemma supplies a maximal element when every chain in a nonempty poset has an upper bound. Zorn's lemma
For an arbitrary forcing preorder, distributivity of its separative quotient prevents new sequences of ground-model elements of the corresponding shorter lengths. Closure, distributivity, and absence of new short sequences
Under countable choice, . Countable choice makes omega-one regular
A forcing extension of a transitive ground model has exactly the same ordinals as the ground model. Forcing preserves ordinals
AC supplies Zorn's lemma, the countable choices of antichains and ordinal bounds, and countable choice. The Axiom of Choice
Proof
Conditions are compatible exactly when they are comparable in : a common stronger condition is a common tree extension, which makes comparable by F5, while the deeper member of two comparable nodes is already a common forcing extension. Therefore forcing antichains are exactly tree antichains, and F4 makes ccc. The unique root supplied by normality makes nonempty.
Let be dense open. In the inclusion poset of antichains contained in , the empty antichain is present and the union of every chain is an antichain contained in ; F7 gives a maximal member . It is maximal as a forcing antichain: for any , density gives in , and if were incompatible with every member of it could be adjoined. By step 1.1, is countable. F6 therefore gives above the heights of all its nodes. If has height greater than , maximality makes it compatible with some ; comparability and the height inequality give , hence , and openness puts in . Thus every node above level lies in .
Let be dense open and fix . Apply step 2.1 to each , using A1 for the simultaneous maximal-antichain and bound choices. By F6 the countable set has a bound . Normality gives a tree extension of height greater than . Then for every by step 2.1, and . Hence is dense; it is open because every is open. This is -distributivity by F1.
By F9, is regular in the stated ZFC setting. Apply F8 with to the separative quotient of ; the quotient has the same dense-open distributivity and is forcing equivalent to . Step 3.1 therefore implies that no sequence of ground-model elements of length below is added. By F10 every ordinal of a forcing extension is already a ground-model ordinal, and , so forcing with adds no new -sequence of ordinals. This last assertion comes from F8 and F10, not from the definition of distributivity.
Depends on
- Closure, distributivity, and chain conditions for forcing orders
- Dense open sets and generic filters over a model
- Normal and splitting trees
- Aronszajn, Suslin and special trees
- Tree predecessors and compatibility
- The Axiom of Choice
- Zorn's lemma
- Assuming countable choice: every at most countable subset of $\omega_1$ is bounded below $\omega_1$, so no at most countable subset of $\omega_1$ is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable
- Countable choice makes omega-one regular
- Closure, distributivity, and absence of new short sequences
- Forcing preserves ordinals
Used by
Dependency tree · two levels
43 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, Proposition 15.43 and Lemma 15.44, printed pp. 277-278 (standard reference, not scraped)
- Karagila, Forcing & Symmetric Extensions, Theorems 4.16 and 4.22, printed pp. 22 and 24 (standard reference, not scraped)