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 yields a Suslin line
Statement
In ZFC, if a Suslin tree exists, then a Suslin line exists in the strong published convention.
Facts & Assumptions
Given: A Suslin tree . Assume AC.
A strong-convention Suslin line is nonempty, dense, has no endpoints, is boundedly complete, has no countable order-dense subset, and has only countable families of pairwise disjoint nonempty open intervals. Suslin lines in order language
Every Suslin tree has an infinitely splitting normal Suslin refinement in ZFC. Every Suslin tree has a normal splitting refinement
The maximal branches of that refinement carry a dense no-endpoint ccc first-difference order in which every nonempty open interval is nonseparable. The first-difference order on branches
Completing such an order and deleting possible endpoints preserves density, bounded completeness, ccc, and absence of separable nonempty intervals. Linear-order completion and density
AC is the choice principle used by the refinement, branch, and completion constructions. The Axiom of Choice
Proof
Apply F2 to and obtain an infinitely splitting normal Suslin refinement .
By F3, the maximal branches of , ordered at their first differing successor, form a nonempty dense linear order without endpoints. The order has no uncountable pairwise disjoint family of nonempty open intervals, and every nonempty open interval of is nonseparable.
Take the exact completion of and delete its possible first and last points. By F4 the resulting order is nonempty, dense, has no endpoints, is boundedly complete, satisfies the interval ccc, and has no separable nonempty open interval. In particular itself has no countable order-dense subset: if such a set existed, it would be dense in every nonempty open subinterval, contradicting the preceding property. Thus every clause of F1 holds, so is a Suslin line in the published convention. All three constructions are in ZFC and their uses of choice are exactly those recorded by the supplying lemmas; the implication is not asserted in ZF.
Depends on
Used by
- Formal relative consistency of not SH Corollary
- SH is not equivalent to CH False statement
- Kurepa equivalence Theorem
Dependency tree · two levels
19 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 9.12 through Corollary 9.16, printed pp. 65-72 (standard reference, not scraped)