MathLabs

Suslin's problem

Independent of the axiomsFoundations of mathematics
Statement

Let (L,<)(L, <) be a non-empty, dense, complete linear order without endpoints such that every collection of pairwise disjoint non-empty open intervals in LL is countable (the countable chain condition, ccc). Must (L,<)(L, <) be order-isomorphic to the real line (R,<)(\mathbb{R}, <)?

Thomas Jech (1967) and Stanley Tennenbaum (1968) constructed forcing models containing Suslin lines (refuting Suslin's Hypothesis), Ronald Jensen (1968) proved that Suslin lines exist in Gödel's constructible universe LL via the diamond principle ♢\diamondsuit, and Robert Solovay and Tennenbaum (1971) invented iterated forcing to prove that Suslin's Hypothesis holds under MA+¬CH\text{MA} + \neg\text{CH}.

  1. Independence of Suslin's Hypothesis from ZFC (Jensen, Solovay–Tennenbaum, 1971)Ronald Jensen, Robert M. Solovay, and Stanley Tennenbaum, 1971Difficulty 5/5ResearchCondensed summary

References

  1. Robert M. Solovay, Stanley Tennenbaum (1971). Iterated Cohen extensions and Souslin's problem · DOI:10.2307/1970745
  2. Ronald B. Jensen (1972). The fine structure of the constructible hierarchy · DOI:10.1016/0003-4843(72)90001-0
  3. Thomas Jech (2003). Set Theory