Overview

  • How do Newton slopes determine root valuations?
  • How can Newton polygons at several primes prove irreducibility?
  • How do residual polynomials give stronger factor-degree restrictions?
  • Which slope denominators force containment of A_n?

Newton polygons and root valuations

Write f(x)=∑i=0naixi∈Qp[x]f(x)=\sum_{i=0}^n a_ix^i\in\mathbb Q_p[x] with a0an≠0a_0a_n\ne0, and normalize vp(p)=1v_p(p)=1. The Newton polygon is the lower convex hull of the points (i,vp(ai))(i,v_p(a_i)) with ai≠0a_i\ne0. Zero coefficients have infinite valuation and contribute no finite points.

Theorem · slopes and roots

A segment of slope −u/v-u/v, in lowest terms with v>0v>0, and horizontal length ℓ\ell, corresponds to exactly ℓ\ell roots of valuation u/vu/v, counted with multiplicity. There is a factor over Qp\mathbb Q_p consisting of all roots with each given valuation.

For a factor over Qp\mathbb Q_p, the number of its roots belonging to that slope must be a multiple of vv. Indeed, the constant coefficient of its corresponding monic slope factor has integer valuation. Thus the possible factor degrees are sums of multiples of the slope denominators, bounded by the lengths available on the respective segments.

References 1

Combining primes

Let the Newton polygon at pp have slopes −hj/ej-h_j/e_j in lowest terms, with ej>0e_j>0, and horizontal lengths ℓj\ell_j. Since the vertices have integer coordinates, eje_j divides ℓj\ell_j. A factor can use 0,ej,2ej,…,ℓj0,e_j,2e_j,\ldots,\ell_j roots from the jj-th segment. Thus every proper factor over Qp\mathbb Q_p has degree in

Np={∑jejkj:kj∈Z, 0≤kj≤ℓj/ej}∩{1,…,n−1}.N_p=\left\{\sum_j e_j k_j: k_j\in\mathbb Z,\ 0\le k_j\le\ell_j/e_j\right\}\cap\{1,\ldots,n-1\}.

A rational factor is also a factor over every Qp\mathbb Q_p. Consequently, if Np1∩⋯∩NpsN_{p_1}\cap\cdots\cap N_{p_s} is empty, then ff is irreducible over Q\mathbb Q. These sets can also be intersected with degree restrictions obtained from factorizations modulo other primes.

The reason for the multiples of eje_j is elementary once the root–slope theorem is known. A monic local factor made from djd_j roots of valuation hj/ejh_j/e_j has constant coefficient of valuation djhj/ejd_jh_j/e_j. This is an integer, so ej∣dje_j\mid d_j. The degree-six example below gives N2={2,4}N_2=\{2,4\} and N3={3}N_3=\{3\}, whose intersection is empty.

Dumas used several primes in this way; Bonciocat gives a systematic formulation and explicit criteria.

References 2

Residual polynomials

The coefficients on a Newton edge also define a residual polynomial. It can exclude factor degrees permitted by the slope denominator.

Theorem · residual-polynomial criterion

Let f(x)=∑i=0edaixi∈Zp[x]f(x)=\sum_{i=0}^{ed}a_ix^i\in\mathbb Z_p[x] be monic. Suppose its Newton polygon is the single segment from (0,hd)(0,hd) to (ed,0)(ed,0), where h,e,dh,e,d are positive integers and gcd⁡(h,e)=1\gcd(h,e)=1. Define

Rf(Y)=∑j=0daejph(d−j)‾ Yj∈Fp[Y].R_f(Y)=\sum_{j=0}^{d}\overline{\frac{a_{ej}}{p^{h(d-j)}}}\,Y^j\in\mathbb F_p[Y].

The polygon hypothesis makes every displayed quotient integral. If RfR_f is irreducible, then ff is irreducible over Qp\mathbb Q_p.

Proof

