Cauchy's Theorem Problem (Abstract Algebra question)

  • Thread starter Thread starter J0EBL0W
  • Start date Start date
  • Tags Tags
    Theorem
J0EBL0W
Messages
4
Reaction score
0
Cauchy's Theorem Problem (Abstract Algebra question)

Homework Statement


I've been thinking about this problem for a couple days now, and I don't even know how to approach it. The problem is:
Let G be a group of order (p^n)*m, where p is a prime and p does not divide m. Suppose that G has a normal subgroup P of order p^n. Prove that f(P)=P for every automorphism 'A' of G.

I can't even convince myself that the question is true, then alone a method on how to show it. Any point in the right direction would help me a ton. Thanks.


Homework Equations





The Attempt at a Solution

 
Last edited:
Physics news on Phys.org
What is "f"? Did you mean A(P)?
 
Prove that for g in G, the order of g divides p^n iff g is an element of P. One direction is easy, for the other direction take g not in P. Then gP is an element of the quotient group G/P which has order n. Can you finish? Once you have that, automorphisms preserve the order of elements.
 
I have no problem showing the orders of G and G/P, but I don't understand why an automorphism automatically preserve the order of elements.
 
Automorphisms are isomorphisms. Do you believe that isomorphisms preserve the order of elements? You should.

Edit: Hopefully you realize that when I said that 'automorphisms are isomorphisms' I was not implying that they are the same thing. Automorphisms are isomorphisms that map the group back onto the same group. The order of the automorphism group gives a sense of symmetry that the group has.
 
Last edited:
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