Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 11.1.10
Exercise 11.1.10
Let .
- (a)
- Use the method of Example 11.1.6 to determine the number of roots of in and .
- (b)
- Explain why the splitting field of over is .
Answers
Proof. (a) With the following Sage instructions:
sage: R.<x> = PolynomialRing(GF(3)) sage: f = -1-x-x^2-x^3-x^4-x^5-x^6-x^7+x^8+x^9+x^10 sage: gcd(f,x^(3^3) -x) x^3 + 2*x^2 + x + 1 sage: gcd(f,x^(3^7) -x) x^7 + 2*x^6 + 2*x^5 + x^4 + 2*x^3 + x^2 + 2 sage: gcd(f,x^3-x) 1
we know that has 3 roots in , 7 roots in (and no root in ).
(The degree of is . Too big for my computer!) (b) We take all the finite field as subfields of an algebraic closure of , so by Corollary 11.1.8,
(If you don’t like algebraic closure, you can replace by which contains all the fields considered in this exercise.)
Note that
Indeed, is a finite subfield of , so is of the form , where and , thus .
Moreover has not root in , since . So the sets of the roots of in and are disjointed. Therefore has 10 distinct roots in any field which contains and . In particular has 10 distinct roots in , and , so splits completely in .
Name the three roots of in , and the seven roots of in .
Since 7 is prime, there is no strictly intermediate field between and , and since , then , and similarly .
Let . Then , is a finite subfield of , which contains and , so and , with , thus , therefore , so . Moreover are in , so
(In other words is the compositum in of and , and the compositum of and in is , so .)
Therefore, is the splitting field of over . □