Maths Olympiad Prep

Track / Stage 8 / 107 of 180 #1807 of 1964

Problem 1807

IMO Shortlist mid-range; USAMO P2/P5
Algebra Difficulty 8.3 Prove it

Let f:R→Rf : \mathbb R \to \mathbb R be a real-valued function defined on the set of real numbers that satisfies
f(x+y)≤yf(x)+f(f(x))f(x + y) \leq yf(x) + f(f(x))
for all real numbers xx and yy. Prove that f(x)=0f(x) = 0 for all x≤0x \leq 0.

Proposed by Igor Voronovich, Belarus

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

1. Let P(x,y) P(x, y) denote the given assertion:
P(x,y):f(x+y)≤yf(x)+f(f(x)) P(x, y) : f(x + y) \leq y f(x) + f(f(x))
for all real numbers x x and y y .

2. First, consider P(x,0) P(x, 0) :
P(x,0):f(x+0)≤0⋅f(x)+f(f(x))  ⟹  f(x)≤f(f(x)) P(x, 0) : f(x + 0) \leq 0 \cdot f(x) + f(f(x)) \implies f(x) \leq f(f(x))
This implies:
f(f(x))≥f(x) f(f(x)) \geq f(x)
Call this result (1).

3. Next, consider P(x,f(x)−x) P(x, f(x) - x) :
P(x,f(x)−x):f(x+(f(x)−x))≤(f(x)−x)f(x)+f(f(x))  ⟹  f(f(x))≤(f(x)−x)f(x)+f(f(x)) P(x, f(x) - x) : f(x + (f(x) - x)) \leq (f(x) - x) f(x) + f(f(x)) \implies f(f(x)) \leq (f(x) - x) f(x) + f(f(x))
Simplifying, we get:
0≤(f(x)−x)f(x) 0 \leq (f(x) - x) f(x)
This implies:
f(x)(f(x)−x)≥0 f(x) (f(x) - x) \geq 0
Call this result (2).

4. Claim: f(x)≤0 f(x) \leq 0 for all x∈R x \in \mathbb{R} .

Proof:
- For an arbitrary real z z , consider P(x,f(z)−x) P(x, f(z) - x) :
P(x,f(z)−x):f(x+(f(z)−x))≤(f(z)−x)f(x)+f(f(x))  ⟹  f(f(z))≤(f(z)−x)f(x)+f(f(x)) P(x, f(z) - x) : f(x + (f(z) - x)) \leq (f(z) - x) f(x) + f(f(x)) \implies f(f(z)) \leq (f(z) - x) f(x) + f(f(x))
Interchanging variables x x and z z and adding the inequalities, we get:
f(f(z))+f(f(x))≤(f(z)−x)f(x)+f(f(x))+(f(x)−z)f(z)+f(f(z)) f(f(z)) + f(f(x)) \leq (f(z) - x) f(x) + f(f(x)) + (f(x) - z) f(z) + f(f(z))
Simplifying, we get:
2f(f(z))≤f(z)f(x)−xf(x)+f(x)f(z)−zf(z) 2 f(f(z)) \leq f(z) f(x) - x f(x) + f(x) f(z) - z f(z)
2f(f(z))≤2f(z)f(x)−xf(x)−zf(z) 2 f(f(z)) \leq 2 f(z) f(x) - x f(x) - z f(z)
2f(z)f(x)≥xf(x)+zf(z) 2 f(z) f(x) \geq x f(x) + z f(z)
Call this result (3).

- Suppose there exists a real number t0≥0 t_0 \geq 0 for which f(t0)>0 f(t_0) > 0 . Consider P(t0,y) P(t_0, y) :
P(t0,y):f(y+t0)≤yf(t0)+f(f(t0)) P(t_0, y) : f(y + t_0) \leq y f(t_0) + f(f(t_0))
Letting y→−∞ y \to -\infty , we get:
lim⁡y→−∞f(y+t0)=−∞ \lim_{y \to -\infty} f(y + t_0) = -\infty
This implies f(x)→−∞ f(x) \to -\infty as x→−∞ x \to -\infty .

- Putting z=t0 z = t_0 and letting x→−∞ x \to -\infty in (3), we get:
0>2f(x)f(t0)≥xf(x)+t0f(t0)≥0 0 > 2 f(x) f(t_0) \geq x f(x) + t_0 f(t_0) \geq 0
This is a contradiction.

