9
$\begingroup$

I'm asked in this exercise to find all permutations that commute with $\omega$=(1 9 7 10 12 2 5)(4 11)(3 6 8) in $S_{12}$.

What I have so far: We could write $x$(1 9 7 10 12 2 5)(3 6 8)=(1 9 7 10 12 2 5)(3 6 8)$x$, which means (1 9 7 10 12 2 5)(4 11)(3 6 8)=$x^{-1}$(1 9 7 10 12 2 5)(4 11)(3 6 8)$x$=(1x 9x 7x 10x 12x 2x 5x)(4x 11x)(3x 6x 8x). This means $x$ commutes with $\omega$ iff $x$ 'transfers' one of the distinct cycles that construct $\omega$ unto itself.

There are $7\cdot 2\cdot 3$ ways to 'present' $\omega$ disregarding the order of multiplication of the cycle (should I disregard it?), each of which creates a distinct commuting permutation if constructed by the algorithm: 1x$\rightarrow$(1 9 7 10 12 2 5), 9x$\rightarrow$(1 9 7 10 12 2 5), et cetera. So all in all we end up with $7\cdot 2\cdot 3$ permutations.

I guess what I should ask is: (a) does this sound correct? (b) since the question wants us to find all permutations and not count them, perhaps there is a more general 'form' for the commuting permutations?

  • 1
    All the permutations...in *what* group $\,S_n\,$??2012-11-27
  • 0
    $S_{12}$ - sorry!2012-11-27
  • 0
    It does sound correct. And to find all permutations, I'd say you take each cycle $(a_1,...,a_k)$, map it to $(1,...,k)$ with permutation from $S_{12}$ we'll call $f$. Then you take a permutation $g$ of $S_k$ and extend it to $S_{12}$ by defining at identity on the remaining numbers and map it back top $(a_1,...,a_k)$. And your permutations are $f^{-1}\circ g\circ f$. Then you just compose one of those permutation per cycle and you get the general form.2012-11-27
  • 0
    And I therefore think that the number of permutations is the product of the sizes of $S_7$, $S_2$ and $S_3$ which isn't $7*2*3$ from what I recall.2012-11-27
  • 0
    And I have no idea how to make a "real" proof out of this :/2012-11-27
  • 2
    The size of $S_n$ would be $n!$, by my count. But why would every permutation in say, $S_7$ be eligible?2012-11-27

1 Answers 1