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

Cardinal functions in set theory

• The most frequently used cardinal function is the function that assigns to a set A its cardinality, denoted by |A|.
• Aleph numbers and beth numbers can both be seen as cardinal functions defined on ordinal numbers.
• Cardinal arithmetic operations are examples of functions from cardinal numbers (or pairs of them) to cardinal numbers.
• Cardinal characteristics of a (proper) ideal I of subsets of X are:

${\displaystyle {\rm {add}}(I)=\min\{|{\mathcal {A}}|:{\mathcal {A}}\subseteq I\wedge \bigcup {\mathcal {A}}\notin 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 ${\displaystyle \aleph _{0}}$; if I is a σ-ideal, then ${\displaystyle \operatorname {add} (I)\geq \aleph _{1}.}$

${\displaystyle \operatorname {cov} (I)=\min\{|{\mathcal {A}}|:{\mathcal {A}}\subseteq I\wedge \bigcup {\mathcal {A}}=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 ).

${\displaystyle \operatorname {non} (I)=\min\{|A|:A\subseteq X\ \wedge \ A\notin I\},}$

The "uniformity number" of I (sometimes also written ${\displaystyle {\rm {unif}}(I)}$) is the size of the smallest set not in I. Assuming I contains all singletons, add(I ) ≤ non(I ).

${\displaystyle {\rm {cof}}(I)=\min\{|{\mathcal {B}}|:{\mathcal {B}}\subseteq I\wedge \forall A\in I(\exists B\in {\mathcal {B}})(A\subseteq 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 ${\displaystyle 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.

• For a preordered set ${\displaystyle (\mathbb {P} ,\sqsubseteq )}$ the bounding number ${\displaystyle {\mathfrak {b}}(\mathbb {P} )}$ and dominating number ${\displaystyle {\mathfrak {d}}(\mathbb {P} )}$ are defined as

${\displaystyle {\mathfrak {b}}(\mathbb {P} )=\min {\big \{}|Y|:Y\subseteq \mathbb {P} \ \wedge \ (\forall x\in \mathbb {P} )(\exists y\in Y)(y\not \sqsubseteq x){\big \}},}$

${\displaystyle {\mathfrak {d}}(\mathbb {P} )=\min {\big \{}|Y|:Y\subseteq \mathbb {P} \ \wedge \ (\forall x\in \mathbb {P} )(\exists y\in Y)(x\sqsubseteq y){\big \}}.}$

• In PCF theory the cardinal function ${\displaystyle pp_{\kappa }(\lambda )}$ is used.^[1]

Cardinal functions in topology

Cardinal functions are widely used in topology as a tool for describing various topological properties.^[2][3] Below are some examples. (Note: some authors, arguing that "there are no finite cardinal numbers in general topology",^[4] 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 "${\displaystyle \;\;+\;\aleph _{0}}$" to the right-hand side of the definitions, etc.)

• Perhaps the simplest cardinal invariants of a topological space ${\displaystyle X}$ are its cardinality and the cardinality of its topology, denoted respectively by ${\displaystyle |X|}$ and ${\displaystyle o(X).}$
• The weight ${\displaystyle \operatorname {w} (X)}$ of a topological space ${\displaystyle X}$ is the cardinality of the smallest base for ${\displaystyle X.}$ When ${\displaystyle \operatorname {w} (X)=\aleph _{0}}$ the space ${\displaystyle X}$ is said to be second countable.
  • The ${\displaystyle \pi }$-weight of a space ${\displaystyle X}$ is the cardinality of the smallest ${\displaystyle \pi }$-base for ${\displaystyle X.}$ (A ${\displaystyle \pi }$-base is a set of non-empty open sets whose supersets includes all opens.)
  • The network weight ${\displaystyle \operatorname {nw} (X)}$ of ${\displaystyle X}$ is the smallest cardinality of a network for ${\displaystyle X.}$ A network is a family ${\displaystyle {\mathcal {N}}}$ of sets, for which, for all points ${\displaystyle x}$ and open neighbourhoods ${\displaystyle U}$ containing ${\displaystyle x,}$ there exists ${\displaystyle B}$ in ${\displaystyle {\mathcal {N}}}$ for which ${\displaystyle x\in B\subseteq U.}$
• The character of a topological space ${\displaystyle X}$ at a point ${\displaystyle x}$ is the cardinality of the smallest local base for ${\displaystyle x.}$ The character of space ${\displaystyle X}$ is
  $${\displaystyle \chi (X)=\sup \;\{\chi (x,X):x\in X\}.}$$

  
  When ${\displaystyle \chi (X)=\aleph _{0}}$ the space ${\displaystyle X}$ is said to be first countable.
• The density ${\displaystyle \operatorname {d} (X)}$ of a space ${\displaystyle X}$ is the cardinality of the smallest dense subset of ${\displaystyle X.}$ When ${\displaystyle {\rm {{d}(X)=\aleph _{0}}}}$ the space ${\displaystyle X}$ is said to be separable.
• The Lindelöf number ${\displaystyle \operatorname {L} (X)}$ of a space ${\displaystyle X}$ is the smallest infinite cardinality such that every open cover has a subcover of cardinality no more than ${\displaystyle \operatorname {L} (X).}$ When ${\displaystyle {\rm {{L}(X)=\aleph _{0}}}}$ the space ${\displaystyle X}$ is said to be a Lindelöf space.
• The cellularity or Suslin number of a space ${\displaystyle X}$ is

${\displaystyle \operatorname {c} (X)=\sup\{|{\mathcal {U}}|:{\mathcal {U}}{\text{ 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:
  $${\displaystyle s(X)={\rm {hc}}(X)=\sup\{{\rm {c}}(Y):Y\subseteq X\}}$$

  
  or
  $${\displaystyle s(X)=\sup\{|Y|:Y\subseteq X{\text{ with the subspace topology is discrete}}\}}$$

  
  where "discrete" means that it is a discrete topological space.

• The extent of a space ${\displaystyle X}$ is
  $${\displaystyle e(X)=\sup\{|Y|:Y\subseteq X{\text{ is closed and discrete}}\}.}$$

  
  So ${\displaystyle X}$ has countable extent exactly when it has no uncountable closed discrete subset.
• The tightness ${\displaystyle t(x,X)}$ of a topological space ${\displaystyle X}$ at a point ${\displaystyle x\in X}$ is the smallest cardinal number ${\displaystyle \alpha }$ such that, whenever ${\displaystyle x\in {\rm {cl}}_{X}(Y)}$ for some subset ${\displaystyle Y}$ of ${\displaystyle X,}$ there exists a subset ${\displaystyle Z}$ of ${\displaystyle Y}$ with ${\displaystyle |Z|\leq \alpha ,}$ such that ${\displaystyle x\in \operatorname {cl} _{X}(Z).}$ Symbolically,
  $${\displaystyle t(x,X)=\sup \left\{\min\{|Z|:Z\subseteq Y\ \wedge \ x\in {\rm {cl}}_{X}(Z)\}:Y\subseteq X\ \wedge \ x\in {\rm {cl}}_{X}(Y)\right\}.}$$

  
  The tightness of a space ${\displaystyle X}$ is
  $${\displaystyle t(X)=\sup\{t(x,X):x\in X\}.}$$

  
  When ${\displaystyle t(X)=\aleph _{0}}$ the space ${\displaystyle X}$ is said to be countably generated or countably tight.
  • The augmented tightness of a space ${\displaystyle X,}$ ${\displaystyle t^{+}(X)}$ is the smallest regular cardinal ${\displaystyle \alpha }$ such that for any ${\displaystyle Y\subseteq X,}$ ${\displaystyle x\in {\rm {cl}}_{X}(Y)}$ there is a subset ${\displaystyle Z}$ of ${\displaystyle Y}$ with cardinality less than ${\displaystyle \alpha ,}$ such that ${\displaystyle x\in {\rm {cl}}_{X}(Z).}$

Basic inequalities

$${\displaystyle c(X)\leq d(X)\leq w(X)\leq o(X)\leq 2^{|X|}}$$

$${\displaystyle e(X)\leq s(X)}$$

$${\displaystyle \chi (X)\leq w(X)}$$

$${\displaystyle \operatorname {nw} (X)\leq w(X){\text{ and }}o(X)\leq 2^{\operatorname {nw} (X)}}$$

Cardinal functions in Boolean algebras

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

• Cellularity ${\displaystyle c(\mathbb {B} )}$ of a Boolean algebra ${\displaystyle \mathbb {B} }$ is the supremum of the cardinalities of antichains in ${\displaystyle \mathbb {B} }$.
• Length ${\displaystyle {\rm {length}}(\mathbb {B} )}$ of a Boolean algebra ${\displaystyle \mathbb {B} }$ is

${\displaystyle {\rm {length}}(\mathbb {B} )=\sup {\big \{}|A|:A\subseteq \mathbb {B} {\text{ is a chain}}{\big \}}}$

• Depth ${\displaystyle {\rm {depth}}(\mathbb {B} )}$ of a Boolean algebra ${\displaystyle \mathbb {B} }$ is

${\displaystyle {\rm {depth}}(\mathbb {B} )=\sup {\big \{}|A|:A\subseteq \mathbb {B} {\text{ is a well-ordered subset}}{\big \}}}$.

• Incomparability ${\displaystyle {\rm {Inc}}(\mathbb {B} )}$ of a Boolean algebra ${\displaystyle \mathbb {B} }$ is

${\displaystyle {\rm {Inc}}({\mathbb {B} })=\sup {\big \{}|A|:A\subseteq \mathbb {B} {\text{ such that }}\forall a,b\in A{\big (}a\neq b\ \Rightarrow \neg (a\leq b\ \vee \ b\leq a){\big )}{\big \}}}$.

• Pseudo-weight ${\displaystyle \pi (\mathbb {B} )}$ of a Boolean algebra ${\displaystyle \mathbb {B} }$ is

${\displaystyle \pi (\mathbb {B} )=\min {\big \{}|A|:A\subseteq \mathbb {B} \setminus \{0\}{\text{ such that }}\forall b\in B\setminus \{0\}{\big (}\exists a\in A{\big )}{\big (}a\leq b{\big )}{\big \}}.}$

Cardinal functions in algebra

Examples of cardinal functions in algebra are:

• Index of a subgroup H of G is the number of cosets.
• Dimension of a vector space V over a field K is the cardinality of any Hamel basis of V.
• More generally, for a free module M over a ring R we define rank ${\displaystyle {\rm {rank}}(M)}$ as the cardinality of any basis of this module.
• For a linear subspace W of a vector space V we define codimension of W (with respect to V).
• For any algebraic structure it is possible to consider the minimal cardinality of generators of the structure.
• For algebraic field extensions, algebraic degree and separable degree are often employed (note that the algebraic degree equals the dimension of the extension as a vector space over the smaller field).
• For non-algebraic field extensions, transcendence degree is likewise used.

External links

• A Glossary of Definitions from General Topology

See also

• Cichoń's diagram

References

• Jech, Thomas (2003). Set Theory. Springer Monographs in Mathematics (Third Millennium ed.). Berlin, New York: Springer-Verlag. ISBN 978-3-540-44085-7. Zbl 1007.03002.