Conjugate Elements of a Symmetric Group

Treadstone 71
Messages
275
Reaction score
0
Is the the following definition correct?

Two elements a and b of a group G are said to be CONJUGATE if there exists g in G such that a=gbg^{-1}.

For instance, show that all elements in the symmetric group S5 of order 6 conjugate.
 
Physics news on Phys.org
EDIT: Yes, that's the correct definition, as well. Again, do it: take an element of order 6, compute its conjugates with a couple of elements and see who to generate all elements of order 6.

Eg, in S_n n>2, consider (12)(23)(12)=(13), thus it's clear that all elements of order 2 are conjugate
 
Last edited:
Incidentally, when i say "just do it" I'm not being impatient, it's just that sometimes in maths you sadly just have to get your hands dirty with some calculations.
 
I know, I just think I remember a theorem that says two elements in a symmetric group are conjugate if and only if they have the same cycle shape. There are 7 different cycle shapes in S5, I think.
 
Not sure what you're getting at. Perhaps if you realized there was only one cycle shape which corresponded to elements of order 6 that would help.
 
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...
Back
Top