Next: Factorization of Orders Between
Up: Simple Groups of Order
Previous: Useful Theorems
Theorem 1.1 If
for some prime p,
then P is abelian.
proof:
therefore
is
cyclic. Let x and
and
and choose
.
Since
>
<x,y>. Clearly,
and so the mapping
is an isomorphism. But
is an abelian group and isomorphisms preserve
structure. Thus,
must be an abelian group. Therefore
is not simple because it must have a subgroup of order
p and all subgroups must be normal in an abelian group. No groups of
order p2 are simple.
Theorem 1.2 A group
with order equal to pq for
pq primes and p < q contains a normal Sylow q-subgroup.
It follows that no group with order pq is simple. The proof follows
directly from Sylow's Theorem. Sylow q-subgroups exist and
.
Therefore, nq = 1 and
contains a normal Sylow
q-subgroup.
Theorem 1.3 If
is a proper subgroup of
,
then
is contained in
.
proof:
If
Therefore,
.
Suppose that
.
We
will prove this case by induction on the order of
.
If
then
is abelian and
Assume that for all groups with order
that
.
Let
.
and so form the factor group
.
The subgroup
maps to a subgroup of
the factor group. But the order of the factor group
<
.
So the normalizer in the
factor group contains the subgroup mapped by
,
and this
subgroup correlates to
So by induction
.
Theorem 1.4 (Frattini Argument) Let
and
.
Then,
and
divides
.
proof:
.
Let
.
Then
.
So both
and
.
By Sylow's Theorem, there exists an
such that
.
Therefore,
and
.
Theorem 1.5 If
then
.
Furthermore,
.
Lemma: If
is simple and
then
.
proof:
Let
.
By lemma
.
Frattini's Argument gives that
and so
.
Therefore
(which is the same as
)
must be a subgroup of index 2 in
,
because of the following
The proof is complete.
Theorem 1.6 Let G be a group of order
Then if
H is a normal subgroup of G then H contains a normal subgroup of
every divisor pb of
.
In particular, G has a normal
subgroup of every order pb for
.
In order to prove this we introduce the following lemma:
.
Therefore, by Cauchy's Theorem,
contains a
normal subgroup Z* of Z(G) of order p.
proof:
If the order of G is p2 we've already proved this. So assume that
this holds true for all
.
Choose G with order
pa. Z(G) commutes with everything so it is normal in
G. Because
we can form the factor
group G/Z(G) which has order
.
By induction, this
factor group has normal subgroups, call them
Z*i for all
i that divide
.
But the pre-image of
each subgroup
Z*(G)i is normal in G. Therefore, G has a
normal subgroup for every order
.
The proof is complete.
Next: Factorization of Orders Between
Up: Simple Groups of Order
Previous: Useful Theorems
2001-05-08