Sunday, February 18, 2018

real analysis - Bijection from mathbbR to mathbbRN



How does one create an explicit bijection from the reals to the set of all sequences of reals? I know how to make a bijection from R to R×R.



I have an idea but I am not sure if it will work. I will post it as my own answer because I don't want to anchor your answers and I want to see what other possible ways of doing this are.


Answer




The nicest trick in the book is to find a bijection between R and NN, in this case we are practically done. Why?



(NN)NNN×NNN



And the bijections above are easy to calculate (I will leave those to you, the first bijection is a simple Currying, and for the second you can use Cantor's pairing function).



So if we can find a nice bijection between the real numbers the infinite sequences of natural numbers we are about done. Now, we know that NN can be identified with the real numbers, in fact continued fractions form a bijection between the irrationals and NN.



We first need to handle the rational numbers, but that much is not very difficult. Take an enumeration of the rationals (e.g. Calkin-Wilf tree) in (0,1), suppose qi is the i-th rational in the enumeration; now we take a sequence of irrationals, e.g. rn=1n2+1, and we define the following function:




h(x)={r2nn:x=rnr2n+1n:x=qnxotherwise



Now we can finally describe a list of bijections which, when composed, give us a bijection between R and RN.




  1. RN(0,1)N by any bijection of this sort.

  2. (0,1)N((0,1)Q)N by the encoding given by h.

  3. ((0,1)Q)N(NN)N by continued fractions.

  4. (NN)NNN×N by Currying.

  5. NN×NNN by a pairing function.


  6. NN(0,1)Q by decoding the continued fractions.

  7. (0,1)Q(0,1) by the decoding of h, i.e. h1.

  8. (0,1)R by any bijection of this sort, e.g. the inverse of the bijection used for the first step.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...