The function $f:\mathbb{R} \to \mathbb{R}$ is such that $f(x+y) \geq f(x) + yf(f(x))$ for all $x,y \in \mathbb{R}$. Prove that: a) $f(f(x)) \leq 0$ for all $x \in \mathbb{R}$; b) if $f(0) \geq 0$, then $f(x) = 0$ for all $x\in \mathbb{R}$
Problem
Source: Bulgaria EGMO TST 2015 Day 1 Problem 3 (out of 3)
Tags: Functional inequality, substitutions, limit, function, inequalities
04.02.2023 13:42
05.02.2023 22:36
Additionally, for RMM 2018 TST the following problem was given: if $f$ satisfies the given inequality and is continous, then $f(x) \leq 0$ for all $x\geq -1$. One firstly has to think of and prove part a) of the EGMO TST problem and then do as follows: $f(x+y) \geq f(x) + yf(f(x)) \geq f(x)$ for all $y<0$, so $f$ is decreasing and $\lim_{t\to \infty} f(t) = \infty$. Hence by the definition of a limit there is a real number bigger than all $t$ with $f(t) > 0$ - let $a$ be the smallest such. With $x<a$ and $y=f(x) - x$ we get $f(f(x))(1+x-f(x)) \geq f(x) > 0$ and so $f(x) > x+1$. Taking $x\to a$ and using the continuity of $f$ yields $a\leq -1$, as desired.