Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Complete prime contribution bounded by the termwise mass and overlap loss

Proved
ConnesGreen.prime_convolution_overlap_mass_bound

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

arithmetic-budgetconnes-weilprime-overlapsupport-continuity

Let ggg be an original smooth compact complex test supported in [−T,T][-T,T][−T,T], and set h=g∗g∗h=g*g^*h=g∗g∗ with g∗(t)=g(−t)‾g^*(t)=\overline{g(-t)}g∗(t)=g(−t)​. For the original finite active prime-power set ATA_TAT​ and physical mass and energy M(g),E(g)M(g),E(g)M(g),E(g), define

LT(g)=∑n∈AT2Λ(n)nmin⁡(M(g),2E(g)max⁡(2T−log⁡n,0)).L_T(g)=\sum_{n\in A_T}\frac{2\Lambda(n)}{\sqrt n}\min(M(g),2E(g)\max(2T-\log n,0)).LT​(g)=n∈AT​∑​n​2Λ(n)​min(M(g),2E(g)max(2T−logn,0)).

Then the COMPLETE original prime contribution satisfies

∣Prime⁡(h)∣≤LT(g).|\operatorname{Prime}(h)|\le L_T(g).∣Prime(h)∣≤LT​(g).

The choice between mass and energy is made separately at each prime power, retaining its actual support overlap. This does not assert positivity of the Weil form or RH.

Preamble
import Definitions.Def_ConnesGreen_prime_overlap_loss
set_option autoImplicit false
set_option maxHeartbeats 3000000
open Complex MeasureTheory ConnesRZ ConnesRZFrontier Set
open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology
noncomputable section
open WeilDefect WeilDefect.ConnesNative ConnesGreen
Formal statement
theorem ConnesGreen.prime_convolution_overlap_mass_bound (T : ℝ) (g : ℝ → ℂ)
    (hg : SupportedTest T g) :
    ‖primeSum (conv g (starInv g))‖ ≤ primeOverlapLoss T g := by sorry
Source
monocap-tech/weil, WeilDefect/Connes/PrimeOverlapMass.lean, exact declaration ConnesGreen.prime_convolution_overlap_mass_bound, compiling local source 495a9f34f25d1dbfbeb6ba8dce6d4735559ae878. Original arithmetic definitions, physical energy, actual prime powers and admissible test class retained.

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