Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 11.1.6
Exercise 11.1.6
Let have degree , and assume that the leading coefficient of is not divisible by . Prove that the reduction of modulo is irreducible over if and only if it is not possible to find polynomials , where , such that
This is how Galois defines irreducibility modulo in [Galois, p.113].
Answers
Proof. Write the reductions modulo of .
Let be a polynomial of degree , and assume that the leading coefficient of is not divisible by , so , is not zero, and is not an unit of .
-
Suppose that there exist polynomials
, where
, such that
Then , and , and , with . Hence is not irreducible in .
Conclusion: If is irreducible over , it is not possible to find polynomials , where , such that
-
Conversely, suppose that
is not irreducible in
. Then there exist polynomials
with
and
.
There exist some polynomials such that and (if , with , take ). Thus , therefore , so : there exists such that
is irreducible over if and only if it is not possible to find polynomials , where , such that
□