# How much is ${\aleph_0}^{\aleph _ 0}$? [duplicate]

How much is ${\aleph_0}^{\aleph _ 0}$?

On the left I can find ${2}^{\aleph_0}\le {\aleph_0}^{\aleph _ 0}$ but on the right I can not found someone that is $\le$.

In general, how do I use Cantor-Bernstein to find equalities of cardinalities.

-

## marked as duplicate by Najib Idrissi, Asaf Karagila, Lost1, Sami Ben Romdhane, T. Bongers Feb 18 '14 at 18:50

Do you mean $|\aleph_0^{\aleph_0}|$? – Dustan Levenstein Feb 18 '14 at 17:01
An idea to prove they are both equipotent to $[0,1]$: for the LHS one, use binary digits decomposition, for the RHS, use decomposition in continued fractions. There are some tricks not to forget, but it should work. – Jean-Claude Arbaut Feb 18 '14 at 17:11
Weekly edition of What is $\aleph_0$ powered to $\aleph_0$? – Najib Idrissi Feb 18 '14 at 17:40

Cantor-Bernstein says that $\lambda\le \mu$ and $\mu\le \lambda$ (which is the same as $\lambda\ge \mu$) imply $\lambda=\mu$ for cardinals $\lambda,\mu$. So the strategy for proving equalities of cardinals is always to find an upper and a lower bound for them.
$$2^{\aleph_0}\le \aleph_0^{\aleph_0} \le \left(2^{\aleph_0}\right)^{\aleph_0} = 2^{\aleph_0\cdot \aleph_0} = 2^{\aleph_0}$$
Therefore Cantor-Bernstein implies $\aleph_0^{\aleph_0}=2^{\aleph_0}$.