10

Let $f(x)$ differentiable on $\left[0,1\right]$ such that $f(0) = 0$. Also, assuming that $\forall x\in \left[0,1\right]:\left|f'(x)\right| \le \left|f(x)\right|$. Prove that $f(x)\equiv 0$

What I did so far:
Using LMVT:
$$\frac{f(x)-f(0)}{x-0} = \frac{f(x)}{x} = f'(c)$$ where $c\in \left(0,x\right)$

$$\left|f('c)\right| = \left|\frac{f(x)}{x}\right|.$$

Since, $\left|x\right| \in (0,1)$

$$\left|\frac{f(x)}{x}\right| \ge \left|f(x)\right| \ge \left|f'(x)\right|$$

So, $$\left|f('c)\right| \ge \left|f'(x)\right|$$

But I'm not sure how is it helping me. What am I missing?

AnnieOK
  • 2,920

7 Answers7

4

This is similar to an older question Should $f(x) \equiv 0$?.

Consider $g(x)=\mathrm e^{-x}f(x)$. Then $g'(x)=\mathrm e^{-x}\left(f'(x)-f(x)\right)$. Consider a fixed $x\in[0,1]$. If $f(x)\geq0$ then $g(x)\geq0$ and since $\lvert f(x)\rvert>\lvert f'(x)\rvert$, we have $g'(x)\leq0$. Conversely, if $f(x)\leq0$ then $g(x)\leq0$ and $g'(x)\geq0$. So we have, for all $x\in[0,1], g(x)g'(x)\leq0$. And consequently $h(x)=\frac12g(x)^2$ is decreasing on $[0,1]$. As $h(0)=0$ and $h(x)\geq0$ we conclude that $h(x)=0$ for all $x\in[0,1]$ and thus $f(x)=0$ for all $x\in[0,1]$.

Tom-Tom
  • 6,867
  • $g(x)g'(x)=e^{-2x}\big[f(x)f'(x)-f^2(x)\big]\leq e^{-2x}\big[|f(x)f'(x)|-f^2(x)\big]=e^{-2x}|f(x)|\big(|f'(x)|-|f(x)|\big)\leq0$. – Riemann Dec 05 '22 at 14:19
4

Let $x_0 \in [0,1]$ with $f(x_0) = 0$. We will show that $f(x) = 0$ for all $x \in [x_0, x_0 + \varepsilon]$ for some $\varepsilon > 0$ (if $x_0 < 1$). This is sufficient to prove your claim because you can then consider $\gamma := \sup \{x \in [0,1] \mid f|_{[0,x]} \equiv 0\}$, show $\gamma = 1$ and deduce $f \equiv 0$.

Because $f$ is continuous and $f(x_0) = 0$, there is some $\varepsilon_1 \in (0, \frac{1}{2})$ with $|f(x)| \leq \frac{1}{2}$ for all $x \in [x_0 , x_0 + \varepsilon]$.

We will now show inductively that actually $|f(x)| \leq \left(\frac12\right)^n$ for all $x \in [x_0, x_0 + \varepsilon]$. For $n=1$ this follows by our choice of $\varepsilon$.

For the inductive step note that $|f'(x)| \leq |f(x)| \leq \left(\frac12\right)^n$ for all $x \in [x_0, x_0 + \varepsilon]$. Using the mean-value theorem, it is now easy to see that

$$|f(x)| = |f(x) - f(x_0)| = |f'(\xi)| \cdot |x - x_0| \leq \left(\frac{1}{2}\right)^n \cdot |x - x_0| \leq \left(\frac{1}{2}\right)^{n+1}$$

for $x \in [x_0, x_0 + \varepsilon]$, because $\varepsilon \leq \frac{1}{2}$.

In the limit $n\rightarrow \infty$, we get our claim.

DonAntonio
  • 211,718
  • 17
  • 136
  • 287
PhoemueX
  • 35,087
3

Assume $f$ is not identically zero on $[0,1]$. Since $f$ is continuous on $[0,1]$, there is a maximum point $b\in[0,1]$ such that $|f(b)|\geq |f(x)|$ for all $x\in [0,1]$. If possible, we will choose $b<1$. In other words, either $b<1$, or $b=1$ and $|f(x)|<|f(b)|$ for all $x\in[0,b)$. Without loss of generality, we may assume that $f(b)>0$. (Otherwise consider the function $-f(x)$.)

Use the mean value theorem on the interval $[0,b]$. This yields a point $c\in (0,b)$ such that $f'(c)={f(b)-f(0)\over b-0}={f(b)\over b}$. There are now two cases:

(i) If $b<1$ then $f'(c)={f(b)\over b}>f(b)\geq |f(c)|$, which contradicts $|f'(x)|\leq |f(c)|$.

