Example 2 Let the function f:R→R, not identically zero, satisfy the conditions: for all x, y∈R, (i) f(xy)=f(x)f(y); (ii) f(x+2)=f(x)+f(2).
Find f(x).
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Solution: Clearly, f(x)=x satisfies the requirements. Below, we prove that this is the only solution. First, in (i), let x=y=0, we get f(0)=f2(0),
thus f(0)=0 or f(0)=1. If f(0)=1, then for any y∈R, f(y)=f(0)f(y)=f(0)=1.
But in this case, f(x+2)=f(x)=f(2)=1, which contradicts (ii). Therefore, f(0)=0. Similarly, in (i), let x=y=1, we get f(1)=f2(1),
thus f(1)=1 or f(1)=0. If f(1)=0, then for any −y∈R, f(y)=f(1)f(y)=0,
which contradicts that f(x) is not identically zero. Therefore, f(1)=1. Next, we "improve" (ii). For any y=0, ====f(x+y)=f(2y(x⋅y2+2))f(2y)f(x⋅y2+2)f(2y)(f(x⋅y2)+f(2))f(2y)f(x⋅y2)+f(2y)f(2)f(x)+f(y).
The above equation clearly holds for y=0. Therefore, we have (iii) f(x+y)=f(x)+f(y). Thus, f(x)+f(−x)=f(0)=0. Hence, f(x) is an odd function, and we only need to consider x>0. By f(1)=1 and (iii), it is easy to see that for n∈N, f(n)=f(n−1)+f(1)=f(n−2)+2f(1)=⋯=nf(1)=n.
And for m,n∈N, we have mf(mn)=m↑f(mn)+f(mn)+⋯+f(mn)=fm↑(mn+mn+⋯+mn)=f(n)=n,
i.e., f(mn)=mn.
Thus, for all rational numbers x, f(x)=x.
We only need to prove that this equation also holds for irrational x. Since f(x2)=f(x)f(x)=f2(x)⩾0, when x>0, f(x) is non-negative. When y>0, f(x+y)=f(x)+f(y)⩾f(x),
i.e., f(x) is increasing. For any irrational number c, we can find rational numbers r1, r2, such that r1<c<r2. By monotonicity, r1=f(r1)⩽f(c)⩽f(r2)=r2.
Since r1,r2 can be arbitrarily close to c, we have f(c)=c.
Thus, f(x)=x holds for all x. Note: After obtaining (iii), based on f(1)=1, we can deduce that (3) holds for all rational numbers x. This method is called the Cauchy method. However, to prove that (3) holds for all real numbers, (iii) alone is not sufficient; we must rely on monotonicity or continuity, which (i) provides.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.