Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 14.1.8
Exercise 14.1.8
Let be irreducible of prime degree , where has characteristic 0, and let be roots of f in some splitting field. If contains all other roots of , then is solvable by radicals by Theorem 14.1.1. But suppose that there is some third root such that . Is this enough to force to be solvable by radicals?
- (a)
- Use the classification of transitive subgroups of from Section 13.2 to show that the answer is “yes” when p=5.
- (b)
- Use the polynomial from Example 13.3.10 to show that the answer is “no” when p=7.
Answers
Proof.
- (a)
-
By hypothesis,
, and
are roots of
in some splitting field.
Since is a root of , which is irreducible over ,
Then is a root of , so that the minimal polynomial of over has degree . Thus
By the Tower Theorem,
Now, suppose that there is some third root such that . Then . Let be the remaining roots of . Since the characteristic is , the irreducible polynomial is separable.Then is a root of , so that
Since , the tower theorem gives
Moreover , thus . Write the splitting field of over . We have proved
The classification of transitive subgroups of from Section 13.2 shows that any transitive subgroup of with cardinality is a subgroup of , thus is solvable. So is a solvable group, where has characteristic , therefore is solvable (Theorem 8.5.3).
To conclude, the answer is “yes” when .
- (b)
-
To prove that the answer is “no” when
, we use the counterexample
from Example 13.3.10.
The polynomial is not solvable, since its Galois group is , which is simple (Section 14.3) and not commutative, thus non solvable.
We prove that there are roots of such that .
As in Example 13.3.10, consider the resolvant
Then the factorization of over is
where the polynomials , given in Example 13.3.10, are irreducible factors of degrees and .
Take three roots of such that is any linear factor of , so that the minimal polynomial of is , with , thus
Now we prove that . Consider the chain of extensions
where is the splitting field of over .
The minimal polynomial of over is , thus , and
By the Tower Theorem,
is not divisible by 7.
Since is a root of , the minimal polynomial of over divides . Thus
If , by the Tower Theorem, divides . This contradiction proves that
therefore
In this example, there exist roots of , and some third root such that , but is not solvable.
This shows that the answer is “no” when .
Note: In the proof of the Proposition 13.3.9, we saw that must be conjugate to . This means that there is some numbering of the roots
which verify that, for all , there is some such that
In this correspondance, the roots of are seen as nonzero vectors in , and the seven roots of correspond to the seven (unordered) triples of linearly dependent nonzero vectors in . So the roots where chosen in the preceding proof such that the corresponding vectors verify (but not ) .
This is what we understand in the hint of D.A. Cox “Regard the roots as the nonzero vectors of and pick roots such that ”.
This last equality is not true in , but true for the corresponding vectors in .
Moreover, let be any pair of roots. The corresponding vectors are such that is not a base, so that the root corresponding to is such that is a factor of , and the preceding proof shows that . For each pair of roots of , there exists a third root such that .
0.1 IMPRIMITIVE POLYNOMIALS OF PRIME-SQUARED DEGREE