One of the most useful facts about normal subgroups is the following result/definition.
for all
This group
is
called the quotient group
of
by
and is sometimes pronounced ``
mod
''.
Next we introduce an important idea first emphasized by E. Galois (October 1811-May 1832), the French mathematician mentioned in the introduction. Though Galois attended secondary school, he had trouble entering the French university system. Sadly, by the time he entered the École Normale Súperieure in November 1829, he also began to get caught up in the activities of the French revolution which toppled Charles X. His political activities resulted in him being expelled from schoolin December 1830. Though apparently he had been a rather rebellious teenager, this only frustrated him further. He died in a fight with another Frenchman.
Galois's work was the first to begin to illuminate the ``basic building blocks'' of the collection of finite groups (i.e., the analog of the idea that atoms are the ``basic building blocks'' of molecules). Galois introduced the ideas of solvable groups and normal groups. Roughly speaking, one may say that the basic building blocks of finite groups are those the groups which have no proper non-trivial normal subgroups. Intuitively, this is because a non-trivial quotient group (by a normal subgroup) is closely related to the original group but smaller in size (and hence perhaps subject to analysis by an inductive argument of some type). These basic building blocks are called ``simple'' groups.
All finite simple groups have been classified. In fact, the survey book discussing this is free and download able from [GLS].
Simple groups are not very abundant. In fact, the first
non-abelian simple group is of order
(it's
).
The following basic result, which generalizes the
above example, describes the quotient
group
.
proof:
is a normal subgroup of
, so
is a group. We must show that this group is isomorphic
to the group
. Define
by
, for
.
We must show
(a)
is well-defined,
(b)
is a homomorphism,
(c)
is a bijection.
If
then
,
since
is a group. This implies
, so
. This implies
is well-defined.
Since
is normal,
.
Therefore
, for all
.
This implies
is a homomorphism.
It is clear that
is surjective. To show that
is a bijection, it suffices to prove
is an injection.
Suppose that
, for
some
. Then
, so
. By definition of the kernel,
this implies
, so
. This implies
is injective.
In particular, if
and
are relatively prime
integers then
.
Indeed, by replacing
by
if necessary,
we may assume that
and
are relatively prime
integers. It suffices to show that the
kernel is trivial since both
and
have the same cardinality.
If
sends
to
(where
) then
, so
since
are relatively prime.
proof:
Then
is a subgroup of
and the map
defined by
sending
to
has kernel
.
By the first isomorphism theorem, we therefore have
(a) Describe
the elements in the stabilizer
as permutations in
array form
(recall (5.3) was the definition).
Is this a normal subgroup of
?
(b) Compute the orbit
.
(c) Show that there is a 1-1 correspondence between the
elements in the orbit
and elements in
. (Hint: See the proof of Proposition
5.13.2.)