Cluster k0605
Theorem M: averaged lattice bounds over p-adic polynomial tuples
This group states one very large inequality, called Theorem M, and several close variants. It averages a "bad count" over many choices of parameters, and bounds it using the dimensions of p-adic vector spaces, a prime p, tie data and degree limits. Most files are definitions of claims (Prop) with enormous lists of conditions. Others derive a lattice-height bound from Theorem M plus an extra implication, so these are proofs by assuming other claims. I cannot read the meaning of the notation, such as letters, ties and lgV2, from the statements. No proof content is visible, so none can be called complete.
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 numbersPolynomialsReal analysisLinear algebraGroups as matrices: representations and characters
Uses
Used by
35 Lean files, main folder Formalism.ThetaLogCoordinates.FockResolutionOnto.