Maths Olympiad Prep

Library / /69 of 94

Algebra Difficulty 7.4 National Olympiad, round 2 Prove it Japan

Determine all non-negative real-valued functions ff defined for non-negative real numbers, which satisfy
f(x2)+f(y)=f(x2+y+xf(4y)) f(x^2) + f(y) = f(x^2 + y + x f(4y))
for every pair of non-negative real numbers xx and yy.

Solution

First of all, let us show that the function ff is monotone increasing in the wide sense, namely it satisfies the property that a<b    f(a)f(b)a < b \implies f(a) \le f(b). So, suppose a<ba < b. Then we can choose a number t>0t > 0 such that b=t2+a+tf(4a)b = t^2 + a + t f(4a). Substituting x=tx = t, y=ay = a into the given functional equation, we obtain f(t2)+f(a)=f(b)f(t^2) + f(a) = f(b). Since f(t2)0f(t^2) \ge 0, we then obtain f(a)f(b)f(a) \le f(b), showing the desired monotone property of ff. Furthermore, we note that the same argument shows that if f(t)>0f(t) > 0 for an arbitrary t>0t > 0, then a<b    f(a)<f(b)a < b \implies f(a) < f(b).

We separate the following two cases:
(1): f(t)>0f(t) > 0 is satisfied for an arbitrary t>0t > 0.
(2): f(t)=0f(t) = 0 for some t>0t > 0.

Let us first determine f(x)f(x) in the case (1). As we stated above, in this case, we have a<b    f(a)<f(b)a < b \implies f(a) < f(b), and therefore, we must have f(a)=f(b)    a=bf(a) = f(b) \implies a = b. (ff is said to be injective if it satisfies this property.) For arbitrary non-negative real numbers aa and bb, substitute (x,y)=(a,b)(x, y) = (\sqrt{a}, b), (b,a)(\sqrt{b}, a) into the given functional equation, then we obtain
f(a)+f(b)=f(a+b+af(4b)),f(b)+f(a)=f(b+a+bf(4a)) \begin{align*} f(a) + f(b) &= f(a + b + \sqrt{a} f(4b)), \\ f(b) + f(a) &= f(b + a + \sqrt{b} f(4a)) \end{align*}
from which we get f(a+b+af(4b))=f(b+a+bf(4a))f(a + b + \sqrt{a} f(4b)) = f(b + a + \sqrt{b} f(4a)). Since ff is injective in the case (1), we conclude that a+b+af(4b)=b+a+bf(4a)a + b + \sqrt{a} f(4b) = b + a + \sqrt{b} f(4a), and hence af(4b)=bf(4a)\sqrt{a} f(4b) = \sqrt{b} f(4a) holds for every pair of non-negative real numbers aa and bb. By substituting a=1a = 1 and b=x4b = \frac{x}{4}, where xx is an arbitrary non-negative real number, into the last equation we get f(x)=f(4)2xf(x) = \frac{f(4)}{2} \sqrt{x}. Therefore, we can write f(x)=kxf(x) = k \sqrt{x} for some k>0k > 0. If we substitute x=y=1x = y = 1 into the functional equation for this choice of ff, we obtain that 2k=k2+2k2k = k \sqrt{2} + 2k, from which we get, since k>0k > 0, 2=2+2k2 = \sqrt{2} + 2k, and therefore, k=1k = 1. Thus, we conclude that f(x)=xf(x) = \sqrt{x}.

Conversely, if f(x)=xf(x) = \sqrt{x}, then we get for any pair of non-negative real numbers xx and yy,
f(x2)+f(y)=x+yf(x2+y+xf(4y))=x2+y+x4y=(x+y)2=x+y. \begin{align*} f(x^2) + f(y) &= x + \sqrt{y} \\ f(x^2 + y + x f(4y)) &= \sqrt{x^2 + y + x \sqrt{4y}} = \sqrt{(x + \sqrt{y})^2} = x + \sqrt{y}. \end{align*}
So the function f(x)=xf(x) = \sqrt{x} satisfies the given functional equation. Thus, the desired answer in the case (1) is f(x)=xf(x) = \sqrt{x}.

