Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical-product bound at the center

Proved
ZeroFreeBridge.norm_blaschke_center_le_one

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let R>0R>0R>0 and m:C→Zm:\mathbb C\to\mathbb Zm:C→Z have finite support SSS, with 0<∣u∣<R0<|u|<R0<∣u∣<R and m(u)≥0m(u)\ge0m(u)≥0 for each u∈Su\in Su∈S. For the defined factors FR,uF_{R,u}FR,u​,

∣∏u∈SFR,u(0)−m(u)∣≤1.\left|\prod_{u\in S}F_{R,u}(0)^{-m(u)}\right|\le1.​u∈S∏​FR,u​(0)−m(u)​≤1.

This supplies the center estimate for the canonical product.

Preamble
import Mathlib
/- PHASE 4 (dVP frontier, the Blaschke-CENTRE relation ‖B 0‖ ≤ 1 — item 2's last piece): the canonical
   Blaschke factor has modulus `R/‖w‖ > 1` at the centre, so raised to `-divisor` (`divisor ≥ 0` since the
   disk avoids the ζ pole) each factor has modulus `≤ 1`, and the finite product `‖B 0‖ ≤ 1`.

   Combined with the centre factorization `‖ζ c₀‖ = ‖f 0‖ = ‖B 0‖·‖g 0‖` this gives the Blaschke-centre
   relation `‖ζ c₀‖ ≤ ‖g 0‖` that `DlvpZetaEntire.norm_logDeriv_g_le` requires.  This file supplies the
   per-factor computational core.  conjecture1_proved = False (NOT a proof of RH).
-/


open Complex

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge





Formal statement

theorem ZeroFreeBridge.norm_blaschke_center_le_one {R : ℝ} (hR : 0 < R) (m : ℂ → ℤ)
    (hfin : (Function.support (fun u => -(m u))).Finite)
    (hsupp : ∀ u ∈ hfin.toFinset, u ≠ 0 ∧ ‖u‖ < R)
    (hm : ∀ u ∈ hfin.toFinset, 0 ≤ m u) :
    ‖(∏ᶠ u, (canonicalFactor R u) ^ (-(m u))) 0‖ ≤ 1 := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpBlaschkeCenter.lean#L40-L62

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