Cardinality of sets: prove equality

  • Thread starter Thread starter Dustinsfl
  • Start date Start date
  • Tags Tags
    Cardinality Sets
Dustinsfl
Messages
2,217
Reaction score
5
A=\mathbb{R}-0

(0,1)\subseteq \mathbb{R}-0

Assume A is countable.

Since A is countable, then A\sim\mathbb{N}.
Which follows that (0,1)\sim\mathbb{N}.

However, (0,1) is uncountable so by contradiction, Card(A)=c

Correct?
 
Physics news on Phys.org


The fact that A is not countable, together with the fact it is a subset of R only proves that
\aleph_0 < \mathop{Card}(A) \leq c​
 


So it looks like you will have to use the Continuum Hypothesis!
 


Or find a better lower bound. :wink:
 


Think about the function that maps n\mapsto n+1 for n\in \mathbb{N} where \mathbb{N} is regarded as a subset of \mathbb{R}.
 


Thanks for the help
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top