Maths Olympiad Prep

Library / /371 of 520

Algebra Difficulty 5.9 AIME, harder Find the answer

Example 2 Let the function f:RRf: \mathbf{R} \rightarrow \mathbf{R}, not identically zero, satisfy the conditions: for all xx, yRy \in \mathbf{R},
(i) f(xy)=f(x)f(y)f(x y)=f(x) f(y);
(ii) f(x+2)=f(x)+f(2)f(x+\sqrt{2})=f(x)+f(\sqrt{2}).

Find f(x)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)=xf(x)=x satisfies the requirements. Below, we prove that this is the only solution.
First, in (i), let x=y=0x=y=0, we get
f(0)=f2(0), f(0)=f^{2}(0),

thus f(0)=0f(0)=0 or f(0)=1f(0)=1.
If f(0)=1f(0)=1, then for any yRy \in \mathbf{R},
f(y)=f(0)f(y)=f(0)=1. f(y)=f(0) f(y)=f(0)=1.

But in this case, f(x+2)=f(x)=f(2)=1f(x+\sqrt{2})=f(x)=f(\sqrt{2})=1, which contradicts (ii). Therefore, f(0)=0f(0)=0.
Similarly, in (i), let x=y=1x=y=1, we get
f(1)=f2(1), f(1)=f^{2}(1),

thus f(1)=1f(1)=1 or f(1)=0f(1)=0.
If f(1)=0f(1)=0, then for any yR-y \in \mathbf{R},
f(y)=f(1)f(y)=0, f(y)=f(1) f(y)=0,

which contradicts that f(x)f(x) is not identically zero. Therefore, f(1)=1f(1)=1.
Next, we "improve" (ii). For any y0y \neq 0,
f(x+y)=f(y2(x2y+2))=f(y2)f(x2y+2)=f(y2)(f(x2y)+f(2))=f(y2)f(x2y)+f(y2)f(2)=f(x)+f(y). \begin{aligned} & f(x+y)=f\left(\frac{y}{\sqrt{2}}\left(x \cdot \frac{\sqrt{2}}{y}+\sqrt{2}\right)\right) \\ = & f\left(\frac{y}{\sqrt{2}}\right) f\left(x \cdot \frac{\sqrt{2}}{y}+\sqrt{2}\right) \\ = & f\left(\frac{y}{\sqrt{2}}\right)\left(f\left(x \cdot \frac{\sqrt{2}}{y}\right)+f(\sqrt{2})\right) \\ = & f\left(\frac{y}{\sqrt{2}}\right) f\left(x \cdot \frac{\sqrt{2}}{y}\right)+f\left(\frac{y}{\sqrt{2}}\right) f(\sqrt{2}) \\ = & f(x)+f(y) . \end{aligned}

The above equation clearly holds for y=0y=0. Therefore, we have
(iii) f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y).
Thus, f(x)+f(x)=f(0)=0f(x)+f(-x)=f(0)=0. Hence, f(x)f(x) is an odd function, and we only need to consider x>0x>0.
By f(1)=1f(1)=1 and (iii), it is easy to see that for nNn \in \mathbf{N},
f(n)=f(n1)+f(1)=f(n2)+2f(1)==nf(1)=n. \begin{array}{l} f(n)=f(n-1)+f(1)=f(n-2)+2 f(1) \\ =\cdots=n f(1)=n . \end{array}

And for m,nNm, n \in \mathbf{N}, we have
mf(nm)=f(nm)+f(nm)++f(nm)m=f(nm+nm++nm)m=f(n)=n \begin{array}{l} m f\left(\frac{n}{m}\right)=\underset{m \uparrow}{f\left(\frac{n}{m}\right)+f\left(\frac{n}{m}\right)+\cdots+f\left(\frac{n}{m}\right)} \\ =f \underbrace{\left(\frac{n}{m}+\frac{n}{m}+\cdots+\frac{n}{m}\right)}_{m \uparrow}=f(n)=n \text {, } \\ \end{array}

i.e.,
f(nm)=nm. f\left(\frac{n}{m}\right)=\frac{n}{m} .

Thus, for all rational numbers xx,
f(x)=x. f(x)=x .

We only need to prove that this equation also holds for irrational xx.
Since f(x2)=f(x)f(x)=f2(x)0f\left(x^{2}\right)=f(x) f(x)=f^{2}(x) \geqslant 0, when x>0x>0, f(x)f(x) is non-negative. When y>0y>0,
f(x+y)=f(x)+f(y)f(x), f(x+y)=f(x)+f(y) \geqslant f(x),

i.e., f(x)f(x) is increasing.
For any irrational number cc, we can find rational numbers r1r_{1}, r2r_{2}, such that r1<c<r2r_{1}<c<r_{2}. By monotonicity,
r1=f(r1)f(c)f(r2)=r2. r_{1}=f\left(r_{1}\right) \leqslant f(c) \leqslant f\left(r_{2}\right)=r_{2} .

Since r1,r2r_{1}, r_{2} can be arbitrarily close to cc, we have
f(c)=c. f(c)=c .

Thus, f(x)=xf(x)=x holds for all xx.
Note: After obtaining (iii), based on f(1)=1f(1)=1, we can deduce that (3) holds for all rational numbers xx. 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.