Determine all non-negative real-valued functions f defined for non-negative real numbers, which satisfy f(x2)+f(y)=f(x2+y+xf(4y)) for every pair of non-negative real numbers x and y.
Solution
First of all, let us show that the function f is monotone increasing in the wide sense, namely it satisfies the property that a<b⟹f(a)≤f(b). So, suppose a<b. Then we can choose a number t>0 such that b=t2+a+tf(4a). Substituting x=t, y=a into the given functional equation, we obtain f(t2)+f(a)=f(b). Since f(t2)≥0, we then obtain f(a)≤f(b), showing the desired monotone property of f. Furthermore, we note that the same argument shows that if f(t)>0 for an arbitrary t>0, then a<b⟹f(a)<f(b).
We separate the following two cases: (1): f(t)>0 is satisfied for an arbitrary t>0. (2): f(t)=0 for some t>0.
Let us first determine f(x) in the case (1). As we stated above, in this case, we have a<b⟹f(a)<f(b), and therefore, we must have f(a)=f(b)⟹a=b. (f is said to be injective if it satisfies this property.) For arbitrary non-negative real numbers a and b, substitute (x,y)=(a,b), (b,a) into the given functional equation, then we obtain f(a)+f(b)f(b)+f(a)=f(a+b+af(4b)),=f(b+a+bf(4a)) from which we get f(a+b+af(4b))=f(b+a+bf(4a)). Since f is injective in the case (1), we conclude that a+b+af(4b)=b+a+bf(4a), and hence af(4b)=bf(4a) holds for every pair of non-negative real numbers a and b. By substituting a=1 and b=4x, where x is an arbitrary non-negative real number, into the last equation we get f(x)=2f(4)x. Therefore, we can write f(x)=kx for some k>0. If we substitute x=y=1 into the functional equation for this choice of f, we obtain that 2k=k2+2k, from which we get, since k>0, 2=2+2k, and therefore, k=1. Thus, we conclude that f(x)=x.
Conversely, if f(x)=x, then we get for any pair of non-negative real numbers x and y, f(x2)+f(y)f(x2+y+xf(4y))=x+y=x2+y+x4y=(x+y)2=x+y. So the function f(x)=x satisfies the given functional equation. Thus, the desired answer in the case (1) is f(x)=x.
Alternate Solution: The proof of the fact that 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) is injective, i.e., when f(a)=f(b)⇒a=b. (2) When f(x) is not injective, i.e., when there exist a pair a,b (a=b) for which f(a)=f(b). The fact that f(x)=x for the case (1) can be shown as in the preceding solution.
Let us show that f(x)=0 must hold in the case (2). Choose a pair a,b (a<b) for which f(a)=f(b). Let t be an arbitrary non-negative real number and substitute (x,y)=(t,a), (t,b) into the functional equation, then we get f(t2)+f(a)f(t2)+f(b)=f(t2+a+tf(4a)),=f(t2+b+tf(4b)), from which we get, in view of the fact that f(a)=f(b), f(t2+a+tf(4a))=f(t2+b+tf(4b)). In particular, for t>0 for which t2+a+tf(4a)=b (such a t exists since a<b) we get f(b)=f(b′) if we put b′=t2+b+tf(4b). We thus have f(a)=f(b′) with b′=(t2+a+tf(4a))+(b−a)+t(f(4b)−f(4a))≥b+(b−a)=2b−a since f(4b)≥f(4a). Summarizing this we now see that if f(a)=f(b) holds for some pair of non-negative real numbers a,b (a<b), then there exists a b′ for which f(a)=f(b′),b′≥2b−a hold.
Repeating the procedure above to obtain b′ from the pair (a,b), we get a sequence b1,b2,… of positive numbers for which ∙∙∙b1=bf(a)=f(bn)(n=1,2,…),bn+1≥2bn−a(n=1,2,…) From bn+1≥2bn−a we get bn+1−a≥2(bn−a), from which it follows that bn−a≥2n−1(b1−a). Since b1−a>0, we see that bn can be taken to be arbitrarily large by choosing n larger and larger.
Let now x be an arbitrary positive number for which x≥a, then for a sufficiently large n we have a≤x≤bn, and since f is monotone increasing in the wide sense and since f(a)=f(bn), we get f(x)=f(a). Thus, we have shown that x≥a⇒f(x)=f(a). If we take both x and y to be sufficiently large real numbers and substitute these in the functional equation, we get the identity f(a)+f(a)=f(a), from which we conclude that f(a)=0. Consequently, we have f(x)=f(a)=0 if x≥a. Since f(x) is non-negative valued, and is monotone increasing in the wide sense, we also have 0≤x≤a⇒0≤f(x)≤f(a)=0 as well, and therefore, f(x)=0 for all x≥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.