Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The question contains 2 stages:

  1. Prove that ${\aleph_n} ^ {\aleph_1} = {2}^{\aleph_1}\cdot\aleph_n$

This one is pretty clear by induction and by applying Hausdorff's formula.

  1. Prove ${\aleph_\omega} ^ {\aleph_1} = {2}^{\aleph_1}\cdot{\aleph_\omega}^{\aleph_0}$

Is there an easy proof for the second one?

Thanks in advance.

share|cite|improve this question
up vote 7 down vote accepted

As you mention, the first equation is a consequence of Hausdorff's formula and induction.

For the second: Clearly the right hand side is at most the left hand side. Now: Either $2^{\aleph_1}\ge\aleph_\omega$, in which case in fact $2^{\aleph_1}\ge{\aleph_\omega}^{\aleph_1}$, and we are done, or $2^{\aleph_1}<\aleph_\omega$.

I claim that in this case we have ${\aleph_\omega}^{\aleph_1}={\aleph_\omega}^{\aleph_0}$. Once we prove this, we are done.

Note that $\aleph_\omega={\rm sup}_n\aleph_n\le\prod_n\aleph_n$, so $$ {\aleph_\omega}^{\aleph_1}\le\left(\prod_n\aleph_n\right)^{\aleph_1}=\prod_n{\aleph_n}^{\aleph_1}. $$

Now use part 1, to conclude that ${\aleph_n}^{\aleph_1}<\aleph_\omega$ for all $n$, since we are assuming that $2^{\aleph_1}<\aleph_\omega$. This shows that the last product is at most $\prod_n \aleph_\omega={\aleph_\omega}^{\aleph_0}$.

This shows that ${\aleph_\omega}^{\aleph_1}\le {\aleph_\omega}^{\aleph_0}$. But the other inequality is obvious, and we are done.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.