Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit divisor count for a disk crossing the strip

Proved
ZeroFreeBridge.zeta_zero_count_strip

by Johan Mercedes · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

arda-rh65k-transfernumber-theoryriemann-zeta

Let c∈Cc\in\mathbb Cc∈C and r,R∈Rr,R\in\mathbb Rr,R∈R satisfy 0<∣r∣<∣R∣0<|r|<|R|0<∣r∣<∣R∣, Re⁡c>1\operatorname{Re}c>1Rec>1, ∣R∣<Re⁡c−1/2|R|<\operatorname{Re}c-1/2∣R∣<Rec−1/2, and ∣R∣+2≤∣Im⁡c∣|R|+2\le|\operatorname{Im}c|∣R∣+2≤∣Imc∣. Put

U=∣c∣+∣R∣∣Im⁡c∣−∣R∣+∣c∣+∣R∣Re⁡c−∣R∣.U=\frac{|c|+|R|}{|\operatorname{Im}c|-|R|} +\frac{|c|+|R|}{\operatorname{Re}c-|R|}.U=∣Imc∣−∣R∣∣c∣+∣R∣​+Rec−∣R∣∣c∣+∣R∣​.

Then the finite-support divisor sum of ζ\zetaζ on B(c,∣r∣)‾\overline{B(c,|r|)}B(c,∣r∣)​ obeys

∑u ⁣fdiv⁡B(c,∣r∣)‾ζ(u)≤log⁡(U/∣ζ(c)∣)log⁡(R/r).\sum{}^{\!f}_{u}\operatorname{div}_{\overline{B(c,|r|)}}\zeta(u) \le\frac{\log(U/|\zeta(c)|)}{\log(R/r)}.∑uf​divB(c,∣r∣)​​ζ(u)≤log(R/r)log(U/∣ζ(c)∣)​.

The real logarithm and division use Lean's total definitions for all real inputs.

Preamble
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Mathlib
import Theorems.Thm_ZeroFreeBridge_zeta_sphere_bound_strip
/- PHASE 4 (dVP frontier, item 3 input — strip-capable Jensen zero count): the version of
   `zeta_zero_count_unconditional` (`DlvpZetaDisk`) that survives the disk DIPPING BELOW `Re = 1`.

   The count `∑ divisor ≤ log(M/‖ζ c‖)/log(R/r)` (`zeta_zero_count_le`) takes the boundary bound `M`
   as a HYPOTHESIS and only needs `1 < c.re` at the CENTER plus `1 ∉ closedBall c |R|` — ζ is
   analytic on ANY disk avoiding `s = 1`, even one reaching `Re < 1`.  The original
   `zeta_zero_count_unconditional` supplies `M` via `zeta_sphere_bound` (`Re > 1`), forcing
   `|R| + 1 < c.re`.  Here we supply `M` via `zeta_strip_bound` (valid on the FULL strip
   `Re > 0`, `s ≠ 1`), so the disk may enclose a nontrivial zero `ρ₀` (`Re < 1`).

   This delivers the `O(L)` zero-count bound `∑ |divisor| ≤ Ccount·L` that `hAL_arith` (`DlvpHALArith`)
   consumes.  conjecture1_proved = False (NOT a proof of RH).
-/



open Complex Metric MeromorphicOn

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge



Formal statement

theorem ZeroFreeBridge.zeta_zero_count_strip (c : ℂ) (r R : ℝ)
    (hr : 0 < |r|) (hrR : |r| < |R|) (hc1 : 1 < c.re)
    (hRlt : |R| < c.re - 1/2) (himc : |R| + 2 ≤ |c.im|) :
    ∑ᶠ u, divisor riemannZeta (Metric.closedBall c |r|) u
      ≤ Real.log (((‖c‖ + |R|) / (|c.im| - |R|) + (‖c‖ + |R|) / (c.re - |R|)) / ‖riemannZeta c‖)
          / Real.log (R / r) := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpZetaCountStrip.lean#L60-L89

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me