Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 S be a Suslin line. Declare xy when the closed interval with endpoints x,y 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 S. Assume AC.

[F1]

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

[F2]

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

[F3]

Under countable choice, a countable union of countable sets is countable. Countable unions of at most countable sets, assuming ACω

[F4]

Under AC, a nonempty poset in which every chain has an upper bound has a maximal element. Zorn's lemma

[A1]

AC supplies the maximal disjoint families and the simultaneous dense-set and representative choices below. The Axiom of Choice

Proof

1.1

Reflexivity and symmetry of are immediate. For transitivity, the closed interval between x and z is contained in the union of the closed intervals between x,y and y,z, 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 x<z<y and xy, a dense set for [x,y], restricted to [x,z] and augmented by x,z, makes [x,z] separable; hence xz. Thus every equivalence class is convex.

F1F3A1given
2.1

Fix an equivalence class K. If K has at most two points it is separable. Otherwise let PK be the inclusion poset of pairwise disjoint nonempty intervals (a,b) with a,bK. It is nonempty, and the union of a chain in PK is again such a disjoint family, so F4 gives a maximal family M. The intervals in M are pairwise disjoint open intervals of S, hence F1 makes M countable. For each (an,bn)M, the definition of makes [an,bn] separable; choose a countable dense Dn there. Then D=nDn, augmented by the first and last points of K when they exist, is countable by F3. If c<d in K and (c,d) is nonempty, maximality makes (c,d) meet some (an,bn), and Dn meets that open intersection. Endpoint rays meet D by the same argument unless they end at an included endpoint. Hence D is dense in K, so every class is separable.

F1F3F4A1step 1.1
3.1

Let Q=S/ and order its classes by I<J when one, equivalently every, member of I is below one, equivalently every, member of J. Convexity makes this well defined and gives a linear order. If I<J had no class strictly between them, then for aI and bJ the interval [a,b] would lie in IJ; step 2.1 and F3 would make it separable, forcing ab, a contradiction. Thus Q is dense.

F1F3A1step 1.1step 2.1
4.1

Fix I<J in Q and suppose the nonempty quotient interval (I,J) had a countable dense set A. Let B be the classes K strictly between I,J having more than two points. For each KB, convexity supplies a nonempty open interval of S contained in K; these intervals are pairwise disjoint, so F1 and A1 make B countable. Put C=AB{I,J}. By step 2.1 choose a countable dense set DKK for every KC, and let E=KCDK, countable by F3. Choose aI and bJ. If ac<db and (c,d) is nonempty, then either c,d lie in the same endpoint class, in the same member of B, or in distinct classes; in the last case quotient density and density of A put a class of A strictly between them. In every case E(c,d) is nonempty. Thus E(a,b) together with a,b is countable and dense in [a,b], so ab, contradicting I<J. No nonempty quotient interval is separable.

F1F3A1step 2.1step 3.1
4.2

Suppose Q had an uncountable pairwise disjoint family of nonempty open intervals (Iξ,Jξ). Choose one representative sKK for every endpoint class K that occurs. By density of Q, (sIξ,sJξ) is a nonempty open interval of S. The resulting original intervals are pairwise disjoint because the quotient intervals are, contradicting the ccc of S. Hence Q is ccc.

F1A1step 3.1
5.1

The quotient Q is not a singleton, since otherwise step 2.1 would make all of S separable, contrary to F1. Nor can Q have exactly two classes: then S=IJ is the union of the two separable classes, and countable dense subsets DII and DJJ meet every nonempty open interval of S, because such an interval is infinite, lies in IJ, and therefore has one part that is infinite, hence contains a nonempty interval of that dense class. That would make S separable, again contradicting F1. So Q has at least three classes, and since Q is dense, deleting its possible first and last classes leaves a nonempty dense no-endpoint order Q; steps 4.1-4.2 persist under this deletion. Apply F2 to Q, 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.

F1F2F4A1step 2.1step 3.1step 4.1step 4.2

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