Permutations of a single number in the symmetric group

Ted123
Messages
428
Reaction score
0
Say we have the symmetric group S_5.

The permutations of \{2,5\} are the identity e and the transposition (25).

But what are all the permutations of \{3\}? Is it e and the 1-cycle (3)?
 
Physics news on Phys.org
Ted123 said:
Say we have the symmetric group S_5.

The permutations of \{2,5\} are the identity e and the transposition (25).

But what are all the permutations of \{3\}? Is it e and the 1-cycle (3)?

What do you think would be the difference between e and (3)? Aren't they both the identity permutation?
 
Dick said:
What do you think would be the difference between e and (3)? Aren't they both the identity permutation?

Oh yeah of course. You don't have to write 1-cycles in a permutation so e=(1)(2)(3)(4)(5)=(1)=(2)=(3)=(4)=(5)=(1)(2)=(1)(3) etc.
 
Ted123 said:
Oh yeah of course. You don't have to write 1-cycles in a permutation so e=(1)(2)(3)(4)(5)=(1)=(2)=(3)=(4)=(5)=(1)(2)=(1)(3) etc.

Right. The number of permutations on n elements is n!. So for 2 elements you have two permutations, for 1 element you have one.
 
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