Sylow Theorems and Simple Groups: Proving Non-Simplicity for Groups of Order 96

  • Thread starter Thread starter Adorno
  • Start date Start date
  • Tags Tags
    Groups
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
7 replies · 3K views
Adorno
Messages
29
Reaction score
0

Homework Statement


Prove that no group of order 96 is simple.

Homework Equations


The sylow theorems

The Attempt at a Solution


96 = 2^5*3. Using the third Sylow theorem, I know that n_2 = 1 or 3 and n_3 = 1 or 16. I need to show that either n_2 = 1 or n_3 = 1, but I am unsure how to do this.
 
on Phys.org
I'm not too good at group actions. What would the action be? And where would the homomorphism come from?

If the kernel is normal, then it must be trivial, otherwise there would be a non-trivial normal subgroup of G.
 
So does that action look like (g, n) |-> gn where n is in N_G(H)?

Ok, so how about the homomorphism? Do you map an element of g to the action of left multiplication by g on N_G(H)?
 
So we define the map phi : G -> S_3 by phi(g) = (left multiplication by g).

I can see why this is a homomorphism. (Since left multiplication by g_1g_2 is the same as left multiplication by g_2, then left multiplication by g_1).

Is this right?