3
$\begingroup$

Q: Show that there does not exist a permutation $\sigma \in S_4$ satisfying $(1 2)(3 4)\sigma = \sigma(1 2 3 4)$.

I think, there must be an easy way around or do I have to show the results for every permutation of $S_4$?

$\endgroup$

3 Answers 3

13
$\begingroup$

There is an easy way around. Hint: Think about odd and even permutations.

Or another way to do it would be to observe that if such $\sigma$ existed, you would have $\sigma^{-1} (12)(34) \sigma = (1234)$, and perhaps you know something about conjugation and cycle structure that tells you that can't happen. But the odd and even thing is simpler.

$\endgroup$
3
  • 1
    $\begingroup$ +1: Always very nice, when somebody comes up with a simpler than expected solution! $\endgroup$ Commented Apr 29, 2012 at 11:02
  • $\begingroup$ @Jyrki: Thanks. I've been teaching this stuff recently, which helps. $\endgroup$
    – Tara B
    Commented Apr 29, 2012 at 11:03
  • $\begingroup$ I agree with Jyrki as above. +1 $\endgroup$
    – Mikasa
    Commented Mar 30, 2013 at 7:08
4
$\begingroup$

$ (12)(34) = \sigma^{-1} (1234)\sigma$. You should know that $\sigma^{-1} (1234)\sigma=(\sigma(1)\sigma(2)\sigma(3)\sigma(4))$, so the right hand is cycle of length 4 but the left hand is 2 cycle of length 2. This is contradiction.

$\endgroup$
2
$\begingroup$

Besides to theoretical formal @Tara's approach and by using GAP as follows, you can see that we achieve nothing in GAP's environment:

for alpha in SymmetricGroup(4) do if(alpha^(-1)(1,2)(3,4)alpha=(1,2,3,4)) then Print(alpha,"\n"); fi; od;

$\endgroup$
1
  • $\begingroup$ $\ddot \smile \;\;+1\;\;$ $\endgroup$
    – amWhy
    Commented Mar 30, 2013 at 18:43

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .