# Homework Help: Intermediate subgroups between symmetric groups

1. Jun 28, 2011

### Kreizhn

1. The problem statement, all variables and given/known data

For n>1, show that the subgroup H of $S_n$ (the symmetric group on n-letters) consisting of permutations that fix 1 is isomorphic to $S_{n-1}$. Prove that there are no proper subgroups of $S_n$ that properly contain H.

3. The attempt at a solution

The first part is fairly straightforward. Using cycle notation, we ignore the trivial cycle on 1, then just reduce all other components by 1. It can be shown to be bijective hence giving the desired isomorphism.

Now for the second part, I figure this simply amounts to showing that there is no group N such that $S_{n-1} \subsetneq N \subsetneq S_n$. My first thought is to attack the problem via contradiction. If such a subgroup existed, it would be necessary that $(n-1)! \big| |N| \big| n!$. Unfortunately, I cannot find a reason this can't be true, except when n is prime.

2. Jun 28, 2011

### micromass

Hi Kreizhn!

Did you see the orbit-stabilizer theorem? Your group N acts on {1,...,n}, so by orbit-stabilizer, we have that

$$|N|=|G(x)||G_x|$$

for all x. Now take x=1.

3. Jun 29, 2011

### Kreizhn

It seems like the stabilizer of identity should be trivial, and the orbit of identity is the whole group. So then $|N| = |S_n|$ ? And this would be a contradiction since we assumed N was proper.

4. Jun 29, 2011

### micromass

No, I didn't mean 1 to be the identity. I meant 1 to be an element of the set {1,...,n}.

We know that N acts on {1,...,n}. So we can calculate G(1), G(2),...,G(n). And we can also calculate the stabilizers of these elements.
So, what is the orbit and what is the stabilizer of 1? (or 2,...,or n)

5. Jun 29, 2011

### Kreizhn

Oh yes, silly me. It's a group action on the set {1,..., n} so it wouldn't make sense for x to be identity.

Okay, now H would be a subset of the stabilizer of 1, since elements of H fix 1. Though since H is properly contained in N, the orbit is not just {1}.

If the orbit were "full" (I guess some say trivial), so that G(1) = {1,..., n} then we would get
$$|N| = |G(x)||G_x| \geq |H| n = (n-1)! n = n!$$
which implies $N = S_n.$. We assumed that N was a proper subset so the orbit cannot be trivial, and in particular $\exists m \in \{ 1,\ldots, n \}$ such that $\forall \sigma \in N, \{ 1 \} \sigma \neq \{ m \}$ (where I'm using right-actions).

Is this the right path? Or is there a simple "order argument" that is obvious that I'm just missing?

6. Jun 29, 2011

### micromass

This is indeed the right path. So you must prove that if $S_{n-1}\subset N$, then the orbit is everything. That is

$$G(1)=\{1,...,n\}$$