Maths Olympiad Prep

Library / /225 of 383

, 2020

Algebra Difficulty 8.7 Shortlist Prove it IMO

Let R+\mathbb{R}^{+} be the set of positive real numbers. Determine all functions f:R+R+f: \mathbb{R}^{+} \rightarrow \mathbb{R}^{+} such that, for all positive real numbers xx and yy,
f(x+f(xy))+y=f(x)f(y)+1 f(x+f(xy))+y=f(x)f(y)+1

Solutions — 2

Solution 1

A straightforward check shows that f(x)=x+1f(x)=x+1 satisfies (*). We divide the proof of the converse statement into a sequence of steps.

Step 1: ff is injective.
Put x=1x=1 in (*) and rearrange the terms to get
y=f(1)f(y)+1f(1+f(y)) y=f(1)f(y)+1-f(1+f(y))
Therefore, if f(y1)=f(y2)f(y_1)=f(y_2), then y1=y2y_1=y_2.

Step 2: ff is (strictly) monotone increasing.
For any fixed yR+y \in \mathbb{R}^{+}, the function
g(x):=f(x+f(xy))=f(x)f(y)+1y g(x):=f(x+f(xy))=f(x)f(y)+1-y
is injective by Step 1. Therefore, x1+f(x1y)x2+f(x2y)x_1+f(x_1y) \neq x_2+f(x_2y) for all y,x1,x2R+y, x_1, x_2 \in \mathbb{R}^{+} with x1x2x_1 \neq x_2. Plugging in zi=xiyz_i=x_iy, we arrive at
z1z2yf(z2)f(z1),or1yf(z2)f(z1)z1z2 \frac{z_1-z_2}{y} \neq f(z_2)-f(z_1), \quad \text{or} \quad \frac{1}{y} \neq \frac{f(z_2)-f(z_1)}{z_1-z_2}
for all y,z1,z2R+y, z_1, z_2 \in \mathbb{R}^{+} with z1z2z_1 \neq z_2. This means that the right-hand side of the rightmost relation is always non-positive, i.e., ff is monotone non-decreasing. Since ff is injective, it is strictly monotone.

Step 3: There exist constants aa and bb such that f(y)=ay+bf(y)=a y+b for all yR+y \in \mathbb{R}^{+}.
Since ff is monotone and bounded from below by 00, for each x00x_0 \geqslant 0, there exists a right limitlimxx0f(x)0\operatorname{limit} \lim_{x \searrow x_0} f(x) \geqslant 0. Put p=limx0f(x)p=\lim_{x \searrow 0} f(x) and q=limxpf(x)q=\lim_{x \searrow p} f(x).
Fix an arbitrary yy and take the limit of ()(*) as x0x \searrow 0. We have f(xy)pf(xy) \searrow p and hence f(x+f(xy))qf(x+f(xy)) \searrow q; therefore, we obtain
q+y=pf(y)+1,orf(y)=q+y1p. q+y=p f(y)+1, \quad \text{or} \quad f(y)=\frac{q+y-1}{p} .
(Notice that p0p \neq 0, otherwise q+y=1q+y=1 for all yy, which is absurd.) The claim is proved.

Step 4: f(x)=x+1f(x)=x+1 for all xR+x \in \mathbb{R}^{+}.
Based on the previous step, write f(x)=ax+bf(x)=a x+b. Putting this relation into (*) we get
a(x+axy+b)+b+y=(ax+b)(ay+b)+1 a(x+a x y+b)+b+y=(a x+b)(a y+b)+1
which can be rewritten as
(aab)x+(1ab)y+ab+bb21=0for all x,yR+. (a-a b)x+(1-a b)y+a b+b-b^2-1=0 \quad \text{for all} \ x, y \in \mathbb{R}^{+} .
This identity may hold only if all the coefficients are 00, i.e.,
aab=1ab=ab+bb21=0. a-a b=1-a b=a b+b-b^2-1=0 .
Hence, a=b=1a=b=1.

Solution 2

