Browse · MathNet
PrintXIV APMO
algebra
Problem
Let denote the set of all real numbers. Find all functions from to satisfying: (i) there are only finitely many in such that , and (ii) for all in .
Solution
The only such function is the identity function on .
Setting in the given functional equation (ii), we have . Setting in (ii), we find [1 mark.] and thus [1 mark.]. It follows from (ii) that for all . Set to obtain for all , and so for all . The functional equation (3) suggests that is additive, that is, for all . [1 mark.] We now show this.
First assume that and . It follows from (3) that We next note that is an odd function, since from (2) Since is odd, we have that, for and , Therefore, we conclude that for all . [2 marks.]
We now show that . Recall that . Assume that there is a nonzero such that . Then, using the fact that is additive, we inductively have or for all . However, this is a contradiction to the given condition (i). [1 mark.]
It's now easy to check that is one-to-one. Assume that for some . Then, we have or . This implies that or , as desired. From (1) and the fact that is one-to-one, we deduce that for all . [1 mark.] This completes the proof.
---
Alternative solution.
Again, the only such function is the identity function on .
As in Solution 1, we first show that , , and . [2 marks.] From the latter follows and from condition (i) we get that only possibly for . [1 mark.]
Next we prove This is clear if . If then so which means . If we get similarly and again . [2 marks.]
Thus . Suppose that for some , where . Then from and for some we get , so . Thus for all except possibly . [1 mark.] But for example, and [1 mark.] This finishes the proof.
Setting in the given functional equation (ii), we have . Setting in (ii), we find [1 mark.] and thus [1 mark.]. It follows from (ii) that for all . Set to obtain for all , and so for all . The functional equation (3) suggests that is additive, that is, for all . [1 mark.] We now show this.
First assume that and . It follows from (3) that We next note that is an odd function, since from (2) Since is odd, we have that, for and , Therefore, we conclude that for all . [2 marks.]
We now show that . Recall that . Assume that there is a nonzero such that . Then, using the fact that is additive, we inductively have or for all . However, this is a contradiction to the given condition (i). [1 mark.]
It's now easy to check that is one-to-one. Assume that for some . Then, we have or . This implies that or , as desired. From (1) and the fact that is one-to-one, we deduce that for all . [1 mark.] This completes the proof.
---
Alternative solution.
Again, the only such function is the identity function on .
As in Solution 1, we first show that , , and . [2 marks.] From the latter follows and from condition (i) we get that only possibly for . [1 mark.]
Next we prove This is clear if . If then so which means . If we get similarly and again . [2 marks.]
Thus . Suppose that for some , where . Then from and for some we get , so . Thus for all except possibly . [1 mark.] But for example, and [1 mark.] This finishes the proof.
Final answer
f(x) = x
Techniques
Functional EquationsInjectivity / surjectivity