Cluster k0632
Lattice edges, dual heights and residue-class counts in Hida settings
These files work with lattices (integer-like sets of vectors) over a ring with one prime and an "edge", a pair of lattices where the second is p times bigger in an index sense. They state that a lattice has a basis adapted to both ends of an edge, that a perfect pairing exists between two lattices, and that a counting bound for a "cloud" of low-degree pieces follows from a tensor-basis claim. A quadratic-roots statement and a small matrix lemma about elimination over a ring with one prime also appear. Many results assume other named claims. Names like flip-one-three are project terms.
5 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
Discrete valuation rings: numbers with one prime, and reducing mod itAdic completion: approximating by ever higher powers of an idealLinear algebraFinite sets and countingValuation rings and lattices over themThe ideal class group of a number field
Uses
Used by
47 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.ColumnSpanDensity.