Overview

  • What are the hypotheses of the Schönemann–Eisenstein criterion?
  • When does a translation make the criterion apply?
  • How does the one-edge Dumas criterion extend Eisenstein’s criterion?

The Schönemann–Eisenstein criterion

Theorem · Schönemann–Eisenstein

Let f=anxn+⋯+a0∈Z[x]f=a_nx^n+\cdots+a_0\in\mathbb Z[x], with n≥1n\ge1. Suppose a prime pp satisfies p∤anp\nmid a_n, p∣aip\mid a_i for 0≤i<n0\le i\lt n, and p2∤a0p^2\nmid a_0. Then ff is irreducible over Q\mathbb Q.

Proof

A factorization into positive degrees can be taken in Z[x]\mathbb Z[x]. Reducing it modulo pp gives a factorization of the monomial anxna_nx^n. Both reduced factors are monomials of positive degree, because their leading coefficients remain nonzero. Thus both original constant terms are divisible by pp, which would make a0a_0 divisible by p2p^2.

Schönemann's work of 1846 precedes Eisenstein's 1850 paper. Cox's historical account explains their different motivations and the connection with finite fields and the division of the lemniscate.

References 3

Changes of variable

For a∈K×a\in K^\times and b∈Kb\in K, substitution x↦ax+bx\mapsto ax+b is an automorphism of K[x]K[x] and preserves irreducibility. It may change the coefficient divisibility required by the criterion. Reversing coefficients, f∗(x)=xdeg⁡ff(1/x)f^*(x)=x^{\deg f}f(1/x), also preserves irreducibility when f(0)≠0f(0)\ne0.

Example

(x+1)4+1=x4+4x3+6x2+4x+2.(x+1)^4+1=x^4+4x^3+6x^2+4x+2.

The right side is Eisenstein at 22, proving irreducibility of x4+1x^4+1. More generally, if pp is prime,

Φp(x+1)=(x+1)p−1x=∑j=1p(pj)xj−1\Phi_p(x+1)=\frac{(x+1)^p-1}{x}=\sum_{j=1}^{p}\binom pj x^{j-1}

is Eisenstein at pp: all intermediate binomial coefficients are divisible by pp, while the constant coefficient is exactly pp.

References 1

Schönemann’s residue-power criterion

The following form allows a higher-degree irreducible factor in the reduction. Let ϕ∈Z[x]\phi\in\mathbb Z[x] be monic with irreducible reduction modulo pp, let e≥2e\ge2, and let M∈Z[x]M\in\mathbb Z[x] satisfy deg⁡M<edeg⁡ϕ\deg M\lt e\deg\phi and gcd⁡(ϕˉ,Mˉ)=1\gcd(\bar\phi,\bar M)=1. Then

f=ϕe+pMf=\phi^e+pM

is irreducible over Q\mathbb Q. Indeed, a monic integral factorization would reduce to gˉ=ϕˉa\bar g=\bar\phi^a, hˉ=ϕˉb\bar h=\bar\phi^b, where a,b>0a,b>0 and a+b=ea+b=e. Write g=ϕa+pg1g=\phi^a+pg_1, h=ϕb+ph1h=\phi^b+ph_1. Comparing with ff, then dividing by pp and reducing modulo pp, forces ϕˉ∣Mˉ\bar\phi\mid\bar M, a contradiction.

For example, (x2+x+1)2+2=x4+2x3+3x2+2x+3(x^2+x+1)^2+2=x^4+2x^3+3x^2+2x+3 is irreducible: x2+x+1x^2+x+1 is irreducible over F2\mathbb F_2, and M=1M=1. The reduction is a power of an irreducible quadratic.

References 2

The Dumas criterion

Theorem · one-edge Dumas criterion

Let f=anxn+⋯+a0∈Qp[x]f=a_nx^n+\cdots+a_0\in\mathbb Q_p[x], with a0an≠0a_0a_n\ne0, vp(an)=0v_p(a_n)=0, and vp(a0)=k>0v_p(a_0)=k>0. Suppose gcd⁡(n,k)=1\gcd(n,k)=1 and

vp(ai)≥k(1−in)(0<i<n),v_p(a_i)\ge k\left(1-\frac{i}{n}\right)\qquad(0\lt i\lt n),

where vp(0)=+∞v_p(0)=+\infty. Then ff is irreducible over Qp\mathbb Q_p. For a rational polynomial, this also proves irreducibility over Q\mathbb Q.

The Newton polygon has one segment of slope −k/n-k/n, so every root has valuation k/nk/n. A monic factor of degree dd over Qp\mathbb Q_p would have constant coefficient of valuation dk/ndk/n, an integer. Coprimality forces n∣dn\mid d. Hence no proper positive factor degree is possible. Eisenstein is the case k=1k=1.

References 3

Example

Example · f=x5+4x+4f=x^5+4x+4

