Cluster k0972
Small primes, row conditions and upper-theory bounds
A small cluster with statements about "small" primes of a host number field, such as the local level equalling one away from small primes, and an upper bound on a local invariant counting length of a unit quotient. It also defines "star" conditions and row-small conditions, which say what must hold for rows split between small and non-small primes. One file says the row condition holds for some constants, assuming published results on discrete series and Harish-Chandra modules. Another closes a bound at the primes two and three through the local Langlands correspondence, taken as an assumed result. Largely conditional bookkeeping.
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
Number fields, algebraic integersPrimes and divisibilityIdeals, ideal norm and discriminant of a number fieldReal analysis
Uses
Used by
18 Lean files, main folder Development.AutomorphicArithmetic.ResidueCharacters.