Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 13.2.19
Exercise 13.2.19
Use the methods of this section to compute the Galois group over of each of the following polynomials. Be sure to check that they are irreducible. Remember that in Section 4.2 we learned how to factor polynomials over a finite extension of .
- (a)
- .
- (b)
- .
- (c)
- .
- (d)
- .
- (e)
- .
Answers
Proof. We use the Exercise 14 resolvent() procedure to compute a sextic resolvent, and the additional procedure to verify that this resolvent has a rational root (the polynomials are supposed, as in this exercise, monic with integer coefficients, i.e., , hence resolvent rational root is an integer):
def rational_root(theta): n = Integer(theta.subs(y=0)) if n == 0: return True, 0 for d in n.divisors(): if theta.subs(y = d) == 0: return True, d if theta.subs(y = -d)== 0: return True, -d return False, None
- (a)
-
R.<x> = QQ[] f = x^5 + x + 1;ff.is_irreducible()
f.factor()
The roots of are . Write the roots of . Then is the splitting field of over . As , is also the splitting field of over . The discriminant of is . We show that .
If , then . Therefore
Thus or . If , then , which is impossible since , and gives , which is also impossible. Therefore is not a square in , so the Galois group of over is . This implies that . Since , , so the Galois group of has order :
Since is not a square of , .
Let
Then is a group homomorphism, and the kernel of is , since every -automorphism of which fixes is the identity of . So is injective, and , thefore is a group isomorphism.
If we choose the numbering of the roots of , then the Galois group of is
- (b)
-
R.<x> = QQ[] f = x^5 + 20 *x + 16;ff.is_irreducible()
theta = resolvent(f)[0]; theta.subs(Delta = f.discriminant()).expand()
res = rational_root(theta); res
f.discriminant().factor(),f.discriminant().is_square()
Thus the Galois group of over is .
Verification:
f.galois_group().gens()
- (c)
-
R.<x> = QQ[] f = x^5 + 2;ff.is_irreducible()
theta = resolvent(f)[0]; theta.subs(Delta = f.discriminant()).expand()
res = rational_root(theta); res
f.discriminant().factor(),f.discriminant().is_square()
Thus the Galois group of over is , up to conjugacy.
Verification:
f.galois_group().gens()
- (d)
-
R.<x> = QQ[] f = x^5 -5*x + 12;ff.is_irreducible()
theta = resolvent(f)[0]; theta.subs(Delta = f.discriminant()).expand()
res = rational_root(theta); res
f.discriminant().factor(),f.discriminant().is_square()
K.<alpha> = NumberField(f) S.<X> = K[] g = f.change_ring(S) g.factor()Thus the Galois group of over is , up to conjugacy.
Verification:
f.galois_group().gens()
- (e)
-
R.<x> = QQ[] f = x^5 + x^4 - 4*x^3 - 3*x^2 + 3*x + 1 ff.is_irreducible()
theta = resolvent(f)[0]; theta.subs(Delta = f.discriminant()).expand()
res = rational_root(theta); res
f.discriminant().factor(),f.discriminant().is_square()
K.<alpha> = NumberField(f) S.<X> = K[] g = f.change_ring(S) g.factor()Thus the Galois group of over is , up to conjugacy.
Verification:
f.galois_group().gens()