Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positivity of logarithmic Q from a canonical product, counting, and finite spectral verification

Proved
XiCountedQPublished.logarithmic_Q_positive_from_product_and_count

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

complex-analysisleanriemann-xispectral-counting

Let γj≥2\gamma_j\ge2γj​≥2 and ∣ϵj∣≤1/2|\epsilon_j|\le1/2∣ϵj​∣≤1/2, and put Bj=γj2−ϵj2−2iϵjγjB_j=\gamma_j^2-\epsilon_j^2-2i\epsilon_j\gamma_jBj​=γj2​−ϵj2​−2iϵj​γj​. Assume ϵj=0\epsilon_j=0ϵj​=0 whenever γj≤1000\gamma_j\le1000γj​≤1000, and assume an index j0j_0j0​ satisfies γj0≤100\gamma_{j_0}\le100γj0​​≤100. Suppose every finite set of indices with γj2≤y\gamma_j^2\le yγj2​≤y has cardinality at most y3/4y^{3/4}y3/4 for every y≥1y\ge1y≥1. Let c>0c>0c>0 and g(x)>0g(x)>0g(x)>0 for x>0x>0x>0, with the normalized product identity

g(x)c=∏j(1+xBj)(x>0).\frac{g(x)}{c}=\prod_j\left(1+\frac{x}{B_j}\right)\quad(x>0).cg(x)​=j∏​(1+Bj​x​)(x>0).

Set J(x)=log⁡g(x)−log⁡cJ(x)=\log g(x)-\log cJ(x)=logg(x)−logc. Then, for every integer n≥1n\ge1n≥1 and u>0u>0u>0,

Qn(u):=2nu2n−1(−1)n−1J(n)(u2)>0.Q_n(u):=2^n u^{2n-1}(-1)^{n-1}J^{(n)}(u^2)>0.Qn​(u):=2nu2n−1(−1)n−1J(n)(u2)>0.

The formal index is n=r+1n=r+1n=r+1. Gaussian summability, the Gaussian tail bound, reciprocal summability, integrability, and the integral representation of QnQ_nQn​ are conclusions of the auxiliary results, not independent premises here. The normalized product, counting bound, and finite spectral verification remain explicit hypotheses. No claim is made that those hypotheses have been instantiated in Lean for the complete Riemann-zeta zero multiset, and this theorem does not prove RH.

Preamble
import Mathlib
open MeasureTheory Set Filter Topology
open scoped BigOperators
Formal statement
theorem XiCountedQPublished.logarithmic_Q_positive_from_product_and_count (gamma eps : ℕ → ℝ) (hg : ∀ j, 2 ≤ gamma j)
    (strip : ∀ j, |eps j| ≤ 1/2)
    (verified : ∀ j, gamma j ≤ 1000 → eps j = 0)
    (anchor : ℕ) (anchor_low : gamma anchor ≤ 100)
    (count : ∀ y ≥ (1 : ℝ), ∀ F : Finset ℕ,
      (∀ j ∈ F, (gamma j)^2 ≤ y) → (F.card : ℝ) ≤ y^((3 : ℝ)/4))
    (g : ℝ → ℝ) (c : ℝ) (hc : 0 < c) (gpos : ∀ x > 0, 0 < g x)
    (product_identity : ∀ x > 0, (((g x/c : ℝ) : ℂ)) =
      ∏' j, (1+(x : ℂ)/(((gamma j^2-eps j^2 : ℝ) : ℂ) - ((2*eps j*gamma j : ℝ) : ℂ)*Complex.I)))
    (r : ℕ) (u : ℝ) (hu : 0 < u) :
    0 < (2 : ℝ)^(r+1)*u^(2*(r+1)-1)*(-1 : ℝ)^r *
      iteratedDeriv (r+1) (fun x => Real.log (g x) - Real.log c) (u^2) := by sorry
Source
Desenvolvimento RH, Ricardo Marangoni Brandao Bueno. PF28 and corrected Branches 2/3. Formalization of classical analytic tools and conditional logarithmic-Q positivity, 2026-11-16. No novelty or RH proof claimed. 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