Sylow theorems, proof of


We let G be a group of order pm⁢k where p∤k and prove Sylow’s theoremsMathworldPlanetmath.

First, a fact which will be used several times in the proof:

Proposition 1.

If p divides the size of every conjugacy classMathworldPlanetmathPlanetmath outside the center then p divides the order of the center.

Proof.

This follows from the class equationMathworldPlanetmathPlanetmath:

|G|=|Z⁢(G)|+∑[a]≠Z⁢(G)|[a]|

If p divides the left hand side, and divides all but one entry on the right hand side, it must divide every entry on the right side of the equation, so p|Z(G). ∎

Proposition 2.
Proof.

By inductionMathworldPlanetmath on |G|. If |G|=1 then there is no p which divides its order, so the condition is trivial.

Suppose |G|=pm⁢k, p∤k, and the holds for all groups of smaller order. Then we can consider whether p divides the order of the center, Z⁢(G).

If it does, then by Cauchy’s theorem, there is an element f of Z⁢(G) of order p, and therefore a cyclic subgroup generated by f, ⟨f⟩, also of order p. Since this is a subgroupMathworldPlanetmathPlanetmath of the center, it is normal, so G/⟨f⟩ is well-defined and of order pm-1⁢k. By the inductive hypothesis, this group has a subgroup P/⟨f⟩ of order pm-1. Then there is a corresponding subgroup P of G which has |P|=|P/⟨f⟩|⋅|⟨f⟩|=pm.

On the other hand, if p∤|Z⁢(G)| then consider the conjugacy classes not in the center. By the propositionPlanetmathPlanetmath above, since Z⁢(G) is not divisible by p, at least one conjugacy class can’t be. If a is a representative of this class then we have p∤|[a]|=[G:C(a)], and since |C(a)|⋅[G:C(a)]=|G|, pm∣|C(a)|. But C⁢(a)≠G, since a∉Z⁢(G), so C⁢(a) has a subgroup of order pm, and this is also a subgroup of G. ∎

Proposition 3.

The intersectionMathworldPlanetmath of a Sylow p-subgroup with the normalizerMathworldPlanetmath of a Sylow p-subgroup is the intersection of the subgroups. That is, Q∩NG⁢(P)=Q∩P.

Proof.

If P and Q are Sylow p-subgroups, consider R=Q∩NG⁢(P). Obviously Q∩P⊆R. In additionPlanetmathPlanetmath, since R⊆NG⁢(P), the second isomorphism theorem tells us that R⁢P is a group, and |R⁢P|=|R|⋅|P||R∩P|. P is a subgroup of R⁢P, so pm∣|RP|. But R is a subgroup of Q and P is a Sylow p-subgroup, so |R|⋅|P| is a multipleMathworldPlanetmathPlanetmath of p. Then it must be that |R⁢P|=pm, and therefore P=R⁢P, and so R⊆P. Obviously R⊆Q, so R⊆Q∩P. ∎

The following construction will be used in the remainder of the proof:

Given any Sylow p-subgroup P, consider the set of its conjugates C. Then X∈C↔X=x⁢P⁢x-1={x⁢p⁢x-1|∀p∈P} for some x∈G. Observe that every X∈C is a Sylow p-subgroup (and we will show that the converseMathworldPlanetmath holds as well). We let G act on C by conjugationMathworldPlanetmath:

g⋅X=g⋅x⁢P⁢x-1=g⁢x⁢P⁢x-1⁢g-1=(g⁢x)⁢P⁢(g⁢x)-1

This is clearly a group actionMathworldPlanetmath, so we can consider the orbits of P under it; this remains true if we only consider elements from some subset of G. Of course, if all G is used then there is only one orbit, so we restrict the action to a Sylow p-subgroup Q. the orbits O1,…,Os, and let P1,…,Ps be representatives of the corresponding orbits. By the orbit-stabilizer theorem, the size of an orbit is the index of the stabilizerMathworldPlanetmath, and under this action the stabilizer of any Pi is just NQ⁢(Pi)=Q∩NG⁢(Pi)=Q∩P, so |Oi|=[Q:Q∩Pi].

There are two easy results on this construction. If Q=Pi then |Oi|=[Pi:Pi∩Pi]=1. If Q≠Pi then [Q:Q∩Pi]>1, and since the index of any subgroup of Q divides Q, p∣|Oi|.

Proposition 4.

The number of conjugates of any Sylow p-subgroup of G is congruentMathworldPlanetmath to 1 modulo p

In the construction above, let Q=P1. Then |O1|=1 and p∣|Oi| for i≠1. Since the number of conjugates of P is the sum of the number in each orbit, the number of conjugates is of the form 1+k2⁢p+k3⁢p+⋯+ks⁢p, which is obviously congruent to 1 modulo p.

Proposition 5.

Any two Sylow p-subgroups are conjugate

Proof.

Given a Sylow p-subgroup P and any other Sylow p-subgroup Q, consider again the construction given above. If Q is not conjugate to P then Q≠Pi for every i, and therefore p∣|Oi| for every orbit. But then the number of conjugates of P is divisible by p, contradicting the previous result. Therefore Q must be conjugate to P. ∎

Proposition 6.

The number of subgroups of G of order pm is congruent to 1 modulo p and is a factor of k

Proof.

Since conjugates of a Sylow p-subgroup are precisely the Sylow p-subgroups, and since a Sylow p-subgroup has 1 modulo p conjugates, there are 1 modulo p Sylow p-subgroups.

Since the number of conjugates is the index of the normalizer, it must be |G:NG(P)|. Since P is a subgroup of its normalizer, pm∣NG(P), and therefore |G:NG(P)|∣k. ∎

Title Sylow theoremsMathworldPlanetmath, proof of
Canonical name SylowTheoremsProofOf
Date of creation 2013-03-22 12:51:02
Last modified on 2013-03-22 12:51:02
Owner Henry (455)
Last modified by Henry (455)
Numerical id 12
Author Henry (455)
Entry type Proof
Classification msc 20D20
Related topic SylowPSubgroup
Related topic SylowsThirdTheorem