Proving that N(N(P)) = N(P) for p-Sylow Subgroups of G

  • Thread starter Thread starter basukinjal
  • Start date Start date
basukinjal
Messages
3
Reaction score
0
If H is a subgroup of G then N(H) is defined as { x belonging to G | xHx^-1 = H }. If P is p-Sylow subgroup of G, then prove that N(N(P)) = N(P).
 
Physics news on Phys.org


basukinjal said:
If H is a subgroup of G then N(H) is defined as { x belonging to G | xHx^-1 = H }. If P is p-Sylow subgroup of G, then prove that N(N(P)) = N(P).

You need to prove both directions.
N(P) < N(N(P)) is obvious.

To show N(N(P)) < N(P), you might need to use the fact that P is normal in N(P), which implies the only Sylow p-subgroup of N(P) is P itself.
 
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