Documentation

TauCeti.NumberTheory.NumberField.Ideal.KummerDedekind

Prime counts and residue degrees by Kummer–Dedekind #

Mathlib's number-field Kummer–Dedekind theorem (NumberField.Ideal.primesOverSpanEquivMonicFactorsMod) is a bijection between the primes of 𝓞 K above a rational prime p and the monic irreducible factors of minpoly ℤ θ modulo p, valid whenever p does not divide the conductor exponent of the algebraic integer θ. This file records both its cardinality form and its residue-degree form: the number of primes above p is the number of distinct factors, and their residue degrees are the factors' degrees. When the reduction is squarefree, its factor-degree multiset gives the splitting type directly. These forms are used to read splitting laws from a generator, for instance the quadratic laws of TauCeti.NumberTheory.NumberField.Quadratic.Splitting.

The first instance is the prime 2 for a generator ω with minimal polynomial X² - X + c and odd conductor exponent: the reduction X² + X + c mod 2 is X (X + 1) when c is even and the third cyclotomic polynomial X² + X + 1, irreducible over 𝔽₂, when c is odd, so there are two primes above 2 in the first case and one in the second. The conductor exponent of such a generator is automatically odd, since X² + X + c is separable over 𝔽₂.

Main results #

References #

The Kummer–Dedekind bijection preserves degree. The residue degree of a prime above p equals the degree of its corresponding monic irreducible factor modulo p.

The Kummer–Dedekind count. When p does not divide the conductor exponent of θ, the primes of 𝓞 K above p are counted by the monic irreducible factors of minpoly ℤ θ mod p.

The residue degrees of the primes above p are the degrees of the distinct monic irreducible factors of the minimal polynomial modulo p, when Kummer–Dedekind applies.

At a prime where the reduction of minpoly ℤ θ is squarefree, the splitting type is its multiset of factor degrees. The conductor-exponent hypothesis permits the Kummer–Dedekind correspondence.

The monic irreducible factors of X² - X + c modulo 2. For ω with minimal polynomial X² - X + c over ℤ, the reduction of that polynomial modulo 2 has two monic irreducible factors when c is even, since X² + X = X (X + 1) over 𝔽₂, and one when c is odd, since X² + X + 1 has no root in 𝔽₂.

A generator of K with minimal polynomial X² - X + c over ℤ has odd conductor exponent: its minimal polynomial is separable modulo 2.

The number of primes above 2 for a generator with minimal polynomial X² - X + c. Let K be generated over ℚ by an algebraic integer ω with minimal polynomial X² - X + c over ℤ, and suppose 2 does not divide the conductor exponent of ω. Then there are two primes of 𝓞 K above 2 when c is even and one when c is odd.