Sylow Theorems and Applications

The Sylow theorems are indispensable tools in finite group theory, unlocking the structural secrets of groups by examining subgroups of prime-power order. By guaranteeing the existence and controlling the behavior of these subgroups, Sylow theory enables you to classify groups up to isomorphism and prove deep results about simplicity, forming a bedrock for advanced algebraic study.

Preliminaries: p-Groups and Sylow p-Subgroups

To understand the Sylow theorems, you must first grasp two foundational concepts. A p-group is a finite group whose order is a power of a prime number $p$. For example, any group of order $8$, $27$, or $p^n$ is a p-group. Within a larger finite group $G$, we are particularly interested in maximal p-subgroups. A Sylow p-subgroup of $G$ is a subgroup $P$ such that $|P| = p^n$, where $p^n$ divides $|G|$ but $p^{n+1}$ does not divide $|G|$. In essence, it is a p-subgroup of the highest possible order within $G$. For instance, in a group of order $48 = 2^4 \cdot 3$, a Sylow 2-subgroup has order $16$, and a Sylow 3-subgroup has order $3$.

Statement of the Sylow Theorems

The Sylow theorems consist of three interrelated results that completely describe the Sylow p-subgroups of a finite group $G$ with $|G| = p^n m$, where $p$ is a prime and $p \nmid m$.

Sylow's First Theorem (Existence): For every prime $p$ dividing $|G|$, there exists at least one Sylow p-subgroup of $G$.

Sylow's Second Theorem (Conjugacy): All Sylow p-subgroups of $G$ are conjugate to each other. That is, if $P$ and $Q$ are Sylow p-subgroups, then there exists some $g \in G$ such that $Q = gPg^{-1}$.

Sylow's Third Theorem (Number Constraints): Let $n_p$ denote the number of Sylow p-subgroups of $G$. Then:

1. $n_p$ divides $m$ (where $|G| = p^n m$).
2. $n_p \equiv 1 \pmod{p}$.

These constraints often force $n_p = 1$, which is a critical observation since a unique Sylow p-subgroup must be normal in $G$.

Proofs of the Sylow Theorems

The proofs are elegant applications of group actions. We outline the key ideas, focusing on the logical progression.

Proof of Existence: We proceed by induction on $|G|$. The base case is trivial. For the inductive step, consider the class equation of $G$: $|G| = |Z(G)| + \sum [G : C_G(x_i)]$. If $p$ divides $|Z(G)|$, then by Cauchy's theorem, $Z(G)$ has an element of order $p$, which generates a normal subgroup; the quotient group is smaller, and we lift a Sylow p-subgroup from it. If $p$ does not divide $|Z(G)|$, then there exists a non-central element $x_i$ such that $p$ does not divide $[G : C_G(x_i)]$. Since $|G| = [G : C_G(x_i)] \cdot |C_G(x_i)|$, we have that $p^n$ divides $|C_G(x_i)|$. Since $C_G(x_i) \neq G$, by induction, $C_G(x_i)$ contains a Sylow p-subgroup, which is also a Sylow p-subgroup of $G$.

Proof of Conjugacy: Let $P$ be a Sylow p-subgroup whose existence is guaranteed by the first theorem, and let $Q$ be any other Sylow p-subgroup. Consider the action of $Q$ on the set of left cosets $G/P$ by left multiplication. The size of any orbit divides $|Q|$, which is a power of $p$. Since $|G/P| = m$ is not divisible by $p$, there must exist an orbit of size $1$. This implies there is a coset $gP$ such that for all $q \in Q$, $qgP = gP$. This means $g^{-1}Qg \subseteq P$, and since both are Sylow p-subgroups, we have $g^{-1}Qg = P$, or $Q = gPg^{-1}$.

Proof of Number Constraints: Fix a Sylow p-subgroup $P$. Let $S$ be the set of all Sylow p-subgroups. $P$ acts on $S$ by conjugation. The orbits under this action partition $S$. The orbit-stabilizer theorem tells us the size of any orbit divides $|P|$, a power of $p$. The only orbit of size $1$ is $\{P\}$ itself (since if $Q$ is fixed by $P$, then $P$ normalizes $Q$, and one can show $P=Q$). All other orbits have sizes divisible by $p$. Therefore, $|S| = n_p \equiv 1 \pmod{p}$. Furthermore, $G$ acts transitively on $S$ by conjugacy (from the second theorem), so $n_p = [G : N_G(P)]$. Since $P \subseteq N_G(P)$, we have $[G : N_G(P)]$ divides $[G : P] = m$. Hence, $n_p$ divides $m$.

Applications: Classifying Groups of Small Order

Sylow theory turns classification problems into manageable puzzles using congruence and divisibility constraints. Consider classifying all groups of order $15 = 3 \cdot 5$. Let $n_3$ be the number of Sylow 3-subgroups and $n_5$ the number of Sylow 5-subgroups. By Sylow's third theorem:

• $n_3$ divides $5$ and $n_3 \equiv 1 \pmod{3}$. The only possibility is $n_3 = 1$.
• $n_5$ divides $3$ and $n_5 \equiv 1 \pmod{5}$. The only possibility is $n_5 = 1$.

