Cluster k0292
Counting bad polynomials and permutations (the bad-share estimates)
A mixed collection built around counting arguments. Some files bound how often random polynomials over a small prime field are squarefree or have a bad factor, using the fraction of permutations with a given cycle structure. Others give real-number inequalities, a lower bound on a sum of reciprocals of primes, and a fact about prime powers dividing a number. A further group states family-wide deficit bounds and claims about representations of finite groups with number-field coefficients. The shared thread is "bad share" estimates, but the files do two or three unrelated jobs, and the full intent is unclear. A word-match to Behrend's work on progression-free sets looks unrelated.
3 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 countingModular arithmeticPrimes and divisibilityPolynomialsGroups and homomorphisms
References
Behrend sets without 3-term progressions — F. A. Behrend, "On sets of integers which contain no three terms in arithmetical progression", PNAS 32 (1946)Cited in the author's note · matched by word overlap · unchecked
Uses
Used by
141 Lean files, main folder Development.AbelianVarietyTheory.Proofs.FoundationProofs.