Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Concrete xi-derived Q: finite and infinite branch contradictions under five explicit inputs

Proved
ActualXiBranchesPublished.concrete_xi_branches_from_five_inputs

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

canonical-productsconditional-branchesleanriemann-xi

Let I index the upper zeros of the concrete Riemann xi function with their exact analytic multiplicities. Put ρi=1/2+ϵi+iγi\rho_i=1/2+\epsilon_i+i\gamma_iρi​=1/2+ϵi​+iγi​, Bi=−(ρi−1/2)2B_i=-(\rho_i-1/2)^2Bi​=−(ρi​−1/2)2, G(x)=ℜξ(1/2+x)G(x)=\Re\xi(1/2+\sqrt{x})G(x)=ℜξ(1/2+x​), J(x)=log⁡G(x)−log⁡G(0)J(x)=\log G(x)-\log G(0)J(x)=logG(x)−logG(0), and

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

Assume five inputs: every γi≥2\gamma_i\ge2γi​≥2; γi≤1000\gamma_i\le1000γi​≤1000 implies ϵi=0\epsilon_i=0ϵi​=0; at least one γi≤100\gamma_i\le100γi​≤100; for every y≥1y\ge1y≥1, every finite set of indices with γi2≤y\gamma_i^2\le yγi2​≤y has size at most y3/4y^{3/4}y3/4; and

G(x)/G(0)=∏i∈I(1+x/Bi)(x>0).G(x)/G(0)=\prod_{i\in I}(1+x/B_i)\quad(x>0).G(x)/G(0)=i∈I∏​(1+x/Bi​)(x>0).

Then Qn(u)>0Q_n(u)>0Qn​(u)>0, hence Qn(u)≥0Q_n(u)\ge0Qn​(u)≥0, for every n≥1n\ge1n≥1 and u>0u>0u>0. Let N be the assertion that some such Q is negative, and let Z be the set of all nontrivial zeta zeros off the critical line (both half-planes). The finite branch concludes ¬(N∧Z finite and nonempty)\neg(N\land Z\text{ finite and nonempty})¬(N∧Z finite and nonempty); the infinite branch concludes ¬(N∧Z infinite)\neg(N\land Z\text{ infinite})¬(N∧Z infinite). The functions and zero index are concrete, and positivity of G and its normalizing constant are deduced, not assumed. The five inputs remain explicit proof obligations. These branch statements do not exclude off-line zeros in isolation and do not prove RH.

Preamble
import Mathlib
open MeasureTheory Set Filter Topology
open scoped BigOperators
Formal statement
theorem ActualXiBranchesPublished.concrete_xi_branches_from_five_inputs :
    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 gamma : I → ℝ := fun i => (rho i).im
    let eps : I → ℝ := fun i => (rho i).re-1/2
    let g : ℝ → ℝ := fun x => (f (1/2+(Real.sqrt x : ℂ))).re
    let q : ℕ → ℝ → ℝ := fun n u =>
      (2 : ℝ)^n*u^(2*n-1)*(-1 : ℝ)^(n-1)*
        iteratedDeriv n (fun x => Real.log (g x) - Real.log (g 0)) (u^2)
    let off : Set ℂ := {s | riemannZeta s = 0 ∧ 0 < s.re ∧ s.re < 1 ∧ s.re ≠ 1/2}
    (∀ i, 2 ≤ gamma i) →
    (∀ i, gamma i ≤ 1000 → eps i = 0) →
    (∃ i, gamma i ≤ 100) →
    (∀ y ≥ (1 : ℝ), ∀ F : Finset I,
      (∀ i ∈ F, (gamma i)^2 ≤ y) → (F.card : ℝ) ≤ y^((3 : ℝ)/4)) →
    (∀ x > 0, ((g x / g 0 : ℝ) : ℂ) = ∏' i, (1+(x : ℂ)/(-(rho i-1/2)^2))) →
    (¬ ((∃ n ≥ 1, ∃ u > 0, q n u < 0) ∧ off.Finite ∧ off.Nonempty)) ∧
    (¬ ((∃ n ≥ 1, ∃ u > 0, q n u < 0) ∧ off.Infinite)) ∧
    (∀ n ≥ 1, ∀ u > 0, 0 ≤ q n u) ∧
    (∀ n ≥ 1, ∀ u > 0, 0 < q n u) := 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