In a monic factorization f=g1g2f=g_1g_2 over Qp\mathbb Q_p, the factors have integral coefficients. All roots have valuation h/eh/e, so the constant coefficients show that the factor degrees are ed1,ed2ed_1,ed_2, with d1+d2=dd_1+d_2=d. The residual-polynomial product rule gives Rf=Rg1Rg2R_f=R_{g_1}R_{g_2}, with degrees d1,d2d_1,d_2. This rule follows directly from coefficient multiplication: terms on the edge survive after normalization and reduction; terms above it vanish. If two indices summing to a multiple of ee are individually not multiples of ee, their integral valuations put their product strictly above the edge. Irreducibility of RfR_f therefore forces one factor degree to be zero.

Example

For f=x4+2x2+4f=x^4+2x^2+4 at p=2p=2, the points (0,2),(2,1),(4,0)(0,2),(2,1),(4,0) lie on one edge of slope −1/2-1/2. Its denominator leaves a possible quadratic factor. Here h=1,e=2,d=2h=1,e=2,d=2, and

Rf(Y)=1+Y+Y2.R_f(Y)=1+Y+Y^2.

This quadratic has no root in F2\mathbb F_2. Thus ff is irreducible over Q2\mathbb Q_2, and hence over Q\mathbb Q, although its ordinary reduction is x4x^4. The criterion does not assume tame ramification. When d=1d=1, it recovers the one-edge Dumas criterion.

Newton polygons

Coordinates are (i,vp(ai))(i,v_p(a_i)).

At p=2p=2

Newton polygon at 2Coefficient valuation points with lower convex hull through 0,2; 4,0. Exact slopes -\frac{1}{2}.01201234(0, 2)(2, 1)(4, 0)coefficient index ivaluation at 2

Vertices: (0,2), (4,0)(0,2),\ (4,0)

Slopes: −12-\frac{1}{2}

Possible proper factor degrees from the slopes: 2.

Modular factorizations

Modulo 2

(x)4(x)^{4}
Factor degrees
1 + 1 + 1 + 1
Squarefree reduction
No
Possible proper factor degrees
1, 2, 3

The reduction has repeated factors, so the Frobenius cycle criterion does not apply. It still restricts factor degrees because the degree is preserved.

For the Galois group of this polynomial, see Slope denominators and cycle lengths.

References 2
  • GuardiaMontesNart2012Newton · §1.3–1.4: Theorem 1.13 and Corollary 1.20 in arXiv:0807.2620v2The product rule and residual-polynomial irreducibility criterion. The elementary specialization and quartic calculation are worked out here.Source
  • GuardiaMontesNart2011Montes · §2.1–2.2, Theorems 2.1–2.2The same criterion is encoded by a complete type; the source explains its ramification and residue-degree information.Source

Example

Example

F(x)=6!∑j=06xjj!=720+720x+360x2+120x3+30x4+6x5+x6.F(x)=6!\sum_{j=0}^6\frac{x^j}{j!}=720+720x+360x^2+120x^3+30x^4+6x^5+x^6.

The coefficient valuations, from constant to leading term, are

i0123456v2(ai)4433110v3(ai)2221110.\begin{array}{c|rrrrrrr}i&0&1&2&3&4&5&6\\\hline v_2(a_i)&4&4&3&3&1&1&0\\ v_3(a_i)&2&2&2&1&1&1&0\end{array}.

At 22, the vertices are (0,4),(4,1),(6,0)(0,4),(4,1),(6,0). The slopes are −3/4,−1/2-3/4,-1/2, with lengths 4,24,2. The only proper factor degrees permitted are 2,42,4. At 33, there is one segment from (0,2)(0,2) to (6,0)(6,0), with slope −1/3-1/3; the only proper factor degree permitted is 33. Hence FF is irreducible over Q\mathbb Q.

Coleman’s general treatment of exponential Taylor polynomials uses the same Newton-polygon method.

Newton polygons

Coordinates are (i,vp(ai))(i,v_p(a_i)).

At p=2p=2

