Olympiad Maths Prep

Track / Stage 6 / 24 of 400 #1024 of 2000

Problem 1024

National olympiad, first round
Algebra Difficulty 6.0 Prove it

. Does there exist a function ff from R\mathbb{R} to R\mathbb{R} such that f(f(x))=x22f(f(x))=x^{2}-2 for all xx?

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

. We show that no such function ff exists. Suppose ff satisfies the condition. Let g(x)=x22=f(f(x))g(x)=x^{2}-2=f(f(x)) and h(x)=g(g(x))=x44x2+2h(x)=g(g(x))=x^{4}-4 x^{2}+2. The key is to involve the fixed points of gg and hh. A simple calculation shows that the fixed points of gg (i.e., the solutions of g(x)=xg(x)=x) are -1 and 22; the set SS of fixed points of hh is {1,2,a,b}\{-1,2, a, b\} with
a=(1+5)/2a=(-1+\sqrt{5}) / 2 and b=(15)/2b=(-1-\sqrt{5}) / 2. It is easy to see that {1,2}\{-1,2\} and SS are stable under ff: indeed, a fixed point uu of gg satisfies g(u)=ug(u)=u and thus g(f(u))=f(f(f(u)))=f(g(u))=f(u)g(f(u))=f(f(f(u)))=f(g(u))=f(u), so f(u)f(u) is a fixed point of gg. The same argument applies to hh. Since SS is stable under ff and the restriction of f4f^{4} is the identity on SS, we see that ff induces a bijection ff^{\prime} of SS onto SS. Let gg^{\prime} be the bijection induced by gg on SS. We see that g(1)=1,g(2)=2,g(a)=bg^{\prime}(-1)=-1, g^{\prime}(2)=2, g^{\prime}(a)=b and g(b)=ag^{\prime}(b)=a. It is easy to observe that the relation ff=gf^{\prime} \circ f^{\prime}=g^{\prime} leads to a contradiction: since {1,2}\{-1,2\} is stable under ff^{\prime}, the same is true for {a,b}\{a, b\}; then f(a)=af^{\prime}(a)=a and f(b)=bf^{\prime}(b)=b, or f(a)=bf^{\prime}(a)=b and f(b)=af^{\prime}(b)=a. In both cases, f(f(a))=af^{\prime}\left(f^{\prime}(a)\right)=a, contradicting g(a)=bg^{\prime}(a)=b.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.