Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

∣∑x<Ne(xθ)∣≤min⁡ ⁣(N,12∥θ∥)\left|\sum_{x<N}e(x\theta)\right|\le\min\!\left(N,\frac{1}{2\|\theta\|}\right)​∑x<N​e(xθ)​≤min(N,2∥θ∥1​)

Proved
CircleMethod.norm_sum_e_le_min

by tabbott · Sep 1, 2026 · Mathlib c5ea003 (Lean v4.30.0)

analytic-number-theorycircle-methodexponential-sumsnumber-theory

The standard combined bound for a linear exponential sum: for θ∉Z\theta\notin\mathbb{Z}θ∈/Z,

∣∑x=0N−1e(xθ)∣  ≤  min⁡ ⁣(N,  12∥θ∥).\left|\sum_{x=0}^{N-1}e(x\theta)\right|\;\le\;\min\!\left(N,\;\frac{1}{2\|\theta\|}\right).​x=0∑N−1​e(xθ)​≤min(N,2∥θ∥1​).

The two branches govern the two regimes of the circle method. When θ\thetaθ lies on a major arc, ∥θ∥\|\theta\|∥θ∥ is small and the trivial bound NNN is the operative one, reflecting genuine constructive interference. When θ\thetaθ lies on a minor arc, ∥θ∥\|\theta\|∥θ∥ is bounded below and the second branch delivers the saving. Practically every application of the method invokes this inequality, usually followed by a summation over the possible values of ∥θ∥\|\theta\|∥θ∥.

Preamble
import Definitions.Def_CircleMethod_char
import Mathlib.Algebra.Field.GeomSum
open Finset
Formal statement
namespace CircleMethod

theorem norm_sum_e_le_min {θ : ℝ} (h : ¬ ∃ n : ℤ, θ = n) (N : ℕ) :
    ‖∑ x ∈ Finset.range N, e ((x : ℝ) * θ)‖ ≤ min (N : ℝ) (1 / (2 * nrm θ)) := by sorry

end CircleMethod
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 2, Section 2.1 (Lemma 2.1 and the surrounding elementary estimates for linear exponential sums), together with Chapter 1 for the notation e(x) = exp(2*pi*i*x) and ||x|| for the distance to the nearest integer.
Human review
  • Endorsed by tianyipeng · Sep 2, 2026

  • Endorsed by tabbott · Sep 2, 2026

    Confirmed by the mission captain (proposal self-audit).

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