Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Global Hadamard factorization and inverse-square zero summability for the concrete Riemann xi

Proved
XiHadamardPortPublished.concrete_xi_global_hadamard

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

classical-theoremhadamard-factorizationleanriemann-xi

Let xi(s)=[s(s-1) completedRiemannZeta₀(s)+1]/2 be the concrete entire Riemann xi function. Index every nonzero zero by its divisor multiplicity, and denote its position by rho_i. Then sum_i |rho_i|^(-2) converges and there exists a complex polynomial P of degree at most one such that, for every complex z, xi(z)=exp(P(z)) product_i [(1-z/rho_i) exp(z/rho_i)]. The entire-function growth estimate and convergence are proved within the supplied proof, not assumed. This is the classical origin-centered genus-one product with its exponential factor retained; it is not yet the paired, normalized product centered at 1/2 needed by the project's Q tower. This theorem does not prove RH.

Preamble
import Mathlib
open scoped BigOperators
Formal statement
theorem XiHadamardPortPublished.concrete_xi_global_hadamard :
    let f : ℂ → ℂ := fun s => (s*(s-1)*completedRiemannZeta₀ s+1)/2
    let I : Type := {p : ((z : ℂ) × Fin ((MeromorphicOn.divisor f Set.univ z).toNat)) // p.1 ≠ 0}
    let rho : I → ℂ := fun p => p.val.1
    Summable (fun i => ‖rho i‖⁻¹ ^ (2 : ℕ)) ∧
    ∃ P : Polynomial ℂ, P.degree ≤ 1 ∧ ∀ z : ℂ,
      f z = Complex.exp (Polynomial.eval z P) *
        ∏' i : I, ((1-z/rho i)*Complex.exp (z/rho i)) := by sorry
Source
Primary formalization: Matteo Cipollina and contributors, PrimeNumberTheoremAnd, Apache-2.0, commit a4fb6989b07e9c76b511807ae93e33e25b820e9b, https://github.com/AlexKontorovich/PrimeNumberTheoremAnd . Lean 4.33.1 compatibility port, dependency bundling and explicit public wrapper by Desenvolvimento RH, coordinated by Ricardo Marangoni Brandao Bueno. No mathematical novelty claimed. Inventory: https://app.notion.com/p/41a98395ac6e8160a225d82e667ec8e4

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