In the mathematical discipline of set theory, a cardinal characteristic of the continuum is an infinite cardinal number that may consistently lie strictly between ℵ 0 (the cardinality of the set of natural numbers), and the cardinality of the continuum, that is, the cardinality of the set R of all real numbers. The latter cardinal is denoted 2 ℵ 0 or c . 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.
Cantor's diagonal argument shows that c is strictly greater than ℵ 0 , but it does not specify whether it is the least cardinal greater than ℵ 0 (that is, ℵ 1 ). Indeed the assumption that c = ℵ 1 is the well-known Continuum Hypothesis, which was shown to be independent of the standard ZFC axioms for set theory by Paul Cohen. If the Continuum Hypothesis fails and so c is at least ℵ 2 , natural questions arise about the cardinals strictly between ℵ 0 and c , 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 c . Generally one only considers definitions for cardinals that are provably greater than ℵ 0 and at most c as cardinal characteristics of the continuum, so if the Continuum Hypothesis holds they are all equal to ℵ 1 .
As is standard, we denote by ω the least infinite ordinal, which has cardinality ℵ 0 and may be identified with the set of all 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.
The cardinal characteristic non( N ) 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 b {displaystyle {mathfrak {b}}} and dominating number d {displaystyle {mathfrak {d}}}
We denote by ω ω the set of functions from ω to ω . For any two functions f : ω → ω and g : ω → ω we denote by f ≤ ∗ g the statement that for all but finitely many n ∈ ω , f ( n ) ≤ g ( n ) . The bounding number b is the least cardinality of an unbounded set in this relation, that is, b = min ( { | F | : F ⊆ ω ω ∧ ∀ f : ω → ω ∃ g ∈ F ( g ≰ ∗ f ) } ) .
The dominating number d 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, d = min ( { | F | : F ⊆ ω ω ∧ ∀ f : ω → ω ∃ g ∈ F ( f ≤ ∗ g ) } ) .
Clearly any such dominating set F is unbounded, so b is at most d , and a diagonalisation argument shows that b > ℵ 0 . Of course if c = ℵ 1 this implies that b = d = ℵ 1 , but Hechler has shown that it is also consistent to have b strictly less than d .
Splitting number s {displaystyle {mathfrak {s}}} and reaping number r {displaystyle {mathfrak {r}}}
We denote by [ ω ] ω the set of all infinite subsets of ω . For any a , b ∈ [ ω ] ω , we say that a splits b if both b ∩ a and b ∖ a are infinite. The splitting number s is the least cardinality of a subset S of [ ω ] ω such that for all b ∈ [ ω ] ω , there is some a ∈ S such that a splits b . That is, s = min ( { | S | : S ⊆ [ ω ] ω ∧ ∀ b ∈ [ ω ] ω ∃ a ∈ S ( | b ∩ a | = ℵ 0 ∧ | b ∖ a | = ℵ 0 ) } ) .
The reaping number r is the least cardinality of a subset R of [ ω ] ω such that no element a of [ ω ] ω splits every element of R . That is, r = min ( { | R | : R ⊆ [ ω ] ω ∧ ∀ a ∈ [ ω ] ω ∃ b ∈ R ( | b ∩ a | < ℵ 0 ∨ | b ∖ a | < ℵ 0 ) } ) .
The ultrafilter number u is defined to be the least cardinality of a filter base of a non-principal ultrafilter on ω . Kunen gave a model of set theory in which u = ℵ 1 but c = ℵ ℵ 1 , and using a countable support iteration of Sacks forcings, Baumgartner and Laver demonstrated a model in which u = ℵ 1 and c = ℵ 2 .
Two subsets A and B of ω are said to be almost disjoint if | A ∩ B | 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 A such that for every subset X of ω not in A , there is a set A ∈ A such that A and X are not almost disjoint (that is, their intersection is infinite). The almost disjointness number a is the least cardinality of an infinite maximal almost disjoint family. A basic result is that b ≤ a ; Shelah showed that it is consistent to have the strict inequality b < a .
A well known diagram of cardinal characteristics is Cichoń's diagram, showing all relations provable in ZFC between 10 cardinal characteristics.
