Cluster k0615
Valuation bounds on polynomials by monomial order and projections
These files measure how small the coefficients of multi-variable polynomials are, using a valuation (a score for how divisible by a prime something is). They track how the score changes when a polynomial is added, scaled, or differentiated, and when a "Fock projector" (a map keeping only certain monomials) is applied. Folder names mention monomial order segments and plane Gram data. Several statements are conditional: they derive a conclusion from a named bound or lemma. One claim, about attaching a character to a certain Galois representation over a CM field (a number field with complex-conjugation symmetry), looks out of place.
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 numbersValuation rings and lattices over themDiscrete valuation rings: numbers with one prime, and reducing mod itA stranger way to measure size: ultrametric absolute values
Uses
Used by
40 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.MonomialOrderSegments.