Sylow Theorems

The Sylow theorems are a collection of results in the theory of finite groups. They give a partial converse to Lagrange's Theorem, and are one of the most important results in the field. They are named for P. Ludwig Sylow, who published their proof in 1872.

The Theorems

Throughout this article, $p$ will be an arbitrary prime.

The three Sylow theorems are as follows:

Theorem. Every finite group contains a Sylow $p$ -subgroup.

Theorem. In every finite group, the Sylow $p$ -subgroups are conjugates.

Theorem. In every finite group, the number of Sylow $p$ -subgroups is equivalent to 1 (mod $p$ ).

As $0\neq 1 \pmod{p}$ , the third theorem implies the first.

Before proving the third theorem, we show some preliminary results.

Lemma 1. Let $r$ and $m$ be nonnegative integers. Then $\binom{p^r m}{p^r} \equiv m \pmod{p} .$

Proof. Let $G$ be a group of order $p^r$ (e.g., $\mathbb{Z}/p^r\mathbb{Z}$ , and let $S$ be a set of size $m$ . Let $G$ act on the set $G \times T$ by the law $g(\alpha, x) \mapsto (g\alpha, x)$ ; extend this action canonically to the subsets of $G \times S$ of size $p^r$ . There are $\binom{p^r m}{p^r}$ such subsets.

Evidently, a subset of $A \times T$ is stable under this action if and only if $A= G$ . Thus the fixed points of the action are exactly the subsets of the form $G \times \{x\}$ , for $x\in S$ . Then there are $m$ fixed points. Therefore $\binom{p^r m}{p^r} \equiv m,$ since the $p$ -group $G$ operates on a set of size $\binom{p^r m}{p^r}$ with $m$ fixed points. $\blacksquare$

Let $G$ be a finite group, and let its order be $n= p^r m$ , for some integer $m$ not divisible by $p$ .

Lemma 2. Let $\mathfrak{P}$ be the set of subsets of $G$ of size $p^r$ , and let $G$ act on $\mathfrak{P}$ by left translation. Suppose $\mathfrak{H}$ is an orbit of $\mathfrak{P}$ such that $p$ does not divide $\lvert \mathfrak{H} \rvert$ . Then $\mathfrak{H}$ has $m$ elements, and they are disjoint.

Proof. Since $\lvert \mathfrak{H} \rvert$ divides $n = p^r m$ but is relatively prime to $p^r$ , it follows that $\lvert \mathfrak{H} \rvert$ divides $m$ ; in particular, $\lvert \mathfrak{H} \rvert \le m$ . Since every element of $G$ is included in some element of $\mathfrak{H}$ , $\lvert G \rvert = \biggl\lvert \bigcup_{H \in \mathfrak{H}} H \biggr\rvert \le \lvert \mathfrak{H} \rvert \cdot p^r \le m \cdot p^r,$ with equality only when the elements of $\mathfrak{H}$ are disjoint and when $\mathfrak{H}=m$ . Since equality does occur, both these conditions must be true. $\blacksquare$

Theorem 1. The number of finite subgroups of $G$ is equivalent to 1 (mod $p$ ).

Proof. Consider the action of $G$ on $\mathfrak{P}$ , as described in Lemma 2. Since $\binom{n}{p} \equiv m \pmod{p},$ and every orbit $\mathfrak{H}$ of $\mathfrak{P}$ for which $p$ does not divide $\lvert \mathfrak{H} \rvert$ has $m$ elements, it follows that the number of such orbits is equivalent to 1 (mod $p$ ). It thus suffices to show that every such orbit contains exactly one Sylow $p$ -subgroup, and that every Sylow $p$ -subgroup is contained in exactly one such orbit.

To this end, let $\mathfrak{H}$ be an orbit of $\mathfrak{P}$ for which $p$ does not divide $\mathfrak{H}$ . Consider the equivalence relation $R(x,y)$ on elements of $G$ , defined as " $x$ and $y$ are in the same element of $\mathfrak{H}$ ". Then $R$ is compatible with left translation by $G$ ; since the elements of $\mathfrak{H}$ are disjoint, $R$ is an equivalence relation. Thus the equivalence class of the identity is a subgroup $H$ of $G$ , which must have order $p^r$ . Since this is the only element of $\mathfrak{H}$ that contains the identity, it is the only group in $\mathfrak{H}$ .

Conversely, if $H$ is a Sylow $p$ -subgroup, then its orbit is its set of left cosets, which has size $m$ , which $p$ does not divide. Since orbits are disjoint, $H$ is contained in exactly one orbit of $\mathfrak{P}$ . $\blacksquare$

Theorem 2. The Sylow $p$ -subgroups of $G$ are conjugates.

Page

Toolbox

Search

Sylow Theorems

The Theorems

See also