Proof of Density: D = dyadic rationals set is dense on [0,1] | Homework Help

  • Thread starter Thread starter aortizmena
  • Start date Start date
  • Tags Tags
    Analysis Proof
aortizmena
Messages
7
Reaction score
0

Homework Statement


Prove that D={\frac{m}{2^{n}} : n\in N , m=0,1,2,...,2^{n}} (dyatic rationals set) is dense on [0,1] , i.e. if (a,b) \subset [0,1] then (a,b) \bigcap D \neq emptyset

Homework Equations


The Attempt at a Solution


Is it wrong if I just state that because a,b\in\Re we know that there exists m,n\inN, l=\frac{m}{2^{n+1}}, u=\frac{m}{2^{n-1}} and r=\frac{m}{2^{n}} such that l \leq a \leq r \leq b \leq u?
 
Last edited:
Physics news on Phys.org
Why do you need the extremal inequalities? You should only need a \leq r \leq b. Also it seems like you are trying to say "Because a and b are real, its is obvious there are naturals m,n that allow us to conclude the result", which really is not substantial enough.

Instead, I would use the Archimedian property to argue where there exists n \in \mathbb{N} such that b-a < \frac{1}{2^n}, then you a Pigenhole Principle type argument to see why D should intersect with (a,b) .
 
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