Eisenstein criterion in terms of divisor theory
The below theorem generalises Eisenstein criterion of irreducibility from UFD’s to domains with divisor theory.
Theorem.
Let be a primitive polynomial over an integral domain with divisor theory (http://planetmath.org/DivisorTheory) . If there is a prime divisor such that
- •
- •
- •
then the polynomial is irreducible.
Proof. Suppose that we have in the factorisation
with and . Because the principal divisor , i.e. is divisible by the prime divisor and there is a unique factorisation in the monoid , must divide or but, by , not both of and ; suppose e.g. that. If would divide all the coefficients , then it would divide also the product . So, there is a certain smallest index such that . Accordingly, in the sum , the prime divisor divides (http://planetmath.org/DivisibilityInRings) every summand except the first (see the definition of divisor theory (http://planetmath.org/DivisorTheory)); therefore it cannot divide the sum. But the value of the sum is which by hypothesis
is divisible by the prime divisor. This contradiction
shows that the polynomial is irreducible.