Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Splitting the logarithmic derivative at the zeros

Proved
ZeroFreeBridge.logDeriv_split_off_zeros

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

arda-rh65k-transfernumber-theoryriemann-zeta

Suppose fff and ggg have the defined canonical decomposition on B(0,R)B(0,R)B(0,R), both are analytic near the disk, and ggg is zero-free there. Let SSS be the finite support of −div⁡(f)-\operatorname{div}(f)−div(f) in the disk, and let zzz lie in the disk but outside SSS. Then, for the defined canonical factors FR,uF_{R,u}FR,u​,

logDeriv⁡f(z)=∑u∈S(−div⁡(f)(u))logDeriv⁡FR,u(z)+logDeriv⁡g(z).\operatorname{logDeriv}f(z)=\sum_{u\in S} (-\operatorname{div}(f)(u))\operatorname{logDeriv}F_{R,u}(z) +\operatorname{logDeriv}g(z).logDerivf(z)=u∈S∑​(−div(f)(u))logDerivFR,u​(z)+logDerivg(z).

This separates the divisor terms from the zero-free factor.

Preamble
import Mathlib
import Theorems.Thm_ZeroFreeBridge_blaschke_analyticAt
import Theorems.Thm_ZeroFreeBridge_logDeriv_finprod_canonicalFactor
/- PHASE 4 (dVP frontier, BLASCHKE item (d2)): the log-derivative split for the canonical
   decomposition — `logDeriv ζ = Σ (canonical-factor log-derivatives) + logDeriv g`.

   Off the zeros, the codiscrete factorization `f =ᶠ (∏ᶠ canonicalFactor^{-divisor}) • g` upgrades to
   a pointwise log-derivative identity: work on a small CONVEX ball `B(z,ε) ⊆ ball 0 R` that avoids
   the finitely many zeros (extracted from the OPEN set `ball 0 R \ zeros`), where both `f` and the
   Blaschke·g product are analytic (`DlvpBlaschkeProdAnalytic.blaschke_analyticAt` for the Blaschke
   part), then apply the function-agnostic transfer `DlvpTransfer.logDeriv_congr_of_codiscrete`,
   `logDeriv_mul`, and the Blaschke Herglotz sum `DlvpBlaschkeHerglotz.logDeriv_finprod_canonicalFactor`.

     `logDeriv_split_off_zeros` :  for a `CanonicalDecomp f g R` with `f, g` analytic and `g` zero-free,
       at `z ∈ ball 0 R` off the zeros,
         `logDeriv f z = Σ_u (-divisor f (ball 0 R) u)·logDeriv (canonicalFactor R u) z + logDeriv g z`.

   conjecture1_proved = False (NOT a proof of RH).
-/




open Complex Metric MeromorphicOn Filter

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.logDeriv_split_off_zeros {f g : ℂ → ℂ} {R : ℝ}
    (D : CanonicalDecomp f g R)
    (hf_ana : AnalyticOnNhd ℂ f (ball 0 R)) (hg_ana : AnalyticOnNhd ℂ g (ball 0 R))
    (hg_ne : ∀ w ∈ ball (0 : ℂ) R, g w ≠ 0)
    (hfin : (Function.support (fun u => -(divisor f (ball 0 R) u))).Finite)
    {z : ℂ} (hz : z ∈ ball (0 : ℂ) R) (hzne : ∀ u ∈ hfin.toFinset, z ≠ u) :
    logDeriv f z
      = (∑ u ∈ hfin.toFinset,
          ((-(divisor f (ball 0 R) u) : ℤ) : ℂ) * logDeriv (canonicalFactor R u) z)
        + logDeriv g z := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpBlaschkeSplit.lean#L25-L95

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