Cluster k0483
Gluing local lattice data into a global count
These files relate lattices in a global space to lattices at each prime. Sampled statements say a vector lies in a local lattice exactly when it lies in the local piece of the global one, that the global number of lattices equals the product of local counts when finitely many primes are special, that integers are dense in the local integers modulo a number, and that one can find an integer that is one at a prime and zero elsewhere. These are Chinese-remainder-style tools. Several statements are claims given as hypotheses.
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
Dedekind domains (unique factorisation of ideals)Ideals, ideal norm and discriminant of a number fieldFraction fields, integral elements and integrally closed (normal) ringsPrime ideals, localization and quotient ringsValuation rings and lattices over themModular arithmetic
References
Neukirch, Algebraic Number Theory · ch. II-VI (local-global, approximation)Background reading suggested by the AI namer · unchecked
Uses
Used by
71 Lean files, main folder Formalism.LocalToGlobal.SiegelLatticeTheory.CokernelGLCounts.RankPointCounts.