Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Extended-region error bound for an unramified local Euler factor

Proved
OAI.SevenEighths.QRHEulerRegion.unramifiedClosed_second_region_bound

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

analytic-number-theorydirichlet-l-functionseuler-factorsquasi-riemann-hypothesis

For a real local norm Q≥4Q\ge 4Q≥4 and complex amplitudes A,η,vA,\eta,vA,η,v of modulus at most one, assume ℜx≥87/100\Re x\ge 87/100ℜx≥87/100, ℜw≥19/20\Re w\ge 19/20ℜw≥19/20, and ℜz≥33/200\Re z\ge 33/200ℜz≥33/200. Put

V=Q−6z,R=AQ4−6x−6z,W=vQ−w,D=ηv‾Q−x,K=η(Q−1)Q−x−w.V=Q^{-6z},\quad R=AQ^{4-6x-6z},\quad W=vQ^{-w},\quad D=\eta\overline vQ^{-x},\quad K=\eta(Q-1)Q^{-x-w}.V=Q−6z,R=AQ4−6x−6z,W=vQ−w,D=ηvQ−x,K=η(Q−1)Q−x−w.

The continued unramified local factor in the ProofCouncil detector construction differs from 111 in modulus by at most 240Q−181/100240Q^{-181/100}240Q−181/100. This estimates one detector factor. The global nonvanishing argument also requires bounds on the other factors and their product.

Preamble
import Definitions.Def_OAI_NumberTheory_DirichletL_Detector_Euler
import Definitions.Def_OAI_NumberTheory_DirichletL_Detector_Local
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Analysis.SpecialFunctions.Pow.Real
Formal statement
theorem OAI.SevenEighths.QRHEulerRegion.unramifiedClosed_second_region_bound (Q : ℝ) (A eta v x w z : ℂ)
    (hQ : 4 ≤ Q) (hA : ‖A‖ ≤ 1) (heta : ‖eta‖ ≤ 1) (hv : ‖v‖ ≤ 1)
    (hx : (87/100:ℝ) ≤ x.re) (hw : (19/20:ℝ) ≤ w.re) (hz : (33/200:ℝ) ≤ z.re) :
    let V : ℂ := (Q : ℂ) ^ (-6 * z)
    let R : ℂ := A * (Q : ℂ) ^ (4 - 6*x - 6*z)
    let W : ℂ := v * (Q : ℂ) ^ (-w)
    let D : ℂ := eta * star v * (Q : ℂ) ^ (-x)
    let K : ℂ := eta * (Q - 1) * (Q : ℂ) ^ (-x - w)
    ‖OAI.SevenEighths.ProbeLocal.continuedCorrection V W D
      (OAI.SevenEighths.ProbeEuler.markedFactor R V (Q : ℂ)⁻¹ K (-D + W*R) 1) - 1‖ ≤
      240 * Q ^ (-(181/100 : ℝ)) := by sorry
Source
Tim Gehrunger · ProofCouncil (project credit), adapting the OpenAI/math seven-eighths development, commit fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb. Apache-2.0; this port consolidates the coordinate lemmas, uses the existing Prove2Me factor definitions and estimates, and expands the auxiliary coordinates in the statement. https://github.com/GTimG/QuasiRiemannTracker/blob/a0a0212/submissions/2026-10-09-proofcouncil/src/Submissions/proofcouncil_20261009/QRH/Detector/ExtendedEulerRegion.lean#L11-L71

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