Math Proof: Uncountable binary sequence and a bijection from R to R-{0}

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
11 replies · 4K views
iceblits
Messages
111
Reaction score
0

Homework Statement


Question 1:
Prove that the cardinality of R (the set of all real numbers)is the same as the cardinality of R-{0} by constructing a bijective function from R to R-{0}

Question 2: Let A be the infinite sequence of binary numbers as follows:
A={(a1,a2,a3...)|ai= 0or 1 for all i in the natural numbers}

Show that A is uncountable


Homework Equations





The Attempt at a Solution



For question 2 I think I have to use a proof similar to Cantor's diagonalization argument for proving that the set of real numbers is uncountable. I think I have to use contradiction and assume that the set is countable.
 
Physics news on Phys.org
I think Imay have misunderstood the second part. Isnt f(x) still f(x)=x?
 
so {(x| x =/= 1,2,3,4...)} ?
 
gahh I am so sorry I don't understand..am I looking for a function that hits all numbers except for 0,1,2,3...?
 
iceblits said:
gahh I am so sorry I don't understand..am I looking for a function that hits all numbers except for 0,1,2,3...?

No, that's not what I stated. I just said you had to define f(x)=x for [itex]x\notin\{0,1,2,3,...\}[/itex]. You still need to define f(0), f(1), f(2), ...

But you have to end up with a bijection [itex]f:\mathbb{R}\rightarrow \mathbb{R}\setminus \{0\}[/itex].
 
so how about f(x)={x+1 for the natural numbers and x otherwise) would that make it so that x is not in the natural numbers but f(x) exists for the natural numbers?
 
yay...i can't believe it took me that long to understand what you were trying to say..its obvious now though :)
 
Just wondering if under that function, the preimage of 1.