Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cofinal actual-quartet windows with all-accuracy finite selected certificates

Open
ConnesWeilArithmetic.cofinal_quartet_finite_certificates

by waitingintime · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

actual-zero-custodyarithmetic-lower-boundconnes-weilriemann-hypothesis

For every actual critical-strip zeta zero ρ and every real lower support threshold B, choose one positive radius T strictly greater than B. At that SAME T, for every positive accuracy δ there is a finite reflection-closed set F of actual zeros containing the original quartet of ρ, whose complete omitted positive-column squared-norm tail is strictly less than δ and whose original selected coefficient correction is nonnegative. The quartet and selected negative synthesis are unchanged as F varies; the regularized inverse and full-tail allowance use the same δ. T is chosen before δ. No RH, simple-zero, independent-column, positivity, or separation hypothesis is assumed. This is an unproved research goal, not a certified inequality. Its exact equivalence with Mathlib RH has been checked using the existing certified cofinal-window and finite-certificate reductions.

Preamble
import Definitions.Def_ConnesGreen_finite_selected_correction
import Definitions.Def_ConnesGreen_original_quartet
set_option autoImplicit false
open Complex ConnesRZ ConnesRZFrontier ConnesRZQuartet ConnesGreen
open WeilDefect WeilDefect.ConnesNative
open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology
noncomputable section
Formal statement
theorem ConnesWeilArithmetic.cofinal_quartet_finite_certificates :
    ∀ ρ : CriticalZeros, ∀ B : ℝ,
      ∃ T : ℝ, ∃ hT : 0 < T, B < T ∧
        ∀ δ : ℝ, 0 < δ → ∃ F : Finset CriticalZeros,
          quartet ρ ⊆ F ∧ (∀ τ ∈ F, reflectedZero τ ∈ F) ∧
          (∑' τ : {τ : CriticalZeros // τ ∉ F},
            ‖positiveGreenColumn (fun ζ => sourceEmbed T (actualGreenSource ζ)) τ.1‖ ^ 2) < δ ∧
          0 ≤ canonicalFiniteSelectedCorrection T hT (quartet ρ) F δ := by sorry
