Sean Li Math 4340 Notes Spring 2013 Abstract Algebra Lecture 13 2/18/13 Conjugation (Renaming) Principle. Let , be permutations.

ns. Can be conjugated as = 1 . Cycle Structures. Any two permutations in Sn which have the same cycle structure are conjugates in Sn . In addition, every permutation is a unique project of disjoint cycles. If two permutations have cycles of matching lengths in their disjoint cycle decomposition are said to have the same cycle structure. Even and Odd Permutations. Dene F (x1 , . . . , xn ) =
i<j

(xi xj ).

If Sn dene (F ) =

i<j (x(i)

x(j) ). Note that (x(i) x(j) ) = F.

i<j

It follows that for , Sn , ( )(F ) =

i<j

(x (i) x (j) ) = ( (F )).

We obtain a homomorphism called the sign Sn {1} using the result of the action on F . If +1 then the permutation is called even, and if 1 then the permutation is called odd. Every transposition = (a b) has (F ) = F . Groups of Small Size. Let A4 be the group of even permutations on 4 elements. It is normal because a subgroup of index 2 is normal, and satises |A4 | = However, A4 has no subgroup of order 6. |S4 | = 12. 2