1

How do you show that $\mathbb{R} \backslash \mathbb{Q} \cong \mathbb{N}^{\mathbb{N}}$? What is a good starting point in showing this?

1 Answers1

1

$|\mathbb{R}|>|\mathbb{Q}|$ $\implies$ $|\mathbb{R} \setminus\mathbb{Q}|=|\mathbb{R}|=|2^{\mathbb{N}}|=|\mathbb{N}^{\mathbb{N}}|.$

  • What's the problem? Why downvote? – Edoardo Lanari Jul 19 '13 at 13:01
  • You didn't explain any step. Also, he asked for a starting point, not a solution. – Ido Jul 19 '13 at 13:15
  • 1
    But saying less would take so much longer ... :) – Hagen von Eitzen Jul 19 '13 at 13:16
  • 1
    The amount of explanations needed strongly depends on the knowledge of the reader; if he doesn't know anything about cardinality then every answer is useless, if he knows a bunch of theorems in cardinality computation this is really clear. Moreover the problem is so easy that starting point=ending point. – Edoardo Lanari Jul 19 '13 at 13:21
  • 1
    You could at least note what theorems you use and whether they are proved with axiom of choice or not. – Ido Jul 19 '13 at 13:32
  • 2
    +1: consise answer, which still requires the questioner to think a bit. – wildildildlife Jul 19 '13 at 13:37
  • I think that each step can be done in ZF: the first is additivity plus the fact that k+l=max{k,l}, the second is surely in ZF and the third uses already mentioned facts. – Edoardo Lanari Jul 19 '13 at 14:28