Worked solution: Independence of Suslin's Hypothesis from ZFC (Jensen, Solovay–Tennenbaum, 1971)
The real line has several familiar order properties: it is dense (between any two points there is another), complete (no gaps), has no first or last point, and it is separable — the rationals sit inside it as a countable set that gets arbitrarily close to every point. Cantor proved these four properties, taken together, uniquely characterize up to relabeling.
Separability has an easy consequence: any collection of pairwise disjoint open intervals must be countable, since each one has to contain a distinct rational number. Suslin asked, in 1920, whether this weaker consequence alone — called the countable chain condition — could replace separability in Cantor's characterization, or whether some mysterious "impostor" line could satisfy it without secretly having a countable dense subset.
Cantor's characterization theorem states that a linearly ordered set which is dense (between any two points lies a third), complete (every bounded set has a supremum), without endpoints, and separable (has a countable dense subset) is order-isomorphic to . Each hypothesis is needed; the question Suslin posed in 1920 concerns weakening the last one.
Separability implies the countable chain condition (ccc): any family of pairwise disjoint nonempty open intervals is countable, since each interval must contain a distinct point of the countable dense set. The converse is not obvious at all — disjointness of intervals is a much weaker demand than density of a fixed countable set, and a priori a ccc continuum could 'hide' its density behind uncountably many mutually avoiding regions.
Suslin asked whether ccc can replace separability in Cantor's theorem: is every dense complete endpoint-free ccc order isomorphic to ? A counterexample — a ccc non-separable linear continuum — is called a Suslin line, and Suslin's Hypothesis () asserts none exists. The question resisted direct attack for decades because the order-theoretic hypothesis ccc is hard to exploit in constructions; the next step's equivalence with a tree problem is what made it tractable.
- Separable order
- A linearly ordered set that contains a countable subset getting arbitrarily close to every point, the way sits densely inside .
- Countable chain condition (ccc)
- An order (or more generally a poset) satisfies ccc if every family of pairwise disjoint nonempty open intervals (or pairwise incompatible elements) is countable.