- Now assume t1,t2<0 t_1, t_2 < 0 are reals for which f(ti)>0 f(t_i) > 0 for i∈{1,2} i \in \{1, 2\} . Without loss of generality, let t1<t2 t_1 < t_2 . Consider P(t2,t1−t2) P(t_2, t_1 - t_2) :
P(t2,t1−t2):f(t1)≤(t1−t2)f(t2)+f(f(t2)) P(t_2, t_1 - t_2) : f(t_1) \leq (t_1 - t_2) f(t_2) + f(f(t_2))
Since t1−t2<0 t_1 - t_2 < 0 and f(t2)>0 f(t_2) > 0 , we get:
f(t1)≤0+0=0 f(t_1) \leq 0 + 0 = 0
This is a contradiction.

- Finally, if f(x)>0 f(x) > 0 holds for only one point x=t3 x = t_3 , then f(t3)>0>t3 f(t_3) > 0 > t_3 . From (1) and the previous paragraph, we get:
0≥f(f(t3))≥f(t3)>0 0 \geq f(f(t_3)) \geq f(t_3) > 0
This is a contradiction.

Hence, the claim must hold: f(x)≤0 f(x) \leq 0 for all x∈R x \in \mathbb{R} .

5. Using (2), we get x→f(t) x \to f(t) implies:
f(f(t))(f(f(t))−f(t))≥0 f(f(t)) (f(f(t)) - f(t)) \geq 0
Since f(f(t))≥f(t) f(f(t)) \geq f(t) by (1), we see that f(f(t))≠0  ⟹  f(f(t))=f(t) f(f(t)) \neq 0 \implies f(f(t)) = f(t) .

6. Define:
S:={x∈R:f(f(x))≠0} \mathcal{S} := \{ x \in \mathbb{R} : f(f(x)) \neq 0 \}
For any x,z∈S x, z \in \mathcal{S} , replacing (x,z)→(f(x),f(z)) (x, z) \to (f(x), f(z)) in (3), we get:
2f(x)f(t)=2f(f(x))f(f(t))≥f(x)f(f(x))+f(z)f(f(z))=f(x)2+f(z)2 2 f(x) f(t) = 2 f(f(x)) f(f(t)) \geq f(x) f(f(x)) + f(z) f(f(z)) = f(x)^2 + f(z)^2
This implies:
(f(x)−f(z))2≤0 (f(x) - f(z))^2 \leq 0
So:
f(x)=f(z) f(x) = f(z)

7. We are left with showing rather straightforward details to complete our proof. Note that f≢0 f \not\equiv 0 since otherwise, there is nothing to see.

Case 1: R≠S \mathbb{R} \neq \mathcal{S} .

- Note that there exists z0 z_0 such that f(f(z0))=0 f(f(z_0)) = 0 . Put z=f(z0) z = f(z_0) in (3) to get:
0=2f(f(z0))f(x)≥f(z0)f(f(z0))+xf(x)=xf(x) 0 = 2 f(f(z_0)) f(x) \geq f(z_0) f(f(z_0)) + x f(x) = x f(x)
So for all x<0 x < 0 , we must have f(x)=0 f(x) = 0 . To see f(0)=0 f(0) = 0 , simply observe that:
0=f(f(0))≤f(0)≤0 0 = f(f(0)) \leq f(0) \leq 0

Case 2: R=S \mathbb{R} = \mathcal{S} .

- Note that f(f(x)) f(f(x)) is the constant function now. Therefore, set y=f(t)−x y = f(t) - x for any t∈R t \in \mathbb{R} to get:
0≤f(x)(f(t)−x) 0 \leq f(x) (f(t) - x)
Thus, for all x<f(t)≤0 x < f(t) \leq 0 , we have f(x)=0 f(x) = 0 . Now, take y>0 y > 0 and x<f(t)−y x < f(t) - y to get:
0=f(x+y)≤yf(x)+f(f(x))=f(0)≤0 0 = f(x + y) \leq y f(x) + f(f(x)) = f(0) \leq 0
Which gives f(0)=0 f(0) = 0 . This contradicts the hypothesis of this case, since f(f(0))=0 f(f(0)) = 0 .

Hence, the conclusion must hold. ■\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.