Sylow p-Subgroups – Intersection and Lagrange’s Theorem

group-theorysimple-groupssylow-theory

It seems that often in using counting arguments to show that a group of a given order cannot be simple, it is shown that the group must have at least $n_p(p^n-1)$ elements, where $n_p$ is the number of Sylow $p$-subgroups.

It is explained that the reason this is the case is because distinct Sylow $p$-subgroups intersect only at the identity, which somehow follows from Lagrange's Theorem.

I cannot see why this is true.

Can anyone quicker than I tell me why? I know it's probably very obvious.

Note: This isn't a homework question, so if the answer is obvious I'd really just appreciate knowing why.

Thanks!

Best Answer

Suppose $P$ and $Q$ are Sylow p-subgroups of prime order p (so not just any power of p; as others remarked, then it is not true in general). Note that $P\cap Q$ is a subgroup of $P$ (and of $Q$). So by Lagrange, the order $|P\cap Q|$ divides p. As p is prime, it is 1 or p. But it cannot be p, as $P$ and $Q$ are distinct. So $|P\cap Q|=1$ and consequently the intersection is trivial.

Related Question