Cluster k0695
Host-field conditions, inertness of primes and character box parameters
This large cluster sets up a "host" number field and tests whether primes there are inert (stay prime), using Jacobi symbols. One statement says a prime is inert exactly when it is prime, does not divide the conductor and a Jacobi symbol equals minus one. Others give conditions under which an explicit formula error is small, show a Galois map matches complex conjugation, and give a bijection between a group and a product description. A statement picks an exponent so that a power of two lies in a window above a power of x. Some are named Prop claims about characters, boxes and conductors.
3 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Dirichlet L-functionsDirichlet charactersNumber fields, algebraic integersA group acting on a field, and its fixed subfieldModular arithmeticPrimes and divisibilityIdeals, ideal norm and discriminant of a number field
References
Neukirch, Algebraic Number Theory · ch. I and II (primes in quadratic fields, ramification)Background reading suggested by the AI namer · unchecked
Uses
Used by
80 Lean files, main folder Development.AutomorphicArithmetic.ConductorsKronecker.