Abstract Algebra Problem (Group Isomorphisms)

[BSMSMSTMSPHD]

Hi. My latest question concerns the following. I must prove that the alternating group $$A_n$$ contains a subgroup that is isomorphic to the symmetric group $$S_{n-2}$$ for n = 3, 4, ...

So far, here's what I have (not much). The cases for n = 3 and n = 4 are elementary, since the group lattices are very easy to visualize. But, once n = 5, this becomes quickly unwieldy ( $$A_5$$ has 60 elements.)

I also know, by Lagrange, that this subgroup must divide the order of $$A_n$$. Since the order of $$S_{n-2}$$ is $$(n-2)!$$ and the order of $$A_n$$ is $$\frac{n!}{2}$$ I took the ratio of these and got $$\frac{n(n-1)}{2}$$ which is always a natural number for n = 2, 3, ... But that just shows that the isomorphism is always possible in terms of the orders of the groups involved. It doesn't guarantee that such a subgroup exists.

The other thing I know is that $$A_n$$ is a non-abelian simple group for n > 4. This means that it contains no proper normal subgroups. What this could possibly do for me, I'm not sure. But is seems to eliminate the isomorphism theorems from my arsenal, since they require subgroups to be normal.

Any suggestions for an approach here? Thanks.

 

[AKG]

How would you change the elements of S_n-2 into elements of S_n such that they're all even? Answer the question in two parts: a) how would you "change" an even element of S_n-2 into an even element of S_n, and b) how would you change an odd element of S_n-2 into an even element of S_n? Start with a reasonable guess, and try to prove that this procedure for changing elements of one group into elements of another is an injective homomorphism. If it doesn't work out, tweak your guess a little until you find one.

 

[StatusX]

Take a set of n elements. S_n-2 can act on n-2 of these as you'd expect. For the other two, if you can think of something to do with them that ensures that for each element in S_n-2, the total associated permutation of all n elements is even, then you'll be able to associate each element of S_n-2 with an element of A_n. Can you do this in such a way that the result is an injective homomorphism, and so an isomorphism between S_n-2 and its image in A_n?

 

[BSMSMSTMSPHD]

Thanks to both of you, I think I've got it.

I send the even elements to themselves and I multiply the odd elements by the transposition made up of the elements n and n-1. This guarantees that each permutation in the image is even. I checked and confirmed that this is an injective homomorphism.

Thanks!