Browse · MathNet
PrintIMO Problem Shortlist
algebra
Problem
Find all functions from the set of real numbers into the set of real numbers which satisfy for all real the identity
Solution
It is no hard to see that the two functions given by and for all real respectively solve the functional equation. In the sequel, we prove that there are no further solutions. Let be a function satisfying the given equation. It is clear that cannot be a constant. Let us first show that . Suppose that . For any real , substituting into the given functional equation, we obtain contradicting the fact that is not a constant function. Therefore, . Next for any , substituting and into the given equation, we get and respectively. Therefore, we conclude that Consequently, for every real , there exists a real , such that . We also see that if , then so that , and thus 0 is the only real number satisfying . We next show that for any real number , This is clear if . Suppose now , then we can find a number for which . As implies , we can also find number such that . Substituting into the given equation, we get and therefore, , which implies , and hence . Consequently, holds in this case. Finally, suppose holds. Then there exists a real number for which . Choose a number such that . Substituting into the given equation, we get . So we have , from which we conclude that . Since , we get so that and thus we see holds in this case also. This observation finishes the proof of (3). By substituting and into the given equation, we obtain and respectively. Using the fact that holds for all to rewrite the second and the third equation, and rearranging the terms, we obtain Adding up these three equations now yields , and therefore, we conclude that holds for every pair of real numbers . By fixing so that , we obtain . In view of the given equation, we see that . It is easy to check that both functions and satisfy the given functional equation, so these are the desired solutions.
---
Alternative solution.
As in Solution 1 we obtain (1), (2) and (3). Now we prove that is injective. For this purpose, let us assume that for some . Then, by (2) where the last statement follows from the given functional equation with and . Hence, satisfies which implies , i.e., . Then, by we have which implies , and finally . Analogously, it follows that which gives the contradiction . To prove we apply (2) with and also with and obtain and . Now we choose with . Using that is odd and the given equation with (second equality) and with (fourth equality) we obtain Hence, Using this argument twice we obtain Substituting we have where the last equality follows from (4). Applying the given functional equation we proceed to where the last equality follows again from (4) with , i.e., . Finally, and by injectivity of we get and hence the two solutions.
---
Alternative solution.
As in Solution 1 we obtain (1), (2) and (3). Now we prove that is injective. For this purpose, let us assume that for some . Then, by (2) where the last statement follows from the given functional equation with and . Hence, satisfies which implies , i.e., . Then, by we have which implies , and finally . Analogously, it follows that which gives the contradiction . To prove we apply (2) with and also with and obtain and . Now we choose with . Using that is odd and the given equation with (second equality) and with (fourth equality) we obtain Hence, Using this argument twice we obtain Substituting we have where the last equality follows from (4). Applying the given functional equation we proceed to where the last equality follows again from (4) with , i.e., . Finally, and by injectivity of we get and hence the two solutions.
Final answer
f(x) = x and f(x) = -x
Techniques
Functional EquationsInjectivity / surjectivity