Cluster k0634
Gram windows and block bounds for Theorem M
These files belong to the large Theorem M effort over p-adic integers. They state that a lattice of polynomials has an adapted basis, that a bilinear form on a lattice has an orthogonal basis when p is odd, and that sums over a window of parameters of a "bad count" are bounded. They also cover a Gram (inner product matrix) determinant window, finite-rank counts of spans, and base change of structure for lattices. Almost all results come as large definitions of claims, or as theorems proved from such claims, so they record requirements rather than established facts.
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
p-adic numbersPolynomialsLinear algebraValuation rings and lattices over themFinite sets and countingAdic completion: approximating by ever higher powers of an ideal
Uses
Used by
103 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.MonomialFactorials.