Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Zero-free-region estimate from two disk bounds

Proved
ZeroFreeBridge.dlvp_zeta_region_concrete_wired

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let A>0A>0A>0, L≥1L\ge1L≥1, k∈Zk\in\mathbb Zk∈Z with k≥1k\ge1k≥1, R>0R>0R>0, and real σ,β,γ\sigma,\beta,\gammaσ,β,γ satisfy

σ−1=12(3A+5AL),β<1,σ≤2,2−β<R,R+2≤∣γ∣.\sigma-1=\frac1{2(3A+5AL)},\quad \beta<1,\quad \sigma\le2,\quad 2-\beta<R,\quad R+2\le|\gamma|.σ−1=2(3A+5AL)1​,β<1,σ≤2,2−β<R,R+2≤∣γ∣.

Put cj=2+ijγc_j=2+ij\gammacj​=2+ijγ, zj=σ+ijγ−cjz_j=\sigma+ij\gamma-c_jzj​=σ+ijγ−cj​, and fj(w)=ζ(cj+w)f_j(w)=\zeta(c_j+w)fj​(w)=ζ(cj​+w) for j=1,2j=1,2j=1,2. Suppose the divisor of ζ\zetaζ in B(c1,R)B(c_1,R)B(c1​,R) at β+iγ\beta+i\gammaβ+iγ is kkk, and the pole bound

