Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

RG-0 — canonical actual-zero Green realization and bounded synthesis

Proved
ConnesGreen.canonical_Green_realization_and_synthesis

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

actual-zeta-zerosconnes-weildirichlet-greenhilbert-space

For every positive radius ttt, use the specified closed energy-image completion HtH_tHt​ and its fixed Riesz source map. Prove dense source-lift range; square integrability, membership and exact source/Green energy-vector identification for every actual critical-strip zeta zero; the original source norm and supported LgLgLg Green pairing identities; and full multiplicity-weighted energy summability with bounded actual-zero synthesis, summable vector series, exact basis columns, exact adjoint coordinates and energy, the quantitative operator bound and uniqueness. No physical norm or pairing identity, column summability, RH, positivity or separation statement is assumed. The goal concerns the chosen window carrier, not a common carrier for all windows or a prescribed-window negative witness.

Preamble
import Definitions.Def_ConnesGreen_canonical_model
open scoped BigOperators InnerProductSpace lp ENNReal Classical
Formal statement
theorem ConnesGreen.canonical_Green_realization_and_synthesis (t : ℝ) (ht : 0 < t) : DenseRange (ConnesGreen.sourceLift t) ∧ ConnesGreen.ColumnRealization t ∧ ConnesGreen.TestPairing t ∧ ConnesGreen.RawSynthesis t := by sorry
Source
Canonical Green mission specification RG-0 through RG-5, supplied in the proposal definition bundle and target statements. Original native formulas: monocap-tech/weil b019d40205680f9761a4b0a80cbcad56ee1b606b, WeilDefect/DirichletResolvent.lean, DirichletEnergy.lean and ProblemOneIndependence.lean. Hilbert/Dirichlet background: Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations (Springer 2011), https://doi.org/10.1007/978-0-387-70914-7. The canonical aggregate target is the explicit repository specification, not a quotation from the book or a claim of RH.
Read-back

What the Lean code literally says, in plain math · GPT-6 / Codex (independent blind sub-agent)

