Browse · MathNet
PrintProblems from Ukrainian Authors
Ukraine algebra
Problem
Find all bijections such that, for any the following is satisfied:
(Oleksii Masalitin, Fedir Yudin)
(Oleksii Masalitin, Fedir Yudin)
Solution
Denote the statement by , and let denote the substitutions into it. Let be the real number such that . Let denote the set of such that . Then . We prove several lemmas:
Lemma 1. If , then . Proof. Use : .
Lemma 2. If , then . Proof. Denote by the real number that satisfies . Use : , so . We get and , so .
Lemma 3. If , then . Proof. From Lemma 2 we have . Use .
Lemma 4. The function is a surjection. Proof. Use and get . Consider arbitrary . Take such that . Substitute it into the last equality to get , as desired.
Lemma 5. If , then . Proof. Suppose the contrary, let , but . Since , we have . Choose real with . Then there is a real such that . Then . Then there is a real such that . From here we get , which is a contradiction, and the proof of the lemma is complete.
Lemma 6. The function is increasing on . Proof. It suffices to prove that for any positive with we have . Consider such that , and . Since , we have . Then as desired.
From Lemma 1, , , , etc., so contains arbitrary large reals. Let us prove that contains arbitrary small (close to zero) reals. Consider arbitrary . It suffices to prove that . From Lemma 2, we have that if . Since , we have , , , etc., so there is . Denote by the real such that . Use . Since , we have . This means .
Therefore and . We have proven that contains arbitrarily large and arbitrarily small numbers.
Suppose that . Let us prove that there is , lying between and . Suppose otherwise. We've proven that there are such that . Consider the following process: given such that , consider , the midpoint of . By Lemma 3, it lies in and by our assumption is not between and . This means that the closed interval between and lies entirely either in or . Then we can choose one of these intervals and repeat the operation. Since after each step the length of the interval halves, it will eventually be smaller than the length of the interval between and , leading to a contradiction.
Thus, there is between and . Since is increasing, . This contradiction proves that , so . It's easy to check that all functions of the form with satisfy the statement.
Lemma 1. If , then . Proof. Use : .
Lemma 2. If , then . Proof. Denote by the real number that satisfies . Use : , so . We get and , so .
Lemma 3. If , then . Proof. From Lemma 2 we have . Use .
Lemma 4. The function is a surjection. Proof. Use and get . Consider arbitrary . Take such that . Substitute it into the last equality to get , as desired.
Lemma 5. If , then . Proof. Suppose the contrary, let , but . Since , we have . Choose real with . Then there is a real such that . Then . Then there is a real such that . From here we get , which is a contradiction, and the proof of the lemma is complete.
Lemma 6. The function is increasing on . Proof. It suffices to prove that for any positive with we have . Consider such that , and . Since , we have . Then as desired.
From Lemma 1, , , , etc., so contains arbitrary large reals. Let us prove that contains arbitrary small (close to zero) reals. Consider arbitrary . It suffices to prove that . From Lemma 2, we have that if . Since , we have , , , etc., so there is . Denote by the real such that . Use . Since , we have . This means .
Therefore and . We have proven that contains arbitrarily large and arbitrarily small numbers.
Suppose that . Let us prove that there is , lying between and . Suppose otherwise. We've proven that there are such that . Consider the following process: given such that , consider , the midpoint of . By Lemma 3, it lies in and by our assumption is not between and . This means that the closed interval between and lies entirely either in or . Then we can choose one of these intervals and repeat the operation. Since after each step the length of the interval halves, it will eventually be smaller than the length of the interval between and , leading to a contradiction.
Thus, there is between and . Since is increasing, . This contradiction proves that , so . It's easy to check that all functions of the form with satisfy the statement.
Final answer
All functions f(x) = c x with c > 0.
Techniques
Functional EquationsInjectivity / surjectivity