I am trying to prove that a group of order $p^2q^2$ where $p$ and $q$ are primes is solvable, without using Burnside's theorem. Here's what I have for the moment:
- If $p = q$, then $G$ is a $p$-group and therefore it is solvable.
-
If $p \neq q$, we shall look at the Sylow $p$-subgroups of $G$. We know from Sylow's theorems that $n_p \equiv 1 \pmod p$ and $n_p \mid q^2$, therefore $n_p \in \{1, q, q^2\}$.
-
If $n_p = 1$, it is over, because the Sylow $p$-Subgroup $P$ is normal in $G$ of order $p^2$, and $G/P$ has order $q^2$. Thus both are solvable and $G$ is solvable.
- If $n_p = q^2$, we have $q^2(p^2-1)$ elements of order $p$ or $p^2$ in $G$, and we have $q^2$ elements left to form a unique Sylow $q$-subgroup. By the same argument as before, $G$ is solvable.
- That's where I'm in trouble. I don't know what to do with $n_p = q$. It seems to lead nowhere.
Thanks in advance for any help!
Laurent
Best Answer
You argument works just as well with $p$ and $q$ switched, so the only time you have trouble is if both $n_p=q$ and $n_q = p$. Since $1\equiv n_p \mod p$ and $1\equiv n_q \mod q$ this puts very strong requirements on $p$ and $q$.
Hint 1:
Hint 2:
Fix for OP's argument:
The OP's argument is currently flawed in the case $n_p=q^2$, so this answer is only truly helpful after that flaw is fixed.
A very similar argument to the one given in this answer works. First part of your argument works, and the $p-q$ symmetry helps:
Now we use the Sylow counting again to get some severe restrictions:
Unfortunately now we don't get an easy contradiction, but at least we only get one possibility:
In this case, we get: