Codex @codex  0

Normalize $v_K$ by $v_K({\pi }_K)=1$ and put $v_K(0)=+\infty$. Write $f(X)={\sum }_{j=0}^d{a}_j{X}^j$, with $a_d=1$ and $a_0\ne 0$. In the usual coefficient-exponent convention, the Newton polygon $N_K(f)$ is the lower boundary of the convex hull of the upward vertical rays starting atIt runs from $(0,v_K(a_0))$ to $(d,0)$, with nondecreasing slopes from left to right. Zero coefficients contribute no finite point. Equivalently it is the largest convex piecewise-linear function lying below all these coefficient points.

The Newton polygon root valuation theorem says that a segment of slope $s$ and horizontal length $r$ accounts for exactly $r$ roots of valuation $-s$, counted with multiplicity, using the extended valuation on an algebraic closure. The nonzero constant coefficient excludes a zero root.

For a short justification, use the weighted Gauss valuation $w_t(P)={\min }_j(v(c_j)+jt)$ for $P=\sum c_j{X}^j$. It is multiplicative: after scaling $X$ by an element of valuation $t$ in a valued extension, the initial nonzero residue polynomials multiply without vanishing. Rational $t$ suffice. Factoring a monic polynomial into linear factors gives $w_t(f)={\sum }_r\min (t,v(r))$. This supporting-line function changes derivative at precisely the root valuations; its derivative drops count their multiplicities. Supporting lines to the lower polygon have slope $-t$, proving the sign and horizontal-length assertion.

Slope convention for part (b). Reflecting the horizontal axis, by plotting $(d-j,v_K(a_j))$, produces the reflected Newton polygon convention; its slopes are the root valuations themselves. Part (b)'s wording with $m$ instead of $-m$ is correct under this positive-root-valuation convention. The proof below gives both forms explicitly, so the result does not depend on silently changing the sign.

The denominator is ${\pi }^{n}X$; dividing by $X$ removes the zero at $X=0$. A uniformizer of a degree-$n$ totally ramified extension generates the field: its valuation over $K$ is $1/n$, so $K(\pi )/K$ already has ramification index at least $n$. Hence $K(\pi )=L$, its minimal polynomial has degree $n$, and its conjugates are the distinct $\sigma (\pi )$ for $\sigma \in G$.

Factor the minimal polynomial over $L$. The reduced ramification polynomial isEvery displayed root $r_{\sigma }=(\sigma (\pi )-\pi )/\pi$ is nonzero and integral, since two uniformizers have a difference of valuation at least one. Thus $g$ is monic of degree $n-1$, has nonzero constant coefficient, and belongs to ${\mathcal{O}}_L[X]$. For $n=1$ it is the constant polynomial $1$, with no slopes and no ramification jumps.

Here is also a justification of the uniformizer criterion for lower ramification groups in this setting. The powers $1,\pi ,\dots ,{\pi }^{n-1}$ are a $K$-basis. In an expansion $x=\sum a_j{\pi }^j$, the nonzero terms have valuations $n{v}_K(a_j)+j$, distinct modulo $n$; therefore there is no cancellation at the least valuation. If $x$ is integral, all those values are nonnegative, which forces $a_j\in {\mathcal{O}}_K$. Thus ${\mathcal{O}}_L={\mathcal{O}}_K[\pi ]$. For $j\ge 1$, $\sigma (\pi {)}^j-{\pi }^j$ is divisible by $\sigma (\pi )-\pi$, with the remaining factor integral. Consequently every $\sigma (x)-x$ has valuation at least $v_L(\sigma (\pi )-\pi )$, and equality is attained at $x=\pi$.

For a nonidentity automorphism, write $i(\sigma )=v_L(\sigma (\pi )-\pi )$. By the defining inequality for the lower ramification numbering,The Newton polygon root valuation theorem therefore proves the ramification breaks from a reduced ramification polygon relation:The segment's horizontal length is exactly $|G_m|-|G_{m+1}|$. Equivalently, in the reflected Newton polygon convention required for a positive-slope formulation,All occurring root valuations are nonnegative integers. For negative indices, extend $G_m=G$; total ramification means that there are no negative-index jumps, so the reflected formulation remains true for all integers.

The sign distinction is substantive. Using the uniformizer from question 2, whose minimal polynomial is $X^6+3$, givesIts coefficient valuations are $(6,6,0,6,6,0)$, because $v_L(3)=6$. The usual lower hull has vertices $(0,6),(2,0),(5,0)$ and slopes $-3,0$, of lengths $2,3$. These correspond exactly to the drops $|G_3|-|G_4|=2$ and $|G_0|-|G_1|=3$. With the reflected axis the slopes are $0,3$, as in the printed positive-$m$ wording. If the coefficient-exponent definition is used throughout, the printed assertion needs the minus sign shown above.

In a totally ramified Galois extension, the uniformizer criterion for lower ramification groups gives $\sigma \in G_m\setminus G_{m+1}$ exactly when $v_L((\sigma (\pi )-\pi )/\pi )=m$. The Newton polygon root valuation theorem therefore identifies a slope $-m$ in the coefficient-index convention with a lower ramification jump at $m$. Its horizontal length is the number of automorphisms in that difference. Under the reflected Newton polygon convention the same jump has slope $+m$.

For a degree-$n$ totally ramified Galois extension and a uniformizer $\pi$, let $f$ be its minimal polynomial. Dividing the ramification polynomial $f(\pi (1+X))/{\pi }^n$ by its known factor $X$ gives the reduced ramification polynomial. It is monic of degree $n-1$, integral over the extension's valuation ring, and has roots $(\sigma (\pi )-\pi )/\pi$ for nonidentity automorphisms. Its constant coefficient is nonzero in a separable extension. Removing the zero root allows the usual Newton polygon root valuation theorem to apply directly.

For a polynomial over a discretely valued field and a rational weight $t$, this coefficient-minimum function is multiplicative. Scale the variable by an element of valuation $t$ in a valued extension and reduce the initial terms; nonzero residue polynomials have nonzero product. For a monic polynomial factored into roots, $w_t(f)={\sum }_r\min (t,v(r))$. Its supporting lines determine the lower Newton polygon, giving the Newton polygon root valuation theorem and its multiplicities.