Newton polygon at 2Coefficient valuation points with lower convex hull through 0,4; 4,1; 6,0. Exact slopes -\frac{3}{4}, -\frac{1}{2}.012340123456(0, 4)(1, 4)(2, 3)(3, 3)(4, 1)(5, 1)(6, 0)coefficient index ivaluation at 2

Vertices: (0,4), (4,1), (6,0)(0,4),\ (4,1),\ (6,0)

Slopes: −34, −12-\frac{3}{4},\ -\frac{1}{2}

Possible proper factor degrees from the slopes: 2, 4.

At p=3p=3

Newton polygon at 3Coefficient valuation points with lower convex hull through 0,2; 6,0. Exact slopes -\frac{1}{3}.0120123456(0, 2)(1, 2)(2, 2)(3, 1)(4, 1)(5, 1)(6, 0)coefficient index ivaluation at 3

Vertices: (0,2), (6,0)(0,2),\ (6,0)

Slopes: −13-\frac{1}{3}

Possible proper factor degrees from the slopes: 3.

Modular factorizations

Modulo 2

(x)6(x)^{6}
Factor degrees
1 + 1 + 1 + 1 + 1 + 1
Squarefree reduction
No
Possible proper factor degrees
1, 2, 3, 4, 5

The reduction has repeated factors, so the Frobenius cycle criterion does not apply. It still restricts factor degrees because the degree is preserved.

References 2
  • Coleman1987Newton-polygon treatment of exponential Taylor polynomials; the degree-six valuation table is calculated here.Source
  • Hajir2005 · Theorem 2.1The local theorem justifying the factor-degree restrictions.Source

A criterion for containing the alternating group

Theorem · a form of Hajir’s Newton-index criterion

Let f∈Q[x]f\in\mathbb Q[x] be irreducible of degree nn. Suppose a prime qq divides the denominator, in lowest terms, of some Newton slope of ff at a finite prime. If

n2<q≤n−3,\frac n2\lt q\le n-3,

then Gal⁡(f/Q)\operatorname{Gal}(f/\mathbb Q) contains AnA_n.

The root valuation forces qq to divide a ramification index in the local splitting field, and hence the order of the global group. Cauchy's theorem gives an element of order qq; because 2q>n2q>n, this element is a single qq-cycle. Transitivity comes from irreducibility. A nontrivial block system would have both its block size and its number of blocks smaller than qq; an element of order qq could act nontrivially on neither, which is impossible. Thus the action is primitive. Jordan's theorem then gives AnA_n.

The discriminant decides between AnA_n and SnS_n only after this containment has been proved. A nonsquare discriminant alone does not imply the full symmetric group.

References 3
  • Hajir2005 · Theorem 2.2Newton index divides the Galois-group order and a prime in the stated interval forces alternating-group containment.Source
  • Jordan1871Classical primitive-group theorem used in the final step.Source
  • DixonMortimer1996Permutation-group background for primitivity and long prime cycles.Source

Example

Example · f=x8+2x5+6f=x^8+2x^5+6 has group S8S_8

Eisenstein at 22 proves irreducibility. At 33, the Newton polygon has vertices (0,1),(5,0),(8,0)(0,1),(5,0),(8,0), hence slopes −1/5,0-1/5,0 of lengths 5,35,3. The denominator forces 55 to divide the Galois-group order. Since 8<2⋅58\lt 2\cdot5, an element of order 55 is a single 5-cycle. Irreducibility supplies transitivity, and 8/2<5≤8−38/2\lt 5\le8-3 satisfies the criterion above. Thus the group contains A8A_8.

The exact discriminant is

disc⁡(f)=21239⋅79⋅733.\operatorname{disc}(f)=2^{12}3^9\cdot79\cdot733.

It is nonsquare, so the group is S8S_8. Here the reductions at 2,32,3 are x8x^8 and x5(x−1)3x^5(x-1)^3. Reading these multiplicities as Frobenius cycle lengths would be invalid.

