Cluster k0641
Lifting letters, column systems and coefficient dependence
These files handle "lifting" polynomials from a residue setting to a ring with one prime, in the Frobenius-paths part of the growth bounds. One claim says that path-indexed polynomials form a basis over any ring. Another says the coefficients of a lifted substitution are divisible by a controlled power of a uniformiser (the element that generates the maximal ideal) and depend only on a plane determined by a matrix. A long statement about Chebyshev points (well-spread sample points in an interval) bounds a pairing. Several theorems conclude from admissibility assumptions.
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
PolynomialsDiscrete valuation rings: numbers with one prime, and reducing mod itLinear algebraReal analysisp-adic numbersHensel lifting (improving an approximate root)
Uses
Used by
37 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.FrobeniusPaths.