Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform lower bound for finite Euler products on corrected signed ordinates, across every real part

Proved
MasulloGRH.uniform_finite_euler_product_on_signed_ordinates

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

analytic-number-theoryeuler-producthecke-characters

For any finite family of real numbers qj>1q_j>1qj​>1, there is a constant c>0c>0c>0 depending only on that family. For every choice of unit phases zjz_jzj​, there is a nondecreasing sequence Tk∈[k,k+1]T_k\in[k,k+1]Tk​∈[k,k+1] over all integers, escaping in both directions and satisfying Tk≥0T_k\ge0Tk​≥0 for k≥0k\ge0k≥0 and Tk≤0T_k\le0Tk​≤0 for k<0k<0k<0, such that for every kkk and every real σ\sigmaσ the product ∏j∣1−zjqj−(σ+iTk)∣\prod_j|1-z_jq_j^{-(\sigma+iT_k)}|∏j​∣1−zj​qj−(σ+iTk​)​∣ is at least ccc. This applies to unramified finite Hecke Euler factors by taking qjq_jqj​ to be the prime ideal norms and zjz_jzj​ the unramified character values. The strict negative index condition leaves T0T_0T0​ free in [0,1][0,1][0,1].

Preamble
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.Log
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Data.Fintype.Pigeonhole
import Mathlib.Tactic.ByContra
import Mathlib.Tactic.Choose
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Instances.Int
import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset

open Finset Complex
Formal statement
theorem MasulloGRH.uniform_finite_euler_product_on_signed_ordinates {m : ℕ} (q : Fin m → ℝ) (hq : ∀ i, 1 < q i) :
    ∃ c : ℝ, 0 < c ∧ ∀ z : Fin m → ℂ, (∀ i, ‖z i‖ = 1) →
      ∃ T : ℤ → ℝ, (∀ k : ℤ, T k ∈ Set.Icc (k : ℝ) ((k : ℝ) + 1)) ∧
        (∀ k, 0 ≤ k → 0 ≤ T k) ∧ (∀ k, k < 0 → T k ≤ 0) ∧
        (∀ k, T k ≤ T (k+1)) ∧
        Filter.Tendsto (fun k => |T k|) Filter.cofinite Filter.atTop ∧
        ∀ k (σ : ℝ), c ≤ ∏ i, ‖1 - z i * (q i : ℂ) ^ (-((σ : ℂ) + (T k : ℂ) * Complex.I))‖ := by sorry
Source
Correction to Alessandro Maria Masullo, The Music of the Primes, 20 November 2026, Lemma 7.1.1.1 (7.1.1.3) and Proposition B.5.3.2 (B.5.3.3). Elementary finite sampling proof using the logarithms of the Euler norms.

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