Cluster k0545
Positivity and counting near lattices at all but finitely many primes
These files check conditions that hold "for all but finitely many primes" of a number field, as needed when many local factors are multiplied. They state a positivity test for a "near-lattice" (a set close to a grid of points), second-countability of matrix groups over adelic rings (a mild countable-basis condition), and facts about smooth scaling in the local integers. Many reference counts of prime-ideal data in completions. They support the stabilizer-volume computation and are technical. Names are the project's own.
4 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
Adic completion: approximating by ever higher powers of an idealTopology: open sets, closed sets, compact and connected setsNumber fields, algebraic integersLattices in n dimensions, covolume and counting pointsp-adic numbers
Uses
Used by
35 Lean files, main folder Formalism.PeriodIntegrals.UnitaryGroupMassFormula.StabilizerVolume.