MA3202, ALGEBRA II 5
3. R ING H OMOMORPHISMS
Definition 3.1. Let R and S be two rings. A map f : R ! S is called a ring homomor-
phism if
(1) f (x + y) = f (x) + f (y) for all x, y 2 R,
(2) f (x.y) = f (x).f (y) for all x, y 2 R,
(3) when R and S have identity, f (1) = 1.
Remark 3.2. Note that the first two conditions on f do not ensure that f (1) = 1 even if
f is non-zero. Consider f : Z ! Z ⇥ Z defined by f (m) = (m, 0). Here Z ⇥ Z forms a
ring under the component wise addition and multiplication and the identity element
is (1, 1). But according to the definition of f , f (1) = (1, 0).
Observations:
Let f : R ! S is a ring homomorphism. Then
(i) f (0) = 0.
(ii) f ( a) = f (a) for all a 2 R.
(iii) f (a b) = f (a) f (b) for all a, b 2 R.
(iv) f (na) = nf (a) where n 2 Z.
Example 3.3. Let R be a ring. Then the map f : R ! R defined by f (x) = x is a ring
homomorphism.
Z
Example 3.4. The map f : Z ! nZ defined by f (k) = [k] is a ring homomorphism.
Definition 3.5. Let R and S be two rings. A ring homomorphism f : R ! S is called
an isomorphism if it is bijective (one-one and onto).
Definition 3.6. Two rings R and S are called isomorpohic if there is an isomorphism
between R and S.
Notation. We shall use the symbol R ' S to denote that R and S are isomorphic.
Example 3.7. Let R be a ring. Then the map f : R ! R defined by f (x) = x is an
isomorphism.
Z
Example 3.8. The map f : Z ! nZ defined by f (k) = [k] is not an isomorphism.
Example 3.9. Let C be the ring of complex numbers. Then the map f : C ! C defined
by f (z) = z̄ is an isomorphism (very easy to check!).
Theorem 3.10. The only isomorphism of Z onto Z is the identity map.
6 MA3202, ALGEBRA II
Proof. Let f : Z ! Z be an isomorphism and n 2 Z+ . Then (see (3.2(iv))),
f (n) = f (1 + · · · + 1) = f (1) + · · · + f (1) = nf (1) = n1 = n.
Now, let n 2 Z and n = m where m 2 Z+ . Then (see (3.2(ii))),
f (n) = f ( m) = f (m) = m = n.
Finally, we have f (n) = n for all n 2 Z. This completes the proof. ⇤
Theorem 3.11. The only isomorphism of Q onto Q is the identity map.
Proof. Let f : Q ! Q be an isomorphism and m/n 2 Q. Now by previous proof we
have f (m) = m. Now (see (3.2(iv)))
1 1 1 1
f (1) = f (n ) = nf ( ) =) f ( ) = .
n n n n
Finally, f (m/n) = f (1/n + · · · + 1/n) = mf (1/n) = m/n. This completes the proof. ⇤
Theorem 3.12. The only isomorphism of R onto R is the identity map.
Proof. Let f : R ! R be an isomorphism.
Step 1: f is strictly increasing.
Proof: First we show that f takes positive real numbers to positive real numbers. Let
p p p
x > 0. Then f (x) = f (( x)2 ) = (f ( x))2 > 0 as f ( x) 6= 0.
Let x < y. Then,
y x > 0 =) f (y x) > 0 =) f (y) f (x) > 0 =) f (y) > f (x).
This completes the proof of Step 1.
Step 2: In this step we prove our theorem. Let x 2 R. We want to show f (x) = x. If
not, then either f (x) > x or x > f (x). Assume that f (x) > x. We can find q 2 Q such
that x < q < f (x). Now, x < q =) f (x) < f (q) (by Step 1). But f (q) = q by previous
proof. Then we have f (x) < x, a contradiction.
Similarly, we can show that f (x) > x is not possible. This completes the proof. ⇤
bigskip
Theorem 3.13. An isomorphism f : C ! C taking R to R is of the form f (z) = z or f (z) = z̄.
Proof. Let f : C ! C be an isomorphism and z = x + iy 2 C, where x, y 2 R. Then
using previous theorem we have
f (z) = f (x + iy) = f (x) + f (i)f (y) = x + f (i)y.
MA3202, ALGEBRA II 7
Now
1 = f ( 1) = f (i2 ) = f (i)2 =) f (i) = ±i.
If f (i) = i, then f (z) = x + f (i)y = x + iy = z. If f (i) = i, then f (z) = x + f (i)y =
x iy = z̄. This completes the proof. ⇤
