MATH 103A HW 9 SOLUTIONS (NONAUTHORITATIVE)

Chapter 6 Problems Problem 6: We wish to nd Aut(Z). So suppose is an automorphism of Z. Then is determined by (1). To see this, suppose n Z, then since is a homomorphism, (n) = (n 1) = n(1). Now note that since is an automorphism, (1) must be a generator of Z, thus (1) {1, 1}. There are thus 2 elements of Aut(Z)., namely the identity automorphism, and the automorphism dened by (1) = 1. Problem 7: We wish to show that S4 is not isomorphic to D12 . To see this, note that D12 has elements of order 12, namely rotations by i/6, but S4 has no elements of order 12. Problem 30: Let G be a nite abelian group with no elements of order 2. Then the kernel of the map : g g 2 is trivial. But an injective function from a nite set to itself is also a surjection. Thus is an automorphism. Alternatively, we can see that is surjective as follows: Note that we must have |G| is odd, and in a group of odd order, every element is a square, by a previous homework assignment. To see that the result is not true if G is an innite group, consider G = Z. Then the map in question is x 2x. This is clearly not surjective since all odd numbers are not in the image. Problem 35: Let a G have nite order, and let a be the automorphism of G given by a (x) = axa1 . Let k = |a| and note that for any x G, k (x) = (axa1 )k = ak xak = x, so k is the a a identity automorphism, and thus |a | k. Alternatively, we can note that a is actually an inner automorphism, and we have an isomorphism Inn(G) G/Z(G), then use the fact that the order of aZ(G) divides the order of a. = Problem 40: Consider the group Q under addition, and let Aut(Q). Note rst that for any m Z, we have (m) = (m 1) = m(1). Also, for any 0 = n Z we have (1) = (n/n) = n(1/n), so dividing by n yields (1/n) = (1/n)(1). Putting this together, for any m/n Q, we have (m/n) = m(1/n) = (m/n)(1). Chapter 10 Problems Problem 2: That is a homomorphism is obvious: (xy) = |xy| = |x||y| = (x)(y). Problem 6: Let : R[x] R[x] denote the map, where we think of R[x] as a group under addition. Then (f + g) = f + g = (f ) + (g). The kernel is {f R[x] | f = 0} = {0}. Note that the
1

MATH 103A HW 9 SOLUTIONS (NONAUTHORITATIVE)

map is not a homomorphism if instead we use the antiderivative passing through the point (0, 1), for then (0 + 0) = (0) = 1, but (0) + (0) = 2.

Problem 8: That sgn is a homomorphism follows from what we know about the parity of products of two permutations. The kernel is the set of even permutations. Problem 9: Let : GH G be dened by (g, h) = g. Then ((g, h)(g h )) = (gg , hh ) = gg , and also ((g, h))((g h )) = gg , so it is a homomorphism. The kernel of is the set {(e, h) | h H}, which we can write more compactly as {e} H. Problem 10: Just recall that the composition of a rotation and a reection is (some other) reection, and that the composition of two reections is a rotation. The kernel is the set of rotations.

Problem 16: If is such a surjective homomorphism, then since the groups have the same (nite) order, would actually be an isomorphism. But note that Z8 Z2 has an element of order 8, while Z4 Z4 has no elements of order 8. Problem 18: There are no homomorphisms from Z4 Z4 onto Z8 , because if is a homomorphism from G to H, then |(x)| |x| for any x G. But Z4 Z4 has no elements of order 8. We also cant have any homomorphisms from Z16 onto Z2 Z2 since any homomorphic image of a cyclic group is cyclic. Problem 28: Let G be a group, and : G Z6 Z2 a surjective homomorphism with |Ker()| = 5. First note that this tells us that |G| = 5 12 = 60, and that Ker() is a normal subgroup of order 5. Since G is a normal subgroup of order 60, we just need to show that G has normal subgroups of orders 10, 15, 20 and 30. Note that we have the following surjective homomorphisms 1 2 3 4 : : : : Z6 Z2 Z6 Z2 Z6 Z2 Z6 Z2 Z6 given by (m, n) m Z2 given by (m, n) n Z3 given by (m, n) 3m Z2 Z2 given by (m, n) (2m, n)

The composite homomorphisms are surjections from G to groups of orders 6, 2, 3, and 4, respectively, so their kernels, which are normal subgroups of G, have orders 10, 30, 20, and 15 respectively. Alternatively, we can do the following. Recall that the inverse image of a normal subgroup under a homomorphism is again normal. That is, if N is any normal subgroup of Z6 Z2 , and 1 (N ) denotes the set {g G | (g) N }, then 1 (N ) is normal in G. Now, since Ker() has order 5, is a 5-to-1 map. So if N Z6 Z2 , then |1 (N )| = 5|N |. So we just need to nd normal subgroups of Z6 Z2 of orders 2, 3, 4, and 6. This is easy. Since Z6 Z2 is abelian, every subgroup is normal. So the subgroups (0, 1) , (2, 0) , (3, 0) (0, 1) , and (2, 0) (0, 1) have the prescribed orders.

MATH 103A HW 9 SOLUTIONS (NONAUTHORITATIVE)

Problem 38: Let M, N be normal subgroups of G with N M . We wish to prove that (G/N )/(M/N ) G/M . Consider the map from G/N to G/M given by gN gM . We = claim that this is a homomorphism. To see this, note that for g, h G, we have ((gN )(hN )) = (ghN ) = ghM and (gN )(hN ) = (gM )(hM ) = ghM . Now compute, Ker() = {gN G/N | gM = M } = {gN G/N | g M } = M/N. The result now follows from the rst isomorphism theorem. Problem 50: H is a subgroup. Note rst that e H. Now, if x, y H, then (xy 1 ) = (x)(y 1 ) = (x)(y)1 = (x)(y)1 = (xy 1 ). Problem 52: Let H, K be normal subgroups of G with H K = {e}. Consider the map : G G/H G/K given by (g) = (gH, gK). We claim that is a homomorphism. Note that for any x, y G, (xy) = (xyH, xyK) = (xH, xK)(yH, yK) = (x)(y). Whats the kernel? Well, Ker() = {g G | (gH, gK) = (H, K)} = H K = {e}, so is injective.