Sylow Theorems and Finite Group Structure

Let a finite group G have order p to the power a times m, where p is prime and p does not divide m. A Sylow p-subgroup has order exactly p to the power a. The existence theorem guarantees such a subgroup. This exceeds finding an element of order p: a subgroup of order p squared need not be cyclic, so one generator need not capture the whole prime-power part. Factor the group order before choosing the power.

The conjugacy theorem says all Sylow p-subgroups are conjugate inside G; moreover every p-subgroup is contained in a Sylow p-subgroup. The counting theorem restricts their number n_p by divisibility and a congruence. These are simultaneous requirements, so first list divisors of m and then discard those not congruent to one modulo p. A surviving number is a permitted candidate, not automatically a realized count for the group you are investigating.

Conjugation acts on the set of Sylow p-subgroups. The stabilizer of a chosen P is its normalizer: the elements g satisfying gPg inverse equals P. Since conjugacy makes this action transitive, orbit–stabilizer identifies n_p with the index of that normalizer. If n_p equals one, every conjugate is P itself, which is precisely normality. Conversely, a normal Sylow subgroup has no distinct conjugates, so the conjugacy theorem makes it unique. Being a Sylow subgroup alone does not imply being normal. Do not confuse the normalizer with the centralizer: normalizing P allows conjugation to permute its elements, whereas centralizing P requires fixing every element individually. A subgroup can therefore be normal without its elements commuting with the entire ambient group.

The congruence also has an action-based explanation. Let P act on the Sylow subgroups by conjugation. Nontrivial orbits have sizes divisible by p. The only fixed Sylow subgroup is P: if P normalizes another Sylow subgroup Q, the product QP is a p-subgroup because Q is normal in that product; maximal prime-power order then forces QP equals Q and P equals Q. Thus the total count differs from one by a multiple of p. This reasoning explains why the congruence involves p, rather than the full order of P.

When two normal subgroups P and Q have coprime orders, their intersection is trivial: its order divides both orders by Lagrange. For elements h in P and k in Q, the commutator hkh inverse k inverse belongs to both subgroups, using normality in each direction. It must therefore be the identity, so every element of P commutes with every element of Q. Their product then behaves as a direct product. Coprime orders alone would not justify the commutation step; normality is doing essential work.

For order twelve, Sylow counting gives n_3 equal to one or four and n_2 equal to one or three. The arithmetic therefore does not identify a unique group or force both subgroups to be normal. The cyclic group of order twelve has both counts equal to one, whereas the alternating group on four letters has four Sylow 3-subgroups and one Sylow 2-subgroup. These are compatible outcomes, not a contradiction. When several candidates survive, look for an additional action, element count, or homomorphism instead of silently choosing your preferred value.