Sylow's Theorems

Lagrange's theorem tells us that the order of any subgroup divides the order of a finite group, but it gives no converse — a group of order $n$ need not have subgroups of every order dividing $n$. Sylow's theorems supply the most important partial converse: for each prime power $p^n$ that maximally divides $|G|$, subgroups of exactly that order are guaranteed to exist. These maximal $p$-subgroups, called Sylow $p$-subgroups, are all conjugate to one another, and their number is sharply constrained modulo $p$. The surprising fact is how much global structure these local (prime-by-prime) statements impose: counting Sylow subgroups alone can prove that no simple group of certain orders exists, a key step toward classifying all finite groups.

The Core Insight

Decompose the order of a finite group prime-by-prime. For each prime $p$, the "biggest $p$-piece" of $G$ — a subgroup of order equal to the full power of $p$ in $|G|$ — always exists, is unique up to conjugation, and comes in a number tightly pinned down by congruence and divisibility conditions. Group actions (especially $G$ acting on cosets and on the set of subgroups by conjugation) convert these existence/counting claims into orbit–stabilizer arithmetic.

Formal Statement

Sylow p-subgroup

Let $G$ be a finite group of order

where $p$ is a prime. A Sylow $p$-subgroup of $G$ is a subgroup $P\le G$ with

We write $n_p$ for the number of Sylow $p$-subgroups of $G$, and ${\mathrm{Syl}}_p(G)$ for the set of all of them.

Sylow's Three Theorems

Let $G$ be a finite group with $|G|=p^{n}m$, $p\nmid m$.

Furthermore $n_p=[G:N_G(P)]$, where $N_G(P)$ is the normalizer of any Sylow $p$-subgroup $P$.

Why It Holds

Sylow I via group action on subsets

We prove existence of a subgroup of order $p^n$.

Since $p\nmid |\mathcal{O}|$, the full $p^n$ must divide $|P|$, giving $p^n\mid |P|$.

Thus $P$ is a Sylow $p$-subgroup. The chain of subgroups of orders $p^k$ follows from an inductive argument inside any $p$-group using its nontrivial center. $■$

Sylow II and III via conjugation action

Let $P$ be a fixed Sylow $p$-subgroup (exists by Sylow I), and let $X={\mathrm{Syl}}_p(G)$ be the set obtained as the $G$-orbit of $P$ under conjugation. We will show $X$ is all Sylow $p$-subgroups.

Since $P\le N_G(P)$, we have $p^n\mid |N_G(P)|$, so $n_p=[G:N_G(P)]$ divides $[G:P]=m$. Combined with [8] this gives both parts of [3]. $■$

Peter Ludwig Mejdell Sylow | 1832–1918

A Norwegian secondary-school teacher in Halden (Frederikshald), Sylow published his three theorems in 1872 in Mathematische Annalen under the title "Théorèmes sur les groupes de substitutions," working in the language of permutation groups before the abstract group concept was standard. He spent much of his career teaching at the gymnasium level, and only late in life (1898) obtained a university chair at Christiania (Oslo), arranged in part by Sophus Lie. Together with Lie he edited the collected works of Niels Henrik Abel. His theorems are widely regarded as the deepest elementary results in finite group theory.

Building Intuition

Think of $|G|=p^{n}m$ as a number split into its $p$-part ($p^n$) and its co-$p$-part ($m$). Sylow I says the $p$-part is always realized by an actual subgroup — the group cannot "lose" its prime-power factor; it must be packaged as a genuine subgroup. Sylow II says these prime-power packages are interchangeable: $G$ shuffles them around by conjugation, so structurally there is only "one" Sylow $p$-subgroup up to relabeling. Sylow III is the bookkeeping: the count $n_p$ must be $1$ plus a multiple of $p$ (so $n_p\in \{1,p+1,2p+1,\dots \}$) AND must divide the co-$p$-part $m$. Often these two constraints together leave only $n_p=1$, which means the Sylow subgroup is normal — an enormously useful conclusion for proving a group is not simple.

