Cardinal characteristic of the continuum explained
In the mathematical discipline of set theory, a cardinal characteristic of the continuum is an infinite cardinal number that may consistently lie strictly between
(the
cardinality of the set of
natural numbers), and the
cardinality of the continuum, that is, the cardinality of the set
of all
real numbers. The latter cardinal is denoted
or
. A variety of such cardinal characteristics arise naturally, and much work has been done in determining what relations between them are
provable, and constructing models of set theory for various
consistent configurations of them.
Background
Cantor's diagonal argument shows that
is strictly greater than
, but it does not specify whether it is the
least cardinal greater than
(that is,
). Indeed the assumption that
is the well-known
Continuum Hypothesis, which was shown to be consistent with the standard
ZFC axioms for set theory by
Kurt Gödel and to be independent of it by
Paul Cohen. If the Continuum Hypothesis fails and so
is at least
, natural questions arise about the cardinals strictly between
and
, for example regarding Lebesgue measurability. By considering the least cardinal with some property, one may get a definition for an uncountable cardinal that is consistently less than
. Generally one only considers definitions for cardinals that are provably greater than
and at most
as cardinal characteristics of the continuum, so if the Continuum Hypothesis holds they are all equal to
.
Examples
As is standard in set theory, we denote by
the least infinite
ordinal, which has cardinality
; it may be identified with the set of natural numbers.
A number of cardinal characteristics naturally arise as cardinal invariants for ideals which are closely connected with the structure of the reals, such as the ideal of Lebesgue null sets and the ideal of meagre sets.
non(N)
The cardinal characteristic
is the least cardinality of a
non-measurable set; equivalently, it is the least cardinality of a set that is not a Lebesgue null set.
Bounding number and dominating number
We denote by
the set of functions from
to
. For any two functions
and
we denote by
the statement that for all but finitely many
. The
bounding number
is the least cardinality of an unbounded set in this relation, that is,
akb=min(\{|F|:F\subseteq\omega\omega\land\forallf:\omega\to\omega\existsg\inF(g\nleq*f)\}).
The dominating number
is the least cardinality of a set of functions from
to
such that every such function is dominated by (that is,
) a member of that set, that is,
akd=min(\{|F|:F\subseteq\omega\omega\land\forallf:\omega\to\omega\existsg\inF(f\leq*g)\}).
Clearly any such dominating set
is unbounded, so
is at most
, and a diagonalisation argument shows that
. Of course if
this implies that
, but Hechler
[1] has shown that it is also consistent to have
strictly less than
Splitting number and reaping number
We denote by
the set of all infinite subsets of
. For any
, we say that
splits
if both
and
are infinite. The
splitting number
is the least cardinality of a subset
of
such that for all
, there is some
such that
splits
. That is,
aks=min(\{|S|:S\subseteq[\omega]\omega\land\forallb\in[\omega]\omega\existsa\inS(|b\capa|=\aleph0\land|b\setminusa|=\aleph0)\}).
The reaping number
is the least cardinality of a subset
of
such that no element
of
splits every element of
. That is,
akr=min(\{|R|:R\subseteq[\omega]\omega\land\foralla\in[\omega]\omega\existsb\inR(|b\capa|<\aleph0\lor|b\setminusa|<\aleph0)\}).
Ultrafilter number
The ultrafilter number
is defined to be the least cardinality of a filter base of a non-principal
ultrafilter on
. Kunen
[2] gave a model of set theoryin which
but
and using a countable support iteration of Sacks forcings, Baumgartner and Laver
[3] constructed a model in which
and
.
Almost disjointness number
Two subsets
and
of
are said to be
almost disjoint if
is finite, and a
family of subsets of
is said to be almost disjoint if its members are pairwise almost disjoint. A
maximal almost disjoint ("
mad") family of subsets of
is thus an almost disjoint family
such that for every subset
of
not in
, there is a set
such that
and
are not almost disjoint(that is, their
intersection is infinite). The almost disjointness number
is the least cardinality of an infinite maximal almost disjoint family.A basic result
[4] is that
- Shelah[5] showed that it is consistent to have the strict inequality
.
Cichoń's diagram
A well-known diagram of cardinal characteristics is Cichoń's diagram, showing all pairwise relations provable in ZFC between 10 cardinal characteristics.
Further reading
- Tomek Bartoszyński and Haim Judah. Set Theory On the Structure of the Real Line. A K Peters, 1995.
- Book: Vaughan, Jerry E. . Chapter 11: Small uncountable cardinals and topology . van Mill . Jan . Reed . George M. . Open Problems in Topology . 196–218 . 1990 . . Amsterdam . 0-444-88768-7 . https://archive.org/details/openproblemsinto0000unse/page/196 . PDF . December 5, 2011 .
- Book: Blass, Andreas . Andreas Blass
. Andreas Blass . Chapter 6 : Combinatorial Cardinal Characteristics of the Continuum . Foreman . Matthew . Matthew Foreman . Kanamori . Akihiro . Akihiro Kanamori . Handbook of Set Theory . 1 . 395–490 . January 12, 2010 . . 978-1-4020-4843-2 . December 5, 2011.
- Book: Bartoszyński, Tomek . Tomek Bartoszyński
. Tomek Bartoszyński . Chapter 7 : Invariants of Measure and Category . Foreman . Matthew . Kanamori . Akihiro . Handbook of Set Theory . 1 . 491–556 . January 12, 2010 . Springer . 978-1-4020-4843-2 . math.LO/9910015.
- Book: Jech . Thomas . Thomas Jech . Set Theory . Third Millennium . . Berlin, New York . Springer Monographs in Mathematics . 978-3-540-44085-7 . 2003 . 1007.03002 .
- Book: Halbeisen, Lorenz J. . Combinatorial Set Theory: With a Gentle Introduction to Forcing . Springer-Verlag. London . 2012 . Springer Monographs in Mathematics . Springer Monographs in Mathematics . 978-1-4471-2172-5 . 10.1007/978-1-4471-2173-2.
Notes and References
- Stephen Hechler. On the existence of certain cofinal subsets of
. In T. Jech (ed), Axiomatic Set Theory, Part II. Volume 13(2) of Proc. Symp. Pure Math., pp 155–173. American Mathematical Society, 1974
- [Kenneth Kunen]
- [James Earl Baumgartner]
- [Eric van Douwen]
- [Saharon Shelah]