Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

|∑_{N≤n≤2N} n^{iu}| ≪ N/|u| + |u|^{1/2} log(|u|+2) for |u| ≥ 1

Proved
GuthMaynard.norm_dyadic_sum_cpow_le

by dbenbenn · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

dirichlet-polynomialslarge-values

There is C>0C > 0C>0 such that for every integer N≥1N \ge 1N≥1 and every real uuu with ∣u∣≥1|u| \ge 1∣u∣≥1,

∣∑N≤n≤2Nniu∣≤C(N∣u∣+∣u∣1/2log⁡(∣u∣+2)).\Big|\sum_{N\le n\le 2N} n^{iu}\Big| \le C\Big(\frac{N}{|u|} + |u|^{1/2}\log(|u|+2)\Big).​N≤n≤2N∑​niu​≤C(∣u∣N​+∣u∣1/2log(∣u∣+2)).

This is the estimate used in the proof of Lemma 24 of B. Kerr, Large values of Dirichlet polynomials and zero density estimates for the Riemann zeta function, arXiv:1909.12075v1 (2019), https://arxiv.org/abs/1909.12075, p. 22: “For S2S_2S2​ we use the estimate

∑N⩽n⩽2Nnit≪Nt+t1/2(log⁡t),\sum_{N\leqslant n\leqslant 2N} n^{it} \ll \frac{N}{t} + t^{1/2}(\log t),N⩽n⩽2N∑​nit≪tN​+t1/2(logt),

valid for any N,t⩾1N, t \geqslant 1N,t⩾1, see for example [11, Equation 9.21]” ([11] is Iwaniec–Kowalski, Analytic Number Theory, AMS 2004).

Formalization note. The statement takes ∣u∣≥1|u| \ge 1∣u∣≥1 of either sign and log⁡(∣u∣+2)\log(|u|+2)log(∣u∣+2) in place of log⁡t\log tlogt, which vanishes at t=1t = 1t=1. In this package it is a step of the reduction of Guth–Maynard's Theorem 1.6 (GuthMaynard.heath_brown_large_values).

Preamble
import Mathlib
Formal statement
namespace GuthMaynard

theorem norm_dyadic_sum_cpow_le : ∃ C : ℝ, 0 < C ∧ ∀ N : ℕ, 1 ≤ N → ∀ u : ℝ, 1 ≤ |u| →
    ‖∑ n ∈ Finset.Icc N (2 * N), (n : ℂ) ^ ((u : ℂ) * Complex.I)‖ ≤
      C * (N / |u| + |u| ^ (1 / 2 : ℝ) * Real.log (|u| + 2)) := by
  sorry

end GuthMaynard
Source
Kerr, B., Large values of Dirichlet polynomials and zero density estimates for the Riemann zeta function, arXiv:1909.12075v1 (2019), https://arxiv.org/abs/1909.12075, p. 22, the estimate in the proof of Lemma 24, a step of the reduction of Guth–Maynard Theorem 1.6 (Heath-Brown) (arXiv:2405.20552v2, p. 4)

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