1
$\begingroup$

Consider $S_n$, the permutation group. Let $a\in S_n$. I want to show that if $a$ is an $n$ or an $n-1$ cycle, then $\langle a\rangle = \{c \in S_n : ca=ac\}$. Any help will be veru much appreciated.

1 Answers 1

1

Define an action $\,S_n\times S_n\to S_n\,$ by conjugation. Since there are $\,(n-1)!\,$ different $\,n-\,$cycles , we get that if $\,a\,$ is an $\,n-\,$ cycle then

$$(n-1)!=|\mathcal Orb(a)|=[S_n:C_{S_n}(a)]=\frac{|S_n|}{|C_{S_n}(a)|}\Longrightarrow |C_{S_n}{a}|=n$$

and since clearly every power of $\,a\,$ commutes with $\,a\,$ , these powers thus are the only elements in $\,S_n\,$ that do so.

Added on request of the OP: There are $\,(n-2)!\,n\,$ different $\,(n-1)-\,$ cycles in $\,S_n\,$ , so if $\,a\,$ is such a cycle:

$$|\mathcal Orb(a)|=[S_n:C_{S_n}(a)]\Longrightarrow |C_{S_n}(a)|=\frac{n!}{(n-2)!n}=n-1$$

and again we have that the only elements that commute with this cycle are its $\,n-1\,$ powers.

  • 3
    While this solution is correct, I think it would be preferable to avoid the orbit-stabilizer theorem insofar as one can perform a direct computation. In a first course in group theory, one often learns how to compute the centralizer of an element before one learns about the orbit-stabilizer theorem.2012-11-14
  • 1
    Perhaps you're right, yet I think groups actions are so basic and important that it is worth knowing this stuff early in the course and, at least where I studied, it was taught before we went into depth in permutation groups.2012-11-14
  • 0
    Would the same argument be applicable for $(n-1)$cycles?2012-11-14
  • 0
    Yes @Stefan . I added something to my answer.2012-11-14