Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 8.1.6
Exercise 8.1.6
In this exercise you will prove that groups of order 30 are solvable.
- (a)
- Use the method of Example 8.1.10 to prove that groups of order 10 or 15 are solvable.
- (b)
- Show that a group of order 30 is solvable if and only if it has a proper normal subgroup different from .
- (c)
- Let a group of order 30. Use the third Sylow theorem to show that has one or ten -Sylow subgroups and one or six -Sylow subgroups.
- (d)
- Show that the group can’t simultaneously have ten -Sylow subgroups and six -Sylow subgroups. Conclude that must be solvable.
Answers
Proof.
- (a)
-
Let
be a group of order 10, and
the number of 5-Sylow subgroups of
. Then
and
. Therefore
. A group of order 10 has a unique 5-Sylow
, and as all 5-Sylow subgroup are conjugate,
is normal in
, since the conjugate of a 5-Silow is a 5-Sylow. Then
and
are prime, so
and
are cyclic of prime order. This implies that
is solvable.
Same reasoning if : then , and , therefore .
- (b)
-
Let
be a group of order 30.
- If is Abelian, a fortiori solvable, it contains a 5-Sylow subgroup, necessarily normal in .
-
If
is a non Abelian solvable group, there exists a composition series
Then , otherwise a short series , with Abelian, is in contradiction with the hypothesis " non Abelian". Then the subgroup is normal in , and .
Consequently the hypothesis solvable implies the existence of a proper non trivial subgroup of .
-
Conversely, suppose that
has a normal subgroup
, with
.
then divides 30, and , so .
If or , then is solvable by part (a), and the quotient group is then of order or both prime, so is cyclic. This proves that is solvable.
If or , then is cyclic, and of order 15 or 10 is solvable by part (a), so is solvable.
A group of order 5 is cyclic, a fortiori solvable, and a group of order 6 est isomorphic to the cyclic group , or to , and in both cases is solvable.
If or , and are both solvable, so is solvable.
Conclusion: a group of order 30 is solvable if and only if it contains a proper non trivial normal subgroup.
- (c)
-
The number
of 3-sylow subgroups of
satisfies
, and
divides
, so
or
.
The number of 5-sylow subgroups of satisfies , and divisdes , so or .
- (d)
-
Suppose that
contains ten 3-Sylow subgroups of
and six 5-Sylow subgroups.
Two distinct cyclic subgroups of order , with prime, have a trivial intersection, otherwise any non trivial element in the intersection would be a generator of these two subgroups, which would then be identical.
Consequently, two 3-Sylow subgroups have an intersection reduced to the identity of , and this is the same for the 5-Sylow.
The union of 3-Sylow has then elements, and the union of the 5-Sylow elements. As a 5-Sylow and a 3-Sylow have a trivial intersection, would contains at least elements, in contradiction with .
Therefore or . In the first case, a 3-Sylow is normal in , and in the second case, this is a 5-Sylow. By part (b), is solvable.