Concerns about the equivalence of R and 2^N

53 Views Asked by At

enter image description here

In the prove of Theorem 2.35, I don’t understand why it have to construct a F and a G. Why couldn’t we prove R is equivalent to 2^N by simply doing binary expansion? Also I don’t really quite understand why F and G is equivalent