Question 1.
Let f f f be a homomorphism from Z \mathbb{Z} Z to Z \mathbb{Z} Z . Prove that either f ( x ) = 0 f(x)=0 f ( x ) = 0 for every x ∈ Z x\in\mathbb{Z} x ∈ Z , or f ( x ) = x f(x)=x f ( x ) = x for every x ∈ Z x\in\mathbb{Z} x ∈ Z .
Solution.
Consider f ( 1 ) f(1) f ( 1 ) . Since f f f is a homomorphism of rings, we have
f ( 1 ) 2 = f ( 1 2 ) = f ( 1 ) . f(1)^{2}=f(1^{2})=f(1). f ( 1 ) 2 = f ( 1 2 ) = f ( 1 ) .
Therefore, f ( 1 ) ( f ( 1 ) − 1 ) = 0 f(1)(f(1)-1)=0 f ( 1 ) ( f ( 1 ) − 1 ) = 0 , i. e. either f ( 1 ) = 0 f(1)=0 f ( 1 ) = 0 or f ( 1 ) = 1 f(1)=1 f ( 1 ) = 1 .
Suppose f ( 1 ) = 0 f(1)=0 f ( 1 ) = 0 . Then for any x ∈ Z x\in\mathbb{Z} x ∈ Z :
f ( x ) = f ( x ⋅ 1 ) = f ( x ) f ( 1 ) = f ( x ) ⋅ 0 = 0 , f(x)=f(x\cdot 1)=f(x)f(1)=f(x)\cdot 0=0, f ( x ) = f ( x ⋅ 1 ) = f ( x ) f ( 1 ) = f ( x ) ⋅ 0 = 0 ,
so f f f is the zero homomorphism.
Now let f ( 1 ) = 1 f(1)=1 f ( 1 ) = 1 . Then for any x > 0 x>0 x > 0 we have
f ( x ) = f ( 1 + ⋯ + 1 ⏟ x t e r m s ) = f ( 1 ) + ⋯ + f ( 1 ) ⏟ x t e r m s = 1 + ⋯ + 1 ⏟ x t e r m s = x . f(x)=f(\underbrace{1+\cdots+1}_{x\,terms})=\underbrace{f(1)+\cdots+f(1)}_{x\,terms}=\underbrace{1+\cdots+1}_{x\,terms}=x. f ( x ) = f ( x t er m s 1 + ⋯ + 1 ) = x t er m s f ( 1 ) + ⋯ + f ( 1 ) = x t er m s 1 + ⋯ + 1 = x .
Furthermore, if x < 0 x<0 x < 0 , then − x > 0 -x>0 − x > 0 , so
f ( x ) = f ( − ( − x ) ) = − f ( − x ) = − ( − x ) = x . f(x)=f(-(-x))=-f(-x)=-(-x)=x. f ( x ) = f ( − ( − x )) = − f ( − x ) = − ( − x ) = x .
Finally, f ( 0 ) = 0 f(0)=0 f ( 0 ) = 0 , because is the zero of Z \mathbb{Z} Z . Thus, f f f is the identity homomorphism in this case. ∎