Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cofinal upper windows for nonprincipal Dirichlet prime ramps

Open
GRH.nonprincipal_corrected_prime_ramp_upper_windows

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

dirichlet-l-functionsnumber-theoryriemann-hypothesis

Fix a modulus q≥1q\ge1q≥1, a nonprincipal Dirichlet character χ mod q\chi\bmod qχmodq, and a real number 1/2<θ<11/2<\theta<11/2<θ<1. Define the corrected real prime ramp by

Gχ(y)=∑1≤n≤yΛ(n)Re⁡χ(n) (y/n−1)++yRe⁡L′(1,χ)L(1,χ).G_\chi(y)=\sum_{1\le n\le y}\Lambda(n)\operatorname{Re}\chi(n)\,(y/n-1)_+ + y\operatorname{Re}\frac{L'(1,\chi)}{L(1,\chi)}.Gχ​(y)=1≤n≤y∑​Λ(n)Reχ(n)(y/n−1)+​+yReL(1,χ)L′(1,χ)​.

The proposed estimate asserts that there are δ>0\delta>0δ>0 and C≥0C\ge0C≥0 such that every X≥1X\ge1X≥1 admits Y≥XY\ge XY≥X with Gχ(y)≤CyθG_\chi(y)\le Cy^\thetaGχ​(y)≤Cyθ for every y∈[Y,Y1+δ]y\in[Y,Y^{1+\delta}]y∈[Y,Y1+δ]. The correction removes the pole at s=1s=1s=1 in the ramp transform. Only an upper bound on these relative windows is required. This is the nonprincipal singleton specialization of Alpöge’s corrected family ramp, used as the arithmetic input for a primitive Dirichlet critical-line reduction.

Preamble
import Mathlib

open Finset ArithmeticFunction Set
Formal statement
namespace GRH

theorem nonprincipal_corrected_prime_ramp_upper_windows :
    ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q), χ ≠ 1 →
      ∀ θ : ℝ, 1/2 < θ → θ < 1 → ∃ δ C : ℝ, 0 < δ ∧ 0 ≤ C ∧
        ∀ X : ℝ, 1 ≤ X → ∃ Y : ℝ, X ≤ Y ∧ ∀ y ∈ Icc Y (Y^(1+δ)),
          (∑ n ∈ range (⌊y⌋₊+1), vonMangoldt n * (χ (n:ZMod q)).re * max (y/(n:ℝ)-1) 0) +
              y * (deriv χ.LFunction 1 / χ.LFunction 1).re ≤ C*y^θ := by sorry

end GRH
Source
Levent Alpöge, 20 November 2026, https://alpo.ge/remark.pdf; released module Development.AutomorphicArithmetic.DedekindLFunctions.CharFamily, `Gchi`; analytic upper-window criterion in LandauTheorems.ZeroFreeOfRpowWindow.

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