In mathematics, Suslin's problem is a question about totally ordered sets posed by and published posthumously.
It has been shown to be independent of the standard axiomatic system of set theory known as ZFC; showed that the statement can neither be proven nor disproven from those axioms, assuming ZF is consistent.
(Suslin is also sometimes written with the French transliteration as Souslin, from the Cyrillic Суслин.)
right
Suslin's problem asks: Given a non-empty totally ordered set R with the four properties
R does not have a least nor a greatest element;
the order on R is dense (between any two distinct 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; and
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.
Any totally ordered set that is not isomorphic to R but satisfies properties 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 ω1 either has a branch of length ω1 or an antichain of cardinality .
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.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Set Theory as a foundational system for mathematics. ZF, ZFC and ZF with atoms. Relative consistency of the Axiom of Choice, the Continuum Hypothesis, the reals as a countable union of countable sets,
In elementary mathematics, a number line is a picture of a graduated straight line that serves as visual representation of the real numbers. Every point of a number line is assumed to correspond to a real number, and every real number to a point. The integers are often shown as specially-marked points evenly spaced on the line. Although the image only shows the integers from –3 to 3, the line includes all real numbers, continuing forever in each direction, and also numbers that are between the integers.
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.
In the mathematical discipline of set theory, forcing is a technique for proving consistency and independence results. Intuitively, forcing can be thought of as a technique to expand the set theoretical universe to a larger universe by introducing a new "generic" object . Forcing was first used by Paul Cohen in 1963, to prove the independence of the axiom of choice and the continuum hypothesis from Zermelo–Fraenkel set theory.
Explores the significance of leading digits and dominant balance in engineering approximations, showcasing historical methods like slide rules and their relevance in solving challenging problems.
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the theories share set variables and set operations. We prove a combination theore ...