Group theory MOC

Sylow's theorem

Let 𝐺 be a finite group of order 𝑝𝑟𝑚 where 𝑝 is prime and 𝑝 𝑚. Then #m/thm/group

  1. Syl𝑝(𝐺), the set of Sylow 𝑝-subgroups, is non-empty;
  2. Every 𝑝-subgroup of 𝐺 is contained in a Sylow p-subgroup;
  3. All Sylow 𝑝-subgroups are conjugate in 𝐺;
  4. If 𝑛𝑝 =Syl𝑝(𝐺) then 𝑛𝑝 divides 𝑚 and 𝑛𝑝 𝑝1.
Proof due to Wielandt

In this proof group actions are taken to be right actions.

Let Ω be the set of all subsets of 𝐺 of size 𝑝𝑟, and 𝐺 act on Ω by right multiplication. Note

|Ω|=(𝑝𝑟𝑚𝑝𝑟)=𝑝𝑟𝑚𝑝𝑟(𝑝𝑟𝑚1)𝑝𝑟1𝑝𝑟𝑚(𝑝𝑟1)1

which is not divisible by 𝑝, so there must be a 𝐺-orbit on Ω of degree not divisible by 𝑝, Let Σ be such an orbit and 𝑆 Σ. Let 𝑃 =(𝐺)𝜌𝑆 ={𝑔 𝐺 :𝑆𝑔 =𝑆} 𝐺. We claim |𝑃| =𝑝𝑟, whence follows 𝑃 is a Sylow 𝑝-subgroup. Since |𝐺| =𝑝𝑟𝑚 =|Σ||𝑃|, we know 𝑝𝑟 |𝑃|. Now

(𝑃)𝜌𝑠={𝑔𝑃:𝑠𝑔=𝑠}=1

and (𝑃)𝜌 acting on 𝑆 is free, so each (𝑃)𝜌-orbit of 𝑆 has size |𝑃|. Herefore |𝑃| |𝑆| and thus 𝑃 Syl𝑝(𝐺).

To recap, if 𝑆 Ω and 𝑆(𝐺)𝜌 is not divisible by 𝑝, then (𝐺)𝜌𝑆 Syl𝑝(𝐺), proving ^S1.

Now let 𝐻 be a 𝑝-subgroup of 𝐺, and Σ be as above. Then (𝐻)𝜌 acts on Σ. The (𝐻)𝜌-orbits on Σ have sizes which are powers of 𝑝. Since |Σ| does not divide 𝑝, it follows there must exist a singleton orbit {𝑇}, so (𝐻)𝜌 (𝐺)𝜌𝑇, the latter being a Sylow 𝑝-subgroup, proving ^S2.

Let 𝑃1,𝑃2 Syl𝑝(𝐺). From directly above, 𝑃1 =(𝐺)𝜌𝑇1 and 𝑃2 =(𝐺)𝜌𝑇2 for some 𝑇1,𝑇2 Σ 𝐺, thus 𝑇1𝑔 =𝑇2 for some 𝑔 𝐺. It follows

𝑃𝑔1=(𝐺)𝜌𝑇1𝑔=(𝐺)𝜌𝑇2=𝑃2

proving ^S3.

𝐺 acts (transitively by ^S3) on Syl𝑝(𝐺) by conjugation, and |𝐺| =Syl𝑝(𝐺)|N𝐺(𝑃)| where N𝐺(𝑃) is the normalizer of 𝑃 Syl𝑝(𝐺) by the Orbit-stabilizer theorem. Since 𝑃 N𝐺(𝑃), it follows 𝑝𝑟 divides |N𝐺(𝑃)|, whence Syl𝑝(𝐺) divides 𝑚.

𝑃 acts by conjugation on Syl𝑝(𝐺), and by ^S2 𝑃 =(𝐺)𝜌𝑆 for some 𝑆 Σ. The only orbit of size 1 is {𝑃}: For if 𝑄 Syl𝑝(𝐺) then 𝑄𝑔 =𝑄 for all 𝑔 𝑃, so 𝑃 N𝐺(𝑄). Since 𝑃𝑄 N𝐺(𝑄), and 𝑃𝑄 is a 𝑝-group, so 𝑃 =𝑄.

All orbits of 𝑃 on Syl𝑝(𝐺) have size a 𝑝-power, therefore all orbits other than {𝑃} have size divisible by 𝑝. Therefore 𝑛𝑝 𝑝1, proving ^S4.


#state/tidy | #lang/en | #SemBr