Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Analyticity of a finite canonical product

Proved
ZeroFreeBridge.blaschke_analyticAt

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

arda-rh65k-transfernumber-theoryriemann-zeta

Let n:C→Zn:\mathbb C\to\mathbb Zn:C→Z have finite support S⊂B(0,R)S\subset B(0,R)S⊂B(0,R). If z∈B(0,R)‾z\in\overline{B(0,R)}z∈B(0,R)​ and z∉Sz\notin Sz∈/S, then the finite product of defined canonical factors

z⟼∏u∈SFR,u(z)n(u)z\longmapsto\prod_{u\in S}F_{R,u}(z)^{n(u)}z⟼u∈S∏​FR,u​(z)n(u)

is analytic at zzz. The exclusion permits negative integer exponents.

Preamble
import Mathlib
/- PHASE 4 (dVP frontier, BLASCHKE item (d2) sub-lemma): the finite Blaschke product is analytic
   AWAY FROM ITS ZEROS.

   The Blaschke product `∏ᶠ_u (canonicalFactor R u)^{n u}` has (for `n = -divisor ≤ 0`) removable
   singularities exactly at the support points `u`.  AT a point `z` avoiding all of them, each factor
   is genuinely analytic and nonzero (`canonicalFactor` is analytic off `{u}` and nonzero away from
   `u` inside the disk), so `AnalyticAt.zpow` applies to each and `Finset.analyticAt_prod` to the
   product — NO meromorphic-order argument needed.

   This is exactly the analyticity the codiscrete → pointwise transfer (`DlvpTransfer`) needs to split
   `logDeriv ζ = logDeriv(Blaschke) + logDeriv g` at points off the zeros (item d2).  Function-agnostic
   in the exponent `n`.  conjecture1_proved = False (NOT a proof of RH).
-/


open Complex Metric

section
namespace ZeroFreeBridge
end ZeroFreeBridge
open ZeroFreeBridge

Formal statement

theorem ZeroFreeBridge.blaschke_analyticAt {R : ℝ} (n : ℂ → ℤ) (hn : (Function.support n).Finite)
    {z : ℂ} (hz : z ∈ closedBall (0 : ℂ) R)
    (hsupp : ∀ u ∈ hn.toFinset, u ∈ ball (0 : ℂ) R)
    (hzne : ∀ u ∈ hn.toFinset, z ≠ u) :
    AnalyticAt ℂ (∏ᶠ u, (canonicalFactor R u) ^ (n u)) z := by sorry
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/DlvpBlaschkeProdAnalytic.lean#L20-L40

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