(ii) If $b=1$ then $f'(c)=f(b)>|f(c)|$, again contradicting $|f'(x)|\leq |f(c)|$.

  • Very nice solution. Simple one, Thank you! – AnnieOK May 31 '14 at 19:10
  • Thanks! It is also possible to start with a slightly smaller interval $[0,1-\epsilon]$. Then there will only be the case $b<1$ to consider, and the result will be that $f\equiv 0$ on $[0,1-\epsilon]$. Letting $\epsilon \to 0$ and using continuity of $f$ at $x=1$ yields $f\equiv 0$ on $[0,1]$. – Per Erik Manne May 31 '14 at 19:20
2

You can use the fact that $|f'(c)| \leq |f(c)|$ and since $f$ is differentiable it is also continuoues, therefore you could get the equality $|f(x)| = |\frac{f(x)} x |$ which means $f(x)=0$

Snufsan
  • 2,125
  • 1
    Hmm.. I know that $\left|\frac{f(x)}{x}\right| = \left|f'(c)\right| \le \left|f(c)\right|$. How to get $\left|f(x)\right|$ into the picture? – AnnieOK May 31 '14 at 14:09
  • I mean, how did you reach to $\left|f(x)\right| = \left|\frac{f(x)}{x}\right|$? – AnnieOK May 31 '14 at 14:21
2

$\displaystyle \left |\frac{f(x)}x \right | \le |f(c)| \implies |f(x)| \le |f(c)| $ where $0<c<x$. This implies $\displaystyle |f(x)| \le \left| \lim_{\epsilon \to 0^+}f(\epsilon)\right| = 0$

To show that $c_n \to 0$, either there exists finitely $c \in (0, x)$ such that $f'(c) = f(x)/x$ or there and interval $(a,b)$ where $f'(c) = \mathrm{constant}$, second case, $c = \inf\{(a,b)\}$.

S L
  • 11,731
  • Here $c$ depends on $x$, so how $\epsilon$ may tend to zero with $x$ fixed? – Seirios May 31 '14 at 15:53
  • $c$ has it's own previous $c' < c$ which in turn has $c''<c'$, using above inequality ... we can get $|f(0_+)| \ge |f(c')| \ge |f(c)| \ge |f(x)|$ – S L May 31 '14 at 15:57
  • 1
    Your last inequality must be weak as you're passing to the limit. – DonAntonio May 31 '14 at 17:14
  • 1
    I did not understand your argument in that way. But it seems to only give a decreasing sequence $(c_n)$ such that $|f(x)| \leq |f(c_n)|$ for all $n \geq 1$. How do you justify that $c_n \to 0$? – Seirios May 31 '14 at 20:04
  • @Seirios seems like you found flaw in my logic ... i'll try to reply you by tomorrow evening (if I can). else i'll delete my answer. – S L May 31 '14 at 20:20
2

Solution 1: Suppose by contradiction that there exists $x_0 \in (0,1]$ such that $f(x_0) \neq 0$. Because $f$ is continuous, there exist $a<b$ such that $f$ is nonzero on $[a,b]$; without loss of generality, suppose it is positive (otherwise consider $-f$). In particular, you have

$$b-a \geq \int_a^b \frac{f'(x)}{f(x)}dx = \ln(f(b)) - \ln(f(a)).$$

Now, according to mean value theorem, there exists $c \in (a,b) \subset (0,1)$ such that

$$1 < \frac{1}{c} = \frac{\ln(f(b))- \ln(f(a))}{b-a} \leq 1,$$

a contradiction.

Solution 2: Let $x_m \in [0,1]$ be such that $|f(x_m)|= \max\limits_{x \in [0,1]} |f(x)|$. Without loss of generality, we may suppose $f(x_m) \geq 0$ (otherwise consider $-f$). By mean value theorem, for all $x<x_m$, there exists $c \in (x,x_m)$ such that

$$f(x_m) \geq |f(c)| \geq |f'(c)| = \left| \frac{f(x_m)-f(x)}{x_m-x} \right| = \frac{f(x_m)-f(x)}{x_m-x}.$$

Therefore,

$$f(x_m) \leq \frac{f(x)}{1-x-x_m} = \frac{f(x)}{x} \cdot \frac{x}{1-x-x_m}. \hspace{1cm} (1)$$

On the other hand, from Taylor's expansion

$$f(x) = \underset{=0}{\underbrace{ f(0) }} + x \underset{=0}{\underbrace{ f'(0) }} + o(x),$$

hence $\frac{f(x)}{x}=o(1)$. When $x \to 0$, $(1)$ gives $0 \leq f(x_m) \leq 0$. Consequently, $f \equiv 0$.

Seirios
  • 33,157
1

From the application of the LMVT we get $$f(x)=xf'(\theta x),\ $$ for some $\theta\in [0,1]$. So, $$|f(x)|=x|f'(\theta x)|\le x|f(\theta x)|$$ So, by repeated application of this inequality $n$ times you get $$|f(x)|\le \prod_{k=1}^n \theta_k \cdot x^nf\left(x\prod_{k=1}^n \theta_k \right)$$ Since $x,\ \theta_i,\ i=1,2,\cdots ,\ n\in [0,1]$, as $n\to \infty$ for any $x\in [0,1]$, $f(x)=0$.