Maths Olympiad Prep

Library / /240 of 397

Algebra Difficulty 6.1 National Olympiad Prove it Taiwan

Find all functions f:RRf: \mathbb{R} \to \mathbb{R} satisfying the following conditions:
(1) For all x,yRx, y \in \mathbb{R}, f(1+xy)f(x+y)=f(x)f(y)f(1 + xy) - f(x + y) = f(x)f(y), and
(2) f(1)0f(-1) \neq 0.

Solution

The unique solution is f(x)=x1,xRf(x) = x - 1, x \in \mathbb{R}.
We let g(x)=f(x)+1g(x) = f(x) + 1 and prove that g(x)=xg(x) = x for all real numbers xx. Then the condition of the problem can be written as
g(1+xy)g(x+y)=(g(x)1)(g(y)1)for all x,yR with g(1)1.(1) g(1+xy)-g(x+y) = (g(x)-1)(g(y)-1) \quad \text{for all } x,y \in \mathbb{R} \text{ with } g(-1) \neq 1. \quad (1)
Let C=g(1)10C = g(-1) - 1 \neq 0. Setting y=1y = -1 in (1), we obtain
g(1x)g(x1)=C(g(x)1).(2) g(1-x) - g(x-1) = C(g(x) - 1). \quad (2)
Setting x=1x = 1 in (2) gives C(g(1)1)=0C(g(1) - 1) = 0. Therefore, since C0C \neq 0, we have g(1)=1g(1) = 1. Substituting x=0x = 0 and x=2x = 2 respectively produces g(0)=0g(0) = 0 and g(2)=2g(2) = 2.
We observe that
g(x)+g(2x)=2for all xR,(3) g(x) + g(2 - x) = 2 \quad \text{for all } x \in \mathbb{R}, \quad (3)
g(x+2)g(x)=2for all xR.(4) g(x + 2) - g(x) = 2 \quad \text{for all } x \in \mathbb{R}. \quad (4)
Replacing xx in (2) by 1x1 - x gives g(x)g(x)=C(g(1x)1)g(x) - g(-x) = C(g(1-x) - 1), and replacing xx by x-x gives g(x)g(x)=C(g(1+x)1)g(-x) - g(x) = C(g(1+x) - 1). Adding the two equations gives C(g(1x)+g(1+x)2)=0C(g(1-x) + g(1+x) - 2) = 0. Hence, since C0C \neq 0, we obtain (3).
Let u,vu, v be such that u+v=1u + v = 1. Substituting (x,y)(x, y) respectively by (u,v)(u, v) and (2u,2v)(2 - u, 2 - v) in (1) gives g(1+uv)g(1)=(g(u)1)(g(v)1)g(1 + uv) - g(1) = (g(u) - 1)(g(v) - 1), g(3+uv)g(3)=g(3 + uv) - g(3) =
g(uv+3)g(uv+1)=g(3)g(1). g(uv + 3) - g(uv + 1) = g(3) - g(1).
Every x54x \le \frac{5}{4} can be expressed in the form x=uv+1x = uv + 1 where u+v=1u + v = 1 (since the quadratic polynomial t2t+(x1)t^2 - t + (x-1) has real roots when x54x \le \frac{5}{4}). Therefore, when x54x \le \frac{5}{4}, g(x+2)g(x)=g(3)g(1)g(x+2)-g(x) = g(3)-g(1). Since g(x)=xg(x) = x holds at x=0,1,2x = 0, 1, 2, letting x=0x = 0 gives g(3)=3g(3) = 3. This proves that (4) holds when x54x \le \frac{5}{4}. If x>54x > \frac{5}{4} then x<54-x < \frac{5}{4}, so g(2x)g(x)=2g(2-x)-g(-x) = 2. On the other hand, from (3) we get g(x)=2g(2x)g(x) = 2-g(2-x), g(x+2)=2g(x)g(x+2) = 2-g(-x), so that g(x+2)g(x)=g(2x)g(x)=2g(x+2) - g(x) = g(2-x) - g(-x) = 2. Hence (4) holds for all real numbers xx.
Replacing xx in (3) by x-x gives g(x)+g(2+x)=2g(-x) + g(2+x) = 2. From (4) we obtain g(x)+g(x)=0g(x) + g(-x) = 0 for all xx. Substituting (x,y)(x,y) respectively by (x,y)(-x,y) and (x,y)(x,-y) in (1) gives g(1xy)g(x+y)=(g(x)+1)(1g(y))g(1-xy)-g(-x+y) = (g(x)+1)(1-g(y)), g(1xy)g(xy)=(1g(x))(g(y)+1)g(1-xy)-g(x-y) = (1-g(x))(g(y)+1). Adding the two equations gives g(1xy)=1g(x)g(y)g(1-xy) = 1-g(x)g(y). From (3) we obtain g(1+xy)=1+g(x)g(y)g(1+xy) = 1+g(x)g(y). Therefore, from the original equation (1), we obtain the form g(x+y)=g(x)+g(y)g(x+y) = g(x)+g(y), so gg is additive.
From additivity we get g(1+xy)=g(1)+g(xy)=1+g(xy)g(1+xy) = g(1)+g(xy) = 1+g(xy), and since g(1+xy)=1+g(x)g(y)g(1+xy) = 1+g(x)g(y) has already been obtained above, we get g(xy)=g(x)g(y)g(xy) = g(x)g(y). In particular, setting y=xy = x gives g(x2)=g(x)20g(x^2) = g(x)^2 \ge 0 for all real numbers xx, meaning that g(x)0g(x) \ge 0 when x0x \ge 0. Since gg is additive and bounded below on [0,+][0, +\infty], gg is linear, and moreover g(x)=g(1)x=xg(x) = g(1)x = x for all real numbers xx.
In summary, the unique solution is f(x)=x1,xRf(x) = x-1, x \in \mathbb{R}.

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 translated into English from the original; metadata (topic, difficulty) added by this project.