Cluster k0637
Segment degree selection lemmas and counting for Theorem M
These files produce counting bounds for pieces ("segments") of a large parameter set, in the Theorem M effort. They state that certain families are linearly independent over a ring with one prime, that a finite set of generators can be cut down to a basis, and that a sum over labels is at most the dimension of a residue space. Smaller facts give numeric inequalities between powers of p, degrees and positions. Many theorems prove a "Rest" claim from other "Rest" claims, so they combine assumptions rather than stand alone. One stray claim concerns integrals on a locally compact group.
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
Discrete valuation rings: numbers with one prime, and reducing mod itPolynomialsFinite sets and countingLinear algebraLocal rings and residue fields: one big ideal of small elementsIntegration on a group, Haar measure and fundamental domains
Uses
Used by
65 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.SegmentDegree.