Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 4.5.29 (Simple groups $G$ of order $|G| < 100$)
Exercise 4.5.29 (Simple groups $G$ of order $|G| < 100$)
If is a non-abelian simple group of order , prove that .
Answers
Proof. Let be a non-abelian simple group of order . We know that
- if , or if is prime or the square of a prime, then is abelian.
- If for some integer , then is a -group which has a non trivial center (and is a proper subgroup, otherwise is abelian). Thus is not simple.
- If , with , the unique Sylow -subgroup of is normal, so is not simple (see Example, “groups of order ” in this section).
- If , where are prime numbers, then has a normal Sylow subgroup for either or (see Example, “groups of order ” in this section), so is not simple.
- If , then has a normal subgroup isomorphic to (see Example, “groups of order ” in this section), so is not simple.
It remains the following values for :
Part 3 of Sylow’s Theorem gives first (see program below in the note):
- If , then .
- If , then .
- If , then .
- If , then .
- If , then .
- If , then .
- If , then .
In every case, is not simple.
There are values left to study (excluding ):
-
If , then , thus
Assume for the sake of contradiction that . Then .
Since acts by conjugation on the set of Sylow -subgroups , this action affords a homomorphism
This action is not trivial, otherwise would be normal in , therefore . Since is simple, or , thus
so that is injective. This shows that is isomorphic to a subgroup of . Since and , this is impossible. This contradiction shows that , therefore has a non trivial proper normal subgroup of order , so is not simple.
- If or , we obtain similarly or . Since , the same proof shows that is not simple.
-
If , then .
Assume for the sake of contradiction that . Then .
Since acts by conjugation on the set of Sylow -subgroups , this action affords a homomorphism
This action is not trivial, otherwise would be normal in , therefore . Since is simple, or , thus
so that is injective. This shows that is isomorphic to a subgroup of . Since . This is impossible. This contradiction shows that , therefore has a non trivial proper normal subgroup of order , so is not simple.
- If , . If , then , and similarly acts faithfully by conjugation on the set of -Sylow, so is isomorphic to some subgroup of . Since , this is impossible.
- If , we obtain similarly or . If , acts non trivially by conjugation on the set of Sylow -subgroups. This affords an injective homomorphism . But . Therefore is not simple.
-
If , we obtain
Suppose for the sake of contradiction that and , so that and . Any pair of distinct Sylow subgroups have trivial intersection, so there are elements of order . It remains a set of elements, whose order is not . Every Sylow -subgroup has elements, whose order is not , so , where , so . There is only one Sylow -subgroup of , which is normal in . Therefore is not simple.
- If , where is odd, by Exercise 4.2.13, there is a subgroup of of index 2, which is normal in , so is not simple.
It remains only the case . By Proposition 23, . □
Note: We obtain the possible values of with sagemath. For instance,
sage: def sylow(n): ....: l = [] ....: for p,a in n.factor(): ....: m = n // p^a ....: divisors = [d for d in range(1,m+1) if m % d == 0] ....: possible = [d for d in divisors if d % p == 1] ....: l.append([p,possible]) ....: return(l) ....: sage: n = 90 sage: for p, l in sylow(n): ....: print p, ’=>’, l ....: 2 => [1, 3, 5, 9, 15, 45] 3 => [1, 10] 5 => [1, 6]