Jump to content

Suslin's problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Thijs!bot (talk | contribs) at 21:37, 31 January 2010 (robot Adding: fr:Problème de Souslin). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, Suslin's problem is a question about totally ordered sets posed by Mikhail Yakovlevich Suslin in the early 1920s.[1] 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.[2]

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

Formulation

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

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

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 isomorphic to R.

Implications

Any totally ordered set that is not isomorphic to R but satisfies (1) - (4) is known as a Suslin line. The existence of Suslin lines has been proven to be equivalent to the existence of Suslin trees. Suslin lines exist if the additional constructibility axiom V equals L is assumed.

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. Equivalently, that every tree of height ω1 either has a branch of length ω1 or an antichain of cardinality ω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 Suslin hypothesis is independent of ZFC, and is independent of both the generalized continuum hypothesis and of the negation of the continuum hypothesis. However, Martin's axiom plus the negation of the Continuum Hypothesis implies the Suslin 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.

See also

Notes

  1. ^ Souslin, M. (1920). "Problème 3". Fundamenta Mathematicae. 1: 223.
  2. ^ Solovay, R. M. (1971). "Iterated Cohen extensions and Souslin's problem". Ann. of Math. (2). 94: 201–245. doi:10.2307/1970860. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

References