They both investigate the properties of a function
f
:
R
→
R
that satisfies the following:
f ( f ( x ) ) = x 3 , ∀ x ∈ R .
Antonio
: I have proved that
f
is a bijection.
Niccolò
: It is true that
[
f
(
x
)
]
3
=
f
(
x
3
)
,
∀
x
∈
R
.
Antonio
: I have shown that
[
f
(
−
1
)
]
3
+
[
f
(
1
)
]
3
=
f
(
0
)
.
Niccolò
: I have studied the intersection of the graph of
f
with the line
y
=
x
. It is impossible for them to have exactly two common points.
If the competition is won by the one who made less mistakes, then who is the winner?
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.
If f ( x ) = ∣ x ∣ 3 , then f ( − 1 ) = ∣ − 1 ∣ 3 = 1 and f ( f ( − 1 ) ) = f ( 1 ) = 1 . So this function does not satisfy f ( f ( x ) ) = x 3 .
Log in to reply
Damn it, you got me😅. I'm sorry, this function was the closest I could get though
Antonio's 1st statement is correct .
P r o o f :
Since
x
3
runs over all the real numbers,
f
is surjective.
Now,
f
(
a
)
=
f
(
b
)
⟹
f
(
f
(
a
)
)
=
f
(
f
(
b
)
)
⟹
a
3
=
b
3
⟹
a
=
b
, hence
f
is injective.
From the above we get that
f
is bijective.
□
Niccolò's 1st statement is correct .
P r o o f :
For all x ∈ R we have f ( f ( x ) ) = x 3 ⟹ f ( f ( f ( x ) ) ) = f ( x 3 ) ⟹ [ f ( x ) ] 3 = f ( x 3 ) □
Antonio's 2nd statement is wrong .
P r o o f :
We will use a counterexample:
f
(
x
)
=
⎩
⎪
⎪
⎪
⎨
⎪
⎪
⎪
⎧
x
3
−
(
−
x
)
3
0
1
if
x
>
0
and
x
=
1
if
x
<
0
if
x
=
1
if
x
=
0
It is easy to confirm that this function satisfies the given property.
At the same time,
[
f
(
−
1
)
]
3
+
[
f
(
1
)
]
3
=
(
−
1
)
3
+
0
3
=
−
1
=
1
=
f
(
0
)
□
Niccolò's 2nd statement is correct .
P r o o f :
Let
x
be the x-coordinate of a point of intersection of the graph of
f
and the line
y
=
x
.
Then
x
satisfies the equation
f
(
x
)
=
x
(
1
)
.
Consequently,
f
(
f
(
x
)
)
=
f
(
x
)
⟹
x
3
=
f
(
x
)
(
2
)
.
(
1
)
,
(
2
)
⟹
x
3
=
x
⟹
x
=
0
,
x
=
1
,
or
x
=
−
1
.
This means that the only possible values for the x-coordinates of the common points (if any) are 0 , 1 and − 1 .
Suppose there are exactly two points of intersection. We will examine the case that these are the ones with x-coordinates
0
and
1
, but the same way we can work for any other combination.
Then,
[
f
(
0
)
=
0
,
f
(
1
)
=
1
and
f
(
−
1
)
=
k
=
−
1
]
(
3
)
.
Thus, f ( f ( − 1 ) ) = f ( k ) ⟹ ( − 1 ) 3 = f ( k ) ⟹ − 1 = f ( k ) ⟹ f ( − 1 ) = f ( f ( k ) ) ⟹ k = k 3 ⟹ [ k = 0 , k = 1 , or k = − 1 ] .
The latter is impossible, because of ( 3 ) , since f is injective and this completes the proof. □
Summing up, Niccolò has no wrong statements, while Antonio has one. The winner is N i c c o l o ˋ .
In Niccolo's first statement, how did you write f ( f ( f ( x ) ) ) = [ f ( x ) ] 3 ?
Log in to reply
I used the initital property putting f(x) in the place of x.
Problem Loading...
Note Loading...
Set Loading...
f ( x ) = ∣ x ∣ 3
Antonio's 1st statement is wrong, as the function does not take every value in R , it's range is just from 0 to ∞
Niccolo's 1st statement is correct.
Antonio's 2nd statement is also wrong, as LHS = 2 while the RHS=0
Niccolo's 2nd statement is wrong, as the function's curve meets y = x at exactly 2 points.
Thus, Niccolo wins.
(This is just an example of such a function, there could be other functions that satisfy the given property)