In set theory, a Suslin tree is a tree of uncountable height, specifically height aleph one, in which every branch and every level is countable, named after the Russian mathematician Mikhail Suslin. The existence of a Suslin tree is equivalent to a negative answer to Suslin's problem, which asks whether a certain characterization of the real number line by its order properties can be weakened in a particular way and still uniquely describe the real line, and whether such a tree exists cannot be decided by the standard axioms of set theory alone. Under the axiom of constructibility a Suslin tree does exist, while under an axiom called Martin's axiom together with the negation of the continuum hypothesis no Suslin tree exists, making the question of Suslin trees one of the classic examples of a mathematical statement that is independent of the standard axioms.
Facts
Connections
In Branch
Source Wikipedia: Tree (set theory)
Is Kind Of Object
Sources
1. Wikipedia: Tree (set theory)
Definition
Trees with a single root may be viewed as rooted trees in the sense of graph theory in one of two ways: either as a tree (graph theory) or as a trivially perfect graph. In the first case, the graph is the undirected Hasse diagram of the partially ordered set, and in the second case, the graph is simply the underlying (undirected) graph of the partially ordered set.
- In Branch: Set Theory, Lead sentence
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.