Cluster k0623
Prime-sum bounds for Joint Record and weight-spread claims
These files collect inequalities about primes and sums of logarithms, used for a "joint record" statement. A typical claim says that for a large enough size x and a prime l, a chosen exponent bound holds and the weighted sum of exponents times log l stays below a multiple of a polynomial in x. Smaller facts cover residues modulo l (what is left after dividing by l), a lack of residues in a window of numbers, and a parameter-spread inequality. Several statements are large conditional implications that rely on named lemmas, and the Hida setting means a ring setup with a prime.
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
Primes and divisibilityModular arithmeticChebyshev functions theta and psiFinite sets and countingReal analysisNumber fields, algebraic integers
References
Apostol, Introduction to Analytic Number Theory · ch. 4 (primes, Chebyshev) and ch. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
35 Lean files, main folder Formalism.PieriBlockIdeals.