Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A complete countable index of upper nontrivial zeta zeros with exact multiplicities

Proved
XiMultiplicityPublished.complete_countable_zero_index

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

canonical-productsleanriemann-xizero-multiplicity

There exist a countable index type III and a map ρ:I→C\rho:I\to\mathbb Cρ:I→C whose image is exactly

{s:ζ(s)=0, 0<ℜs<1, ℑs>0}.\{s:\zeta(s)=0,\ 0<\Re s<1,\ \Im s>0\}.{s:ζ(s)=0, 0<ℜs<1, ℑs>0}.

For every zero sss in this set, the fiber {i:ρ(i)=s}\{i:\rho(i)=s\}{i:ρ(i)=s} has cardinality equal to its analytic order of vanishing as a zero of zeta. For every real TTT, only finitely many indices satisfy ℑρ(i)≤T\Im\rho(i)\le Tℑρ(i)≤T. The result supplies a complete index with multiplicities. It is noncomputational and does not provide a numerical list, a quantitative counting bound, an increasing enumeration by natural numbers, or a proof that the index type is infinite.

Preamble
import Mathlib
open MeasureTheory Set Filter Topology
open scoped BigOperators
Formal statement
theorem XiMultiplicityPublished.complete_countable_zero_index :
    ∃ I : Type, Countable I ∧ ∃ rho : I → ℂ,
      (∀ s : ℂ, (∃ i, rho i = s) ↔
        riemannZeta s = 0 ∧ 0 < s.re ∧ s.re < 1 ∧ 0 < s.im) ∧
      (∀ s : ℂ, riemannZeta s = 0 → 0 < s.re → s.re < 1 → 0 < s.im →
        Nat.card {i : I // rho i = s} = analyticOrderNatAt riemannZeta s) ∧
      (∀ T : ℝ, {i : I | (rho i).im ≤ T}.Finite) := 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