For real t>0t>0t>0, let Z={ρ∈C:ζ(ρ)=0, 0<Re⁡ρ<1}Z=\{\rho\in\mathbb C:\zeta(\rho)=0,\ 0<\operatorname{Re}\rho<1\}Z={ρ∈C:ζ(ρ)=0, 0<Reρ<1}, with no requirement that Re⁡ρ=1/2\operatorname{Re}\rho=1/2Reρ=1/2, and put mρ=analyticOrderNatAt⁡(ζ,ρ)∈Nm_\rho=\operatorname{analyticOrderNatAt}(\zeta,\rho)\in\mathbb Nmρ​=analyticOrderNatAt(ζ,ρ)∈N. A supported test is a complex-valued C∞C^\inftyC∞ function on R\mathbb RR with compact topological support contained in (−t,t)(-t,t)(−t,t). Let Ht=L2([−t,t],dx;C)H_t=L^2([-t,t],dx;\mathbb C)Ht​=L2([−t,t],dx;C), let [f]t[f]_t[f]t​ be the almost-everywhere equivalence class of fff when fff is square integrable for restricted Lebesgue measure, and set [f]t=0[f]_t=0[f]t​=0 otherwise. In the complex Hilbert direct sum At=Ht⊕2HtA_t=H_t\oplus_2H_tAt​=Ht​⊕2​Ht​, set Et(f)=([f′]t,12[f]t)E_t(f)=([f']_t,\tfrac12[f]_t)Et​(f)=([f′]t​,21​[f]t​) and let PtP_tPt​ be the closed complex linear span of Et(g)E_t(g)Et​(g) over all supported tests. Define Λt(f)=proj⁡Pt(0,2f)\Lambda_t(f)=\operatorname{proj}_{P_t}(0,2f)Λt​(f)=projPt​​(0,2f) for f∈Htf\in H_tf∈Ht​ and Bt(f)=Λt([f]t)B_t(f)=\Lambda_t([f]_t)Bt​(f)=Λt​([f]t​) for arbitrary functions. Put γρ=−i(12−ρ‾)\gamma_\rho=-i(\tfrac12-\overline\rho)γρ​=−i(21​−ρ​), aρ(x)=e−ixγρ=ex(ρ‾−1/2)a_\rho(x)=e^{-ix\gamma_\rho}=e^{x(\overline\rho-1/2)}aρ​(x)=e−ixγρ​=ex(ρ​−1/2), qρ=(14+γρ2)−1q_\rho=(\tfrac14+\gamma_\rho^2)^{-1}qρ​=(41​+γρ2​)−1, and vρ(x)=qρe−ixγρ−qρe−itγρsinh⁡((t+x)/2)/sinh⁡t−qρeitγρsinh⁡((t−x)/2)/sinh⁡tv_\rho(x)=q_\rho e^{-ix\gamma_\rho}-q_\rho e^{-it\gamma_\rho}\sinh((t+x)/2)/\sinh t-q_\rho e^{it\gamma_\rho}\sinh((t-x)/2)/\sinh tvρ​(x)=qρ​e−ixγρ​−qρ​e−itγρ​sinh((t+x)/2)/sinht−qρ​eitγρ​sinh((t−x)/2)/sinht. Set Jρ=∫−tt(∣vρ′(x)∣2+14∣vρ(x)∣2) dxJ_\rho=\int_{-t}^{t}(|v'_\rho(x)|^2+\tfrac14|v_\rho(x)|^2)\,dxJρ​=∫−tt​(∣vρ′​(x)∣2+41​∣vρ​(x)∣2)dx, cρ=mρ Bt(aρ)∈Ptc_\rho=\sqrt{m_\rho}\,B_t(a_\rho)\in P_tcρ​=mρ​​Bt​(aρ​)∈Pt​, wρ=mρJρw_\rho=m_\rho J_\rhowρ​=mρ​Jρ​, and Lg=−g′′+14gLg=-g''+\tfrac14gLg=−g′′+41​g. All four following assertions hold together: the map Λt:Ht→Pt\Lambda_t:H_t\to P_tΛt​:Ht​→Pt​ has dense range (its range closure is PtP_tPt​), For every ρ∈Z\rho\in Zρ∈Z, aρa_\rhoaρ​, vρv_\rhovρ​, and vρ′v'_\rhovρ′​ belong to L2([−t,t],dx)L^2([-t,t],dx)L2([−t,t],dx), Et(vρ)∈PtE_t(v_\rho)\in P_tEt​(vρ​)∈Pt​, Bt(aρ)B_t(a_\rho)Bt​(aρ​) viewed in AtA_tAt​ equals Et(vρ)E_t(v_\rho)Et​(vρ​), and ∥Bt(aρ)∥2=Jρ\|B_t(a_\rho)\|^2=J_\rho∥Bt​(aρ​)∥2=Jρ​. The source and column L2L^2L2 assertions remove the fallback for those classes. For every supported test ggg, both ggg and g′g'g′ belong to L2([−t,t],dx)L^2([-t,t],dx)L2([−t,t],dx) and LgLgLg belongs to this space; for every ρ∈Z\rho\in Zρ∈Z, the function x↦vρ(x)‾Lg(x)x\mapsto\overline{v_\rho(x)}Lg(x)x↦vρ​(x)​Lg(x) is interval-integrable with respect to Lebesgue measure from −t-t−t to ttt, and ⟨Bt(aρ),Bt(Lg)⟩=∫−ttvρ(x)‾Lg(x) dx\langle B_t(a_\rho),B_t(Lg)\rangle=\int_{-t}^{t}\overline{v_\rho(x)}Lg(x)\,dx⟨Bt​(aρ​),Bt​(Lg)⟩=∫−tt​vρ​(x)​Lg(x)dx. Interval integrability here requires integrability on the interval between these endpoints, equivalently on (−t,t](-t,t](−t,t] up to the null endpoints. The product integral therefore has an integrability assertion rather than relying on the nonintegrable fallback. The zero supported test is included. The real family (wρ)ρ∈Z(w_\rho)_{\rho\in Z}(wρ​)ρ∈Z​ is summable, and there exists a continuous complex linear map S:ℓ2(Z;C)→PtS:\ell^2(Z;\mathbb C)\to P_tS:ℓ2(Z;C)→Pt​ with all of these properties: for every u∈ℓ2(Z;C)u\in\ell^2(Z;\mathbb C)u∈ℓ2(Z;C), the PtP_tPt​-valued family (uρcρ)ρ∈Z(u_\rho c_\rho)_{\rho\in Z}(uρ​cρ​)ρ∈Z​ is summable and Su=∑ρ∈ZuρcρSu=\sum_{\rho\in Z}u_\rho c_\rhoSu=∑ρ∈Z​uρ​cρ​; for every ρ∈Z\rho\in Zρ∈Z, Seρ=cρSe_\rho=c_\rhoSeρ​=cρ​, where eρe_\rhoeρ​ has value one at ρ\rhoρ and zero at every other index; for every h∈Pth\in P_th∈Pt​ and ρ∈Z\rho\in Zρ∈Z, (S∗h)ρ=⟨cρ,h⟩(S^*h)_\rho=\langle c_\rho,h\rangle(S∗h)ρ​=⟨cρ​,h⟩; for every h∈Pth\in P_th∈Pt​, ∥S∗h∥2=∑ρ∈Z∣⟨cρ,h⟩∣2\|S^*h\|^2=\sum_{\rho\in Z}|\langle c_\rho,h\rangle|^2∥S∗h∥2=∑ρ∈Z​∣⟨cρ​,h⟩∣2; and ∥S∥2≤∑ρ∈Zwρ\|S\|^2\le\sum_{\rho\in Z}w_\rho∥S∥2≤∑ρ∈Z​wρ​. Finally, for every continuous complex linear map T:ℓ2(Z;C)→PtT:\ell^2(Z;\mathbb C)\to P_tT:ℓ2(Z;C)→Pt​, if Teρ=cρTe_\rho=c_\rhoTeρ​=cρ​ for all ρ∈Z\rho\in Zρ∈Z, then T=ST=ST=S. Summability is convergence of the net of finite partial sums over the whole index type, without prescribing an enumeration. In particular the displayed coefficient-vector sums have explicit summability assertions. The square-root factor is the nonnegative real square root embedded in C\mathbb CC, and there is no other column normalization. The density assertion does not assert surjectivity. If ZZZ is empty, the per-zero column and pairing clauses are vacuous, the energy family is empty, and the synthesis domain is zero-dimensional; density and supported-test membership still concern PtP_tPt​ and all supported tests. All inner products are complex and conjugate-linear in the first argument; norms of linear maps are operator norms. The derivatives are total real derivatives, using zero where the relevant derivative does not exist, and integrals and infinite sums are total, using zero when integrability or summability fails. The L2L^2L2 assignment has its stated zero fallback. Multiplicity is a natural analytic order, with no separate positivity hypothesis, so zero multiplicity gives zero raw column and weighted energy. The definition of inverse sends zero to zero, but γρ=±i/2\gamma_\rho=\pm i/2γρ​=±i/2 would force ρ=0\rho=0ρ=0 or ρ=1\rho=1ρ=1 and is excluded by the strict critical-strip inequalities; t>0t>0t>0 likewise excludes sinh⁡t=0\sinh t=0sinht=0. Empty-index families and zero subspaces are permitted by the quantified forms, and t≤0t\le0t≤0 is excluded by each theorem.

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

    Confirmed by the moderator at approval.

  • Endorsed by waitingintime · Oct 7, 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