Let be a system of mutually disjoint sets, and let for all . We define the sum of by
If and are systems of mutually disjoint sets such that for all , then
This lemma makes the definition of legitimate.
If for all , then .
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 for all , then
Th: Let be an infinite ordinal, let be a nonzero cardinal numbers, and let
If are mutually disjoint sets and , and are cardinals, then
We also get the distributive law, let be a cardinal, and be a cardinal for every , then $$\lambda \cdot \left(\sum_{i \in I}\kappa_i\right) = \sum_{i \in I} (\lambda \cdot \kappa_i)$$
Let be a family of sets such that for all . We define the product by
Let and are such that for all , then
The infinite products have many properties of finite products of natural numbers. For instance, if at least on is , then .
If are mutually disjoint sets and , and are cardinals, then
If for all , then .
If the factors are all equal, then the following holds, as the finite case: If for all , then
The following rules, involving exponentiation, also generalize from the finite to the infinite case
König's Theorem
If and are cardinal numbers, and if , for all , then
We have that if for all , then
Cardinal Exponentiation
By Cantor's Theorem, we get that , 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 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 cannot be , since , but the lemma doesn't prevent from being . Similarly, cannot be either or or , etc.
If there's a such that , then
Th: Let be a singular cardinal. Let us assume that the value of for all , say . Then .
Lemma: If , then
Lemma: Let , and let be the set of all subsets such that . Then .
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 , and every ,
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 , 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 , then $$\aleph_\omega^{\aleph_\beta} = \aleph_\omega^{\aleph_0} \cdot 2^{\aleph_\beta}$$