Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 4.1.8
Exercise 4.1.8
If a polynomial is irreducible over a field , it may or may not remain irreducible over a large field. Here are examples of both types of behavior.
- (a)
- Prove that is irreducible over .
- (b)
- In Example 4.1.7, we showed that is irreducible over (it is the minimal polynomial of ). Show that is not irreducible over .
Answers
Proof.
- (a)
-
is irreducible over
. We show that it remains irreducible over
.
Suppose on the contrary that is reducible over : , where are nonconstant polynomials. Then , and as , ,
Then is a root of , thus is a root of . Since and , every element of is of the form .
We should have Then
If , , in contradiction with the irrationality of . Thus or .
gives : this is in contradiction with the irrationality of .
implies . But then .
, and . By Gauss Lemma, , hence , thus is even: this is absurd.
Conclusion: is irreducible .
- (b)
-
The equality show that is not irreducible over .
Factorisation with Sage:
K = NumberField(x^2-3, ’a’);L.<X> = PolynomialRing(K) p = X^4-10*X^2+1 factor(p)