Math 2.0

Group theory and generalizations Proof

Proof of the third Sylow theorem

Builds on Sylow p-subgroupP-groupFirst Sylow theoremAction by conjugationConjugate subgroupFixed points of a p-group actionNormaliserLagrange's theoremSecond Sylow theoremOrder of an element divides the order of the group

Proof

We let a Sylow subgroup act by conjugation on the set of all Sylow subgroups and count fixed points modulo pp.

  1. Write ∣G∣=pnm|G| = p^n m with n≥0n \geq 0 and p∤mp \nmid m. Let Ω=Syl⁡p(G)\Omega = \operatorname{Syl}_p(G) be the set of Sylow pp-subgroups, so ∣Ω∣=np|\Omega| = n_p. By the first Sylow theorem, Ω\Omega contains some PP.
  2. For g∈Gg \in G and Q∈ΩQ \in \Omega, the conjugate subgroup gQg−1gQg^{-1} is a subgroup of order ∣Q∣=pn|Q| = p^n, since x↦gxg−1x \mapsto gxg^{-1} is a bijection. So gQg−1∈ΩgQg^{-1} \in \Omega.
  3. So GG acts on Ω\Omega by g⋅Q=gQg−1g \cdot Q = gQg^{-1}, as in the action by conjugation. Restrict this action to PP.
  4. The order of each element of PP divides pnp^n, so it is a power of pp. So PP is a finite pp-group. The fixed point lemma gives np=∣Ω∣≡∣ΩP∣(modp)n_p = |\Omega| \equiv |\Omega^P| \pmod p, where ΩP\Omega^P is the set of fixed points.
  5. The subgroup PP is a fixed point, because xPx−1=PxPx^{-1} = P for each x∈Px \in P.
  6. Let Q∈ΩPQ \in \Omega^P. Then xQx−1=QxQx^{-1} = Q for each x∈Px \in P. So P⊆NP \subseteq N, where N=NG(Q)N = N_G(Q) is the normaliser of QQ in GG.
  7. The set NN is a subgroup of GG. Indeed, if gQg−1=QgQg^{-1} = Q and hQh−1=QhQh^{-1} = Q, then (gh)Q(gh)−1=Q(gh)Q(gh)^{-1} = Q, and g−1Qg=Qg^{-1}Qg = Q follows from Q=gQg−1Q = gQg^{-1}.
  8. Also Q⊆NQ \subseteq N, and QQ is normal in NN by the definition of NN.
  9. By Lagrange's theorem, ∣N∣|N| divides pnmp^n m, and pn=∣Q∣p^n = |Q| divides ∣N∣|N|. So ∣N∣=pnm′|N| = p^n m' with m′∣mm' \mid m, hence p∤m′p \nmid m'.
  10. So PP and QQ are both subgroups of NN of order pnp^n, that is, Sylow pp-subgroups of NN.
  11. By the second Sylow theorem in the group NN, there is g∈Ng \in N with P=gQg−1P = gQg^{-1}.
  12. Since g∈N=NG(Q)g \in N = N_G(Q), we have gQg−1=QgQg^{-1} = Q. So P=QP = Q.
  13. By steps 5 and 12, ΩP={P}\Omega^P = \{P\}, so ∣ΩP∣=1|\Omega^P| = 1.
  14. By step 4, np≡1(modp)n_p \equiv 1 \pmod p.

Idea

A Sylow subgroup PP acts on the set of Sylow subgroups by conjugation. A fixed point QQ is normalised by PP, and inside the normaliser of QQ both are Sylow subgroups, so they are conjugate there, hence equal. With exactly one fixed point, the fixed point lemma gives np≡1(modp)n_p \equiv 1 \pmod p.

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Sylow_theorems, Proof of the Sylow theorems
About this page
TagD2BZ6ZQMMR
URIm2://D2BZ6ZQMMR
Kindproof
WritingW0 stub
MSC20D20
ProvesThird Sylow theorem
UsesSylow p-subgroup, P-group, First Sylow theorem, Action by conjugation, Conjugate subgroup, Fixed points of a p-group action, Normaliser, Lagrange's theorem, Second Sylow theorem, Order of an element divides the order of the group
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.