Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Centered zeta zero-sum bound from factor and count bounds

Proved
ZeroFreeBridge.hbc1_from_bounds

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let R>0R>0R>0, 1<σ≤21<\sigma\le21<σ≤2, 2−σ<R2-\sigma<R2−σ<R, γ∈R\gamma\in\mathbb Rγ∈R, c=2+iγc=2+i\gammac=2+iγ, f(w)=ζ(c+w)f(w)=\zeta(c+w)f(w)=ζ(c+w), and z=σ+iγ−cz=\sigma+i\gamma-cz=σ+iγ−c. Suppose ggg gives the defined canonical decomposition of fff on B(0,R)B(0,R)B(0,R), both fff and ggg are analytic near that disk, ggg is zero-free on it, and ζ(c+z)≠0\zeta(c+z)\ne0ζ(c+z)=0. Let SSS be the finite support of −div⁡B(0,R)f-\operatorname{div}_{B(0,R)}f−divB(0,R)​f. If

∣logDeriv⁡g(z)∣≤Bg,∑u∈Sdiv⁡B(0,R)f(u)≤C,CR−∣z∣+Bg≤AL,|\operatorname{logDeriv}g(z)|\le B_g,\quad \sum_{u\in S}\operatorname{div}_{B(0,R)}f(u)\le C,\quad \frac{C}{R-|z|}+B_g\le A_L,∣logDerivg(z)∣≤Bg​,u∈S∑​divB(0,R)​f(u)≤C,R−∣z∣C​+Bg​≤AL​,

then

Re⁡(−logDeriv⁡f(z))≤AL−Re⁡∑u∈Sdiv⁡B(0,R)f(u)z−u.\operatorname{Re}(-\operatorname{logDeriv}f(z))\le A_L- \operatorname{Re}\sum_{u\in S}\frac{\operatorname{div}_{B(0,R)}f(u)}{z-u}.Re(−logDerivf(z))≤AL​−Reu∈S∑​z−udivB(0,R)​f(u)​.

This combines a zero count and a bound for the zero-free factor.

Preamble
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Mathlib
import Theorems.Thm_ZeroFreeBridge_bc_sum_blaschke
/- PHASE 4 (dVP frontier, item (A) — the height-γ hbc₁ wiring): produce the BC-SUM inequality
   `dlvp_zeta_region_of_bc_sums` consumes at height γ, from the O(L) bounds.

   With every analytic input now an explicit kernel-clean lemma (`hg_bound_gamma` for `Bg`,
   `sum_divisor_recenter_le_jensen` for the count `C`), closing `hbc₁` is composition: this wrapper
   takes `Bg`, `C`, and the region constraint `C/(R-‖z₀‖) + Bg ≤ AL`, derives `hAL` (via
   `sum_abs_divisor_eq` + `divisor ≥ 0` from `hf_ana.divisor_nonneg` + monotonicity in the count),
   and calls `bc_sum_concrete`.  Reusable for BOTH heights (the height-2γ `hbc₂` uses the same shape
   on the parallel disk).  `‖z₀‖ = 2-σ` via `concrete_eval_eq`.  conjecture1_proved = False.
-/



open Complex MeromorphicOn Metric

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.hbc1_from_bounds (σ γ : ℝ) {R : ℝ} (hR : 0 < R) (hσ1 : 1 < σ) (hσ2 : σ ≤ 2) (hσR : 2 - σ < R)
    (g : ℂ → ℂ)
    (D : CanonicalDecomp (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) g R)
    (hf_ana : AnalyticOnNhd ℂ (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) (ball 0 R))
    (hg_ana : AnalyticOnNhd ℂ g (ball 0 R)) (hg_ne : ∀ w ∈ ball (0 : ℂ) R, g w ≠ 0)
    (hfin : (Function.support
      (fun u => -(divisor (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) (ball 0 R) u))).Finite)
    (heval_ne : riemannZeta (((2 : ℂ) + (γ : ℂ) * I)
      + ((σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I))) ≠ 0)
    {Bg AL C : ℝ}
    (hg_bound : ‖logDeriv g ((σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I))‖ ≤ Bg)
    (hcount : (∑ u ∈ hfin.toFinset,
        (divisor (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) (ball 0 R) u : ℝ)) ≤ C)
    (hAL_bound : C / (R - ‖(σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I)‖) + Bg ≤ AL) :
    (-(logDeriv (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w))
        ((σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I)))).re
      ≤ AL - (∑ u ∈ hfin.toFinset,
          (divisor (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) (ball 0 R) u : ℂ)
            / (((σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I)) - u)).re := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpZetaHbc1.lean#L18-L57

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