Section 3.

3. Clearly f is 1-1 and onto. Also, f (a + b) = (a + b, a + b) = (a, a) + (b, b) =

f (a) + f (b), and f (ab) = (ab, ab) = (a, b)(a, b) = f (a)f (b). Thus f is an isomor-
phism.
5. Clearly f is 1-1 and onto. Also, f (a + b) = (a + b, 0S ) = (a, 0S ) + (b, 0S ) =
f (a) + f (b), and f (ab) = (ab, 0S ) = (a, 0S )(b, 0s ) = f (a)f (b). Thus f is an iso-
morphism.
6. The function f given in the hint is 1-1 and onto, and satisfies f (a + b) =
f (a) + f (b), f (ab) = f (a)f (b) (check), so f is an isomorphism.

a 0
8. Let S be the ring of all 22 matrices of the form . Define f : R S
0 a

a 0
by f (a) = . Then f is 1-1 and onto, and satisfies f (a+b) = f (a)+f (b),
0 a
f (ab) = f (a)f (b) (check), so f is an isomorphism.
9. By Theorem 3.12, f (1) = 1, so f (2) = f (1 + 1) = f (1) + f (1) = 1 + 1 = 2,
and inductively f (n) = n for all positive n. Also 0 = f (0) = f (n + n) =
f (n) + f (n) = n + f (n), so that f (n) = n, for all positive n. Hence f is
the identity map.
10(a). No. f (xy) = xy 6= f (x)f (y)
10(b). Yes. f (xy) = xy = xy = (x)(y) = f (x)f (y) in Z2 , and f (x + y) =
(x + y) = x y = f (x) + f (y).
10(c). No. g(1) 6= 1.
10(d). No. h(1) 6= I2 = 1M2 (R) .
10(e). Yes. f ([x]12 + [y]12 ) = f ([x + y]12 ) = [x + y]4 = [x]4 + [y]4 = f ([x]12 ) +
f ([y]12 ); and similarly f ([x]12 [y]12 ) = f ([x]12 )f ([y]12 ).
11(a). eg f : Z Z defined by f (n) = 2n.
11(b). eg f : Z Z defined by f (n) = n2 .

1

1 0 1 0
23. Clearly f is surjective, but not injective since eg and
2 3 4 5
both map to 1. It is straightforward to check f (A + B) = f (A) + f (B), f (AB) =
f (A)f (B), for elements A, B L.
25(a). f g(r1 + r2 ) = f (g(r1 + r2 )) = f (g(r1) + g(r2 )) = f (g(r1)) + f (g(r2 )) = f
g(r1 )+f g(r2 ); and f g(r1 r2 ) = f (g(r1r2 )) = f (g(r1 )g(r2)) = f (g(r1 ))f (g(r2)) =
f g(r1)f g(r2 ), so f g is a homomorphism.
25(b). Follows from function theory, the composition of two injective (surjective)
maps is injective (surjective).
28. Let k1 , k2 K. Then f (k1 k2 ) = f (k1 ) f (k2 ) = 0S 0S = 0S ; thus
k1 k2 K. Also, f (k1 k2 ) = f (k1 )f (k2 ) = 0S 0S = 0S , so that k1 k2 K. Thus
by the subring criterion, K is a subring of R.
29. Let p1 , p2 P , so that f (p1 ), f (p2 ) T . Then f (p1 p2 ) = f (p1 )f (p2 ) T ,
so p1 p2 P by definition of P . Similarly, f (p1 p2 ) = f (p1 )f (p2 ) T since T
is closed under multiplication. Thus p1 p2 P . By the subring criterion, P is a
subring of R.