Prove that p-group of order p^n is not simple

  • Thread starter Thread starter vanckzhu
  • Start date Start date
vanckzhu
Messages
5
Reaction score
0

Homework Statement



Show that, for p prime and n greater than or equal to 2, that every group of order Pp^n is not simple.

Homework Equations


N/A

The Attempt at a Solution



Hint given regarding the center. I know that the center is not trivial, but I guess I have to show that the center is not the entire group...so the center (which obviously is a subgroup of p^n) is a non-trivial normal subgroup?

Edit: LaTex doesn't work here, sad.
 
Last edited:
Physics news on Phys.org
Partially correct. Assuming the center is a non-trivial proper subgroup of your p-group, then it is, by definition, normal - meaning your p-group is not simple. And it is required to be non-trivial. However, your center need not be a proper subgroup. If your center is the entire p-group, implying the group is abelian, what is your next step? Cauchy's Theorem would be useful.*edit* LaTeX does work here, use [ t e x ] and [ / t e x ], without spaces. There are some packages not included, but the basics will work.
 
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