Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 13.4.9
Exercise 13.4.9
Prove that two permutations in are conjugate if and only if they have the same cycle type.
Proof.
Let have cycle type . Then can be expressed uniquely as the product of disjoint cycles , where is a -cycle. Let such that . Then:
Since and are disjoint for , then and are also disjoint. Indeed, being disjoint means no number is moved by both and , i.e., there is no such that and . If and are not disjoint, then they both move some number . Then and , hence and , which means that is moved by both and . This is a contradiction. Therefore is the product of -conjugates of disjoint cycles for , and these -conjugates are disjoint cycles with the same respective lengths, i.e., has the same cycle type as . For the converse direction, suppose and have the same cycle type . Then and where the cycles are disjoint. Let define the permutation by for all . Then , i.e., and are -conjugate. □Answers
2022-07-19 00:00