Arithmetic of Cardinal Numbers

Subjects: Set Theory
Links: Basic Cardinal Arithmetic, Regular and Singular Cardinals

Let AiiI be a system of mutually disjoint sets, and let |Ai|=κi for all iI. We define the sum of κiiI by

iIκi=|iIAi|

If AiiI and AiiI are systems of mutually disjoint sets such that |Ai|=|Ai| for all iI, then |iIAi|=|iIAi|

This lemma makes the definition of iIκi legitimate.

If κiλi for all iI, then iIκiiIλi.

We can see that $$\left|\bigcup_{i \in I} A_i\right| \le \sum_{i \in I} |A_i|$$

If the summands are all equal, then the following holds, as the finite case: If κ=κi for all iλ, then

iλκi=κλ

Th: Let λ be an infinite ordinal, let κα (α<λ) be a nonzero cardinal numbers, and let κ=sup{καα<λ}

α<λκα=λκ=λsup{καα<λ}

If Ji (iI) are mutually disjoint sets and J=iIJi, and κj (jJ) are cardinals, then

iI(jJiκj)=jJκj

We also get the distributive law, let λ be a cardinal, and κi be a cardinal for every iI, then $$\lambda \cdot \left(\sum_{i \in I}\kappa_i\right) = \sum_{i \in I} (\lambda \cdot \kappa_i)$$

Let AiiI be a family of sets such that |Ai|=κi for all iI. We define the product κiiI by

iIκi=|iIAi|

Let AiiI and AiiI are such that |Ai|=|Ai| for all iI, then |iIAi|=|iIAi|

The infinite products have many properties of finite products of natural numbers. For instance, if at least on κi is 0, then iIκi=0.

If Ji (iI) are mutually disjoint sets and J=iIJi, and κj (jJ) are cardinals, then

iI(jJiκj)=jJκj

If κiλi for all iI, then iIκiiIλi.

If the factors are all equal, then the following holds, as the finite case: If κ=κi for all iλ, then

iλκi=κλ

The following rules, involving exponentiation, also generalize from the finite to the infinite case

iI(κiλ)=(iIκi)λiIκλi=κiIλi
König's Theorem

If κi and λi (iI) are cardinal numbers, and if κi<λi, for all iI, then

iIκi<iIλi

We have that if 1<κiλi for all iI, then

iIκiiIλi

Cardinal Exponentiation

By Cantor's Theorem, we get that 2α>α, in other words, $$\aleph_{\alpha +1} \le 2^{\aleph_\alpha}$$We can look at the Generalised Continuum Hypothesis, and we get that $$ \aleph_{\alpha +1} = 2^{\aleph_\alpha}$$Without assuming the Generalised Continuum Hypothesis, there is not much one can prove about 2α except, the first property and the trivial property $$2^{\aleph_\alpha} \le 2^{\aleph_\beta} \quad \text{whenever} \quad \alpha\le \beta$$
Lemma: For every α, $$\aleph_\alpha < \text{cf}(2^{\aleph_\alpha})$$Thus 20 cannot be ω, since cf(2ω)=0, but the lemma doesn't prevent 20 from being ω1. Similarly, 21 cannot be either ω1 or ω or ω+ω, etc.

If there's a γ<α such that γβα, then αβ=γβ

Th: Let α be a singular cardinal. Let us assume that the value of 2ξ for all ξ<α, say 2ξ=β. Then 2α=β.

Lemma: If αβ, then αβ=2β

Lemma: Let αβ, and let S be the set of all subsets Xωα such that |X|=β. Then |S|=αβ.

Th: Let us assume the Generalised Continuum Hypothesis. If α is a regular cardinal, then $$ \aleph_\alpha^{\aleph_\beta} = \begin{cases} \aleph_\alpha & \beta < \alpha\ \aleph_{\beta +1} & \beta \ge \alpha\end{cases}$$
Lemma: For every cardinal κ>1, and every α, cf(κα)>α

Th: Let us assume the Generalised Continuum Hypothesis. If α is a singular cardinal, then $$ \aleph_\alpha^{\aleph_\beta} = \begin{cases}
\aleph_\alpha & \aleph_\beta < \text{cf}(\aleph_\alpha)\
\aleph_{\alpha +1} & \text{cf}(\aleph_\alpha) \le \aleph_\beta \le \aleph_\alpha\
\aleph_{\beta+1} & \aleph_\beta \ge \aleph_\alpha
\end{cases}$$
Hausdorff's Formula:
For every α and every β $$\aleph_{\alpha+1}^{\aleph_\beta} = \aleph_\alpha^{\aleph_\beta}\cdot \aleph_{\alpha +1}$$
We get the result that for n<ω, then $$ \aleph_n ^{\aleph_\beta} = \aleph_n \cdot 2^{\aleph_\beta}$$ We can also get the result $$\prod_{n <\omega} \aleph_n = \aleph_\omega ^{\aleph_0} $$We get a small corollary from this let β>0, then $$\aleph_\omega^{\aleph_\beta} = \aleph_\omega^{\aleph_0} \cdot 2^{\aleph_\beta}$$