MathLabs

Problem 2

Let R\mathbb{R} be the set of real numbers. Determine all functions f:R→Rf:\mathbb{R}\rightarrow\mathbb{R} such that, for all real numbers xx and yy, f(f(x)f(y))+f(x+y)=f(xy).f(f(x)f(y)) + f(x+y) = f(xy).
Step 5 of 6: ff is injective
f(a)=f(b)  ⟹  a=bf(a)=f(b)\implies a=b
Detailed analysis

Suppose f(a)=f(b)f(a)=f(b). Shifting both aa and bb by the same large integer mm preserves f(a)=f(b)f(a)=f(b) (since f(a+m)=f(a)−m=f(b)−m=f(b+m)f(a+m)=f(a)-m=f(b)-m=f(b+m)), and since the discriminant (a+m+1)2−4(b+m)(a+m+1)^2-4(b+m) is a quadratic in mm with positive leading coefficient, it becomes nonnegative for mm large enough; so we may assume from the start that real numbers x,yx,y exist with x+y=a+1x+y=a+1, xy=bxy=b. The original equation then gives f(f(x)f(y))=f(xy)−f(x+y)=f(b)−f(a+1)=f(b)−(f(a)−1)=1f(f(x)f(y))=f(xy)-f(x+y)=f(b)-f(a+1)=f(b)-(f(a)-1)=1 (using f(a)=f(b)f(a)=f(b)). Applying the shift identity to u=f(x)f(y)u=f(x)f(y): f(u+1)=f(u)−1=1−1=0f(u+1)=f(u)-1=1-1=0, so by the unique zero from Step 3, u+1=1u+1=1, i.e. f(x)f(y)=0f(x)f(y)=0; by the unique zero again, x=1x=1 or y=1y=1. If x=1x=1 then y=by=b and x+y=1+b=a+1x+y=1+b=a+1 gives b=ab=a; if y=1y=1 then symmetrically a=ba=b. Either way a=ba=b, proving injectivity.