Proving Aut(S_3) is Isomorphic to S_3

  • Thread starter Thread starter happyg1
  • Start date Start date
happyg1
304
0

Homework Statement




Prove that Aut(S_3)=S_3

Homework Equations


= means isomorphic


The Attempt at a Solution



If I let S_3 be {1,2,3} then I can write out explicitly its 6 elements...the permutations of 1,2,3...
Aut(S3) is the set of isomorphisms of S3 onto itself. So can I just write them all out and then say that since they have the same order they are isomorphic?
Or is there a better way?

Thanks,
CC
 
Physics news on Phys.org
If you can show there are exactly 6 isomorphisms, then you've shown Aut(S_3) is one of the two groups of order 6: Z_6 and S_3. These can be distinguished by the fact that Z_6 is abelian while S_3 is not, so it only remains to find a pair of isomorphisms that don't commute.

How were you planning on showing there are exactly 6 isomorphisms? If you're not sure here, think about the relation:

(12)(13)=(132)
 
happyg1 said:
Aut(S3) is the set of isomorphisms of S3 onto itself. So can I just write them all out and then say that since they have the same order they are isomorphic?

No. This does not prove anything.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply . Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
1
Views
2K
Replies
4
Views
2K
Replies
3
Views
2K
Replies
10
Views
3K
Replies
5
Views
1K
Replies
1
Views
2K
Replies
8
Views
2K
Replies
1
Views
2K
Back
Top