Center of Symmetric Groups n>= 3 is trivial

Click For Summary
SUMMARY

The discussion confirms that for symmetric groups \( S_n \) where \( n \geq 3 \), the center is trivial, meaning the only permutation that commutes with all others is the identity permutation. The participants explore the concept of commutativity in permutations and the implications of conjugation, ultimately establishing that non-commutative permutations exist within these groups. The key takeaway is that any permutation cycle involving three or more elements demonstrates non-commutativity.

PREREQUISITES
  • Understanding of symmetric groups, specifically \( S_n \)
  • Knowledge of permutation cycles
  • Familiarity with the concept of commutativity in group theory
  • Basic understanding of conjugation in group theory
NEXT STEPS
  • Study the properties of symmetric groups \( S_n \) for \( n \geq 3 \)
  • Learn about permutation cycles and their effects on group structure
  • Research the concept of conjugation in group theory
  • Explore examples of non-commutative groups beyond symmetric groups
USEFUL FOR

This discussion is beneficial for students of abstract algebra, particularly those studying group theory, as well as educators teaching concepts related to symmetric groups and permutations.

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.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
4
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
6K
  • · Replies 1 ·
Replies
1
Views
1K