Cluster k0625
Counting sums and parameter bounds for polynomial dimension
These files give inequalities with many parameters: a prime p, sizes N and N1, intervals and a few constants. They bound the "kappa" quantities, sums that count slopes along segments of a set, by constant multiples of N*N1/Y. Other files count frames (families of intervals or windows) and give a closed formula for a count called B, as well as a dimension count for polynomial spaces. Most statements are long assumption lists leading to a bound, so they show what is needed, not that it holds. The role is partly a guess; terms such as ColumnSpanDensity are project names.
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
Finite sets and countingReal analysisPolynomialsLattices in n dimensions, covolume and counting points
Uses
Used by
37 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.ColumnSpanDensity.