Re⁡(−ζ′(σ)ζ(σ))≤1σ−1+A\operatorname{Re}\left(-\frac{\zeta'(\sigma)}{\zeta(\sigma)}\right) \le\frac1{\sigma-1}+ARe(−ζ(σ)ζ′(σ)​)≤σ−11​+A

holds. For each jjj, suppose every defined canonical zero-free factor ggg of fjf_jfj​ has ∣logDeriv⁡g(zj)∣≤Bg,j|\operatorname{logDeriv}g(z_j)|\le B_{g,j}∣logDerivg(zj​)∣≤Bg,j​, and the finite-support divisor count on B(cj,R)‾\overline{B(c_j,R)}B(cj​,R)​ is at most CjC_jCj​, with

CjR−∣zj∣+Bg,j≤AL.\frac{C_j}{R-|z_j|}+B_{g,j}\le AL.R−∣zj​∣Cj​​+Bg,j​≤AL.

Then

β≤1−1112AL.\beta\le1-\frac1{112AL}.β≤1−112AL1​.

This assembles the zero-free-region argument from explicit disk hypotheses.

Preamble
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Mathlib
import Theorems.Thm_ZeroFreeBridge_dlvp_region_bound
import Theorems.Thm_ZeroFreeBridge_dlvp_region_gap
import Theorems.Thm_ZeroFreeBridge_hbc1_from_bounds
import Theorems.Thm_ZeroFreeBridge_htwo_shape_of_bc_sum
import Theorems.Thm_ZeroFreeBridge_hzero_shape_of_bc_sum
import Theorems.Thm_ZeroFreeBridge_sum_divisor_recenter_le_finsum
import Theorems.Thm_ZeroFreeBridge_zeta_logDeriv_comb_nonneg
import Theorems.Thm_ZeroFreeBridge_zeta_recentered_canonical_decomp
import Theorems.Thm_ZeroFreeBridge_zeta_zero_re_lt
/- PHASE 4 (dVP frontier, the CAPSTONE WIRING): the concrete instantiation of
   `dlvp_zeta_region_of_bc_sums` for an actual ζ-zero `ρ₀ = β+iγ` (`β < 1`).

   This discharges — internally, for the two disks `c₀ = 2+iγ` (height γ) and `c₁ = 2+2iγ`
   (height 2γ) — every hypothesis of the lower-layer region theorem EXCEPT the pole bound and the
   two O(L) numeric constraints:
     * both `CanonicalDecomp`s (`zeta_recentered_canonical_decomp`), analyticity bundles
       (`zeta_recenter_ana_closedBall`/`.mono`), and `MeromorphicOn`s;
     * `hbc₁` (height γ) via `hbc1_from_bounds` fed by the abstract `Bg₁`/`C₁` bounds
       (`hgb₁`, `hC₁` via `sum_divisor_recenter_le_finsum`);
     * `hbc₂` (height 2γ) via the PARALLEL `c₁`-disk `hbc1_from_bounds`, dropped to `A·L` with
       `htwo_shape_of_bc_sum` and recentred to the `c₀` form (`neg_logDeriv_zeta_recenter_re`),
       with `s₂ = ∅`;
     * the divisor/geometry data for the concrete zero (`divisor_comp_const_add_apply`,
       `zeta_zero_re_lt`, `zeta_divisor_nonneg`).

   The remaining inputs — the pole bound `hpole_pf` (via `hpole_bounded`, needs `σ` near 1) and the
   two numeric couplings `hnum₁`/`hnum₂` (`C/(R-‖z₀‖) + Bg ≤ A·L`, with `Bg = O(L)` from
   `hg_bound_gamma` and `C = O(L)` from `sum_divisor_recenter_le_jensen`) — are taken as clean
   hypotheses here: they are the numeric-coupling crux, isolated for a dedicated closing lemma.
   `Bg₁`/`C₁`/`Bg₂`/`C₂` are abstracted so the caller supplies the explicit O(L) values.

   conjecture1_proved = False (NOT a proof of RH — this is a REDUCTION).
-/









open Complex MeromorphicOn Metric

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.dlvp_zeta_region_concrete_wired
    (σ A L β γ : ℝ) (k : ℤ) (R : ℝ) (Bg₁ C₁ Bg₂ C₂ : ℝ)
    (hA : 0 < A) (hL : 1 ≤ L) (hk : 1 ≤ k)
    (hσ_opt : σ - 1 = 1 / (2 * (3 * A + 5 * (A * L))))
    (hβ1 : β < 1) (hσ2 : σ ≤ 2)
    (hR : 0 < R) (hβR : 2 - β < R) (himc0 : R + 2 ≤ |γ|)
    (hmρ₀ : divisor riemannZeta (ball ((2 : ℂ) + (γ : ℂ) * I) R) ((β : ℂ) + (γ : ℂ) * I) = k)
    (hpole_pf : (-deriv riemannZeta (σ : ℂ) / riemannZeta (σ : ℂ)).re
                ≤ (1 / ((σ : ℂ) - 1)).re + A)
    (hgb₁ : ∀ g : ℂ → ℂ,
        CanonicalDecomp (fun w => riemannZeta (((2 : ℂ) + (γ : ℂ) * I) + w)) g R →
        ‖logDeriv g ((σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I))‖ ≤ Bg₁)
    (hC₁ : ((∑ᶠ ρ, divisor riemannZeta (closedBall ((2 : ℂ) + (γ : ℂ) * I) R) ρ : ℤ) : ℝ) ≤ C₁)
    (hnum₁ : C₁ / (R - ‖(σ : ℂ) + (γ : ℂ) * I - ((2 : ℂ) + (γ : ℂ) * I)‖) + Bg₁ ≤ A * L)
    (hgb₂ : ∀ g : ℂ → ℂ,
        CanonicalDecomp (fun w => riemannZeta (((2 : ℂ) + ((2 * γ : ℝ) : ℂ) * I) + w)) g R →
        ‖logDeriv g ((σ : ℂ) + ((2 * γ : ℝ) : ℂ) * I - ((2 : ℂ) + ((2 * γ : ℝ) : ℂ) * I))‖ ≤ Bg₂)
    (hC₂ : ((∑ᶠ ρ, divisor riemannZeta (closedBall ((2 : ℂ) + ((2 * γ : ℝ) : ℂ) * I) R) ρ : ℤ) : ℝ)
             ≤ C₂)
    (hnum₂ : C₂ / (R - ‖(σ : ℂ) + ((2 * γ : ℝ) : ℂ) * I - ((2 : ℂ) + ((2 * γ : ℝ) : ℂ) * I)‖) + Bg₂
             ≤ A * L) :
    β ≤ 1 - 1 / (112 * (A * L)) := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpZetaConcreteWired.lean#L38-L289

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