Exercise 12, § 5
Algebra, I, 142
Bourbaki marks this one as harder than the rest.
(a) Show that every permutation is a product of cycles of order 3 (which are not in general component cycles of ). (Prove it for a product of two transpositions and use § 5, no. 7, Proposition 9.)
(b) If are distinct elements of , let denote the cycle of order whose support is and which maps to for and to . Show that is generated by the cycles . (Use (a).)
(c) Deduce that, if is odd, is generated by and and, if is even, by and .
(d) Show that, if a normal subgroup of contains a cycle of order 3, it is identical with (prove that such a subgroup contains all the cycles , ).
Solution
No solution has been written yet.