Suslin's problem

In mathematics, Suslin's problem is a question about totally ordered sets posed by Mikhail Yakovlevich Suslin (1920) and published posthumously. It has been shown to be independent of the standard axiomatic system of set theory known as ZFC: the statement can neither be proven nor disproven from those axioms.^[1]

(Suslin is also sometimes written with the French transliteration as Souslin, from the Cyrillic Суслин.)

Un ensemble ordonné (linéairement) sans sauts ni lacunes et tel que tout ensemble de ses intervalles (contenant plus qu'un élément) n'empiétant pas les uns sur les autres est au plus dénumerable, est-il nécessairement un continue linéaire (ordinaire)?

A (linearly) ordered set without jumps or gaps and such that every set of its intervals (containing more than one element) not overlapping each other is at most denumerable, is it necessarily an (ordinary) linear continuum?

The original statement of Suslin's problem from (Suslin 1920)

Formulation

Given a non-empty totally ordered set R with the following four properties:

R does not have a least nor a greatest element;
the order on R is dense (between any two elements there is another);
the order on R is complete, in the sense that every non-empty bounded subset has a supremum and an infimum;
every collection of mutually disjoint non-empty open intervals in R is countable (this is the countable chain condition for the order topology of R).

Is R necessarily order-isomorphic to the real line R?

If the requirement for the countable chain condition is replaced with the requirement that R contains a countable dense subset (i.e., R is a separable space) then the answer is indeed yes: any such set R is necessarily order-isomorphic to R (proved by Cantor).

The condition for a topological space that every collection of non-empty disjoint open sets is at most countable is called the Suslin property.

Implications

Any totally ordered set that is not isomorphic to R but satisfies (1) – (4) is known as a Suslin line. The Suslin hypothesis says that there are no Suslin lines: that every countable-chain-condition dense complete linear order without endpoints is isomorphic to the real line. An equivalent statement is that every tree of height ω₁ either has a branch of length ω₁ or an antichain of cardinality $\aleph_1.$

The generalized Suslin hypothesis says that for every infinite regular cardinal κ every tree of height κ either has a branch of length κ or an antichain of cardinality κ. The existence of Suslin lines is equivalent to the existence of Suslin trees and to Suslin algebras.

The Suslin hypothesis is independent of ZFC. Jech (1967) and Tennenbaum (1968) independently used forcing methods to construct models of ZFC in which Suslin lines exist. Jensen later proved that Suslin lines exist if the diamond principle, a consequence of the Axiom of constructibility V=L, is assumed. (Jensen's result was a surprise as it had previously been conjectured that V=L implies that no Suslin lines exist, on the grounds that V=L implies there are "few" sets.) On the other hand, Solovay & Tennenbaum (1971) used forcing to construct a model of ZFC in which there are no Suslin lines; more precisely they showed that Martin's axiom plus the negation of the Continuum Hypothesis implies the Suslin Hypothesis.

The Suslin hypothesis is also independent of both the generalized continuum hypothesis (proved by Ronald Jensen) and of the negation of the continuum hypothesis. It is not known whether the Generalized Suslin Hypothesis is consistent with the Generalized Continuum Hypothesis; however, since the combination implies the negation of the square principle at a singular strong limit cardinal—in fact, at all singular cardinals and all regular successor cardinals—it implies that the axiom of determinacy holds in L(R) and is believed to imply the existence of an inner model with a superstrong cardinal.

Notes

↑ Solovay, R. M.; Tennenbaum, S. (1971). "Iterated Cohen extensions and Souslin's problem". Ann. of Math. (2) (Annals of Mathematics) 94 (2): 201–245. doi:10.2307/1970860. JSTOR 1970860.

References

K. Devlin and H. Johnsbråten, The Souslin Problem, Lecture Notes in Mathematics (405) Springer 1974
Jech, Tomáš (1967), "Non-provability of Souslin's hypothesis", Comment. Math. Univ. Carolinae 8: 291–305, MR 0215729
Souslin, M. (1920), "Problème 3" (PDF), Fundamenta Mathematicae 1: 223
Tennenbaum, S. (1968), "Souslin's problem.", Proc. Nat. Acad. Sci. U.S.A. 59: 60–63, doi:10.1073/pnas.59.1.60, MR 0224456
Grishin, V.N. (2001), "Suslin hypothesis", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4

Set theory

Axioms	Choice countable dependent Extensionality Infinity Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification

Operations	Cartesian product Complement De Morgan's laws Disjoint union Intersection Power set Set difference Symmetric difference Union

Concepts Methods	Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Transfinite induction Venn diagram

Set types	Countable Empty Finite (hereditarily) Fuzzy Infinite Recursive Subset · Superset Transitive Uncountable Universal

Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck

Paradoxes Problems	Russell's paradox Suslin's problem

Set theorists	Abraham Fraenkel Bertrand Russell Ernst Zermelo Georg Cantor John von Neumann Kurt Gödel Lotfi A. Zadeh Paul Bernays Paul Cohen Richard Dedekind Thomas Jech Willard Quine

This article is issued from Wikipedia - version of the Tuesday, April 26, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.

Suslin's problem

Formulation

Implications

See also

Notes

References