The Eisenstein criterion says that a primitive polynomialis irreducible if there is a prime such thatBy the Gauss lemma for polynomials, irreducibility over and over agree for primitive polynomials.
Conversely, let be prime. Translation by one is an automorphism of , andIts leading coefficient is one, every lower coefficient is divisible by , and its constant coefficient is , which is not divisible by . The Eisenstein criterion proves that is irreducible, hence so is . Therefore the geometric-sum irreducibility criterion is
Regardas a monic quadratic in over . By the Gauss lemma for polynomials, reducibility in would imply reducibility in , so would be a square in . This is impossible: its zero at has odd order one, whereas every zero or pole of a square in a rational-function field has even order. Hence
The same odd-valuation obstruction to a rational-function square works over every field of characteristic different from two, since the zeros and are then distinct. It does not work over every field. In characteristic two,so the polynomial is reducible.
Articles by others on the same topic
There are currently no matching articles.