Therefore, both the Sylow 3-subgroup $P_3$ and Sylow 5-subgroup $P_5$ are unique, hence normal. Since their intersection is trivial and their product is the whole group, $G \cong P_3 \times P_5 \cong C_3 \times C_5 \cong C_{15}$. Thus, every group of order $15$ is cyclic.

For a slightly more complex example, consider groups of order $21 = 3 \cdot 7$. Let $n_7$ be the number of Sylow 7-subgroups. We have $n_7$ divides $3$ and $n_7 \equiv 1 \pmod{7}$. This forces $n_7 = 1$, so the Sylow 7-subgroup $P_7 \cong C_7$ is normal. Let $P_3 \cong C_3$ be a Sylow 3-subgroup. The group is a semidirect product $C_7 \rtimes C_3$. The possible homomorphisms $C_3 \to \operatorname{Aut}(C_7) \cong C_6$ give two possibilities: the trivial map (yielding the cyclic group $C_{21}$) and a nontrivial map of order $3$ (yielding the unique non-abelian group of order $21$).

Applications: Proving Non-Simplicity of Certain Groups

A group is simple if it has no non-trivial proper normal subgroups. Sylow theory provides powerful tests for non-simplicity by forcing the existence of a normal Sylow subgroup.

Consider a group $G$ of order $30 = 2 \cdot 3 \cdot 5$. We show it cannot be simple. Let $n_5$ be the number of Sylow 5-subgroups. Sylow's third theorem gives $n_5$ divides $6$ and $n_5 \equiv 1 \pmod{5}$. The possibilities are $n_5 = 1$ or $n_5 = 6$. If $n_5 = 1$, that unique Sylow 5-subgroup is normal, and $G$ is not simple. If $n_5 = 6$, these subgroups account for $6 \cdot (5-1) = 24$ distinct elements of order $5$ (since different Sylow p-subgroups intersect trivially). Now consider $n_3$, the number of Sylow 3-subgroups. Possibilities are $n_3 = 1$ or $n_3 = 10$. If $n_3 = 1$, it is normal. If $n_3 = 10$, these account for $10 \cdot (3-1) = 20$ distinct elements of order $3$. But $24 + 20 > 30$, which is impossible. Therefore, $n_3$ must be $1$, giving a normal Sylow 3-subgroup. Hence, no group of order $30$ is simple.

Another classic example is groups of order $48$. While the constraints alone might not force a unique Sylow 2-subgroup, more advanced arguments using the action on cosets or the normalizer can show that such a group cannot be simple, often because the number of Sylow 2-subgroups is small enough to construct a nontrivial normal subgroup.

Common Pitfalls

1. Ignoring All Constraints for $n_p$: A common error is to use only one part of Sylow's third theorem. You must check both that $n_p$ divides $m$ and that $n_p \equiv 1 \pmod{p}$. For example, in a group of order $28$, $n_7$ divides $4$ and $n_7 \equiv 1 \pmod{7}$. The divisors of $4$ are $1,2,4$. Only $1$ is congruent to $1 \mod 7$. So $n_7=1$ is forced, not just possible.

1. Assuming Sylow p-subgroups Are Always Normal: While a unique Sylow p-subgroup is normal, having multiple Sylow p-subgroups does not preclude normality elsewhere. The theorems provide conditions to test; normality is a conclusion, not an automatic property. For instance, in the symmetric group $S_4$ (order $24$), the Sylow 3-subgroups are not normal ($n_3 = 4$), but the Sylow 2-subgroups are also not unique ($n_2 = 3$).

1. Miscounting Elements in Non-Simplicity Arguments: When assuming multiple Sylow p-subgroups to force a contradiction, ensure you correctly count distinct non-identity elements. Different Sylow p-subgroups for the same prime $p$ intersect only in the identity. So if you have $n_p$ subgroups of order $p^k$, they contribute $n_p \cdot (p^k - 1)$ distinct elements of order a power of $p$. Adding these for different primes requires careful disjointness checks.

1. Overlooking the Base Case in Inductive Proofs: When sketching the proof of existence, beginners sometimes mishandle the case where $G$ has a nontrivial center. The correct application of Cauchy's theorem and the inductive hypothesis on quotient groups is crucial for a rigorous argument.

Summary

• The Sylow theorems guarantee the existence, conjugacy, and tightly constrained number of maximal prime-power order subgroups in any finite group.
• The theorems are proven using group actions, with the class equation and orbit-stabilizer theorem playing key roles, transforming abstract problems into combinatorial ones.
• Applications to classification involve solving the congruence $n_p \equiv 1 \pmod{p}$ and divisibility $n_p \mid m$ to severely limit possibilities, often forcing a unique Sylow subgroup that is normal.
• Proving non-simplicity often involves showing that for some prime $p$, the only possible $n_p$ is 1, or that assuming multiple Sylow subgroups leads to an element count exceeding the group order.
• Mastery of Sylow theory requires simultaneously applying all parts of the third theorem and carefully tracking element counts in application arguments.
• These theorems are a gateway to understanding the architecture of finite groups, directly leading to deeper classification results and the study of solvable and simple groups.