Scribd
Upload
93 views4 pages

Mit Ocw: 18.703 Modern Algebra Prof. James Mckernan

The document discusses the alternating groups, which are subgroups of symmetric groups. It defines even and odd permutations, and proves that a permutation cannot be both even and odd. This is used to define the alternating group An as the kernel of a homomorphism from the symmetric group Sn to Z2, consisting of even permutations. A key result is that for n ≥ 5, the only normal subgroup of Sn is An, and An is a simple group with no proper normal subgroups. For n = 4, A4 is not simple as it has a normal subgroup of order 4.

Uploaded by

teesri_aankh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
93 views4 pages

Mit Ocw: 18.703 Modern Algebra Prof. James Mckernan

The document discusses the alternating groups, which are subgroups of symmetric groups. It defines even and odd permutations, and proves that a permutation cannot be both even and odd. This is used to define the alternating group An as the kernel of a homomorphism from the symmetric group Sn to Z2, consisting of even permutations. A key result is that for n ≥ 5, the only normal subgroup of Sn is An, and An is a simple group with no proper normal subgroups. For n = 4, A4 is not simple as it has a normal subgroup of order 4.

Uploaded by

teesri_aankh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MIT OCW: 18.703 Modern Algebra Prof.

James McKernan
11. The Alternating Groups
Consider the group S
3
. Then this group contains a normal subgroup,
generated by a 3-cycle.
Now the elements of S
3
come in three types. The identity, the prod-
uct of zero transpositions, the transpositions, the product of one trans-
position, and the three cycles, products of two transpositions. Then
the normal subgroup above, consists of all permutations that can be
represented as a product of an even number of transpositions.
In general there is no canonical way to represent a permutation as a
product of transpositions. But we might hope that the pattern above
continues to hold in every permutation group.
Denition 11.1. Let S
n
be a permutation.
We say that is even if it can be represented as a product of an even
number of transpositions. We say that is odd if it can be represented
as a product of an odd number of transpositions.
The following result is much trickier to prove than it looks.
Lemma 11.2. Let S
n
be a permutation.
Then is not both an even and an odd permutation.
There is no entirely satisfactory proof of (11.2). Here is perhaps the
simplest.
Denition 11.3. Let x
1
, x
2
, . . . , x
n
be indeterminates and set

f(x
1
, x
2
, . . . , x
n
) = (x
i
x
j
).
i<j
For example, if n = 3, then
f(x
1
, x
2
, x
3
) = (x
1
x
2
)(x
1
x
3
)(x
2
x
3
).
Denition 11.4. Given a permutation S
n
, let

g =

(f) = (x
(i)
x
(j)
).
i<j
Suppose that = (1, 2) S
3
. Then
g =

(f) = (x
2
x
1
)(x
2
x
3
)(x
1
x
3
) = (x
1
x
2
)(x
1
x
3
)(x
2
x
3
) = f.
The following Lemma is the key part of the proof of (11.2).
Lemma 11.5. Let and be two permutations and let = . Then
(1)

(f) = f.
(2)

(f) =

(f)).
(3)

(f) = f, whenever is a transposition.


1

MIT OCW: 18.703 Modern Algebra Prof. James McKernan


Proof. g is clearly a product of terms of the form x
i
x
j
or x
j
x
i
,
where i < j. Thus g = f. Hence (1).


(

(f)) =

( (x
(i)
x
(j)
)
i<j
= (x
(((i))
x
((j))
)
i<j
= (x
(i)
x
(j)
)
i<j
=

(f).
Hence (2).
Suppose that = (a, b), where a < b. Then the only terms of f
aected by are the ones that involve either x
a
or x
b
. There are three
cases:
i = b = a and j
i = a and j = b
i = a and j = b.
Suppose i a and j = b. If i < a, then x
i
x
b
is sent to x
i
x
a
=
and there is no change of sign. If a < i < b then x
a
x
i
is sent to
x
b
x
i
= (x
i
x
b
). Thus there is a change in sign. If i > b then
x
a
x
i
is sent x
b
x
i
and there is no change in sign.
Similarly if i = a and j If j < a or j > b there is no change in = b.
sign. If a < j < b there is a change in sign. But then the rst two cases
contribute in total an even number of signs changes (in fact, there will
be exactly (a b 1) + (a b 1) = 2(a b 1) sign changes).
Finally we need to consider the case i = a and j = b. In this case
x
a
x
b
gets replaced by x
b
x
a
and there is a change in sign. Hence
(3). D
Proof. Suppose that is a product of an even number of transpositions.
Then by (2) and (3) of (11.5),

(f) = f. Similarly if

(f) is a product
of an odd number of transpositions, then

(f) = f. Thus cannot


be both even and odd. D
Denition-Lemma 11.6. There is a surjective homomorphism
: S
n
Z
2
The kernel consists of the even transpositions, and is called the alter-
nating group A
n
.
Proof. The map sends an even transposition to 1 and an odd transposi-
tion to 1. (2) of (11.5) implies that this map is a homomorphism. D
2

MIT OCW: 18.703 Modern Algebra Prof. James McKernan


Note that half of the elements of S
n
are even, so that the alternating
group A
n
contains
n
2
!
. One of the most important properties of the
alternating group is,
Theorem 11.7. Suppose that n = 4.
The only normal subgroup of S
n
is A
n
. Moreover A
n
is simple, that
is, A
n
has no proper normal subgroups.
If n = 4 then we have already seen that
{e, (1, 2)(3, 4), (1, 3)(2, 4), (1, 4)(2, 3)}.
is a normal subgroup of S
4
. In fact it is also a normal subgroup of A
4
,
so that A
4
is not simple.
3
=
MIT OpenCourseWare
http://ocw.mit.edu
18.703 Modern Algebra
Spring 2013
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like