We provide another proof that f(x)=x+1f(x)=x+1 is the only function satisfying (*).
Put a=f(1)a=f(1). Define the function ϕ:R+R\phi: \mathbb{R}^{+} \rightarrow \mathbb{R} by
ϕ(x)=f(x)x1 \phi(x)=f(x)-x-1
Then equation (*) reads as
ϕ(x+f(xy))=f(x)f(y)f(xy)xy. \phi(x+f(xy))=f(x)f(y)-f(xy)-x-y .
Since the right-hand side is symmetric under swapping xx and yy, we obtain
ϕ(x+f(xy))=ϕ(y+f(xy)). \phi(x+f(xy))=\phi(y+f(xy)) .
In particular, substituting (x,y)=(t,1/t)(x, y)=(t, 1/t) we get
ϕ(a+t)=ϕ(a+1t),tR+. \phi(a+t)=\phi\left(a+\frac{1}{t}\right), \quad t \in \mathbb{R}^{+} .
Notice that the function ff is bounded from below by a positive constant. Indeed, for each yR+y \in \mathbb{R}^{+}, the relation (*) yields f(x)f(y)>y1f(x)f(y)>y-1, hence
f(x)>y1f(y)for all xR+ f(x)>\frac{y-1}{f(y)} \quad \text{for all} \ x \in \mathbb{R}^{+}
If y>1y>1, this provides a desired positive lower bound for f(x)f(x).
Now, let M=infxR+f(x)>0M=\inf_{x \in \mathbb{R}^{+}} f(x)>0. Then, for all yR+y \in \mathbb{R}^{+},
My1f(y),orf(y)y1M M \geqslant \frac{y-1}{f(y)}, \quad \text{or} \quad f(y) \geqslant \frac{y-1}{M}
Lemma 1. The function f(x)f(x) (and hence ϕ(x)\phi(x)) is bounded on any segment [p,q][p, q], where 0<p<q<+0<p<q<+\infty.
Proof. ff is bounded from below by MM. It remains to show that ff is bounded from above on [p,q][p, q]. Substituting y=1y=1 into ()(*), we get
f(x+f(x))=af(x) f(x+f(x))=a f(x)
Take z[p,q]z \in [p, q] and put s=f(z)s=f(z). By the above, we have
f(z+s)=asandf(z+s+as)=f(z+s+f(z+s))=a2s. f(z+s)=a s \quad \text{and} \quad f(z+s+a s)=f(z+s+f(z+s))=a^2 s .
Plugging in (x,y)=(z,1+sz)(x, y)=\left(z, 1+\frac{s}{z}\right) to ()(*) and using the previous estimate, we obtain
f(z+as)=f(z+f(z+s))=sf(1+sz)szs2Mzsz f(z+a s)=f(z+f(z+s))=s f\left(1+\frac{s}{z}\right)-\frac{s}{z} \geqslant \frac{s^2}{M z}-\frac{s}{z}
Now, substituting (x,y)=(z+as,zz+as)(x, y)=\left(z+a s, \frac{z}{z+a s}\right) to ()(*) and applying the above estimate and the estimate f(y)Mf(y) \geqslant M, we obtain
a2s=f(z+s+as)=f(z+as+f(z))=f(z+as)f(zz+as)+1zz+asMf(z+as)s2zMszs2qMsp a^2 s=f(z+s+a s)=f(z+a s+f(z))=f(z+a s)f\left(\frac{z}{z+a s}\right)+1-\frac{z}{z+a s} \\ \geqslant M f(z+a s) \geqslant \frac{s^2}{z}-\frac{M s}{z} \geqslant \frac{s^2}{q}-\frac{M s}{p}
This yields sq(Mp+a2)=:Ls \leqslant q\left(\frac{M}{p}+a^2\right)=: L, and ff is bounded from above by LL on [p,q][p, q].
Applying Lemma 1 to the segment [a,a+1][a, a+1], we see that ϕ\phi is bounded on it. By the previous symmetry, we get that ϕ\phi is also bounded on [a+1,+)[a+1,+\infty), and hence on [a,+)[a,+\infty). Put C=max{a,3}C=\max\{a, 3\}.

Lemma 2. For all xCx \geqslant C, we have ϕ(x)=0\phi(x)=0 (and hence f(x)=x+1f(x)=x+1).
Proof. Substituting y=xy=x to the earlier equation, we obtain
ϕ(x+f(x2))=f(x)2f(x2)2x \phi\left(x+f\left(x^2\right)\right)=f(x)^2-f\left(x^2\right)-2x
hence,
ϕ(x+f(x2))+ϕ(x2)=f(x)2(x+1)2=ϕ(x)(f(x)+x+1) \phi\left(x+f\left(x^2\right)\right)+\phi\left(x^2\right)=f(x)^2-(x+1)^2=\phi(x)(f(x)+x+1)
Since f(x)+x+1C+14f(x)+x+1 \geqslant C+1 \geqslant 4, we obtain that
ϕ(x)14(ϕ(x+f(x2))+ϕ(x2)) |\phi(x)| \leqslant \frac{1}{4}\left(|\phi\left(x+f\left(x^2\right)\right)|+|\phi\left(x^2\right)|\right)
Since CaC \geqslant a, there exists a finite supremum S=supxCϕ(x)S=\sup_{x \geqslant C}|\phi(x)|. For each x[C,+)x \in [C,+\infty), both x+f(x2)x+f\left(x^2\right) and x2x^2 are greater than xx; hence they also lie in [C,+)[C,+\infty). Therefore, taking the supremum of the left-hand side over x[C,+)x \in [C,+\infty), we obtain SS/2S \leqslant S/2 and hence S=0S=0. Thus, ϕ(x)=0\phi(x)=0 for all xCx \geqslant C.
It remains to show that f(y)=y+1f(y)=y+1 when 0<y<C0<y<C. For each yy, choose x>max{C,Cy}x>\max\{C, \frac{C}{y}\}. Then all three numbers x,xyx, x y, and x+f(xy)x+f(x y) are greater than CC, so (*) reads as
(x+xy+1)+1+y=(x+1)f(y)+1,hencef(y)=y+1 (x+x y+1)+1+y=(x+1)f(y)+1, \quad \text{hence} \quad f(y)=y+1

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.