Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Optimized de la Vallée Poussin region estimate

Proved
ZeroFreeBridge.dlvp_region_bound

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, and δ>0\delta>0δ>0, and write B=3A+5ALB=3A+5ALB=3A+5AL. Suppose

δB=12,δ(1−δB)≤(1−β)(3+δB).\delta B=\tfrac12,\qquad \delta(1-\delta B)\le(1-\beta)(3+\delta B).δB=21​,δ(1−δB)≤(1−β)(3+δB).

Then

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

This is the real-variable optimization used in the zero-free-region proof.

Preamble
import Mathlib
/- PHASE 4 (dVP frontier, the σ-OPTIMIZATION — the headline region bound): turn the cleared region GAP
   into the de la Vallée Poussin bound `β ≤ 1 - c/(A·L)` (`= 1 - c/log|t|`).

   `ZeroFreeRegion.dlvp_region_gap` produces, at any `σ > 1`, the gap
     `(σ-1)·(1 - (σ-1)·B) ≤ (1-β)·(3 + (σ-1)·B)`,   B = 3A + 5AL.
   The classical dVP optimization CHOOSES `σ - 1 = δ = 1/(2B)`, so `δ·B = 1/2` and the gap collapses to
   `δ/2 ≤ (7/2)(1-β)`, i.e. `1 ≤ 14 B (1-β)`.  Since `B = A(3+5L) ≤ 8AL` for `L ≥ 1`, this gives
   `112 A L (1-β) ≥ 1`, hence

     `β ≤ 1 - 1/(112 · A · L)`,

   the zero-free region with an EXPLICIT constant `c = 1/112` (per unit `A`).  This is the final step of
   the reduction skeleton: composed with `dlvp_region_gap` at `σ = 1 + 1/(2B)`, it yields the region from
   the three Borel–Carathéodory inputs.  Self-contained real-arithmetic.  conjecture1_proved = False.
-/


section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.dlvp_region_bound (A L β δ : ℝ) (hA : 0 < A) (hL : 1 ≤ L) (hδpos : 0 < δ)
    (hδB : δ * (3 * A + 5 * (A * L)) = 1 / 2)
    (hgap : δ * (1 - δ * (3 * A + 5 * (A * L)))
              ≤ (1 - β) * (3 + δ * (3 * A + 5 * (A * L)))) :
    β ≤ 1 - 1 / (112 * (A * L)) := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpRegionBound.lean#L20-L43

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