Cardinal function

In mathematics, a cardinal function (or cardinal invariant) is a function that returns cardinal numbers.

Cardinal functions in set theory

add(I)=min⁔{|š’œ|:š’œāŠ†Iāˆ§ā‹ƒš’œāˆ‰I}.
The "additivity" of I is the smallest number of sets from I whose union is not in I any more. As any ideal is closed under finite unions, this number is always at least ℵ0; if I is a σ-ideal, then add⁔(I)≄ℵ1.
cov⁔(I)=min⁔{|š’œ|:š’œāŠ†Iāˆ§ā‹ƒš’œ=X}.
The "covering number" of I is the smallest number of sets from I whose union is all of X. As X itself is not in I, we must have add(Iā€Š) ≤ cov(Iā€Š).
non⁔(I)=min⁔{|A|:AāŠ†X ∧ Aāˆ‰I},
The "uniformity number" of I (sometimes also written unif(I)) is the size of the smallest set not in I. Assuming I contains all singletons, add(Iā€Š) ≤ non(Iā€Š).
cof(I)=min⁔{|ℬ|:ā„¬āŠ†Iāˆ§āˆ€A∈I(∃Bāˆˆā„¬)(AāŠ†B)}.
The "cofinality" of I is the cofinality of the partial order (I, āŠ†). It is easy to see that we must have non(Iā€Š) ≤ cof(Iā€Š) and cov(Iā€Š) ≤ cof(Iā€Š).
In the case that I is an ideal closely related to the structure of the reals, such as the ideal of Lebesgue null sets or the ideal of meagre sets, these cardinal invariants are referred to as cardinal characteristics of the continuum.
š”Ÿ(ā„™)=min⁔{|Y|:YāŠ†ā„™Ā āˆ§Ā (āˆ€xāˆˆā„™)(∃y∈Y)(yāŠ‘̸x)},
š””(ā„™)=min⁔{|Y|:YāŠ†ā„™Ā āˆ§Ā (āˆ€xāˆˆā„™)(∃y∈Y)(xāŠ‘y)}.

Cardinal functions in topology

Cardinal functions are widely used in topology as a tool for describing various topological properties. Below are some examples. (Note: some authors, arguing that "there are no finite cardinal numbers in general topology", prefer to define the cardinal functions listed below so that they never taken on finite cardinal numbers as values; this requires modifying some of the definitions given below, for example by adding "+ℵ0" to the right-hand side of the definitions, etc.)

c⁔(X)=sup⁔{|š’°|:š’°Ā is a family of mutually disjoint non-empty open subsets ofĀ X}.
  • The hereditary cellularity (sometimes called spread) is the least upper bound of cellularities of its subsets: s(X)=hc(X)=sup⁔{c(Y):YāŠ†X} or s(X)=sup⁔{|Y|:YāŠ†XĀ with the subspace topology is discrete} where "discrete" means that it is a discrete topological space.

Basic inequalities

c(X)≤d(X)≤w(X)≤o(X)≤2|X| e(X)≤s(X) χ(X)≤w(X) nw⁔(X)≤w(X)Ā andĀ o(X)≤2nw⁔(X)

Cardinal functions in Boolean algebras

Cardinal functions are often used in the study of Boolean algebras. We can mention, for example, the following functions:

length(š”¹)=sup⁔{|A|:AāŠ†š”¹Ā is a chain}
depth(š”¹)=sup⁔{|A|:AāŠ†š”¹Ā is a well-ordered subset}.
Inc(š”¹)=sup⁔{|A|:AāŠ†š”¹Ā such thatĀ āˆ€a,b∈A(a≠b ⇒¬(a≤b ∨ b≤a))}.
Ļ€(š”¹)=min⁔{|A|:AāŠ†š”¹āˆ–{0}Ā such thatĀ āˆ€b∈Bāˆ–{0}(∃a∈A)(a≤b)}.

Cardinal functions in algebra

Examples of cardinal functions in algebra are:

See also