Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Countable-index logarithmic Q positivity under explicit product and spectral conditions

Proved
XiMultiplicityPublished.countable_logarithmic_Q_positive

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

canonical-productsleanriemann-xizero-multiplicity

Let III be any countable type, γi≥2\gamma_i\ge2γi​≥2, ∣ϵi∣≤1/2|\epsilon_i|\le1/2∣ϵi​∣≤1/2, and Bi=γi2−ϵi2−2iϵiγiB_i=\gamma_i^2-\epsilon_i^2-2i\epsilon_i\gamma_iBi​=γi2​−ϵi2​−2iϵi​γi​. Assume ϵi=0\epsilon_i=0ϵi​=0 for γi≤1000\gamma_i\le1000γi​≤1000, and assume an anchor has γ≤100\gamma\le100γ≤100. For every y≥1y\ge1y≥1, suppose every finite set of indices with γi2≤y\gamma_i^2\le yγi2​≤y has cardinality at most y3/4y^{3/4}y3/4. Let c>0c>0c>0 and g(x)>0g(x)>0g(x)>0 for x>0x>0x>0 satisfy

g(x)/c=∏i∈I(1+x/Bi).g(x)/c=\prod_{i\in I}(1+x/B_i).g(x)/c=i∈I∏​(1+x/Bi​).

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

2nu2n−1(−1)n−1J(n)(u2)>0.2^n u^{2n-1}(-1)^{n-1}J^{(n)}(u^2)>0.2nu2n−1(−1)n−1J(n)(u2)>0.

The formal index is n=r+1n=r+1n=r+1. This generalizes the previously verified natural-number-indexed theorem to an arbitrary countable index, including an index constructed from actual zero multiplicities. Product identification, counting, positivity of g, and finite spectral data remain hypotheses; their application to xi is not asserted by this theorem.

Preamble
import Mathlib
open MeasureTheory Set Filter Topology
open scoped BigOperators
Formal statement
theorem XiMultiplicityPublished.countable_logarithmic_Q_positive (I : Type*) [Countable I] (gamma eps : I → ℝ) (hg : ∀ j, 2 ≤ gamma j)
    (strip : ∀ j, |eps j| ≤ 1/2)
    (verified : ∀ j, gamma j ≤ 1000 → eps j = 0)
    (anchor : I) (anchor_low : gamma anchor ≤ 100)
    (count : ∀ y ≥ (1 : ℝ), ∀ F : Finset I,
      (∀ 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. Continuation of PF28 and Branches 2/3 formalization, 2026-11-16. Classical results and countable generalization; 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