In abstract algebra, finite group theory is in its core. Now from Lagrange theorem, we have
Lemma 1 Let be a subgroup of a finite group
. Then the order of
is a divisor of the order of
.
This theorem states the necessary condition for a finite group to be a subgroup of a finite group
. But it does not give us the sufficient condition for a finite group to be a subgroup of another finite group. i.e. the converse is false.
For example, given alternating group of order
, there does not exist a subgroup of order
. (The proof of this part will be remained to the reader.)
Suppose that the order of a finite group is , how do we know whether there exists a subgroup of order a divisor of
? Sylow Theorems give the answer.
There are in fact three theorems in the set of Sylow Theorems. Let us state them one by one
Theorem 1 (First Sylow Theorem) Let be a finite group and let
where
and where
does not divide
. Then
contains a subgroup of order
for each
where
.
- Every subgroup
of
of order
is a normal subgroup of a subgroup of order
for
.
Before stating the Second Sylow Theorem, we require some terminology right now.
Definition 1 A -group is a group such that each element in the group has order a power of
.
Definition 2 A Sylow –subgroup
of a group
is a maximal
-subgroup of G, that is, a
-subgroup contained in no larger
-subgroup.
Now we continue with the Second Sylow Theorem.
Theorem 2 (Second Sylow Theorem) Let and
be Sylow
-subgroups of a finite group
. Then
and
are conjugate subgroups of
.
Theorem 3 (Third Sylow Theorem) If is a finite group and
divides
then the number of Sylow
-subgroups is congruent to
modulo
and divides
.
As the Second and Third Sylow Theorem are quite complex, and our main focus would be finding the converse of Lagrange theorem, so we will only delve into the First Sylow Theorem.
Proof and idea. We use induction in proving this theorem. As by Cauchy theorem, there exists a subgroup of order . If we can use induction on the power of
, then we are done.
As Sylow Theorem is highly related to the concept of cosets and normalizer group, we can consider the group , which we denote as normalizer of
in
.
Lemma 2 Let be a
-subgroup of a finite group
. Then
Continuing our proof, as is a normal subgroup of
, we can form the factor group
. Suppose that this factor is of order power of
, then by Cauchy theorem again, there exists a subgroup
of order
, and using canonical homomorphism we could proceed our induction.
Let be a subgroup of order
, where
, so
divides
. By Lemma 2, we derive that
divides
. Therefore the factor group
has a subgroup
of order
.
Consider the canonical homomorphism
Then has order
. Thus our proof is complete. The second part follows immediately from part 1.
Applications
Proposition 1 No group of order for
is simple.
Proposition 2 No group of order
is simple.
Proof. By the First Sylow Theorem, has a Sylow
-subgroup. Also, by the Third Sylow Theorem, the number of such Sylow
-subgroups of
is
and is a divisor of
. So the number of such subgroups is
. As the only Sylow
-subgroup, it must be a normal subgroup of
. Thus
is not simple.
Leave a Reply