We prove the stated Eisenstein criterion directly. Assume . Suppose in the polynomial ring . Since the principal ideal domain is an integral domain, polynomial degree is additive under polynomial multiplication, and the product of the leading coefficients of is the leading coefficient of . These two coefficients are therefore units. Multiplying and by inverse units, without changing their product, makes both factors monic polynomials.
If either factor is a constant polynomial, that factor is now , so the original factor was a unit. It remains to rule out and .
The prime element generates a maximal ideal in the principal ideal domain . Indeed, if , then , and the irreducible element property of forces either or . Consequently is a field. Apply reduction modulo an ideal to every coefficient. The monic polynomial factors retain their polynomial degrees, and the hypotheses give
The polynomial ring over a field is a unique factorization domain, and is an irreducible polynomial. Thus its only monic polynomial divisors in are powers of . Hence and . Both have zero constant term, so and . This gives , a contradiction.
The monic polynomial has positive polynomial degree, so it is a nonzero nonunit. Every factorization therefore has a unit factor, proving
Regard as the polynomial ring . The coefficient ring is a Euclidean domain, hence a principal ideal domain. The element is a prime element: the quotient ring is an integral domain.
The monic polynomial has its other coefficients divisible by , while . Part (a)(i), with playing the role of and the indeterminate, proves that is an irreducible polynomial.
Now use the automorphism of a polynomial ring
Its inverse fixes and sends to . A ring isomorphism preserves units and factorizations, hence preserves irreducible elements. Since
we obtain
Applying the Eisenstein criterion directly to the second expression with the prime element would fail, since ; the change of indeterminate supplies the required argument.

Articles by others on the same topic (0)

There are currently no matching articles.