Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lower bound from one term of a zero sum

Proved
ZeroFreeBridge.herglotz_re_ge

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let S⊂CS\subset\mathbb CS⊂C be finite and m:S→Zm:S\to\mathbb Zm:S→Z nonnegative. Let ρ0=β+iγ∈S\rho_0=\beta+i\gamma\in Sρ0​=β+iγ∈S have weight k=m(ρ0)k=m(\rho_0)k=m(ρ0​), and suppose every other ρ∈S\rho\in Sρ∈S has Re⁡ρ<σ\operatorname{Re}\rho<\sigmaReρ<σ. Then

kσ−β≤Re⁡∑ρ∈Sm(ρ)σ+iγ−ρ.\frac{k}{\sigma-\beta}\le\operatorname{Re} \sum_{\rho\in S}\frac{m(\rho)}{\sigma+i\gamma-\rho}.σ−βk​≤Reρ∈S∑​σ+iγ−ρm(ρ)​.

The singled-out zero gives a lower bound for the weighted zero sum.

Preamble
import Mathlib
/- PHASE 4 (dVP frontier, BLASCHKE → skeleton bridge): the Herglotz lower bound.

   `DlvpBCSumBlaschke.bc_sum_blaschke` gives `-Re(ζ'/ζ) ≤ A·L − Re(Z)` with `Z = Σ_ρ (divisor ρ)/(z−ρ)`.
   To reach the skeleton's `hzero` shape `-Re(ζ'/ζ) ≤ A·L − k/(σ−β)`, one needs `Re(Z) ≥ k/(σ−β)`:
   keep the zero `ρ₀ = β+γI` at the SAME height as `z = σ+γI` (its real part is exactly `k/(σ−β)`,
   rung 1 `re_smul_inv_sub_at_equal_height`) and DROP the other zeros (each `Re ≥ 0` since their real
   part is `< σ`, rung 1 `re_inv_sub_nonneg_of_re_lt`, times the nonnegative multiplicity).

     `herglotz_re_ge` :  ρ₀ ∈ s with `ρ₀ = β+γI`, `m ρ₀ = k`, `m ≥ 0`, other zeros `Re < σ`
       ⟹  `k/(σ−β) ≤ Re(Σ_ρ (m ρ)/((σ+γI) − ρ))`.

   Combined with `bc_sum_blaschke` (a `linarith`) this yields the `hzero`/`htwo` inputs the reduction
   skeleton `DlvpPole.dlvp_region_of_bc_inputs` consumes.  conjecture1_proved = False (NOT RH).
-/


open Complex

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.herglotz_re_ge {s : Finset ℂ} (m : ℂ → ℤ) (σ γ β : ℝ) (k : ℤ)
    (hm : ∀ ρ ∈ s, 0 ≤ m ρ)
    (ρ₀ : ℂ) (hρ₀ : ρ₀ ∈ s) (hρ₀_eq : ρ₀ = (β : ℂ) + (γ : ℂ) * I) (hmρ₀ : m ρ₀ = k)
    (hother : ∀ ρ ∈ s, ρ ≠ ρ₀ → ρ.re < σ) :
    (k : ℝ) / (σ - β)
      ≤ (∑ ρ ∈ s, (m ρ : ℂ) / (((σ : ℂ) + (γ : ℂ) * I) - ρ)).re := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpHerglotzLower.lean#L21-L47

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