Center of Symmetric Groups n>= 3 is trivial

Metahominid
Messages
22
Reaction score
0

Homework Statement


The question is to show that the for symmetric groups, Sn with n>=3, the only permutation that is commutative is the identity permutation.

Homework Equations


I didn't know if it was necessary but this equates to saying the center is the trivial group.


The Attempt at a Solution


I was attempting to show that there will always exist a permutation that isn't commutative for a particular one, which I was figuring would be showing there can be permutations that move an element to different places so their compositions would be different.
 
Physics news on Phys.org
If u and v are permutations, then uv=vu is the same thing as uvu-1=v. So if v is in the center of Sn, then conjugating v by any other element doesn't change v. Do you know what the conjugates of an element of Sn look like?
 
No I do not, I don't think we have covered conjugation.
 
Metahominid said:
No I do not, I don't think we have covered conjugation.

You don't need it. Your first approach was fine. Sn contains a permutation cycle (x1,x2,x3) where x1,x2 and x3 are in {1,...n}. Write down a permutation that doesn't commute with it.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top