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 with , and normalize . The Newton polygon is the lower convex hull of the points with . Zero coefficients have infinite valuation and contribute no finite points.
Theorem · slopes and roots
A segment of slope , in lowest terms with , and horizontal length , corresponds to exactly roots of valuation , counted with multiplicity. There is a factor over consisting of all roots with each given valuation.
For a factor over , the number of its roots belonging to that slope must be a multiple of . 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.
Combining primes
Let the Newton polygon at have slopes in lowest terms, with , and horizontal lengths . Since the vertices have integer coordinates, divides . A factor can use roots from the -th segment. Thus every proper factor over has degree in
A rational factor is also a factor over every . Consequently, if is empty, then is irreducible over . These sets can also be intersected with degree restrictions obtained from factorizations modulo other primes.
The reason for the multiples of is elementary once the root–slope theorem is known. A monic local factor made from roots of valuation has constant coefficient of valuation . This is an integer, so . The degree-six example below gives and , whose intersection is empty.
Dumas used several primes in this way; Bonciocat gives a systematic formulation and explicit criteria.
References 2
- dumas1906 · p. 238, item 4Historical source for the polygon-product and several-prime method.Source
- bonciocat2015multiprime · §1, Theorem A (arXiv:1304.0874v2, p. 3)Systematic several-prime irreducibility criteria.Source
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 be monic. Suppose its Newton polygon is the single segment from to , where are positive integers and . Define
The polygon hypothesis makes every displayed quotient integral. If is irreducible, then is irreducible over .
Proof
In a monic factorization over , the factors have integral coefficients. All roots have valuation , so the constant coefficients show that the factor degrees are , with . The residual-polynomial product rule gives , with degrees . 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 are individually not multiples of , their integral valuations put their product strictly above the edge. Irreducibility of therefore forces one factor degree to be zero.
Example
For at , the points lie on one edge of slope . Its denominator leaves a possible quadratic factor. Here , and
This quadratic has no root in . Thus is irreducible over , and hence over , although its ordinary reduction is . The criterion does not assume tame ramification. When , it recovers the one-edge Dumas criterion.
Newton polygons
Coordinates are .
At
Vertices:
Slopes:
Possible proper factor degrees from the slopes: 2.
Modular factorizations
Modulo 2
- 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.
Modulo 3
- Factor degrees
- 2 + 2
- Squarefree reduction
- No
- Possible proper factor degrees
- 2
The reduction has repeated factors, so the Frobenius cycle criterion does not apply. It still restricts factor degrees because the degree is preserved.
Modulo 5
- Factor degrees
- 2 + 2
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 2
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
Modulo 7
- Factor degrees
- 1 + 1 + 1 + 1
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 1, 2, 3
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
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
The coefficient valuations, from constant to leading term, are
At , the vertices are . The slopes are , with lengths . The only proper factor degrees permitted are . At , there is one segment from to , with slope ; the only proper factor degree permitted is . Hence is irreducible over .
Coleman’s general treatment of exponential Taylor polynomials uses the same Newton-polygon method.
Newton polygons
Coordinates are .
At
Vertices:
Slopes:
Possible proper factor degrees from the slopes: 2, 4.
At
Vertices:
Slopes:
Possible proper factor degrees from the slopes: 3.
Modular factorizations
Modulo 2
- 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.
Modulo 3
- 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.
Modulo 5
- 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.
Modulo 7
- Factor degrees
- 1 + 2 + 3
- Squarefree reduction
- Yes
- Possible proper factor degrees
- 1, 2, 3, 4, 5
The factor degrees are the cycle lengths of a Frobenius element. Every proper rational factor has one of the listed degrees.
Modulo 11
- Factor degrees
- 6
- Squarefree reduction
- Yes
- Possible proper factor degrees
- None
The irreducible reduction proves irreducibility over Q and gives a cycle of full length in the Galois group.
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 be irreducible of degree . Suppose a prime divides the denominator, in lowest terms, of some Newton slope of at a finite prime. If
then contains .
The root valuation forces 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 ; because , this element is a single -cycle. Transitivity comes from irreducibility. A nontrivial block system would have both its block size and its number of blocks smaller than ; an element of order could act nontrivially on neither, which is impossible. Thus the action is primitive. Jordan's theorem then gives .
The discriminant decides between and 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 · has group
Eisenstein at proves irreducibility. At , the Newton polygon has vertices , hence slopes of lengths . The denominator forces to divide the Galois-group order. Since , an element of order is a single 5-cycle. Irreducibility supplies transitivity, and satisfies the criterion above. Thus the group contains .
The exact discriminant is
It is nonsquare, so the group is . Here the reductions at are and . 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 . If the relevant prime is smaller, an element of order may be a product of several disjoint -cycles. If irreducibility is unavailable, transitivity cannot be assumed.
Counterexample
The polynomial has one Newton slope at . Its roots are , and its splitting field is . The only nonidentity automorphism acts as a product of two transpositions, never a single transposition. Its discriminant 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 certified above also has slope denominator two. Its roots are , with independent sign choices, and its splitting field is . Its Galois group is in the transitive degree-four action: all three nonidentity elements are double transpositions. Its discriminant 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
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
- GuardiaMontesNart2012Newton · Introduction; §3 and Theorem 4.18 in arXiv:0807.2620v2Source
- GuardiaMontesNart2011Montes · §2.2–3Source
Related topics
Connected diagrams
- How can several local tests prove irreducibility? · Classical
- Central-binomial sections: exact groups and prime reductions · Claimed
- Positive Laguerre parameters: a proposed complete classification · Claimed
- Legendre polynomials: irreducibility and all signed permutations · Claimed
- Legendre values: from prime divisibility to base-p digits · Published
- Negative Laguerre parameters: a complete Galois classification · Published
- How can exponent geometry prove absolute irreducibility? · Published
Schönemann–Eisenstein and Dumas criteria
Eisenstein corresponds to one edge of slope −1/n.
Contrasts withReduction modulo primes
Newton polygons apply at repeated reductions, where the squarefree Frobenius test does not apply.
UsesTransitivity, primitivity, and cycle criteria
Cauchy’s and Jordan’s theorems turn suitable ramification divisors into alternating containment.
UsesDiscriminants, parity, and ramification
After alternating containment, the discriminant determines whether the group is alternating or symmetric.
Supplies examples forCapelli’s theorem and polynomial composition
The binomials x⁶−72 and x⁴+4 exhibit power obstructions and valuation constraints.
Applies toGeneralized Laguerre polynomials
Factorial and binomial coefficient formulas determine useful Newton slopes.
Develops intoPolynomial factorization algorithms
Higher Newton polygons and residual polynomials define the types used by the Montes algorithm.
Linked from 17 articles
- Reduction modulo primes
- Schönemann–Eisenstein and Dumas criteria
- Capelli’s theorem and polynomial composition
- Frobenius and factorization modulo primes
- Ramification and inertia
- Transitivity, primitivity, and cycle criteria
- Taylor polynomials
- Taylor polynomials and Katz–Rivin questions
- Generalized Laguerre polynomials
- Hermite, Bessel, and Legendre polynomials
- Krawtchouk polynomials
- Kaneko–Zagier polynomials
- Bernoulli and Euler polynomials
- Truncated binomial polynomials
- Littlewood polynomials
- Newton polytopes and irreducibility
- Polynomial factorization algorithms
References
- 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 - 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 - 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 - 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 - 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 - On the Galois groups of the exponential Taylor polynomials
Coleman, Robert F. L'Enseignement Mathématique, 33, 183–189, 1987.
Read the source - 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 - Permutation Groups
Dixon, John D. and Mortimer, Brian. Graduate Texts in Mathematics 163, Springer, 1996.
Read the source - Fields and Galois Theory
Milne, James S. Kea Books, 2022.
Author’s book page - Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalità
Capelli, Alfredo. Mathematische Annalen, 54, 602–603, 1901.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.