Permutation question concerning cycle shapes

In summary, we can show that for any permutation $h \in S_4$, the conjugate $h^{-1}fh$ of any permutation $f \in K_4$ will have a cycle structure of $(2,2)$, except for the identity permutation.
  • #1
Confusedalways
4
0
Consider the subset of $S_4$ defined by

$$K_4=\{(1)(2)(3)(4),(12)(34),(13)(24),(14)(23)\}$$

Show that for all $f \in K_4$ and all $h \in S_4$, we have $h^{-1}fh \in K_4$

I showed all the possible cycle shapes of h and am trying to show that $h^{-1}fh$ must always have cycle shape $(2,2)$, excluding the case of identity permutation.

Just don't know where to go from here
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
Hi, Confusedalways! Welcome. (Wave)

You're on the right track. Consider the following fact. If $\sigma = (a_1 \cdots a_r)$ is a cycle in $S_n$ and $\tau\in S_n$, then $\tau \sigma \tau^{-1} = (\tau(a_1)\cdots \tau(a_r))$. Take for instance $(12)(34)$. For all $h\in S_4$, $$h(12)(34)h^{-1} = h(12)h^{-1}h(34)h^{-1} = (h(1)\;h(2))\,(h(3)\;h(4))$$

so $h(12)(34)h^{-1}$ has cycle structure $(2,2)$. The same argument applies to the others.
 

Related to Permutation question concerning cycle shapes

1. What is a permutation?

A permutation is a mathematical concept that refers to the rearrangement of elements in a specific order. It is used to determine the number of ways in which a set of objects can be arranged or ordered.

2. What is a cycle in permutation?

A cycle in permutation refers to a specific type of arrangement where the elements are arranged in a circular fashion. It represents a group of elements that are moved to different positions while maintaining their relative order.

3. How do you calculate the number of possible cycle shapes in a permutation?

The number of possible cycle shapes in a permutation can be calculated using the formula n!/c, where n is the total number of elements and c is the number of cycles in the permutation.

4. Can a permutation have more than one cycle?

Yes, a permutation can have multiple cycles. The number of cycles in a permutation depends on the arrangement of elements and can range from 1 to n, where n is the total number of elements.

5. How is a permutation with no cycles represented?

A permutation with no cycles is represented as a single cycle of length 1, where each element is in its original position. It is also known as the identity permutation.

Similar threads

  • Linear and Abstract Algebra
Replies
28
Views
3K
  • Linear and Abstract Algebra
Replies
4
Views
2K
  • Linear and Abstract Algebra
Replies
27
Views
9K
  • Linear and Abstract Algebra
Replies
2
Views
2K
  • Linear and Abstract Algebra
Replies
1
Views
4K
  • Calculus and Beyond Homework Help
Replies
1
Views
937
  • Linear and Abstract Algebra
Replies
7
Views
2K
Replies
27
Views
973
Replies
12
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
804
Back
Top