Conjugation action of a Sylow p-subgroup P on the set of all Sylow p-subgroups, illustrating why n_p ≡ 1 (mod p)

<svg viewBox="0 0 640 360" xmlns="http://www.w3.org/2000/svg">
<rect width="640" height="360" fill="#0a0e17"/>
<text x="320" y="28" fill="#e2e8f0" font-size="16" text-anchor="middle">P acts by conjugation on Syl_p(G):  orbits of size 1 or p, p², …</text>

<!-- fixed point P -->
<circle cx="110" cy="180" r="26" fill="none" stroke="#d4a853" stroke-width="2.5"/>
<text x="110" y="185" fill="#d4a853" font-size="15" text-anchor="middle">P</text>
<text x="110" y="230" fill="#e2e8f0" font-size="12" text-anchor="middle">fixed point</text>
<text x="110" y="246" fill="#e2e8f0" font-size="12" text-anchor="middle">(orbit size 1)</text>

<!-- an orbit of size p -->
<g stroke="#94a3b8" stroke-width="1.6" fill="none">
<circle cx="360" cy="90" r="18"/>
<circle cx="440" cy="120" r="18"/>
<circle cx="470" cy="200" r="18"/>
<circle cx="410" cy="265" r="18"/>
<circle cx="330" cy="245" r="18"/>
<circle cx="300" cy="160" r="18"/>
</g>
<!-- cyclic arrows -->
<g stroke="#d4a853" stroke-width="1.8" fill="none" marker-end="url(#arr)">
<path d="M376 100 L424 110"/>
<path d="M456 134 L462 184"/>
<path d="M460 215 L424 252"/>
<path d="M392 268 L348 256"/>
<path d="M318 232 L308 178"/>
<path d="M312 146 L344 102"/>
</g>
<text x="385" y="330" fill="#e2e8f0" font-size="12" text-anchor="middle">one orbit of size p  (no fixed members)</text>

<defs>
<marker id="arr" markerWidth="9" markerHeight="9" refX="7" refY="4" orient="auto">
<path d="M0,0 L8,4 L0,8 Z" fill="#d4a853"/>
</marker>
</defs>

<text x="320" y="352" fill="#94a3b8" font-size="12" text-anchor="middle">|Syl_p(G)| = 1 + (multiples of p)  ⟹  n_p ≡ 1 (mod p)</text>
</svg>

Worked Examples

Groups of order 15 are cyclic

No simple group of order 30

Common Misconceptions

Lagrange has no full converse

The alternating group $A_4$ has order $12=2^2\cdot 3$. Although $6\mid 12$, $A_4$ has no subgroup of order 6. (Any such subgroup would have index 2, hence be normal and contain all squares of elements; counting the eight 3-cycles forces a contradiction.) Sylow's theorems correctly predict only subgroups of orders $1,2,3,4$ — and indeed $A_4$ has a normal Sylow 2-subgroup $V_4$ of order 4 ($n_2=1$) and four Sylow 3-subgroups ($n_3=4\equiv 1(\mathrm{mod}3)$, $4\mid 3$? no — recheck: $m=3$, $n_3\mid 3$ and $\equiv 1(\mathrm{mod}3)$ gives $n_3\in \{1\}$... but $A_4$ actually has $n_3=4$). The resolution: for $p=3$, $|A_4|=2^2\cdot 3$ so $m=4$, $n_3\mid 4$, $n_3\equiv 1(\mathrm{mod}3)\Rightarrow n_3\in \{1,4\}$, and indeed $n_3=4$. This shows the theorems are tight but the order-6 subgroup simply does not exist.

Connections