Source
Research target obtained by composing the exact right-hand sides of the certified Lean statements ConnesGreen.mathlib_RH_iff_cofinal_quartet_half_windows (https://prove2.me/theorems/244c2d57-a32e-4a29-be0d-1b044a6dc328) and ConnesGreen.canonical_picard_half_iff_finite_selected_certificates (https://prove2.me/theorems/c73d6d16-ea2f-4177-bee8-6604c46af5bb). No claim that the resulting lower bound is proved in Connes 1999 or in the repository. Literature/source audit addendum (COR-22): An independent Lean audit composes ConnesGreen.mathlib_RH_iff_cofinal_quartet_half_windows and ConnesGreen.canonical_picard_half_iff_finite_selected_certificates to verify equivalence between this exact research goal and Mathlib RiemannHypothesis. The research goal remains unproved. The window T must be chosen before every positive delta; the selected quartet stays fixed, and the same delta is used for full positive-tail control and the selected correction. Arithmetic transfer checkpoint: monocap-tech/provenance 178c83225b2300506ff622899d08ec3c987137d5, rh/checkpoints/RH_ZERO_PROV_2_EULER_WEIL_MARKER_TRANSFER_20260920.md, SHA256 0bb48b950f09220f7b2f193c16b45b15add0333906f919f8b50ca915f77a1a0d. Exact checkpoint bytes were verified in retained local Git; public availability has not been checked.
Read-back

What the Lean code literally says, in plain math · GPT-6

For every complex number ρ\rhoρ with ζ(ρ)=0\zeta(\rho)=0ζ(ρ)=0 and 0<Re⁡ρ<10<\operatorname{Re}\rho<10<Reρ<1, and for every real number BBB, there exist a real number TTT and a witness of T>0T>0T>0 such that B<TB<TB<T and the following holds for every real δ>0\delta>0δ>0: there exists a finite subset FFF of Z={z∈C:ζ(z)=0, 0<Re⁡z<1}Z=\{z\in\mathbb C:\zeta(z)=0,\ 0<\operatorname{Re}z<1\}Z={z∈C:ζ(z)=0, 0<Rez<1} satisfying Qρ⊆FQ_\rho\subseteq FQρ​⊆F, r(F)⊆Fr(F)\subseteq Fr(F)⊆F, ∑τ∈Z∖F∥pT,τ∥2<δ\sum_{\tau\in Z\setminus F}\|p_{T,\tau}\|^2<\delta∑τ∈Z∖F​∥pT,τ​∥2<δ, and CT,Qρ,F,δ≥0C_{T,Q_\rho,F,\delta}\geq0CT,Qρ​,F,δ​≥0. Here r(z)=1−z‾r(z)=1-\overline zr(z)=1−z is reflection, Qρ={ρ,ρ‾,1−ρ‾,1−ρ}Q_\rho=\{\rho,\overline\rho,1-\overline\rho,1-\rho\}Qρ​={ρ,ρ​,1−ρ​,1−ρ} is a finite set with repeated values removed, and every index denotes a distinct zero value together with its strip-and-zero property, rather than a separate index for each occurrence of its multiplicity. The finite set FFF need only be closed under rrr, not under conjugation; it contains the whole quartet. To define all the columns and the operator in this assertion, let μT\mu_TμT​ be Lebesgue measure restricted to [−T,T][-T,T][−T,T], let LT=L2(μT;C)L_T=L^2(\mu_T;\mathbb C)LT​=L2(μT​;C), and give AT=LT⊕LTA_T=L_T\oplus L_TAT​=LT​⊕LT​ its usual Hilbert direct-sum norm. For any function f:R→Cf:\mathbb R\to\mathbb Cf:R→C, write [f]T[f]_T[f]T​ for its L2L^2L2 equivalence class if it is almost everywhere strongly measurable and has finite L2L^2L2 seminorm with respect to μT\mu_TμT​, and for the zero vector otherwise. Define ET(g)=([g′]T,12[g]T)E_T(g)=([g']_T,\tfrac12[g]_T)ET​(g)=([g′]T​,21​[g]T​), where the derivative is the total derivative used in the definitions, and let HTH_THT​ be the closure in ATA_TAT​ of the complex linear span of all ET(g)E_T(g)ET​(g) for smooth, compactly supported g:R→Cg:\mathbb R\to\mathbb Cg:R→C whose topological support is contained in the open interval (−T,T)(-T,T)(−T,T). This closed subspace, with the inner product inherited from ATA_TAT​, is the physical carrier of every column below. Let ΠT:AT→HT\Pi_T:A_T\to H_TΠT​:AT​→HT​ be the orthogonal projection and let eT,z=ΠT(0,2[fz]T)e_{T,z}=\Pi_T(0,2[f_z]_T)eT,z​=ΠT​(0,2[fz​]T​), where fz(x)=exp⁡(x(z‾−12))f_z(x)=\exp(x(\overline z-\tfrac12))fz​(x)=exp(x(z−21​)). This source is exactly the one obtained in the definitions by setting γz=−i(r(z)−12)\gamma_z=-i(r(z)-\tfrac12)γz​=−i(r(z)−21​) and using exp⁡(x(−iγz))\exp(x(-i\gamma_z))exp(x(−iγz​)). Write m(z)=analyticOrderNatAt⁡(ζ,z)m(z)=\operatorname{analyticOrderNatAt}(\zeta,z)m(z)=analyticOrderNatAt(ζ,z) for the natural-number vanishing order, which is the natural-number conversion of the extended analytic order (its total definition returns zero for infinite order or failure of analyticity), and put wT,z=m(z) eT,zw_{T,z}=\sqrt{m(z)}\,e_{T,z}wT,z​=m(z)​eT,z​, with the real square root acting as a complex scalar. The positive and negative pair columns are exactly pT,z=12(wT,z+wT,r(z))p_{T,z}=\tfrac12(w_{T,z}+w_{T,r(z)})pT,z​=21​(wT,z​+wT,r(z)​) and nT,z=12(wT,z−wT,r(z))n_{T,z}=\tfrac12(w_{T,z}-w_{T,r(z)})nT,z​=21​(wT,z​−wT,r(z)​) in HTH_THT​. For any finite set J⊆ZJ\subseteq ZJ⊆Z, let KJ=ℓ2(J;C)K_J=\ell^2(J;\mathbb C)KJ​=ℓ2(J;C) with its ordinary coefficient inner product, one coordinate for each zero value in JJJ; define PT,F:KF→HTP_{T,F}:K_F\to H_TPT,F​:KF​→HT​ by PT,Fa=∑z∈FazpT,zP_{T,F}a=\sum_{z\in F}a_zp_{T,z}PT,F​a=∑z∈F​az​pT,z​ and NT,Qρ:KQρ→HTN_{T,Q_\rho}:K_{Q_\rho}\to H_TNT,Qρ​​:KQρ​​→HT​ by NT,Qρb=∑z∈QρbznT,zN_{T,Q_\rho}b=\sum_{z\in Q_\rho}b_zn_{T,z}NT,Qρ​​b=∑z∈Qρ​​bz​nT,z​. With Hilbert-space adjoints taken using these coefficient and physical inner products, the asserted correction is the bounded complex-linear endomorphism of KQρK_{Q_\rho}KQρ​​

CT,Qρ,F,δ=δIKQρ−NT,Qρ∗NT,Qρ+(PT,F∗NT,Qρ)∗Inv⁡(PT,F∗PT,F+δIKF)(PT,F∗NT,Qρ),C_{T,Q_\rho,F,\delta} =\delta I_{K_{Q_\rho}}-N_{T,Q_\rho}^{*}N_{T,Q_\rho} +(P_{T,F}^{*}N_{T,Q_\rho})^{*} \operatorname{Inv}(P_{T,F}^{*}P_{T,F}+\delta I_{K_F}) (P_{T,F}^{*}N_{T,Q_\rho}),CT,Qρ​,F,δ​=δIKQρ​​​−NT,Qρ​∗​NT,Qρ​​+(PT,F∗​NT,Qρ​​)∗Inv(PT,F∗​PT,F​+δIKF​​)(PT,F∗​NT,Qρ​​),

where Inv⁡\operatorname{Inv}Inv is the ring inverse, equal to the two-sided inverse when its argument is a unit and zero otherwise; in the finite coefficient space displayed here, δ>0\delta>0δ>0 makes PT,F∗PT,F+δIP_{T,F}^{*}P_{T,F}+\delta IPT,F∗​PT,F​+δI invertible. The inequality C≥0C\geq0C≥0 means that CCC is self-adjoint and Re⁡⟨Cb,b⟩≥0\operatorname{Re}\langle Cb,b\rangle\geq0Re⟨Cb,b⟩≥0 for every b∈KQρb\in K_{Q_\rho}b∈KQρ​​, including zero. The tail sum uses all zero values outside FFF, their physical column norms, and no extra multiplicity factor beyond the square-root weights already in the columns; the definitions establish summability of these squared norms for positive TTT, so it is the usual convergent sum. The single TTT may depend on ρ\rhoρ and BBB but is chosen before δ\deltaδ and works for every positive δ\deltaδ; FFF may depend on all of ρ,B,T,δ\rho,B,T,\deltaρ,B,T,δ, with no nesting or monotonicity requirement and no upper bound on its size. No assumption places ρ\rhoρ off the line Re⁡ρ=12\operatorname{Re}\rho=\tfrac12Reρ=21​, assumes a simple zero, or requires a nonzero imaginary part: coincidences within the quartet are permitted, a reflection-fixed zero has nT,z=0n_{T,z}=0nT,z​=0, and linearly dependent or zero columns retain their original coefficient coordinates. The quartet always contains ρ\rhoρ, hence QρQ_\rhoQρ​ and the required FFF are nonempty, although the tail index set can be empty, in which case its sum is zero. There is no assertion at T≤0T\leq0T≤0 or δ≤0\delta\leq0δ≤0, and the universal clause over ρ\rhoρ would be vacuous if ZZZ were empty.

Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by waitingintime · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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