# Newton diagram

Newton polygon

A convex polygonal line, introduced by I. Newton in 1669 (see ) to determine the exponents of the principal terms of algebraic functions. The process of finding successively the terms of the expansion of an algebraic function with the help of the Newton diagram is called the method of the Newton diagram. In more detail it was worked out by V. Puiseux  and it is sometimes called the Puiseux diagram in mathematical literature. Before Puiseux, an algebraic version of the Newton diagram was studied by J.L. Lagrange .

Let $F ( x, y)$ be a pseudo-polynomial in $y$, that is, let

$$F ( x, y) = \ \sum _ {s = 0 } ^ { n } F _ {s} ( x) y ^ {s} ,$$

where

$$F _ {s} ( x) = \ x ^ {\rho _ {s} } \sum _ {r = 0 } ^ \infty F _ {rs} x ^ {r/p} ,$$

$x$ and $y$ are complex variables, $F _ {rs}$ are complex numbers, $p$ is a natural number, $\rho _ {s}$ are non-negative rational numbers, $F _ {n} ( x) \not\equiv 0$, and $F _ {0} ( x) \not\equiv 0$. As a rule one assumes that if $F _ {s} ( x) \not\equiv 0$, then $F _ {0s} ( x) \not\equiv 0$, hence, $F _ {00} \neq 0$, $F _ {0n} \neq 0$. A solution $y = y ( \lambda )$ of the equation

$$\tag{1 } F ( x, y) = 0$$

is sought for in the form of a series

$$\tag{2 } y = y _ \epsilon x ^ \epsilon + y _ {\epsilon ^ \prime } x ^ {\epsilon ^ \prime } + \dots ,$$

where $\epsilon < \epsilon ^ \prime < \dots$ or, briefly, $y = y _ \epsilon x ^ \epsilon + z$, $z = o ( x ^ \epsilon )$ as $x \rightarrow 0$. To determine the possible values of $\epsilon$ and $y _ \epsilon$ one substitutes (2) in (1), collects terms with equal powers of $x$, and equates to zero the coefficients of these powers.

The process begins with the term of lowest degree. As long as the exponent $\epsilon$ is not yet determined, there is no way of telling which of the resulting terms are lowest in $x$. However, the terms of lowest order are among the following:

$$\tag{3 } F _ {00} x ^ {\rho _ {0} } ,\ \ F _ {0k} y _ {\epsilon ^ {k} } x ^ {\rho _ {k} + k \epsilon } ,\ \ F _ {0n} y _ \epsilon ^ {n} x ^ {\rho _ {n} + n \epsilon } ,$$

where $k$ ranges over those values $1, 2 \dots$ for which $F _ {k} ( x) \not\equiv 0$. To annihilate the terms of lowest order one has to choose $\epsilon$ so that at least two of the exponents $\rho _ {0}$, $\rho _ {k} + k \epsilon$, $\rho _ {n} + n \epsilon$ coincide and the remaining ones are to be not smaller. This argument leads to Newton's diagram.

In the plane one takes a rectangular Cartesian coordinate system and plots the points $( 0, \rho _ {0} )$, $( k, \rho _ {k} )$ and $( n, \rho _ {n} )$, where $k$ ranges over the same values as in (3). Through the point $( 0, \rho _ {0} )$ one draws the line that coincides with the $y$- axis and then rotates around $( 0, \rho _ {0} )$ anti-clockwise until it falls onto one of the plotted points, say $( l, \rho _ {l} )$. The tangent of the angle that the line $L$ passing through $( 0, \rho _ {0} )$ and $( l, \rho _ {l} )$ makes with the negative $x$- axis is one of the values $\epsilon$, since $\rho _ {0} = \rho _ {l} + l _ \epsilon$, and $\rho _ {k} + k \epsilon > \rho _ {l} + l _ \epsilon$ if $( k, \rho _ {k} ) \notin L$. Suppose that $( s, \rho _ {s} )$ is the point on $L$ with largest $x$- coordinate and that $L$ is rotated anti-clockwise around $( s, \rho _ {s} )$ until it falls onto another one of the plotted points, say, $( t, \rho _ {t} )$ with $t > s$. Let $L ^ \prime$ be the line through $( s, \rho _ {s} )$ and $( t, \rho _ {t} )$. The tangent of the angle between $L ^ \prime$ and the negative $x$- axis gives another possible value of $\epsilon$. Continuing these constructions one obtains a convex polygonal line, which is called Newton's diagram. Figure: n066520a

The value of the coefficient of $y _ {s} ^ \epsilon$ is determined as follows. Let $( i, \rho _ {i} )$ and $( j, \rho _ {j} )$ be the extreme points of a segment of the Newton diagram that determines one of the possible values of $\epsilon$. To annihilate the terms of lowest order when (2) is substituted in (1) it is necessary and sufficient that

$$\tag{4 } {\sum _ \epsilon } {} \prime F _ {0s} y _ \epsilon ^ {s} = 0,$$

where the prime in the sum denotes that summation is over those $\rho$ for which $\rho _ {s} + s \epsilon = \rho _ {i} + i \epsilon$. Equation (4) has $j - i$ non-zero roots (including multiplicity), that is, as many as the length of the projection of the relevant segment of the Newton diagram. Hence it is clear that by the method of the Newton diagram one obtains all $n$ values of the principal term $y _ \epsilon x ^ \epsilon$ in (2). By the same method one determines the next term in the expansion (2), etc. As a result, all $n$ solutions of (1) have the form (2), so-called Puiseux series (see Algebraic function). The method of the Newton diagram is also applicable to the solution of differential equations.

How to Cite This Entry:
Newton diagram. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Newton_diagram&oldid=47966
This article was adapted from an original article by V.A. Trenogin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article