How many functions f from the reals to the reals are there, such that f ( f ( x ) ) = x 2 − 2 ?
Details and assumptions
f need not be a polynomial. f need not even be continuous.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let g ( x ) = x 2 − 2 . Notice that if g ( x ) = x , then x 2 − 2 = x which has 2 distinct solutions, so g ( x ) has 2 fixed points. If g ( g ( x ) ) = x , then ( x 2 − 2 ) 2 − 2 = x ⇒ 0 = x 4 − 4 x 2 − x + 2 = ( x 2 − x − 2 ) ( x 2 + x − 1 ) has 4 distinct solutions, so g ( g ( x ) ) has 4 fixed points. We will show, by contradiction, that there are no functions f that satisfy f ∘ f = g .
Suppose that f exists. Let a and b be the distinct fixed points of g and let a , b , c and d be the distinct fixed points of g ∘ g . Let m = g ( c ) . Then g ( m ) = g ( g ( c ) ) = c , so g ( g ( m ) ) = g ( c ) = m , so m is a fixed point of g ∘ g . If m = a , then c = g ( m ) = g ( a ) = a is a contradiction. Similarly, if m = b , then c = g ( m ) = g ( b ) = b is a contradiction. If m = c , then c = g ( c ) so c is a fixed point of g , which is a contradiction. Thus, m = d . As such, g ( c ) = d , and we similarly have g ( d ) = c .
Now consider f ( x 1 ) for x 1 ∈ { a , b } . Since g ( f ( x 1 ) ) = f ( f ( f ( x 1 ) ) ) = f ( g ( x 1 ) ) = f ( x 1 ) , so f ( x 1 ) is a fixed point of g , thus f ( x 1 ) ∈ { a , b } . Similarly, consider f ( x 2 ) for x 2 ∈ { a , b , c , d } . Since g ( g ( f ( x 2 ) ) = f ( f ( f ( f ( f ( x 2 ) ) ) ) ) = f ( g ( g ( x 2 ) ) ) = f ( x 2 ) , so f ( x 2 ) is a fixed point of g , thus f ( x 2 ) ∈ { a , b , c , d } . Consider f ( c ) .
Case 1: f ( c ) = a . Then, f ( a ) = f ( f ( c ) ) = g ( c ) = d which is a contradiction.
Case 2: f ( c ) = b . Similarily, f ( b ) = f ( f ( c ) ) = g ( c ) = d which is a contradiction.
Case 3: f ( c ) = c . Then g ( c ) = f ( f ( c ) ) = f ( c ) = c which is a contradiction.
Case 4: f ( c ) = d . Then d = g ( c ) = f ( f ( c ) ) = f ( d ) ⇒ g ( d ) = f ( f ( d ) ) = f ( d ) = d which is a contradiction.
Hence, there are 0 functions f that satisfies the conditions.
Problem Loading...
Note Loading...
Set Loading...
The answer is that there are no such functions f . More generally, applying the below assertion to g ( x ) = x 2 − 2 to get a solution to the problem.
A more general assertion: If g is a function from R to itself such that g has exactly two fixed points { s , t } and if g ( g ( x ) ) has exactly four fixed points { s , t , u , v } then there is no function f such that f ( f ( x ) ) = g ( x ) .
Proof by contradiction: (Assuming there is f such that f ( f ( x ) ) = g ( x ) :-
Step 1: g ( u ) = v , g ( v ) = u .
Step 2: g ( f ( x ) ) = f ( g ( x ) ) .
Step 3: Using step 2 and the fact that s , t are the fixed points of g , we can show that f takes { s , t } to { s , t } and { s , t , u , v } to { s , t , u , v } .
Step 4: by further solving we can show that each possibility f ( v ) = s or t or u or v leads to a contradiction. so there is no function exist so that f ( f ( x ) ) = x 2 − 2 .
[Latex Edits - Calvin]