Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primitive nonprincipal prime-ramp windows at or below the verified line

Open
GRH.primitive_nonprincipal_corrected_prime_ramp_upper_windows_at_or_below_verified_line

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

dirichlet-l-functionsnumber-theoryriemann-hypothesis

Fix a modulus qge1qge 1qge1, a primitive nonprincipal Dirichlet character chimod q, and 1/2<hetale0.87495706981/2< hetale 0.87495706981/2<hetale0.8749570698. Let

G_chi(y)=sum_{1le nle y}Lambda(n)operatorname{Re}chi(n)(y/n-1)_+ + yoperatorname{Re} rac{L'(1,chi)}{L(1,chi)}.

There should be delta>0delta>0delta>0 and Cge0Cge0Cge0 such that for every Xge1Xge1Xge1 there exists YgeXYge XYgeX with

Gchi(y)leCyhetaqquad(YleyleY1+delta).G_chi(y)le Cy^ hetaqquad(Yle yle Y^{1+delta}).Gc​hi(y)leCyhetaqquad(YleyleY1+delta).

Only primitive nonprincipal characters are quantified here. A separate change-of-modulus estimate carries these windows to induced characters.

Preamble
import Mathlib

open Finset ArithmeticFunction Set
Formal statement
namespace GRH

theorem primitive_nonprincipal_corrected_prime_ramp_upper_windows_at_or_below_verified_line :
    ∀ (q : ℕ) [NeZero q] (χ : DirichletCharacter ℂ q), χ.IsPrimitive → χ ≠ 1 →
      ∀ θ : ℝ, 1/2 < θ → θ ≤ (0.8749570698:ℝ) → ∃ δ 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
Primitive-conductor restriction of https://prove2.me/theorems/edddccfa-3c07-4897-831f-46382957c69d.

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