Explicit divisor count for a disk crossing the strip
ProvedZeroFreeBridge.zeta_zero_count_striparda-rh65k-transfernumber-theoryriemann-zeta
Let and satisfy , , , and . Put
Then the finite-support divisor sum of on obeys
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