Jump to content

Recommended Posts

Posted

Show that Sn is isomorphic to a subgroup of An+2.

I will demonstrate my idea for n=3.

S3 has 3!=6 permutations, 3 odd: (1 2), (1 3), (2 3); and 3 even: identity, (1 2 3)=(1 2)(2 3), (1 3 2)=(1 3)(3 2).

Let's consider them separately. Put elements 4 and 5 in A5 aside. 

Identify even permutations in S3 with permutations in A5 with the same cycles as in S3 while the elements 4 and 5 are fixed, e.g., (1 2)(2 3) in S3 ↔ (1 2)(2 3) in A5.

Identify odd permutations in S3 with permutations in A5 with the same cycles as in S3 plus the cycle (4 5), e.g., (1 2) in S3  ↔ (1 2)(4 5) in A5.

I think, it is obvious how to generalize it for any n, right?

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.