Cluster k0627
Valuations of multi-variable polynomials under twisted substitution
These files assign each polynomial in many variables a valuation, a score recording how divisible its coefficients are by a prime or by a set of letters, and then prove the score behaves like a size: scores add when polynomials are multiplied and take a minimum when they are added. Other statements say that splitting a polynomial into pieces by degree does not lower the score, and that a chain rule for a derivative operator holds. They also cover substitution of matrices into variables and weights. Some are conditional on named claims.
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
PolynomialsA stranger way to measure size: ultrametric absolute valuesDiscrete valuation rings: numbers with one prime, and reducing mod itPartial derivatives on polynomials, differentials and smoothnessp-adic numbers
References
Neukirch, Algebraic Number Theory · ch. II (valuations)Background reading suggested by the AI namer · unchecked
Uses
Used by
38 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.RootWeights.