Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonnegativity of a weighted zero sum

Proved
ZeroFreeBridge.weighted_sum_re_nonneg

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, m:S→Zm:S\to\mathbb Zm:S→Z nonnegative, and z∈Cz\in\mathbb Cz∈C satisfy Re⁡ρ<Re⁡z\operatorname{Re}\rho<\operatorname{Re}zReρ<Rez for every ρ∈S\rho\in Sρ∈S. Then

Re⁡∑ρ∈Sm(ρ)z−ρ≥0.\operatorname{Re}\sum_{\rho\in S}\frac{m(\rho)}{z-\rho}\ge0.Reρ∈S∑​z−ρm(ρ)​≥0.

This allows all such terms in the zero sum to be discarded in a lower bound.

Preamble
import Mathlib
/- PHASE 4 (dVP frontier, Blaschke → skeleton GLUE): combine the Blaschke BC-SUM with the Herglotz
   lower bound to produce the reduction skeleton's `hzero` / `htwo` shapes.

   `DlvpBCSumBlaschke.bc_sum_blaschke` gives `-Re(ζ'/ζ)(z) ≤ AL - Re(Z)`, `Z = Σ_ρ (m ρ)/(z-ρ)`.
   `DlvpHerglotzLower.herglotz_re_ge` gives `Re(Z) ≥ k/(σ-β)` (keep the equal-height zero, drop the
   rest).  A `linarith` combines them into `-Re(ζ'/ζ)(z) ≤ AL - k/(σ-β)` — the exact `hzero` input of
   `DlvpPole.dlvp_region_of_bc_inputs`.  Dropping ALL zeros (`Re(Z) ≥ 0`, `weighted_sum_re_nonneg`)
   instead gives the `htwo` shape `-Re(ζ'/ζ)(z) ≤ AL`.  Abstract in the function `f` (composes with the
   ζ recentering).  conjecture1_proved = False (NOT a proof of RH).
-/


open Complex

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.weighted_sum_re_nonneg (s : Finset ℂ) (m : ℂ → ℤ) (z : ℂ)
    (hm : ∀ ρ ∈ s, 0 ≤ m ρ) (hlt : ∀ ρ ∈ s, ρ.re < z.re) :
    0 ≤ (∑ ρ ∈ s, (m ρ : ℂ) / (z - ρ)).re := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpBlaschkeToSkeleton.lean#L17-L32

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