Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Off-line zeros and multiplicity indices have the same finite or infinite classification

Proved
ActualXiBranchesPublished.offline_cardinality_correspondence

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

canonical-productsconditional-branchesleanriemann-xi

Let III be the complete index of upper zeros of the concrete Riemann xi function, with each zero repeated according to its analytic multiplicity. Write ρi\rho_iρi​ for the indexed zero. Let

E={i∈I:ℜρi≠1/2},Z={s:ζ(s)=0, 0<ℜs<1, ℑs>0, ℜs≠1/2}.E=\{i\in I:\Re\rho_i\ne1/2\},\qquad Z=\{s:\zeta(s)=0,\ 0<\Re s<1,\ \Im s>0,\ \Re s\ne1/2\}.E={i∈I:ℜρi​=1/2},Z={s:ζ(s)=0, 0<ℜs<1, ℑs>0, ℜs=1/2}.

Then E is finite if and only if Z is finite; E is nonempty if and only if Z is nonempty; and E is infinite if and only if Z is infinite. This verifies that counting multiplicities does not change the finite/nonempty/infinite classification used in the two branches. It makes no assertion that E or Z is empty, finite, or infinite.

Preamble
import Mathlib
open MeasureTheory Set Filter Topology
open scoped BigOperators
Formal statement
theorem ActualXiBranchesPublished.offline_cardinality_correspondence :
    let f : ℂ → ℂ := (fun s : ℂ => (1+s*(s-1)*completedRiemannZeta₀ s)/2)
    let I : Type := (s : {z : ℂ // f z = 0 ∧ 0 < z.im}) × Fin (analyticOrderNatAt f s.val)
    let rho : I → ℂ := fun i => i.1.val
    let offI : Set I := {i | (rho i).re-1/2 ≠ 0}
    let offZ : Set ℂ := {s | riemannZeta s = 0 ∧ 0 < s.re ∧ s.re < 1 ∧
      0 < s.im ∧ s.re ≠ 1/2}
    (offI.Finite ↔ offZ.Finite) ∧ (offI.Nonempty ↔ offZ.Nonempty) ∧
    (offI.Infinite ↔ offZ.Infinite) := by sorry
Source
Desenvolvimento RH, Ricardo Marangoni Brandao Bueno, PF28 and Branches 2/3 continuation, 2026-11-16. Classical analytic ingredients and conditional integration; no RH proof or novelty 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