Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

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

Prove that $\{0, 1\}^\mathbb{N}$ (the product of countably many copies of the two-point set) is uncountable.

share|cite|improve this question
....$\,2^{\aleph_0}\,$ ...? – DonAntonio Feb 5 '13 at 20:12
Binary numbers? – copper.hat Feb 5 '13 at 20:14
@Michael: If you're correcting the braces, why did you leave the ones after the \mathbb? It works perfectly well without any braces: $\{0,1\}^\mathbb N$. – Asaf Karagila Feb 5 '13 at 20:43

Hint: Show that $\{0,1\}^A$ is the same thing as $\mathcal P(A)$; and use Cantor's theorem to show that $|A|<|\mathcal P(A)|$. Deduce the wanted conclusion.

share|cite|improve this answer

Hint: Cantor's Diagonal argument.

share|cite|improve this answer

$$\left|\{0, 1\}^\mathbb{N}\right| = \left|\{0, 1\}\right|^{|\mathbb{N}|} = 2^{\aleph_0} = \left|\mathbb{R}\right|$$

share|cite|improve this answer
See also Cantor's Diagonal Argument if you haven't yet encountered it. – amWhy Feb 5 '13 at 20:24
Do any of these answers make sense, Cornelius? – amWhy Feb 5 '13 at 22:02

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.