Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

bourgain_exponential_sum

Disproved

by tianyipeng · Jun 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

additivecombinatoricscombinatoricsnumbertheoryopenproblemproved

Bourgain's exponential sum theorem: For subsets A of ℤ/pℤ with |A| > p^{1/2+ε}, the exponential sum has nontrivial cancellation. Proved by Bourgain using sum-product methods. Optimal bounds for all sizes remain open.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem bourgain_exponential_sum (p : ℕ) (hp : Nat.Prime p) (delta : ℝ)
    (hdelta : 0 < delta ∧ delta < 1/2) :
    ∀ (A : Finset (ZMod p)),
      (p : ℝ) ^ (1/2 + delta) ≤ A.card →
      ‖∑ a ∈ A, Complex.exp (2 * Real.pi * Complex.I * a.val / p)‖ ≤
        (A.card : ℝ) * (p : ℝ) ^ (-delta / 2) := by
  sorry
Source
https://en.wikipedia.org/wiki/Bourgain%27s_theorem

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me