References 2
  • Hajir2005 · Theorem 2.2The Newton-index theorem proves alternating containment for the displayed octic. The valuations and resultant were computed exactly for this entry.Source
  • Milne2022The discriminant-square criterion completes the group determination.Author’s book page

Slope denominators and cycle lengths

A slope denominator need not be the length of a cycle in the Galois group. The prime-order argument above uses both the denominator and the interval n/2<q≤n−3n/2\lt q\le n-3. If the relevant prime is smaller, an element of order qq may be a product of several disjoint qq-cycles. If irreducibility is unavailable, transitivity cannot be assumed.

Counterexample

The polynomial x4+4=(x2−2x+2)(x2+2x+2)x^4+4=(x^2-2x+2)(x^2+2x+2) has one Newton slope −1/2-1/2 at 22. Its roots are 1±i,−1±i1\pm i,-1\pm i, and its splitting field is Q(i)\mathbb Q(i). The only nonidentity automorphism acts as a product of two transpositions, never a single transposition. Its discriminant 2142^{14} is a square, consistently with this even action. Capelli's exceptional fourth-power case explains the factorization.

The same phenomenon occurs for irreducible polynomials. The irreducible quartic x4+2x2+4x^4+2x^2+4 certified above also has slope denominator two. Its roots are (±2±−6)/2(\pm\sqrt2\pm\sqrt{-6})/2, with independent sign choices, and its splitting field is Q(2,−6)\mathbb Q(\sqrt2,\sqrt{-6}). Its Galois group is V4V_4 in the transitive degree-four action: all three nonidentity elements are double transpositions. Its discriminant 210322^{10}3^2 is a square.

For Laguerre and Taylor polynomials, explicit coefficient formulas make the Newton polygons accessible. The resulting factor-degree restrictions prove irreducibility in many cases, and suitable slopes then give alternating-group containment.

References 3
  • Hajir2005 · Theorem 2.2The irreducibility input and prime interval are explicit hypotheses.Source
  • capelli1901binomialsThe fourth-power exception explains the explicitly factored quartic.Source
  • GuardiaMontesNart2012Newton · Corollary 1.20 in arXiv:0807.2620v2The earlier residual-polynomial criterion proves irreducibility of the second counterexample; its radicals, field, permutation action, and discriminant are calculated here.Source

Questions

SettledIrreducibility methods

How can one refine Newton-polygon restrictions on factor degrees?

Scope. Local factorization of a specified separable polynomial over a p-adic field

Residual polynomials give the first refinement, illustrated above. If a residual factor is repeated, that stage may leave irreducibility undecided; higher Newton polygons refine the associated valuation and residue data. The Guàrdia–Montes–Nart theory gives a terminating local factorization procedure for separable polynomials. Finding shorter irreducibility proofs for particular families remains a separate question.

References 2
Discuss this question →

Related topics

References

  1. 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
  2. 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
  3. 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
  4. Newton polygons of higher order in algebraic number theory

    Guàrdia, Jordi and Montes, Jesús and Nart, Enric. Transactions of the American Mathematical Society, 364(1), 361–416, 2012.

    Read the source
  5. Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields

    Guàrdia, Jordi and Montes, Jesús and Nart, Enric. Journal de théorie des nombres de Bordeaux, 23(3), 667–696, 2011.

    Read the source
  6. On the Galois groups of the exponential Taylor polynomials

    Coleman, Robert F. L'Enseignement Mathématique, 33, 183–189, 1987.

    Read the source
  7. Théorèmes sur les groupes primitifs

    Jordan, Camille. Journal de Mathématiques Pures et Appliquées (2), 16, 383–408, 1871.

    Read the source
  8. Permutation Groups

    Dixon, John D. and Mortimer, Brian. Graduate Texts in Mathematics 163, Springer, 1996.

    Read the source
  9. Fields and Galois Theory

    Milne, James S. Kea Books, 2022.

    Author’s book page
  10. Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalità

    Capelli, Alfredo. Mathematische Annalen, 54, 602–603, 1901.

    Read the source