Tuesday, October 6, 2015

discrete mathematics - Prove that $mathbb{|Q| = |Qtimes Q|}$



I have this problem:




Prove that $\mathbb{|Q| = |Q\times Q|}$




I know that $\mathbb Q$ is countably infinite.




But then how can I prove that $\mathbb{|Q\times Q|}$ is countably infinite?



Thanks you!


Answer



Whatever proof you have that $\mathbb Q$ is countably infinite probably relies on a mapping between elements of $\mathbb Q$ and elements of $\mathbb {Z \times Z}$. But to say that $\mathbb Q$ is countably infinite is to put it in correspondence with $\mathbb Z$. Use this fact, then repeat the original proof.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection $f \colon A \rightarrow B$ and I want to get bijection. Can I just resting codomain to $f(A)$? I know that every function i...