You are on page 1of 1

Conjugacy 145

But [G:C(a)] = G

so
eachtermin2[G:C()].has theformp with k2 1. Hence |G|-[G:C(a)]= |Z(G)}, Z(G)
term on the lef is divisible by p. It follows thatp also divides Z(G)| and 4G) #1
Proposition -4
ifG=p. p prime, then either G Z, or G=7, * Z,
Proof: If G is cyclic, G= Z, and we are done.
Suppose G is not cyclic. Then only non identity element has order p.
Ifg*e, Fg>| divides p?, and 1<g>|<p, so g>l=p.
By Theorem 6.17, we can find g, e Z(G), 8, * e, then
<g,Z,
Now take s, e
G-g, then g,> s Z
Because g, e Z(G), g, and g, coincide.

Next, we claim that <g,OS=e.


In fact g>Og>| divides Ig,>|=p.
So,either I8,>OB>= | and <g>n8>={e), as desired, or K8>n =ks,and
S 8= 8 then g, e g , contrary to the construction.
So, g s8,>= {e}.
Then is
gg, a subgroup of Gisomorphic to Z, x
Z,
But
(G=p, so G= <g,O8:4,*
Proposition -5
Groups of order p?, are abelian, wherep is prime.
Proof: If |G| =p* and Z(G) * G then let a e G-Z(G). Then C(a) is a subgroup containing
both a and Z(G), with |Z(G}} 2 p. by Burnside Theorem. This shows that C(a) = G a contradiction
Thus Z(G)=G and so G is abelian.
Alternatively (1)
By Theorem 6.17 and Lagrange's theorem, |Z(G)) =p or p'
Ifz(G)=p , then G = Z(G) and G is abelian

If|Z(G)]=p, then |G/Z{G)]=p, so that G/Z(G) is cyclic.


But G is abelian, by the G/Z theorem.
The G/Z Theorem: ILet G be a group and let Z(G) be the center of G. If G/Z(G) is cyclic, than
G is abelian]

Alternatively (2)
Let (G= p?.

You might also like