Diamonds (set theory)
( Diamond ) is a "combinatorial" principle in set theory .
definition
For each infinite cardinal number is an abbreviation for the following statement:
- there is a sequence with the following properties:
- for all true
- for all the set is a stationary subset of .
Often one speaks in a simplistic way that the principle makes it possible to "guess" subsets of . While the number of subsets of (i.e. the cardinality of the power set of ) is greater than according to Cantor's theorem , postulates that there is a transfinite sequence of length that “guesses” all subsets of (more precisely: stationary often better and better approximated).
Instead of just writing .
Connection with CH and GCH
The statement ◊ in the Zermelo-Fraenkel set theory (ZFC) can neither be proven nor refuted.
It is easy to show that ◊ implies the continuum hypothesis CH. More generally, the equation follows . From CH can ◊ not conclude, but from with one can close. So it follows from the generalized continuum hypothesis GCH for all with uncountable cofinality .
Applications
◊ implies that the Suslin hypothesis is false; in other words: that there is a Suslin straight line, i.e. a non-separable linear order in which every family of disjoint intervals is at most countable.