Cluster k0417
Size windows, prime sums and 2-adic order facts
This cluster mixes several analytic and arithmetic bounds. One statement picks one outcome from a probability distribution so that a "loss" is small. Others compute orders of elements modulo powers of two, bound sums of (log prime)/prime over primes whose order is small, and give a "least residue" fact. A further group expands a weighted sum over characters (an "ASK" quantity) and states a balance identity. The files do rather different jobs: elementary prime-sum estimates and a character-sum expansion. Some names suggest hypotheses and even a counterexample file. I cannot tell how they fit together.
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
Chebyshev functions theta and psiPrimes and divisibilityModular arithmeticInfinite seriesFinite sets and countingGroups as matrices: representations and characters
References
Montgomery and Vaughan, Multiplicative Number Theory I · ch. 2-4 (prime sums, characters)Background reading suggested by the AI namer · unchecked
Uses
Used by
23 Lean files, main folder Formalism.SizeWindowBrackets.