14.4: Algebraic lemma
( \newcommand{\kernel}{\mathrm{null}\,}\)
The following lemma was used in the proof of Proposition 14.3.1.
Assume f:R→R is a function such that for any x,y∈R we have
- f(1)=1,
- f(x+y)=f(x)+f(y),
- f(x⋅y)=f(x)⋅f(y).
Then f is the identity function; that is, f(x)=x for any x∈R.
Note that we do not assume that f is continuous.
A function f satisfying these three conditions is called a field automorphism. Therefore, the lemma states that the identity function is the only automorphism of the field of real numbers. For the field of complex numbers, the conjugation z↦ˉz (see Section 14.3) gives an example of a nontrivial automorphism.
- Proof
-
By (b) we have
By (a),
f(0)+1=1;
whence
f(0)=0.
Applying (b) again, we get that
0=f(0)=f(x)+f(−x).
Therefore,
f(−x)=−f(x) for any x∈R.
Applying (b) recurrently, we get that
f(2)=f(1)+f(1)=1+1=2;f(3)=f(2)+f(1)=2+1=3; ...
Together with 14.4.2, the latter implies that
f(n)=n for any integer n.
By (c)
Therefore
f(mn)=mn
for any rational number mn.
Assume a≥0. Then the equation x⋅x=a has a real solution x=√a. Therefore, [f(√a)]2=f(√a)⋅f(√a)=f(a). Hence f(a)≥0. That is,
a≥0 ⟹ f(a)≥0.
Applying 14.3.2, we also get
a≤0 ⟹ f(a)≤0.
Now assume f(a)≠a for some a∈R. Then there is a rational number mn that lies between a and f(a); that is, the numbers
have opposite signs.
By 14.4.3
y+mn=f(a)==f(x+mn)==f(x)+f(mn)==f(x)+mn;
that is, f(x)=y. By 14.4.4 and 14.4.5 the values x and y cannot have opposite signs — a contradiction.