Arithmetic of Cardinal Numbers

Let ⟨Ai∣i∈I⟩ be a system of mutually disjoint sets, and let |Ai|=κi for all i∈I. We define the sum of ⟨κi∣i∈I⟩ by

∑i∈Iκi=|⨆i∈IAi|

If ⟨Ai∣i∈I⟩ and ⟨Ai′∣i∈I⟩ are systems of mutually disjoint sets such that |Ai|=|Ai′| for all i∈I, then |⨆i∈IAi|=|⨆i∈IAi′|

This lemma makes the definition of ∑i∈Iκi legitimate.

If κi≤λi for all i∈I, then ∑i∈Iκi≤∑i∈Iλ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 (i∈I) are mutually disjoint sets and J=⋃i∈IJi, and κj (j∈J) are cardinals, then

∑i∈I(∑j∈Jiκj)=∑j∈Jκj

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

Let ⟨Ai∣i∈I⟩ be a family of sets such that |Ai|=κi for all i∈I. We define the product ⟨κi∣i∈I⟩ by

∏i∈Iκi=|∏i∈IAi|

Let ⟨Ai∣i∈I⟩ and ⟨Ai′∣i∈I⟩ are such that |Ai|=|Ai′| for all i∈I, then |∏i∈IAi|=|∏i∈IAi′|

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

If Ji (i∈I) are mutually disjoint sets and J=⋃i∈IJi, and κj (j∈J) are cardinals, then

∏i∈I(∏j∈Jiκj)=∏j∈Jκj

If κi≤λi for all i∈I, then ∏i∈Iκi≤∏i∈Iλ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

∏i∈I(κiλ)=(∏i∈Iκi)λ∏i∈Iκλi=κ∑i∈Iλi
König's Theorem

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

∑i∈Iκi<∏i∈Iλi

We have that if 1<κi≤λi for all i∈I, then

∑i∈Iκi≤∏i∈Iλ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 2ℵ0 cannot be ℵω, since cf(2ℵω)=ℵ0, but the lemma doesn't prevent 2ℵ0 from being ℵω1. Similarly, 2ℵ1 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}$$