We begin our discussion with the following basic notion.
Clearly
if and only if
and
commute.
If we recall our discussion on the subgroup
generated by a subset of a group
, then
we know that
consists of all finite products of commutators
and inverses of commutators. (See Proposition 5.1.1.) However,
the inverse of a commutator is once again a
commutator (see exercise 1 for this section).
It then follows that
is precisely the set of all finite products
of commutators, i.e.,
is the set of all
elements of the form
The following proposition shows that the commutator subgroup is always normal.
Proof:
If
for
, and
,
is again a
commutator of elements of
. Now from our previous comments, an
arbitrary element of
has the form
,
where each
is a commutator.
Thus
and since by the above each
is a
commutator
.
Using Proposition 6.1.4, we have proven
.
We next contend that the factor group
is an
abelian group and that actually
is the smallest normal
subgroup that enjoys this property.
(Note that if
is a finite group and if
,
where
such that
is abelian, then
, so we are actually discovering
the ``largest'' abelian homomorphic image of
.)
Proof:
In order to establish the first part of the theorem,
let
and
be any two elements of
.
Then
Next let
. If
does not contain
,
then
certainly cannot contain all commutators of elements
of
(recall that the group generated by a set is the
smallest subgroup containing that set - see §5.1).
Thus let
be such that
.
Then
.
Hence
is non-abelian.
Taking the contrapositive completes the proof.
In general, we know (see exercise 8 for Section 6.1) that a normal subgroup of a normal subgroup need not be normal in the whole group. However, the following theorem shows that in the special case of the commutator subgroup of a normal subgroup, we can state that this is normal in the entire group.
Proof:
Let
where
. Then for an arbitrary
, we have
We consider next the following sequence of subgroups
of an arbitrary group G:
If
is abelian, then
,
and so an abelian group is solvable. The converse is
false, e.g.,
can be
shown to be solvable (see exercise 2 for this section),
but of course
is non-abelian. We also observe that
for
is not solvable.
We have
, for
, since by
Theorem 6.3.2 we know that
is simple (and non-
abelian) for
. We mention in passing
that the Feit-Thompson Theorem alluded to earlier (see the
beginning of Section 6.3) states:
Any group of odd order is solvable.