Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 13.2.10
Exercise 13.2.10
This exercise will prove the second equivalence of Proposition 13.2.7. Note that one direction follows trivially from Theorem 13.2.6. So we can assume that and that where .
- (a)
- Use to prove that acts transitively on . As in the previous exercise, we don’t know if are distinct.
- (b)
- Let be the minimal polynomial of over . By part (a), it is also the minimal polynomial of . Prove that , where or . If , then we are done. So we need to rule out .
- (c)
- Show that implies that , and then use this to show that .
Answers
Proof. If has a root , then by Theorem 13.2.6(b), is conjugate to a subgroup of .
Conversely, assume that is conjugate to a subgroup of . Relabeling the roots, we may assume that , and by Theorem 13.2.6(b), has a root , so .
- (a)
-
Write
and
the corresponding automorphism. Then
and corresponds to .
We name the left coset representatives of given in :
Note that these cosets representatives verify , and
By definition, , where and is given in (13.17), and
(see Exercise 13.2.5). Since , , therefore, for
and .
If corresponds to some , then , so
Since corresponds to ,
and similarly . So the images of by the automorphism corresponding to are given by
therefore acts transitively on .
- (b)
-
Let
be the minimal polynomial of
over
. Since
,
, so
, and similarly
are roots of
, so
is the minimal polynomial of
.
, therefore .
is a separable extension, so is separable, therefore
where are distinct. As is the minimal polynomial of over , and , with , divides , so each is a , and each , is a root of so is a . Therefore , and are the distinct roots of .
Since acts transitively on , then the distinct roots have the same order of multiplicity (as in Exercise 9). Therefore , so
Since , , so or . We need to rule out .
- (c)
-
If
,
Then, with some formal computations,
The coefficients of give
so
Substituting these values in the equation, we obtain
where
Since , if the characteristic is not 5, then , so . But the proof of Theorem 13.2.6 shows that this implies that , and this is a contradiction. Thus and is irreducible over . This proves Proposition 13.2.7. in characteristic .
Sage instructions for part (e):
x,y,beta1,beta2,Delta,b2,b4,b6 = var(’x,y,beta1,beta2,Delta,b2,b4,b6’) p = (y^3 + b2*y^2 + b4*y + b6)^2 - 2^10*Delta*y - (y-beta1)*(y-beta2)^5 p = p.expand().collect(y) R.<y>=QQ[] l = [p.coefficient(y,i) for i in range(5,-1,-1)] eq = l[:3] solve(eq,b2,b4,b6) q=p.subs(b2 == -1/2*beta1 - 5/2*beta2, b4 == -1/8*beta1^2 + 5/4*beta1*beta2 + 15/8*beta2^2, b6 == -1/16*beta1^3 + 5/16*beta1^2*beta2 -15/16*beta1*beta2^2 - 5/16*beta2^3) q=q.expand().collect(y) q.coefficient(y,2).factor()It remains the case where the characteristic is 5. Then the equations become,
If , then , hence . Since the characteristic is not 2, we obtain , which is impossible since is separable by hypothesis.
If , it remains a unique equation
that is
In this case
Since
this condition is equivalent to .
I don’t see an immediate contradiction ...
In fact, with this analysis, we can show a counterexample of Proposition 13.2.7:
Let , where . Then is irreducible, separable, and the Sage instructions given in Exercise 6, where we replace the field by show that , and
(We verify this directly on the formulas (13.24) : almost all the terms of contain or , if not, the coefficient is a multiple of 5, so .)
Therefore is a root of , and , where is not irreducible over .
The second equivalence of Proposition 13.2.7 is false if the characteristic of is 5.
Note : Here we know explicitly the roots of in . If is a root of in this field, the roots of are (see Ex. 6.2.5). If we substitute (with the help of Sage) these roots in , we obtain , therefore
This is a confirmation of the previous results.