Proving the Maximal Property of p-Sylow Subgroups in Finite Groups

  • Thread starter Thread starter tyrannosaurus
  • Start date Start date
  • Tags Tags
    Subgroup
tyrannosaurus
Messages
31
Reaction score
0

Homework Statement



Suppose K is a normal subgroup of a finite group G and S is a p-Sylow subgroup of G. Prove that K intersect S is a p-Sylow subgroup of K. So I know that K is a unique p-sylow group by definition, is that enough to prove that the intersection of K with S is a p-sylow subgroup of K?

Homework Equations





The Attempt at a Solution



Since S is a Sylow-p subgroup of G and K intersect S is a subgroup of S and K, we see that K intersect S is a p-subgroup of K. It remains to show that K intersect S is a maximal p-subgroup of K, which implies that K intersect S is a Sylow p-subgroup of K.

We know that [G:S] is relatively prime to p.
THe hints I was given to finish this off was that [K: K intersect S] = [KS:S] and [G:S] = [G:KS][KS:S] and from that we are suppose to get that [K:K intersect S] is relatively prime to p.
I am not getting how we know that [K: K intersect S] = [KS:S] and that [G:S] = [G:KS][KS:S] and how this implies that [K: K intersect S] is relatively prime to p.
I know that KS is a subgroup of G since K is a normal subgroup of G. If anyone could help me with this problem I will be entirnaly gratefull
 
Physics news on Phys.org
tyrannosaurus said:
I am not getting how we know that [K: K intersect S] = [KS:S] and that [G:S] = [G:KS][KS:S] and how this implies that [K: K intersect S] is relatively prime to p.
I know that KS is a subgroup of G since K is a normal subgroup of G. If anyone could help me with this problem I will be entirnaly gratefull

A general fact is that |KS| = |K| |S| / |K intersect S|. Since [G:H] = |G|/|H| (this is Lagrange's theorem), this statement is equivalent to [K: K intersect S] = [KS:S].

The equation [G:S] = [G:KS][KS:S] is again a consequence of Lagrange. The left side is |G|/|S| and the right side is (|G|/|KS|) (|KS|/|S|). Now, since [G:S] doesn't contain a factor of p and [KS:S] is a factor of [G:S], p cannot be a factor of [KS:S] = [K: K intersect S].
 
A general fact is that |KS| = |K| |S| / |K intersect S|. I forgot about this fact! THanks so much, this makes a whole lot of more sense now.
 
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