Cluster k0437
Chain size windows and a bridge to a growth bound with RH
This cluster states mean-value bounds built from many numerical parameters, plus reductions that appear to lead toward the Riemann-hypothesis claim itself. Some statements bound an average of one quantity by an average of another plus an error; others reduce a "main chain" statement to a concrete-core one at prime pairs; one is titled with a "growth bound and Riemann hypothesis" conclusion. Several files are named as hypotheses or as "false" variants. Their real role appears to be bookkeeping connecting bounds to the final claim.
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
What RH saysPrimes and divisibilityInfinite seriesReal analysisFinite sets and counting
Uses
Used by
28 Lean files, main folder Formalism.SizeWindowBrackets.