Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $h:\mathbb{R}\to\mathbb{R}$ be a function that is continuous on $\mathbb{R}$ and has the property that

$$h\left(\frac{m}{2^n}\right)=0,\quad\forall m\in\mathbb{Z},n\in\mathbb{N}.$$

How can we show that this implies that $h(x)=0$, $\forall x\in\mathbb{R}$?

The way I thought about this problem is to show that the set

$$ S:=\left\{\frac{m}{2^n}:\forall m\in\mathbb{Z},n\in\mathbb{N}\right\}$$

is dense in $\mathbb{R}$. It then follows that for any $c\in\mathbb{R}$ there exists a sequence $(x_n)$ that converges to $c$ such that all the terms are of the form $p/2^q$. Thus, the sequence $(h(x_n))$ converges to $0$ and so by the sequential criterion for continuity we must have $h(c)=0$.

Is there a simpler approach? Proving that $S$ is dense in $\mathbb{R}$ seems overly complicated for this problem. Or, can we deduce it from the density of $\mathbb{Q}$ in $\mathbb{R}$?

share|improve this question
1  
Your argument is looks fine to me, and it's already a very simple argument. You do need to show that $S$ is dense in $\mathbb{R}$; it's not enough to use the fact that $\mathbb{Q}$ is dense because $S$ is a subset of $\mathbb{Q}$. (It would be enough to show that $S$ is dense in $\mathbb{Q}$, but that's not any easier.) –  Brett Frankel Dec 17 '12 at 20:35

1 Answer 1

up vote 2 down vote accepted

Proving $S$ is dense is not very hard. If you realize that increasing $n$ to very large can get you to a very small number and then multiplying by a sufficiently large number $m$ can get you close to any real number within the $\frac1{2^n}$ error margin.

A formal proof will involve using the Archimedian property of $\mathbb{R}$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.