Alternate Solution:
The proof of the fact that f(x)f(x) is monotone increasing in the wide sense is the same as the preceding solution. We now separate the 2 cases as follows:
(1) When f(x)f(x) is injective, i.e., when f(a)=f(b)a=bf(a) = f(b) \Rightarrow a = b.
(2) When f(x)f(x) is not injective, i.e., when there exist a pair a,ba, b (aba \neq b) for which f(a)=f(b)f(a) = f(b).
The fact that f(x)=xf(x) = \sqrt{x} for the case (1) can be shown as in the preceding solution.

Let us show that f(x)=0f(x) = 0 must hold in the case (2). Choose a pair a,ba, b (a<ba < b) for which f(a)=f(b)f(a) = f(b). Let tt be an arbitrary non-negative real number and substitute (x,y)=(t,a)(x, y) = (t, a), (t,b)(t, b) into the functional equation, then we get
f(t2)+f(a)=f(t2+a+tf(4a)),f(t2)+f(b)=f(t2+b+tf(4b)), \begin{aligned} f(t^2) + f(a) &= f(t^2 + a + t f(4a)), \\ f(t^2) + f(b) &= f(t^2 + b + t f(4b)), \end{aligned}
from which we get, in view of the fact that f(a)=f(b)f(a) = f(b),
f(t2+a+tf(4a))=f(t2+b+tf(4b)). f(t^2 + a + t f(4a)) = f(t^2 + b + t f(4b)).
In particular, for t>0t > 0 for which t2+a+tf(4a)=bt^2 + a + t f(4a) = b (such a tt exists since a<ba < b) we get f(b)=f(b)f(b) = f(b') if we put b=t2+b+tf(4b)b' = t^2 + b + t f(4b). We thus have f(a)=f(b)f(a) = f(b') with b=(t2+a+tf(4a))+(ba)+t(f(4b)f(4a))b+(ba)=2bab' = (t^2 + a + t f(4a)) + (b - a) + t(f(4b) - f(4a)) \ge b + (b - a) = 2b - a since f(4b)f(4a)f(4b) \ge f(4a). Summarizing this we now see that if f(a)=f(b)f(a) = f(b) holds for some pair of non-negative real numbers a,ba, b (a<ba < b), then there exists a bb' for which
f(a)=f(b),b2ba f(a) = f(b'), \quad b' \ge 2b - a
hold.

Repeating the procedure above to obtain bb' from the pair (a,b)(a, b), we get a sequence b1,b2,b_1, b_2, \dots of positive numbers for which
b1=bf(a)=f(bn)(n=1,2,),bn+12bna(n=1,2,) \begin{aligned} \bullet & b_1 = b \\ \bullet & f(a) = f(b_n) \quad (n = 1, 2, \dots), \\ \bullet & b_{n+1} \ge 2b_n - a \quad (n = 1, 2, \dots) \end{aligned}
From bn+12bnab_{n+1} \ge 2b_n - a we get bn+1a2(bna)b_{n+1} - a \ge 2(b_n - a), from which it follows that bna2n1(b1a)b_n - a \ge 2^{n-1}(b_1 - a). Since b1a>0b_1 - a > 0, we see that bnb_n can be taken to be arbitrarily large by choosing nn larger and larger.

Let now xx be an arbitrary positive number for which xax \ge a, then for a sufficiently large nn we have axbna \le x \le b_n, and since ff is monotone increasing in the wide sense and since f(a)=f(bn)f(a) = f(b_n), we get f(x)=f(a)f(x) = f(a). Thus, we have shown that xaf(x)=f(a)x \ge a \Rightarrow f(x) = f(a). If we take both xx and yy to be sufficiently large real numbers and substitute these in the functional equation, we get the identity f(a)+f(a)=f(a)f(a) + f(a) = f(a), from which we conclude that f(a)=0f(a) = 0. Consequently, we have f(x)=f(a)=0f(x) = f(a) = 0 if xax \ge a. Since f(x)f(x) is non-negative valued, and is monotone increasing in the wide sense, we also have 0xa0f(x)f(a)=00 \le x \le a \Rightarrow 0 \le f(x) \le f(a) = 0 as well, and therefore, f(x)=0f(x) = 0 for all x0x \ge 0.

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.