For , put . The polynomial
is Eisenstein at . It gives , total ramification, and . Also : in the power basis, terms have valuations in different residue classes modulo , so cannot cancel at the minimum. Integrality forces all integral.
Use part (b) with and differentiate the quotient at :
The root of unity is a unit, while and . Hence the cyclotomic local different exponent is
This includes : that extension is trivial and the exponent is zero.
For , construct an unramified quadratic extension by lifting an irreducible quadratic polynomial over . Its residue field is . Each of its nonzero residue elements is a simple polynomial root of , so Hensel's lemma lifts all polynomial roots into . A primitive residue element lifts to a primitive mth polynomial root: its reduction already has order , and its mth power is one.
Such a primitive polynomial root cannot generate a proper subfield of , since its residue has order and therefore generates the quadratic residue extension. Thus is unramified of degree two. Part (a) gives . The reduced minimal polynomial of an algebraic element has degree two and is separable, so its derivative at is a unit. Part (b) gives
Both answers use normalized discrete valuations on the top field.
Let be a finite Galois extension of non-Archimedean local fields, with Galois group , normalized valuation , integer ring , and residue characteristic . The lower ramification numbering is
These higher ramification groups measure successively finer agreement with the identity. The group is the inertia group, the kernel of the action on the residue field. Each is normal in : conjugation permutes integral elements and preserves their valuations. The groups eventually become trivial, since each nonidentity automorphism moves some integral element and its displacement has finite valuation.
Let , the maximal unramified subextension of a local field extension. Then is the Galois group of the residue extension, cyclic and generated by a Frobenius automorphism. For a uniformizer of , the uniformizer criterion for lower ramification groups gives
To see why one uniformizer suffices, the extension is totally ramified and its integer ring is . Elements of fix its coefficients. Differences of powers of are divisible by , so the valuation bound for implies it for every integral element. The converse follows by testing itself.
The tame inertia quotient is seen explicitly from
It is a homomorphism because inertia acts trivially on the residue field, and its kernel is . Thus is cyclic of order not divisible by . For , the homomorphism
has kernel . Indeed composing two automorphisms adds the leading displacements, since and inertia fixes residue coefficients. Hence each is an elementary abelian p-group. Eventual triviality makes a p-group; the prime-to-p quotient makes it the unique Sylow subgroup of . This is the wild inertia group. Tame ramification means .
The filtration also measures the different exponent. For the totally ramified extension over , the minimal polynomial of an algebraic element of has polynomial roots , . The derivative formula gives
For a fixed , its displacement valuation is the number of indices for which it belongs to . Interchanging the finite sums therefore gives different exponent from ramification groups:
The unramified part contributes zero. More generally different in a tower follows by taking products of bases of a module dual for the trace pairing, and gives
Thus a tame extension has different exponent , while nontrivial wild groups contribute additional positive terms.
The lower numbering restricts to subgroups: if , its groups are , directly from the definition using the same top-field valuation. Quotients need a different indexing. For real put and define the Herbrand function
This upper ramification numbering stretches or compresses intervals according to the inertia indices. The quotient theorem says that for a normal subgroup , upper ramification groups commute with quotients:
In particular the same upper index has a meaning compatible with passing to a smaller Galois extension, which lower indices generally lack.
For a tame totally ramified extension the picture is simple: , all with are trivial, and the different exponent is . The extension for odd illustrates this, giving exponent .
A mixed-characteristic wild family is the lower ramification filtration of a prime-power cyclotomic extension. Take with odd and . If and modulo , then
The last equality follows because has order and its uniformizer valuation scales by the ramification index in that cyclotomic tower. The lower breaks are . Integrating the successive indices gives upper breaks .
In equal characteristic there is an equally explicit wild example. Start with and an Artin–Schreier extension
There is no polynomial root in : a negative-valuation element has , while the right side has valuation . Adjoining a polynomial root splits the polynomial, whose polynomial roots are for , so the extension is cyclic of degree . The valuation equation forces total ramification, and . Choose with and set . Then is a uniformizer. For a nonidentity automorphism ,
the first binomial coefficient is nonzero modulo , and all subsequent terms have strictly higher valuation. Therefore
This is the ramification break of an Artin–Schreier pole. It shows concretely that wild breaks, unlike tame inertia, can occur arbitrarily far out in the filtration.
The lower groups measure integral displacements, the upper groups make quotient comparison possible, and the sizes of the groups determine the different.
The polynomial is Eisenstein at every prime number , so a polynomial root generates a totally ramified cubic field . The splitting-field Galois group is a transitive subgroup of , hence or . Its polynomial discriminant is
The product of the three polynomial root differences is a square root of , transformed by the sign of the polynomial root permutation. Thus the group is exactly when is a square, and otherwise it is . In the latter case the splitting field is
Indeed adjoining one polynomial root leaves a quadratic factor, whose polynomial discriminant is , so the square root of supplies its remaining polynomial roots.
Suppose first that . The unit reduces to , and Hensel's lemma makes it a square exactly when is a square modulo . Quadratic reciprocity gives
If , the field generated by is already the cyclic splitting field, totally ramified of degree three. If , the nonsquare unit gives an unramified quadratic field . Since and have coprime degrees, . Its residue degree is at least two and its ramification index at least three; their product is six, so they are exactly two and three. Thus its inertia group is the normal inside .
In both cases the ramification index is three and is not divisible by . The wild inertia group is trivial, so all positive lower groups are trivial. As a different check, has valuation two in when , agreeing with tame different exponent .
For the polynomial discriminant is , which is nonsquare. Hence . The quadratic subfield can be written with . It is ramified of degree two, by the Eisenstein polynomial . Together with the totally ramified cubic field this forces to be divisible by both two and three. Since , the splitting field is totally ramified. In its normalized valuation,
All differences between distinct polynomial roots have the same valuation, since permutes the polynomial root pairs and preserves the absolute value on a field. Also
has valuation six, so each polynomial root difference has valuation three. A nonidentity three-cycle fixes , and therefore
The transposition fixing negates , so sends to and has displacement valuation . The other transpositions have the same value by conjugacy. The uniformizer criterion now determines every group:
For the wild case the different exponent is . Independently, the cubic subfield has different exponent , and the quadratic extension is tame with exponent one. The tower formula gives , confirming the filtration. Its positive upper break is , because . This completes ramification of the splitting field of X3 plus pX plus p for every odd prime number.
Suppose a nonconstant polynomial has no zero in . Its reciprocal is then an entire holomorphic function. If is the degree and its leading coefficient, division by shows as . Hence , so . Continuity on compact disks now makes bounded on all of .
Fix and let be standard planar Brownian motion started at zero. By part (a) and Itô formula, both components of are local martingales. Since is bounded, they are true martingales, and
For , choose such that whenever , and write . The two-dimensional Gaussian density of is bounded by , so
Consequently
Let , then , to obtain . This is impossible for . Thus
This Brownian proof of the fundamental theorem of algebra uses only harmonicity, the bounded-martingale property and the spreading Gaussian transition density. It does not use either maximum principle from part (b), nor does it incorrectly assume that planar Brownian motion hits a specified point.
Again suppose is a nonconstant polynomial without a complex zero, and put . As proved in part (c), is an entire holomorphic function with at infinity. Choose and then a disk large enough that outside it. On the closed disk, attains its maximum by the extreme value theorem, and that maximum is positive and greater than every value outside the disk. It is therefore a global, and in particular local, maximum on .
Part (b)(ii) forces to be constant. A nonzero constant reciprocal makes constant, a contradiction. Hence . Equivalently one can minimize globally and apply the maximum modulus principle to its reciprocal if that minimum is positive. This supplies the second proof of the fundamental theorem of algebra using part (b).
For a kernel for density estimation and smoothing bandwidth , the kernel density estimator is
We use the convention that a kernel of order ell has
The kernel for density estimation is integrable and can have negative values; requiring nonnegativity would prevent its second moment from vanishing. Some conventions additionally require a nonzero moment of order . The construction below covers that convention too.
The Legendre polynomial kernel construction uses the polynomial reproducing kernel at zero:
Every polynomial of degree at most has the expansion , since the displayed Legendre polynomials have those successive degrees and form an orthonormal basis of this polynomial space. Therefore
Taking proves all the required moment identities. Boundedness and compact support give every absolute moment and a finite L2 norm. If a nonzero moment of order is required, replace this kernel by
The lower moments are unchanged by orthogonality. If , then because otherwise would lie in the polynomial space of degree at most . Evaluating its full Legendre expansion at zero gives , so .
For instance, a simple kernel satisfying the moment conditions needed for three derivatives is
Its negative wings cancel its central contribution to the second moment.
Figure 1.
Signed kernel and cancellation of its second moment
. Details.
Here is the third-order pointwise kernel error bound. Write and , and use any square-integrable kernel with unit integral, first two moments zero and . A change of variables gives
By the Taylor theorem with Lagrange remainder,
The moment cancellations consequently give the uniform bias of a kernel density estimator bound
For the variance, independence and another change of variables give
The triangle inequality and Cauchy-Schwarz inequality now yield
Balancing against gives
The constant is independent of both and . The original PDF has exponent ; the converted TeX's is a transcription error.
To obtain the final parametric rate, we choose a flat-top kernel for density estimation. This kernel also satisfies all the preceding moment conditions, so a single kernel works for both constructions, with different bandwidth choices. With the Fourier transform convention , choose a real even function equal to one on and zero outside , and put
Such a cutoff is explicit: if for and zero otherwise, take . It is constant near zero, and its endpoint transitions are smooth. Repeated integration by parts shows that and all its derivatives decay faster than every power, so lies in the Schwartz space. The Fourier inversion and moment differentiation of the Fourier transform give
Thus this kernel can be used with for the preceding general bound.
For the sharper example choose the probability density function
To check this is a density and identify its Fourier transform, direct integration gives
The continuous value at zero is as displayed. This function is nonnegative and integrable, being bounded near zero and at infinity. Fourier inversion gives , and in particular . Differentiation of this compact frequency integral also shows that and are bounded. Since on the support of , the convolution theorem gives
Both sides are continuous, so the equality holds at every . There is therefore exactly zero bias of a kernel density estimator at bandwidth one, and the variance bound above gives
This is parametric-rate kernel estimation of a bandlimited density. A fixed bandwidth is appropriate because it reproduces this particular density exactly; a generic density would retain a nonzero smoothing bias.
The severity is an equal-weight mixture distribution of rate- and rate- exponential distributions. Its expected value is
The moment-generating function, finite exactly for , is
Canceling the nonzero in the adjustment coefficient equation and multiplying by the positive denominator on gives
Thus the required polynomial is
Since , , and the leading coefficient is positive, one root lies in and the other exceeds . Only the smaller root is in the moment-generating function domain. Consequently
The rationalized expression avoids subtraction of nearly equal numbers when is small.
The erroneously chosen same-mean exponential distribution gives . Direct substitution shows , so lies strictly between the two polynomial roots, and in particular . Therefore
while both bounds equal one at . The exponential misspecification produces a smaller claimed upper bound. The Lundberg inequality certifies for the actual mixture; it does not certify the smaller expression computed from the wrong severity law.
The Weierstrass approximation theorem states that the polynomials are a dense subspace of in the supremum norm. By linearity and (c), uniformly for every polynomial . Given and , choose a polynomial with . The operator norm estimate in (a) gives
First let , then . Hence for every continuous . This is an instance of extension of approximation operators from a dense subspace.
For with , differentiation of the Chebyshev polynomial gives
Both sides are polynomials in , so the identity holds at the endpoints and, in fact, for every real .
Order the roots of a polynomial here as , , so . At these simple roots,
For a polynomial of degree at most , the Lagrange interpolation polynomial is
For , the Chebyshev polynomial is positive: all its roots are at most and its leading coefficient is positive. Hence . The assumed nodal bounds and interpolation of the degree- polynomial now give
Continuity includes . Apply this argument to and use the parity of the Chebyshev polynomial to obtain the negative side. Thus the Chebyshev nodal derivative comparison proves
Assume and . The given Bernstein inequality for algebraic polynomials shows that satisfies the nodal hypotheses of (a). Consequently, in the two endpoint regions , .
For , the finite geometric identity
bounds its absolute value by . It follows that , and the endpoint limit gives . In the central interval, the Bernstein inequality for algebraic polynomials gives
since on . Combining the regions and rescaling proves the Markov inequality for polynomial derivatives:
The Chebyshev polynomial itself attains equality, so this constant is sharp. Constant polynomials have zero derivative.
Put for , with the knots in increasing order. The explicit formula for a divided difference at distinct nodes gives
Each truncated power function is a piecewise polynomial function of degree and is for . Therefore their sum has the same global smoothness. The jump in the st derivative at equals
which is nonzero. Thus each really is a knot, and generally there is no additional smoothness.
If , the values being differenced are the values of the degree- polynomial , so their th divided difference vanishes. If , every sampled truncated power function is zero. To check that both support endpoints occur, for subtract the vanished full polynomial divided difference to obtain
For , only the last term survives and is positive. The nonnegativity from the recurrence in (b) actually gives positivity throughout the interior: for each , at least one lower-order B-spline covering has a positive recurrence coefficient, and induction starts with positive order-one indicators. Hence and for , with degree on its knot intervals. For , the B-spline is the step function , so no continuity is asserted.
The unit-integral normalization of a B-spline also follows directly: integrating over gives . The th divided difference of this monic degree- polynomial is one. Thus , explaining its normalization.
For an autonomous ordinary differential equation, the chain rule gives . The formula is therefore a multiderivative multistep method. Insert the exact solution and expand the two earlier values about :
The unscaled local truncation error is
The coefficients through vanish, but the fourth-order coefficient does not. Hence the method has order three, not four: the one-step residual is for an order- multistep formula. Its zero-stability polynomial is , with a simple unit root and the other root inside the unit disk. Thus the stated order is also the convergence order for smooth solutions, starting errors , and the nearby implicit solution branch, by convergence of a zero-stable multiderivative method.
Yes: this is an A-stable third-order method. Its second derivative is essential; the Second Dahlquist barrier applies to ordinary first-derivative linear multistep methods, not this multiderivative multistep method.
Apply the Dahlquist test equation and put . The amplification polynomial is
We verify the root condition for a multistep method throughout . For a quadratic with , the complex quadratic Schur criterion is
for both roots to be strictly inside the unit disk. Here is a brief justification of the criterion rather than just a root plot. Set . The polynomial is , where and . Its two roots are inside precisely when . On the unit circle , and , so the Rouche theorem equates its interior root count with that of . A boundary zero of would also be a boundary zero of the transformed polynomial, which the strict inequality excludes. This proves the strict criterion; the non-strict form follows by continuity, with any unit root simple because .
For the present polynomial it is enough to show , except at . Write , , and put , . Then
Direct expansion gives the nonnegative factorization
Every term is nonnegative, and the sum is strictly positive unless . Also , so the criterion applies. For every nonzero in the closed left half-plane both amplification roots are strictly inside the unit disk. At they are and , and the unit root is simple. Therefore
This proof establishes stability of both the principal and parasitic modes, including on the imaginary axis.