For a discrete valuation ring with uniformizer , an Eisenstein polynomial is a monic polynomial whose nonleading coefficients are divisible by and whose constant coefficient is not divisible by . It is irreducible, and adjoining one of its roots gives a totally ramified extension.
A polynomial may fail the Eisenstein polynomial test while a translate passes it. Translation does not change the generated extension: if , then vanishes at . For , the translate by is Eisenstein at whenever and .
The ramification polynomial records the normalised differences of conjugates of a uniformizer, including the zero difference from the identity automorphism. Its quotient by is the reduced ramification polynomial. In the usual coefficient-index convention, the finite slopes of its lower Newton polygon are negatives of the valuations of its nonzero roots; the coefficient at the zero root is treated as having infinite valuation.
For a degree- totally ramified Galois extension and a uniformizer , let be its minimal polynomial. Dividing the ramification polynomial by its known factor gives the reduced ramification polynomial. It is monic of degree , integral over the extension's valuation ring, and has roots 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.
In a totally ramified Galois extension, the uniformizer criterion for lower ramification groups gives exactly when . The Newton polygon root valuation theorem therefore identifies a slope in the coefficient-index convention with a lower ramification jump at . Its horizontal length is the number of automorphisms in that difference. Under the reflected Newton polygon convention the same jump has slope .

Ancestors (6)

  1. Local field
  2. Non-Archimedean analysis
  3. Arithmetic
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.