Cluster k0011
p-adic valuations of products and sums over windows of integers
Files about p-adic valuations, which count how many times a prime p divides a number. The sample statements include a lifting-the-exponent formula (how often p divides u^i − 1), bounds on the valuation of a product of terms 1 − u^i over a window of consecutive i, and the p-adic size of the order of the general linear group over a finite field. Others are about Lagrange-type interpolation and about a polynomial that kills certain eigenvectors. The common role is to give explicit inequalities for p-adic sizes used by neighbouring cohomology clusters.
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
p-adic numbersPrimes and divisibilityModular arithmeticDiscrete valuation rings: numbers with one prime, and reducing mod itPolynomialsA stranger way to measure size: ultrametric absolute values
References
Gouvêa, p-adic Numbers: An Introduction · ch. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
26 Lean files, main folder Formalism.PadicSubsetSums.StableGradedCounts.