3
$\begingroup$

Just curious.

I had some values of $n$, and I wanted to conclude that all groups of order $n$ are solvable. Some were easy (eg. not divisible by 4, or $p^aq^b$). For some I did this by inspection of the list of small non-abelian simple groups and found that none of them had order dividing $n$.

In fact those $n$ I resorted to The List for, they had a prime factor $p$, and $n \lt \frac{p^3-p}{2} = \|PSL_2(p)\|$. It sure "looks" like in general we can say all groups of such orders are solvable. (EDIT: that is, if we already knew all groups of order $\frac{n}{p}$ were solvable, which in my cases I did. To rephrase: if we can say all groups of order $m$ are solvable, it "looks" like we can say all groups of order $mp$ are solvable, for any prime $p \gt \sqrt{2m+1}$. This would follow if $PSL_2(p)$ was the smallest unsolvable group with order divisible by $p$.)

I was curious if this was actually true.

  • 0
    I would guess that the answer is yes, but you would probably need the classification of finite simple groups to prove it. – 2017-02-01
  • 1
    If you want to prove your conjecture by induction, you could probably base it on Thompson's classification of [N-groups](https://en.wikipedia.org/wiki/N-group_(finite_group_theory)) or even on the list of minimal simple groups (all subgroups solvable). – 2017-02-03
  • 0
    @j.p. : right, thanks for this hint. A minimal counterexample to the weaker conjecture ($m \to mp$) would be a minimal simple group, and the list of those isn't so daunting. – 2017-02-04

1 Answers 1

0

For the weaker conjecture, YES. All groups order $m$ solvable implies all groups order $mp$ solvable, prime $p \gt \sqrt{2m+1}$.

Suppose all groups order $m$ are solvable, and there is an unsolvable group of order $mp$. If it has an unsolvable proper subquotient, then $p$ divides the order of this subquotient, else we would have an unsolvable group of order dividing $m$. So by induction we have a minimal simple group of order $m'p$, $m'$ dividing $m$.

These minimal simple groups have a short classification -- thank you j.p. -- they are (some of) the $PSL_2$'s, the Suzuki groups, and $PSL_3(3)$. The latter is ruled out by easy calculation.

The order of the Suzuki groups is $q^2(q^2+1)(q-1)$, for $q$ an odd power of 2. Fortunately $q^2+1 = (q+1+\sqrt{2q})(q+1-\sqrt{2q})$, and $\sqrt{2q}$ is an integer. So worst case we're going to have $p$ on the order of $\sqrt[4]{m}$, so there are only a few small cases to check. In fact the only exception is $q=2$, but ${}^2B_2(2)$ is solvable.

For $PSL_2(q)$ where $q$ a power of a prime but not itself prime, worst case that $q+1$ or $q-1$ equals prime $p$ or $2p$, but it is not hard to see still $p \le \sqrt{2m+1}$, equality only for $p=5$, and indeed $PSL_2(4) \simeq PSL_2(5)$.

So that leaves $PSL_2(p)$ for $p$ prime, for which $p = \sqrt{2m+1}$ exactly.

(EDITED) Not sure about the original question. If $PSL_2(p)$ is not always the smallest simple group whose order is divisible by $p$, it's not clear that this would contradict the above, after all, not all the $PSL_2(p)$'s are minimal. For instance for $p=19$ we have $m=180$ and it is not the case that all groups of order $m$ are solvable. Indeed $PSL_2(19)$ contains $PSL_2(5)$.

  • 1
    What is the "stronger conjecture"? The question in the title doesn't seem to appear anywhere in the body of your question, so I'm a bit confused exactly what you're asking. It's certainly not true that a group of order $n$ must be solvable if $n$ has a prime factor $p$ such that $n<\vert\text{PSL}(2,p)\vert$, as $A_5\times C_p$ for a large prime $p$ shows. – 2017-02-04
  • 1
    @JeremyRickard Woops, right, that was less than clear. The stronger conjecture is that the answer to question in the title is yes. I'll edit. – 2017-02-04
  • 1
    The subgroups of ${\rm PSL}(2,p)$ were classified long ago (by Dickson I think) and the only non-solvable subgroup is $A_5$, which arises whenever $p \equiv \pm 1 \bmod 5$. I think you could use that fact to positively answer the main question. – 2017-02-04