Maths Olympiad Prep

Library / /7 of 7

, 2020

Algebra Difficulty 9.0 Shortlist Prove it Taiwan

Let R\mathbb{R} be the set of all real numbers. Find all functions f:RRf: \mathbb{R} \to \mathbb{R} such that for any x,yRx, y \in \mathbb{R}, there holds
f(x+f(y))+f(xy)=yf(x)+f(y)+f(f(x)). f(x + f(y)) + f(xy) = y f(x) + f(y) + f(f(x)).

Solution

Denote the original relation by (*), and define P(a,b)P(a, b) as the property obtained by substituting x=a,y=bx = a, y = b into the given condition on the function ff. We analyze this through the following steps:

(A). Applying P(x,1)P(x, 1) gives f(x+f(1))=f(1)+f(f(x))f(x + f(1)) = f(1) + f(f(x)). From this we obtain f(f(1f(1)))=0f(f(1 - f(1))) = 0. Organizing this as follows:
f(1f(1))=a,f(a)=0.(1) f(1 - f(1)) = a, \quad f(a) = 0. \tag{1}
Also, applying P(a,a)P(a, a) and using (1) gives
f(a2)=f(0).(2) f(a^2) = f(0). \tag{2}
Then applying P(0,a2)P(0, a^2) and P(0,x)P(0, x), we can successively derive
f(0)=0,f(f(x))=f(x),xR.(3) f(0) = 0, \quad f(f(x)) = f(x), \quad \forall x \in \mathbb{R}. \tag{3}

(B). Suppose there exists t0,1t \neq 0, 1 such that f(t)=0f(t) = 0. Then from P(x,t)P(x, t) and (3) we obtain f(xt)=tf(x),xRf(xt) = t f(x), \forall x \in \mathbb{R}. Then from P(tx,ty)tP(x,y)P(tx, ty) - t P(x, y) we derive (t2t)(f(xy)yf(x))=0(t^2 - t)(f(xy) - y f(x)) = 0, and setting x=1x = 1 gives f(y)=f(1)yf(y) = f(1) y, which combined with condition (*) gives f(1)=0f(1) = 0 or f(1)=1f(1) = 1. Thus we obtain two possible functions: f(y)=0f(y) = 0 or f(y)=y,yRf(y) = y, \forall y \in \mathbb{R}. Clearly f(y)=0f(y) = 0 satisfies condition (*), while f(y)=yf(y) = y does not satisfy the condition in this case. (Because f(t)0,t0f(t) \neq 0, \forall t \neq 0.)

(C). Excluding the case in (B), we now assume f(t)0,tR{0,1}f(t) \neq 0, \forall t \in \mathbb{R} - \{0, 1\}. Then (1) gives f(1)=0f(1) = 0 or f(1)=1f(1) = 1. If f(1)=0f(1) = 0, then from P(1,y)P(1, y) we obtain f(1+f(y))=0f(1 + f(y)) = 0. Therefore, f(y)=1,yR{0,1}f(y) = -1, \forall y \in \mathbb{R} - \{0, 1\}, but this clearly contradicts (*). Hence f(1)=1f(1) = 1, and we have the following results:
f(0)=0,f(1)=1;f(t)0,t0.(4) f(0) = 0, \quad f(1) = 1; \quad f(t) \neq 0, \forall t \neq 0. \tag{4}

From P(x,1)P(x, 1) we obtain f(x+1)=f(x)+1f(x+1) = f(x)+1. Then from P(x,y+1)P(x,y)P(x, y+1)-P(x, y) we obtain f(x+xy)=f(x)+f(xy)f(x+xy) = f(x) + f(xy). Therefore, when x0x \neq 0, for any real number zz we may set y=zxy = \frac{z}{x} to obtain
f(x+z)=f(x)+f(z).(5) f(x+z) = f(x) + f(z). \tag{5}
Also noting that f(0)=0f(0) = 0, this result clearly holds for all real numbers x,zx, z. Then from P(x,1)P(x, 1) we can further obtain f(f(x))=f(x)f(f(x)) = f(x). From this result together with applying the property (5) into (*), we deduce that f(xy)=yf(x)f(xy) = y f(x). Finally, from this equation combined with the argument in (B), we must obtain f(y)=y,yRf(y) = y, \forall y \in \mathbb{R}. Clearly this equation satisfies the given condition.

In summary, the functions satisfying the condition are f(x)=0,xRf(x) = 0, \forall x \in \mathbb{R} and f(x)=x,xRf(x) = x, \forall 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 zh; metadata (topic, difficulty) added by this project.