Maths Olympiad Prep

Library / /161 of 299

Algebra Difficulty 6.5 National Olympiad Prove it Iran

Let g:CCg : \mathbb{C} \rightarrow \mathbb{C} be a surjective function. Find all complex functions f:CCf : \mathbb{C} \rightarrow \mathbb{C} such that for any two complex numbers x,yx, y, we have:
g(x)+f(y)=f(x)+g(y). |g(x) + f(y)| = |f(x) + g(y)|.

Solution

First, note that by surjectivity, we can find x0x_0 such that g(x0)=f(y0)g(x_0) = -f(y_0), the problem statement then implies f(x0)=g(y0)f(x_0) = -g(y_0). By setting y=y0y = y_0, x=x0x = x_0 in the problem statement, we have:
g(y)g(y0)=f(y)f(y0) |g(y) - g(y_0)| = |f(y) - f(y_0)|
Note that f(x)f(x) is a function of g(x)g(x) because if g(x0)=g(x1)g(x_0) = g(x_1), then according to the above relation, f(x0)=f(x1)f(x_0) = f(x_1). Knowing the value of ff at three points g(x0)=0g(x_0) = 0, g(x1)=1g(x_1) = 1, g(x2)=ig(x_2) = i, the value of ff is uniquely determined. Because for each point xx, there is a unique point f(x)f(x) such that the distance of ff from
f(x0),f(x1),f(x2) f(x_0), f(x_1), f(x_2)
would be equal to the distance of g(x)g(x) from
g(x0),g(x1),g(x2) g(x_0), g(x_1), g(x_2)
According to the relation we obtained, the image of
f(x0),f(x1),f(x2) f(x_0), f(x_1), f(x_2)
must be an isosceles right triangle with side length one, any such triangle can be obtained by a reflection across the x-axis, a translation, and a rotation from the triangle with vertices (0,0)(0, 0), (1,0)(1, 0), (0,1)(0, 1). Therefore, f(x)=cg(x)+df(x) = c g(x) + d or f(x)=cg(x)+df(x) = c \overline{g}(x) + d where cc is on the unit circle. By substituting the first expression and surjectivity in the original problem statement, we have:
cx+y+d=cy+x+d |c x + y + d| = |c y + x + d|
If c1c \neq -1, then the two expressions cx+yc x + y and cy+xc y + x can be made equal to any arbitrary two complex numbers, which leads to a contradiction. If c=1c = 1, the statement is clearly true. If c=1c = -1, then z+d=z+d|z + d| = |-z + d| implies d=0d = 0. If we substitute the second expression, we have:
cx+y+d=x+cy+d=cx+y+cd |c x + y + d| = |x + c \overline{y} + d| = |c x + y + c d|
Therefore, since cx+yc x + y can be any arbitrary complex number, it is necessary and sufficient that:
d=cd    d2=cd d = \overline{c} d \implies d^2 = c|d|
Therefore, the solutions are:
f(x)=g(x)+df(x)=g(x)f(x)=c2g(x)+rc \begin{aligned} f(x) &= g(x) + d \\ f(x) &= -g(x) \\ f(x) &= c^2 g(x) + r c \end{aligned}
where c=1c = 1 implies rRr \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 reproduced verbatim; metadata (topic, difficulty) added by this project.