← LibraryValuations and UniformisersEngineering · MathematicsLesson 295/385← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginvaluationuniformiserlocalexponent

Orders, Ideals and Prime Decomposition

Valuations and Uniformisers

Valuations at prime ideals, uniformising elements, and computing the exponent of a prime in an ideal factorisation.

Engineering / MathematicsOrders, Ideals and Prime Decomposition2 min readKV-MATH-0592

The valuation at a prime ideal records the exponent of that prime in a factorisation. Computing valuations and constructing elements with prescribed valuations are basic operations in ideal arithmetic and relation collection.

Valuation

v_P(I) = exponent of P in the factorisation of IExtended to elements by taking the valuation of the principal ideal they generate.
Uniformiser
An element of valuation exactly one at the given prime. Exists for every prime ideal.
Local ring
The elements of non-negative valuation at a prime form a discrete valuation ring; the valuation is its length function.
Product formula
Valuations are additive on products, which is what makes them usable for factorisation bookkeeping.

Computing a valuation

Computing the valuation of an ideal at a prime

  1. Bound itThe valuation is bounded by the valuation of the norm divided by the residue degree, giving a quick upper limit.
  2. Divide repeatedlyMultiply by the inverse of the prime and test integrality, counting the successful steps.
  3. Or use a uniformiserMultiply by an element of valuation minus one at the prime and non-negative valuation elsewhere; count steps.

Constructing a uniformiser

A uniformiser is found by taking a random element of the prime and checking that it does not lie in the square of the prime. For a prime in two-element form, the second generator is usually already a uniformiser or becomes one after a small adjustment.

Factoring an ideal

Factoring an ideal into primes

  1. Compute the normFrom the Hermite representation.
  2. Factor the normAn integer factorisation.
  3. Decompose each primeFind the primes above each rational prime dividing the norm.
  4. Compute valuationsAt each candidate prime.
  5. VerifyThe product of prime norms to their valuations must equal the ideal norm.

Archimedean places

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.8. 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.

Continue learning

Essential Discriminant DivisorsArticle · MathematicsNEXT LESSON →The Ideal Class GroupArticle · MathematicsPrime Decomposition when p Does Not Divide the IndexArticle · MathematicsThe Dirichlet Unit Theorem, ComputationallyArticle · Mathematics