4

I know that $ S_8 $ has Sylow $2$-subgroups of order $ 2^7 $. I have no idea about their generators.

biki
  • 41
  • 1
    A group has "a" (one) generator iff it's cyclic. The 2-sylow of S8 is certainly not cyclic. So you want a generating set (in general there will be more than one generating set of a group). – anon Sep 04 '13 at 05:48
  • 1
    @anon here we have to find its minimum elements which generated $H $ – Andy Sep 04 '13 at 05:56
  • This is all discussed in detail here: http://www.math.utsc.utoronto.ca/B31/SylowSubgroups – Betty Mock Sep 04 '13 at 06:06
  • @AnindyaGhatak What is a minimal element of an unordered group? Presumably you mean a minimal generating set. Then yes. – anon Sep 04 '13 at 06:20
  • @BettyMock That is pretty close to unreadable. – Tobias Kildetoft Sep 04 '13 at 06:54
  • Consider what sort of elements have order a power of $2$ in $S_8$. Note that a $2$-Sylow will contain any group of order $8$ as a subgroup, so it might be a good idea to first try to identify these within $S_8$. – Tobias Kildetoft Sep 04 '13 at 06:55
  • @TobiasKildetoft: I examined it in GAP. In fact, I filtered the elements in $S_8$ whose orders is $2^7$. I assumed that the OP wanted $H$ to be cyclic, so I searched to find an element of that order. The result was [ ]. :( – Mikasa Sep 04 '13 at 07:15
  • @BabakS. sure, it is clear that a $2$-Sylow cannot be cyclic, as it must contain some non-abelian subgroups (it must contain the dihedral and the quaternion groups of order $8$). – Tobias Kildetoft Sep 04 '13 at 07:23
  • A related question. My answer there is no different from Mark's or Andreas' (except that he uses more compact notation :-). But take a look at Ted's explanation describing these Sylow 2-subgroups as symmetries of a binary tree. Something I didn't know beforehand. – Jyrki Lahtonen Sep 06 '13 at 18:56

2 Answers2

4

Let's build up the group, noting that because all the Sylow $2$ subgroups are conjugate, and because every 2-subgroup is a subgroup of some Sylow $2$ subgroup, any Sylow $2$ subgroup will contain elements from each conjugacy class of elements of order a power of $2$.

$S_0$ has the identity element, as does $S_1$ - we add that the Sylow $2$ subgroups of $S_{2n+1}$ are isomorphic to those of $S_{2n}$.

$S_2$ adds a transposition $(1,2)$ to give a subgroup of order 2.

$S_4$ has a Sylow subgroup of order $8$ with three types of element $(1,2,3,4); (1,3); (1,3)(2,4)$ it is generated by the $4$-cycle and the transposition (which is not in the subgroup generated by the $4$-cycle).

$S_6$ has a Sylow subgroup of order $16$ with new cycle-types $(1,3)(2,4)(5,6); (1,2,3,4)(5,6)$ - the transposition $(5,6)$ commutes with the elements of the group of order $8$ based on $S_4$.

$S_8$ adds several cycle-types. If we base it on $a=(1,2,3,4,5,6,7,8)$ we have $b=(1,3,5,7)(2,4,6,8)$; $c=(1,3,5,7)(2,6)(4,8)$; $d=(1,3,5,7)(2,6)$; $e=(1,3,5,7)$ as the types containing $4$-cycles. The group generated by $b,c,d,e$ is the direct product of the cyclic group generated by the $4$-cycle $(1,3,5,7)$ and a Sylow-subgroup of $S_4$ based on $(2,4,6,8)$ - hence a group $H$ of order $32$. The other conjugacy types are $(2,6)$, $(2,6)(4,8)$, $(1,5)(2,6)(3,7)(4,8)$, $(1,5)(3,7)(4,8)$ - with a bit of thought these can be derived from $a,b,c,d,e$.

Adding $a$ to $H$ gives the whole group (since conjugation by $a$ gets all the basic elements we want). Now we note that $b=a^2$. Also $de^{-1}=(2,6)$, and conjugating $(2,6)$ by appropriate powers of $a$ gives the transpositions $(1,5);(3,7);(4,8)$. The last of these gives us $c$. So the group is generated by the elements $a, d, e$. We could replace $d$ by $f=(2,6)$ since $d=ef$.

Then our generators are $a=(1,2,3,4,5,6,7,8); e=(1,3,5,7); f=(2,6)$ and it remains to show that each lies outside the group generated by the other two.

Mark Bennet
  • 101,769
4

The Sylow $2$-subgroups of $S_{2^{n}}$ are particularly easy to describe, because they are "simply" iterated wreath products of cyclic groups of order $2$.

In this case, this observation yields a somewhat natural minimal set of generators of the form $$ (1,2), \quad (1,3)(2,4), \quad (1,5)(2,6)(3,7)(4,8). $$

The pattern should be clear. The general form for a "wreath product" set of generators for a Sylow $2$-subgroup of $S_{2^{n}}$ would be $$ (1,2) = \prod_{i=1}^{1} (i, i+1), \quad \prod_{i=1}^{2} (i, i+2), \quad \prod_{i=1}^{4} (i, i+4), \quad \dots \quad, \quad \prod_{i=1}^{2^{n-1}} (i, i+2^{n-1}) $$