Proving A_4 ≠ S_4: Is Order of Elements Enough?

  • Thread starter Thread starter latentcorpse
  • Start date Start date
  • Tags Tags
    Elements
latentcorpse
Messages
1,411
Reaction score
0
How do I go about showing A_4 \not\cong S_4

So far the only argument I've been able to come up with is that the order of the elements of the two groups differ. Is this sufficient to conclude the two groups aren't isomorphic - it just doesn't seem that rigorous to me.
 
Physics news on Phys.org
A group isomorphism is a 1-1 and onto mapping between two groups. Of course that implies they have the same order. There's nothing nonrigorous about saying that.
 
If \phi is an isomorphism between groups then \phi(g^n) = \phi(g)^n so \phi must preserve orders. If you can demonstrate there is an element in one group with an order which doesn't appear in the other group then that means there can be no isomorphism.
 
my bad,
the question was to show A4 isn't isomorphic to D6.
surely i can just apply the argument given in post 3 to this case though?
 
latentcorpse said:
my bad,
the question was to show A4 isn't isomorphic to D6.
surely i can just apply the argument given in post 3 to this case though?

Absolutely.
 
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 ##\left(r\right)^{\left(\frac{1}{n}\right)}##. 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...
Back
Top