Sylow's theorems sit at the heart of finite group theory and link to many neighbors. They refine Lagrange's Theorem by providing a partial converse. Their proofs are pure applications of Group Actions and the Orbit-Stabilizer Theorem, and the counting argument is the Class Equation specialized to conjugation on subgroups. They feed directly into the Classification of Finite Simple Groups by ruling out simplicity for many orders, and the local-global philosophy they embody (studying $G$ one prime at a time) generalizes into Local Analysis in Group Theory and the theory of p-Groups and Nilpotent Groups (a finite group is nilpotent iff it is the direct product of its Sylow subgroups).

Real-World Applications

• Classification of small groups. Sylow counting determines all groups of order $pq$, $p^{2}q$, $15$, $30$, $p^3$, etc., the backbone of every algebra course's "groups of small order" tables.
• Proving non-simplicity. Showing groups of order, e.g., $200=2^3\cdot 5^2$ have a normal Sylow 5-subgroup ($n_5=1$) is a standard route used inside the proof of the Classification of Finite Simple Groups.
• Galois theory / solvability. Detecting normal Sylow subgroups helps establish solvability of Galois groups, deciding which polynomial equations are solvable by radicals.
• Cryptography and computational group theory. Algorithms in systems like GAP and Magma compute Sylow subgroups to decompose and analyze large permutation and matrix groups.
• Coding theory. Automorphism groups of error-correcting codes are analyzed via their Sylow structure to understand symmetry and decoding.
• Crystallography and chemistry. Finite symmetry (point) groups of molecules and crystals are classified using subgroup structure where Sylow analysis pins down possible $p$-subgroup symmetries.
• Representation theory (modular). Brauer theory and block theory organize representations over fields of characteristic $p$ around Sylow $p$-subgroups (defect groups).

Historical Development

• 1770–1771 — Lagrange. Joseph-Louis Lagrange studies permutations of roots of equations, implicitly the "order divides" idea later named Lagrange's theorem.
• 1801 — Gauss. Disquisitiones Arithmeticae contains group-theoretic reasoning on residues and forms, prefiguring abelian group structure.
• 1830s — Galois. Évariste Galois introduces normal subgroups and the role of group structure in solvability of equations.
• 1845 — Cauchy. Augustin-Louis Cauchy proves that if a prime $p$ divides $|G|$ then $G$ has an element (hence subgroup) of order $p$ — the existence seed Sylow would vastly generalize.
• 1872 — Sylow. Ludwig Sylow publishes the three theorems for permutation groups in Mathematische Annalen, the definitive existence/conjugacy/counting results.
• 1878 — Frobenius. Georg Frobenius gives a proof valid for abstract (not merely permutation) groups, freeing the theorems from the substitution-group formalism.
• 1887 — Hölder & others. Sylow's theorems become central tools in the program to classify groups by order; Hölder classifies groups of several small orders.
• 1895–1911 — Burnside. William Burnside's Theory of Groups of Finite Order canonizes Sylow theory and uses it (with character theory) toward results like the $p^a{q}^b$ solvability theorem.
• 1960s–1980s — Classification. Sylow analysis is a recurrent engine in the decades-long classification of finite simple groups (Feit–Thompson, Gorenstein, Aschbacher, et al.).

Subtleties & Limits

While Sylow's theorems are fully proved and complete, deep questions about Sylow structure remain active. The McKay conjecture (recently announced as proved, building on the work of many) asserts a numerical coincidence between irreducible characters of $G$ of degree prime to $p$ and those of the normalizer $N_G(P)$ of a Sylow $p$-subgroup — a profound "local determines global" refinement. The broader local–global principle (Alperin's weight conjecture, the Brauer height-zero conjecture) seeks to express invariants of $G$ entirely in terms of $p$-local subgroups built from Sylow subgroups; several of these remain open or only recently settled. Determining the precise structure (not just existence and count) of Sylow subgroups in arbitrary families of groups, and how the integer $n_p$ behaves, is genuinely subtle: e.g., which integers $n$ can occur as $n_p$ for some group is itself a studied question.

See Also