Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The prime orbit zero-shift overlap decays strictly faster than the scalar Euler sieve factor

Proved
MasulloRH.prime_orbit_overlap_relative_euler_scale

by Yi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryharmonic-analysistrace-formula

Fix 0<a≤10<a\le10<a≤1. For primes p≤Bp\le Bp≤B write rp=p−ar_p=p^{-a}rp​=p−a, EB=∏p≤B(1−rp)E_B=\prod_{p\le B}(1-r_p)EB​=∏p≤B​(1−rp​) and CB=∏p≤B1−rp1+rpC_B=\prod_{p\le B}\frac{1-r_p}{1+r_p}CB​=∏p≤B​1+rp​1−rp​​, with each ratio inside the product. The latter is the limiting zero-shift overlap of the normalized geometric box cutoff at fixed BBB. Then EB>0E_B>0EB​>0 and

CBEB=(∏p≤B(1+rp))−1⟶0.\frac{C_B}{E_B}=\left(\prod_{p\le B}(1+r_p)\right)^{-1}\longrightarrow 0.EB​CB​​=​p≤B∏​(1+rp​)​−1⟶0.

This compares the absolute geometric orbit mass with the finite scalar sieve normalization in the rational trace model.

Preamble
import Mathlib.NumberTheory.SumPrimeReciprocals
import Mathlib.Analysis.SpecialFunctions.Pow.NNReal
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.FieldSimp

open Filter Finset
open scoped Topology
Formal statement
theorem MasulloRH.prime_orbit_overlap_relative_euler_scale (a : ℝ) (ha : 0 < a) (ha' : a ≤ 1) :
    let P (B : ℕ) := (range (B+1)).filter Nat.Prime
    let r (p : ℕ) := (p : ℝ)^(-a)
    let C (B : ℕ) := ∏ p ∈ P B, (1-r p)/(1+r p)
    let E (B : ℕ) := ∏ p ∈ P B, (1-r p)
    (∀ B, 0 < E B ∧ C B / E B = (∏ p ∈ P B, (1+r p))⁻¹) ∧
    Tendsto (fun B => C B / E B) atTop (𝓝 0) := by sorry
Source
Companion to the accepted normalized orbit cutoff https://prove2.me/theorems/fa50948f-56da-4d20-8046-d2063aeeba8d and finite scalar sieve theorem https://prove2.me/theorems/c2c832e0-37f7-48a3-9a12-809625c31683. Uses Euler’s divergence of reciprocal primes.

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