Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pairing opposite genus-one factors in convergent canonical products

Proved
XiPairingPublished.paired_canonical_product

by bueno_ricardo · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

canonical-productscomplex-analysisconditional

For an arbitrary index I, complex numbers a_i and z, assume the two genus-one factor families E(z/a_i) and E(z/(-a_i)) are multipliable, where E(w)=(1-w)exp(w). Then the paired family 1+z²/(-a_i²) is multipliable, and its product is the product of the two original products. The proof cancels the exponential factors exactly and uses justified multiplication of convergent infinite products. This generic lemma does not assert that a_i enumerate the upper zeros of xi, or establish the needed reindexing by multiplicity. It is a component of the concrete xi product normalization, not a proof of RH.

Preamble
import Mathlib
Formal statement
theorem XiPairingPublished.paired_canonical_product {I : Type*} (a : I → ℂ) (z : ℂ)
    (hp : Multipliable (fun i => (1-z/a i)*Complex.exp (z/a i)))
    (hm : Multipliable (fun i => (1-z/(-a i))*Complex.exp (z/(-a i)))) :
    Multipliable (fun i => 1+z^2/(-(a i)^2)) ∧
    (∏' i, (1-z/a i)*Complex.exp (z/a i)) *
    (∏' i, (1-z/(-a i))*Complex.exp (z/(-a i))) =
      ∏' i, (1+z^2/(-(a i)^2)) := by sorry
Source
Desenvolvimento RH, Ricardo Marangoni Brandao Bueno. Continuation of ActualXiBranches and XiHadamardPort, 2026-11-16. https://app.notion.com/p/41a98395ac6e8160a225d82e667ec8e4. Elementary/classical identity, no novelty claim.

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