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.
Nowhere-separable quotient of a Suslin line
Statement
Let be a Suslin line. Declare when the closed interval with endpoints is separable in its order topology. Then is a convex equivalence relation, every equivalence class is separable, and the ordered quotient is dense, ccc, and has no separable nonempty open interval. After deleting possible quotient endpoints, taking its exact completion, and deleting the possible completion endpoints, one obtains a dense, Dedekind-complete, no-endpoint ccc line in which no nonempty open interval is separable.
Facts & Assumptions
Given: A Suslin line . Assume AC.
The published Suslin-line convention gives a nonempty dense no-endpoint linear order with the interval ccc and no countable order-dense subset. Suslin lines in order language
An endpointless dense ccc order with no separable nonempty interval has an exact completion whose endpoint-deleted core retains ccc and nowhere separability and is boundedly complete. Linear-order completion and density
Under countable choice, a countable union of countable sets is countable. Countable unions of at most countable sets, assuming
Under AC, a nonempty poset in which every chain has an upper bound has a maximal element. Zorn's lemma
AC supplies the maximal disjoint families and the simultaneous dense-set and representative choices below. The Axiom of Choice
Proof
Reflexivity and symmetry of are immediate. For transitivity, the closed interval between and is contained in the union of the closed intervals between and , regardless of their order; dense sets for those two intervals, together with their finitely many endpoints, restrict to a countable dense set in the first interval. F3 therefore proves transitivity. If and , a dense set for , restricted to and augmented by , makes separable; hence . Thus every equivalence class is convex.
Fix an equivalence class . If has at most two points it is separable. Otherwise let be the inclusion poset of pairwise disjoint nonempty intervals with . It is nonempty, and the union of a chain in is again such a disjoint family, so F4 gives a maximal family . The intervals in are pairwise disjoint open intervals of , hence F1 makes countable. For each , the definition of makes separable; choose a countable dense there. Then , augmented by the first and last points of when they exist, is countable by F3. If in and is nonempty, maximality makes meet some , and meets that open intersection. Endpoint rays meet by the same argument unless they end at an included endpoint. Hence is dense in , so every class is separable.
Let and order its classes by when one, equivalently every, member of is below one, equivalently every, member of . Convexity makes this well defined and gives a linear order. If had no class strictly between them, then for and the interval would lie in ; step 2.1 and F3 would make it separable, forcing , a contradiction. Thus is dense.
Fix in and suppose the nonempty quotient interval had a countable dense set . Let be the classes strictly between having more than two points. For each , convexity supplies a nonempty open interval of contained in ; these intervals are pairwise disjoint, so F1 and A1 make countable. Put . By step 2.1 choose a countable dense set for every , and let , countable by F3. Choose and . If and is nonempty, then either lie in the same endpoint class, in the same member of , or in distinct classes; in the last case quotient density and density of put a class of strictly between them. In every case is nonempty. Thus together with is countable and dense in , so , contradicting . No nonempty quotient interval is separable.
Suppose had an uncountable pairwise disjoint family of nonempty open intervals . Choose one representative for every endpoint class that occurs. By density of , is a nonempty open interval of . The resulting original intervals are pairwise disjoint because the quotient intervals are, contradicting the ccc of . Hence is ccc.
The quotient is not a singleton, since otherwise step 2.1 would make all of separable, contrary to F1. Nor can have exactly two classes: then is the union of the two separable classes, and countable dense subsets and meet every nonempty open interval of , because such an interval is infinite, lies in , and therefore has one part that is infinite, hence contains a nonempty interval of that dense class. That would make separable, again contradicting F1. So has at least three classes, and since is dense, deleting its possible first and last classes leaves a nonempty dense no-endpoint order ; steps 4.1-4.2 persist under this deletion. Apply F2 to , take its exact completion, and delete the possible completion endpoints. The resulting order is nonempty, dense, has no endpoints, is boundedly complete, is ccc, and has no separable nonempty open interval. This is the asserted nowhere-separable complete line. The only choice costs are F4 and the simultaneous selections explicitly charged to A1; no ZF claim is made.
Depends on
Used by
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, Theorem 9.17 and complete proof, printed pp. 72-74 (standard reference, not scraped)