Gauss lemma for polynomials states that the product of two primitive polynomials over a unique factorization domain is primitive. In particular, a primitive polynomial in is reducible over exactly when it is reducible over .
Eisenstein criterion says that a primitive polynomial
is irreducible over if there is a prime such that , for every , and . To prove it, suppose with both factors of positive degree. After removing contents, Gauss's lemma lets us take primitive. Reduction modulo gives
so both reduced factors are monomials of positive degree. Their constant terms are therefore divisible by , making divide , a contradiction.
An algebraic integer is a complex number satisfying a monic polynomial in . Let be one and let be its monic minimal polynomial. The usual proof using polynomial content shows that . The set
is the kernel of the polynomial-evaluation ring homomorphism, hence an ideal. Every is divisible by in . Because is monic, polynomial division of by takes place in , and the remainder must vanish by minimality. Therefore
where is monic and irreducible.
For
translation gives
This is Eisenstein at , so and therefore are irreducible over . Hence
Irreducibility and Gauss's lemma also show that is a prime ideal of , so
It is not a field. The class of is nonzero but not a unit: reducing further modulo gives a nonzero quotient
in which the image of is zero, whereas a unit must remain a unit under every unital quotient map. Thus

Articles by others on the same topic (0)

There are currently no matching articles.