I am really stuck with how to prove that the only element in Sn (with n>=3) commuting with all the other elements of this group is the identity permutation id.(adsbygoogle = window.adsbygoogle || []).push({});

I have no idea what im supposed to do with it, i know why S3 has only one element that commutes but i dont know how to prove it for all.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proving one element in the symmetric group (s>=3) commutes with all element

**Physics Forums | Science Articles, Homework Help, Discussion**