Find the number of functions such that f : R → R satisfying f ( x 2 + y f ( z ) ) = x f ( x ) + z f ( y ) for all x , y , z ∈ R .
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.
You never proved that f ( 1 ) = 0 .
Log in to reply
I first assume that if there exists some a = 0 for which f ( a ) = 0 , then the only possibility is that f ( x ) = 0 for all x ∈ R . Then I assume that no such a exists, and continue with the proof, so I'm assuming that f ( 1 ) = 0 there given I have already examined that case.
Log in to reply
sorry, wasn't attentive enough.. great solution. +1
When we put the values y = z = 0 ,
We get f ( x 2 ) = x f ( x )
This is true only when f ( x ) = α x , where α is some constant
So from LHS, we get f ( x 2 + y f ( x ) ) = α x 2 + α 2 y z
And from RHS we get x f ( x ) + z f ( y ) = α x 2 + α y z
Equating LHS and RHS we get α 2 = α
So, α ≡ 0 , 1
Thus answer is 2
Take x = 0 , we have f ( y f ( z ) ) = z f ( y ) , and y = 1 gives f ( f ( z ) ) = z f ( 1 ) .
If f ( 1 ) = 0 , then f ( f ( z ) ) = 0 for all z . This imply f ( 0 ) = f ( y f ( f ( z ) ) ) = f ( z ) f ( y ) for all y and z . Take y = z = 0 gives f ( 0 ) = 0 or f ( 0 ) = 1 . If f ( 0 ) = 1 , then f ( 1 ) = f ( f ( 0 ) ) = 0 , but then 1 = f ( 0 ) = f ( 1 ) f ( 1 ) = 0 , contradiction. So f ( 0 ) = 0 and f ( y ) f ( z ) = 0 for all y and z , which is f ( x ) = 0 for all x .
If f ( 1 ) = 0 then f bijective .Take a such that f ( a ) = 1 , then f ( y ) = a f ( y ) . If a = 1 , then f ( y ) = 0 for all y , contradicts surjectivity of f . If a = 1 , f ( f ( z ) ) = z , then f ( x 2 ) = x f ( x ) , gives f ( f ( x ) 2 ) = f ( x ) f ( f ( x ) ) = x f ( x ) = f ( x 2 ) , by injectivity, f ( x ) 2 = x 2 for all x . If there exist b such that f ( b ) = − b , then b 2 = f ( f ( b 2 ) ) = f ( b f ( b ) ) = b f ( b ) = − b 2 ⇒ b = 0 . So f ( x ) = x is a solution.
f ( x ) = x and f ( 0 ) = 0 are only solutions.
That was easier than I thought :)
Notice how you never proved injectivity, which you'll have to do to make this rigorous. And I don't follow your steps in the last line, namely b 2 = f ( f ( b 2 ) ) = ⋯ . Could you elaborate a bit?
Log in to reply
Once you get f ( f ( z ) ) = z f ( 1 ) , and f ( 1 ) = 0 , it is already very trivial to conclude that f is bijective.
For the last line, I did skipped a lot of details, sorry. Since f ( 1 ) = 1 , f ( f ( z ) ) = z for all z , so b 2 = f ( f ( b 2 ) ) . And since f ( x 2 ) = x f ( x ) , f ( f ( b 2 ) ) = f ( b f ( b ) ) . And since from the original equation, f ( y f ( z ) ) = z f ( y ) , so f ( b f ( b ) ) = b f ( b ) . And since by assumption that f ( b ) = − b , so b f ( b ) = − b 2 .
Please correct me for anything I had been wrong. Thanks :)
Log in to reply
Sorry, I missed where you said " f is bijective". This is a great proof, +1.
x → 0 , z → y ; f ( y f ( y ) ) = y f ( y )
By induction, f ( x ) = x .
By guessing; f ( x ) = 0 .
Therefore, number of solutions = 2 .
Note: not sure if it's okay to do this.
How did you use induction to prove f ( x ) = x for all real numbers? Are you sure this is possible? Besides, if you proved that f ( x ) = x , it would mean it is the only solution unless you'd assumed f ( x ) is different from f ( x ) = 0 before that. You've simply successfully guessed the 2 solutions that work, that is all, you haven't proved they are the only ones.
You cannot apply induction in this case. The solution is like this:
Clearly f ( 0 ) = 0
f ( x ) = 0 for all x is a solution. Suppose it is not zero for at least one x ∈ R :
1-First note that f ( z ) = f ( y ) for all z = y .
This is because if f ( z ) = f ( y ) then
f ( y f ( z ) ) = z f ( y )
f ( y f ( z ) ) = f ( y f ( y ) ) = y f ( y ) = z f ( y )
We can prove if f ( x ) = 0 for x = 0 then f ( y ) is zero for all y ∈ R .
2- Now f ( x 2 ) = x f ( x )
Also f ( x f ( x ) ) = x f ( x )
By (1) x f ( x ) = x 2 which means f ( x ) = x
Plugging in y = z = 0 , we find that f ( x 2 ) = x f ( x ) , or f ( 0 ) = 0 . Looking at the degree of f ( x ) in f ( x 2 ) = x f ( x ) , its degree must be either 0 or 1, as in f ( x ) = 0 or f ( x ) = a x + b . Plugging in f ( 0 ) = 0 , we find that f ( x ) = a x . Plugging this into the original, a = 1 , f ( x ) = 0 or x . Thus the number of solutions we have is 2 .
We don't know if it's a polynomial or not.
Letting x = 0 gives f ( y f ( z ) ) = z f ( y ) and f ( z f ( y ) ) = y f ( z ) after flipping y and z . From the second equation, you get f ( f ( z f ( y ) ) ) = f ( y f ( z ) ) , so f ( f ( z f ( y ) ) = z f ( y ) . This means for all x , f ( f ( x ) ) = x as long as there exists some n such that f ( n ) = 0 .
If no n exists satisfying that condition, then f ( n ) = 0 must be true for all n . This function satisfies the equation.
If y = z = 0 , you have f ( x 2 ) = x f ( x ) . If x = 0 and y = z , you have f ( y f ( y ) ) = y f ( y ) . Replacing y with x , you get f ( x f ( x ) ) = f ( x 2 ) from those two equations, which can be rewritten as f ( f ( x f ( x ) ) ) = f ( f ( x 2 ) ) = x f ( x ) = x 2 . Factoring this gives x ( f ( x ) − x ) = 0 , or f ( x ) = x for all x = 0 . You can prove if x = 0 , f ( x ) = 0 by letting x = y = z = 0 in the original equation.
There are 2 function that satisfy the equation.
Problem Loading...
Note Loading...
Set Loading...
Let P ( x , y , z ) be the statement f ( x 2 + y f ( z ) ) = x f ( x ) + z f ( y ) .
P ( 0 , 0 , 0 ) gives f ( 0 2 + 0 f ( 0 ) ) f ( 0 ) = 0 f ( 0 ) + 0 f ( 0 ) = 0 Now assume f ( a ) = 0 for some a ∈ R , a = 0 .
For any x ∈ R , P ( 0 , x , a ) gives f ( x f ( a ) ) f ( 0 ) 0 f ( x ) = a f ( x ) = a f ( x ) = a f ( x ) = 0 Note that f ( x ) = 0 is a solution, as P ( x , y , z ) gives f ( x 2 + y f ( z ) ) 0 = x f ( x ) + z f ( y ) = 0 + 0 Now to find any other solutions, we will assume that for x = 0 , f ( x ) = 0 .
Let f ( 1 ) = b . Then P ( 0 , 1 , 1 ) gives f ( f ( 1 ) ) f ( b ) = f ( 1 ) = b Further, P ( 0 , 1 , b ) gives f ( f ( b ) ) b b = b f ( 1 ) = b 2 = 1 as b = 0 . Therefore, f ( 1 ) = 1 .
Note that P ( 0 , 1 , x ) gives f ( f ( x ) ) = x . Now consider P ( x , 0 , 0 ) and P ( 0 , x , x ) for x = 0 . f ( x 2 ) = x f ( x ) f ( x f ( x ) ) = x f ( x ) Therefore, f ( x 2 ) f ( f ( x 2 ) ) x 2 f ( x ) = f ( x f ( x ) ) = f ( f ( x ( f ( x ) ) ) = x f ( x ) = x Note that f ( x ) = x is a solution, as P ( x , y , z ) gives f ( x 2 + y f ( z ) ) x 2 + y z = x f ( x ) + z f ( y ) = x 2 + y z We have fully examined the case where there exists a = 0 such that f ( a ) = 0 and the case where x = 0 implies f ( x ) = 0 . Therefore, the only two solutions are f ( x ) = 0 and f ( x ) = x