Cluster k0611
p-adic valuation bounds, Smith form and binomial matrices
The files bound sizes measured by powers of a prime p. One statement gives the Smith form over the p-adic integers: any square matrix can be written as unit, diagonal, unit. Others give window-style averaging bounds on how many diagonal entries are small, determinant degree and leading-coefficient formulas for polynomial matrices, and facts about binomial coefficients that are never divisible by p. There are some stray claims on extensions of group schemes. The matrix and p-adic jobs fit together, but the overall aim is only a guess.
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
Polynomialsp-adic numbersLinear algebraA stranger way to measure size: ultrametric absolute valuesDiscrete valuation rings: numbers with one prime, and reducing mod it
References
Neukirch, Algebraic Number Theory · ch. II (p-adic numbers)Background reading suggested by the AI namer · unchecked
Uses
Used by
60 Lean files, main folder Formalism.MahlerMeasure.