KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← Articlesp-adic Root Finding and Newton PolygonsEngineering · Engineering MathematicsLesson 774/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginp-adicNewton polygonvaluationHensel
On this page

Ask about this page

KEVOS AIp-adic Root Finding and Newton Polygons

KEVOS knowledge first · trusted web sources when needed

Polynomial Factorisation

p-adic Root Finding and Newton Polygons

Finding roots in p-adic fields by lifting, and reading ramification structure off the Newton polygon of a polynomial.

Engineering / MathematicsPolynomial Factorisation2 min readKV-MATH-0572

The Newton polygon encodes the valuations of the roots of a polynomial directly from its coefficients. It is the standard tool for understanding local behaviour at a prime, and it drives the hardest cases of prime decomposition.

Construction

Plot a point for each coefficient at its degree and its valuation, then take the lower convex hull. The polygon's segments carry the information.

Constructing the Newton polygon

  1. PlotFor each non-zero coefficient, plot the index against the p-adic valuation of that coefficient.
  2. HullTake the lower convex hull of the plotted points.
  3. Read segmentsEach segment has a slope and a horizontal length.
A segment of slope -s and horizontal length l => l roots of valuation sCounted with multiplicity, in an algebraic closure.

Key point

The valuations of all roots are read off the coefficients alone, with no root computation. This is the same spirit as the resultant: an assertion about roots derived from coefficients.

What it tells you

Reading the Newton polygon
Polygon featureMeaning
A single segment of slope zeroAll roots are units; the polynomial is unramified in this respect
Several distinct slopesThe polynomial factors over the p-adic field, one factor per segment
A slope with denominator e in lowest termsRamification of index at least e
Slope zero segment of length oneA simple unit root; lifts by Hensel

Key point

Distinct slopes give an immediate factorisation over the p-adic field, because roots of different valuations cannot lie in the same irreducible factor. This is the cheapest available splitting and should always be tried first.

p-adic root finding

A simple root modulo p lifts uniquely to a p-adic root by Hensel lifting, which is Newton iteration in the p-adic metric. The condition is that the derivative does not vanish at the root modulo p.

Pitfall

When the derivative vanishes modulo p — the ramified case — the naive lifting criterion fails. The general Hensel condition compares the valuation of the polynomial at the approximate root against twice the valuation of the derivative, and the approximation must satisfy that stronger inequality before lifting is valid.

Use in prime decomposition

Decomposing a prime that divides the index cannot be done by simple factorisation modulo p. Newton polygon methods handle these cases by working locally, and are one of the two standard approaches — the other being the Buchmann-Lenstra method. See Newton polygon methods for decomposition.

Regular polygons and recursion

Note

When a segment's slope has denominator one and the associated residual polynomial is separable, the corresponding factor is fully understood. Otherwise the residual polynomial must be analysed recursively, which is the mechanism of the Montes-style algorithms that generalise this approach.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 3.6.3. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Valuations and Uniformisers
  • Newton Polygon Methods for Prime Decomposition
  • Root Finding over the Reals and Complex Numbers

Continue learning

Root Finding over the Reals and Complex NumbersArticle · Engineering MathematicsNEXT LESSON →Algebraic Numbers and Minimal PolynomialsArticle · Engineering MathematicsFactoring Polynomials over Algebraic Number FieldsArticle · Engineering MathematicsNumber Fields: Definition and Basic PropertiesArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®