1

I am considering the function $$ f(x)=\begin{cases}x\log x, & x>0\\ 0, & x=0\end{cases} $$ on an interval $[0,\varepsilon]$ for small $\varepsilon>0$.

I would like to argue that for $x,y\in [0,\varepsilon]$ with $0<a<b$ one has $$ \lvert f(a)-f(b)\rvert\leq\lvert f(b-a)\rvert. $$

I think, in order to show this, one could use that near $x=0$ the function is convex and $f(0)=0$.

This immediately implies superadditivity, that is, $$ f(a+b)\geq f(a)+f(b). $$

Can one use this to prove the desired statement?

I do not see it.

Martin R
  • 113,040
John_Doe
  • 529

1 Answers1

1

Your idea works. $f$ is convex with $f(0) = 0$ and therefore superadditive. $f$ is decreasing on $[0, 1/e]$, so that for $0 \le a < b \le 1/e$ $$ |f(a) - f(b)| = f(a) - f(b) = f(a) - f(a+b-a) \\ \le f(a) - (f(a) + f(b-a)) = -f(b-a) = |f(b-a)|\, . $$

Martin R
  • 113,040