At 22, the nonzero coefficient points are (0,2),(1,2),(5,0)(0,2),(1,2),(5,0). The middle point lies above the segment joining (0,2)(0,2) to (5,0)(5,0). Its slope is −2/5-2/5, and gcd⁡(2,5)=1\gcd(2,5)=1. Thus ff is irreducible over Q2\mathbb Q_2, hence over Q\mathbb Q.

Eisenstein’s criterion at 22 does not apply because 4∣f(0)4\mid f(0). Dumas’s criterion instead uses the root valuation 2/52/5, whose denominator excludes every proper factor degree.

References 1
  • bonciocat2015multiprime · IntroductionThe one-edge criterion used here; the valuation diagram and polynomial are an explicit worked computation.Source

Limitations and translation

A Newton polygon with several slopes proves reducibility over Qp\mathbb Q_p, but not necessarily over Q\mathbb Q. A single edge whose horizontal and vertical increments have a common divisor may correspond to either an irreducible or a reducible polynomial over Qp\mathbb Q_p. Other primes, residual polynomials, or a change of variable can give further information. Local irreducibility alone does not determine the global Galois group.

Example

The polynomial F=x4−10x2+1F=x^4-10x^2+1 is irreducible: a root 2+3\sqrt2+\sqrt3 generates the degree-four field Q(2,3)\mathbb Q(\sqrt2,\sqrt3), as shown in Field extensions. No integral translation makes FF Eisenstein, since

F(x+c)=x4+4cx3+(6c2−10)x2+(4c3−20c)x+c4−10c2+1.F(x+c)=x^4+4cx^3+(6c^2-10)x^2+(4c^3-20c)x+c^4-10c^2+1.

For an odd prime pp, divisibility of the cubic coefficient forces p∣cp\mid c, while the constant coefficient is then 1(modp)1\pmod p. At p=2p=2, the constant coefficient is odd for even cc, and divisible by eight for odd cc. In each case an Eisenstein hypothesis fails.

The stronger one-edge criterion succeeds after translation: at c=1c=1 the polynomial becomes x4+4x3−4x2−16x−8x^4+4x^3-4x^2-16x-8. Its 22-adic coefficient valuations are 3,4,2,2,03,4,2,2,0, and the lower polygon is a single edge of slope −3/4-3/4. Dumas therefore proves irreducibility even over Q2\mathbb Q_2.

References 3
  • ConradAllPrimes · Theorems 1 and 2Irreducibility and failure of every integral Eisenstein shift.Source
  • dumas1906The one-edge criterion applies to the translated quartic, whose coefficients and valuations are calculated here.Source
  • Hajir2005 · Theorem 2.1Distinct Newton slopes give factors over the complete local field; they do not imply reducibility over the rational field.Source

Questions

ClaimedIrreducibility methods

Can an integral translation always make an irreducible polynomial Eisenstein?

Scope. Translations x↦x+c with c∈Z

No. The irreducible polynomial F=x4−10x2+1F=x^4-10x^2+1 is a counterexample. If F(x+c)F(x+c) were Eisenstein at an odd prime pp, its cubic coefficient would force p∣cp\mid c, but its constant coefficient would be 1(modp)1\pmod p. At two, the constant coefficient is odd when cc is even and divisible by eight when cc is odd. This rules out every integral translation; other changes of variable or valuation criteria may still apply.

References 1
  • ConradAllPrimes · Theorems 1 and 2Explicit counterexample, proved in the article. The Claimed label records that the cited source is unpublished exposition.Source
Discuss this question →

Related topics

References

  1. Von denjenigen Moduln, welche Potenzen von Primzahlen sind. (Fortsetzung)

    Schönemann, Theodor. Journal für die reine und angewandte Mathematik, 32, 93–105, 1846.

    Read the source
  2. Über die Irreductibilität und einige andere Eigenschaften der Gleichung, von welcher die Theilung der ganzen Lemniscate abhängt

    Eisenstein, Gotthold. Journal für die reine und angewandte Mathematik, 39, 160–179, 1850.

    Read the source
  3. Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First

    Cox, David A. The American Mathematical Monthly, 118(1), 3–21, 2011.

    Read the source
  4. Schönemann–Eisenstein–Dumas-type irreducibility conditions that use arbitrarily many prime numbers

    Bonciocat, Nicolae Ciprian. Communications in Algebra, 43(8), 3102–3122, 2015.

    Read the source
  5. Sur quelques cas d'irréductibilité des polynômes à coefficients rationnels

    Dumas, Gustave. Journal de Mathématiques Pures et Appliquées, 6e série, 2, 191–258, 1906.

    Read the source
  6. On the Galois group of generalized Laguerre polynomials

    Hajir, Farshid. Journal de théorie des nombres de Bordeaux, 17(2), 517–525, 2005.

    Read the source
  7. An irreducible that factors modulo all primes

    Conrad, Keith. Author-hosted expository note.

    Read the source