Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

1 Section 1

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

1

Section 1

1. Show that every group of order 5 is abelian.


Clearly, the trivial group 1 is abelian. Moreover, every group of prime order
is cyclic, hence abelian. The only groups left to check are those of order 4.
Let G be a group of order 4. To prove that G is abelian, it suffices to show
that the center of G is all of G. By way of contradiction, suppoze Z(G) 6= G.
Then, since Z(G) is a sub-group of G, it must have order 1 or order 2. But
G is a finite p-group and hence by Theorem 6.5 has a non-trivial center. So,
Z(G) 6= 1.
2. Show that there are two non-isomorphic groups of order 4, namely the
cyclic one, and the product of two cyclic groups of order 2.
Clearly, there exists a cyclic group with 4 elements.
6. Prove that the group of inner automorphisms of a group G is normal
in Aut(G).
Solution:
Let inn(G) denote the group of inner automorphisms of G. Then
inn(G) = {a |a G}

(1)

a : G G by a (g) = a1 ga

(2)

where
Let Aut(G) and compute
(a ( 1 (g))) = (a1 1 (g)a)
= (a1 ) ( 1 (g)) (a)
= 1 (a)g (a)
= (a) (g) inn(G).
Hence, inn(G) C Aut(G).
7. Let G be a group such that Aut(G) is cyclic. Prove that G is abelian.
Solution:
Lemma: G/Z(G)
= inn(G).

(3)

Proof: Let : G inn(G) by (g) = g . Clearly, is surjective. Moreover,


Ker() = {g G|g = } where  is the identity mapping. Hence, g
Ker() = g 1 ag = a a G = ag = ga a G = g Z(G).
Hence Ker() = Z(G). By the 1st Isomorphism Theorem for Groups,
G/Z(G)
= inn(G).
Lemma: Let H be a subgroup of a group G such that H Z(G). Then if
G/H is cyclic, then G is abelian.
12. Let G be a group and let H, N be subgroups with N normal. Let
x be conjugation by an element x G.
(a) Show that x 7 x induces a homomorphism f : H 7 Aut(N ).
Solution: Define a collection of automorphisms h : N 7 N .
h (n) = h n = hnh1

(4)

Clearly h Aut(G) for all h H. Now define f : H 7 Aut(G) by


f (h) = h

(5)

To see that f is indeed a homomorphism we compute


f (h1 h2 ) = h1 h2 ,

(6)

where
1
h1 h2 (n) = h1 h2 n = (h1 h2 )n(h1 h2 )1 = h1 h2 nh1
2 h1 = h1 (h2 n) = h1 (h2 (n))
(7)
Therefore
f (h1 h2 ) = h1 h2 = h1 h2
(8)

which proves that f is a homomorphism from H to Aut(G) induced by x .

You might also like