Tao Lemma 4.4 (prime modulus): Montgomery's uncertainty principle
ProvedTaoFivePrimes.montgomery_uncertainty_primeanalytic-number-theoryexponential-sumsgoldbachnumber-theory
For a cutoff , a modulus , a scale and a frequency , write
where is the von Mangoldt function and .
Let be a prime dividing the sifting modulus , let , and let vanish on . Then
This is the case of Lemma 4.4, whose general form carries the factor .
The inequality says that the mass of a prime-supported exponential sum cannot concentrate at a single frequency: shifting by the nonzero fractions must recover a definite proportion of it. It is what drives the local estimate (Lemma 4.6) and hence Corollary 4.7, the large-sieve upper bound on the major arc. Its degenerate case is the anti-symmetry (4.6).
Formalization Note The inequality is stated in the cleared form , which avoids dividing by .
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_SmoothedExpSum
Formal statement
theorem TaoFivePrimes.montgomery_uncertainty_prime
(eta : ℝ → ℝ) (q p : ℕ) (hp : p.Prime) (hpq : p ∣ q) (x alpha : ℝ)
(hx : 1 ≤ x) (hsupp : ∀ t : ℝ, 1 < t → eta t = 0) :
‖TaoFivePrimes.smoothedExpSum eta q x alpha‖ ^ 2
≤ ((p : ℝ) - 1) * ∑ a ∈ Finset.Ico 1 p,
‖TaoFivePrimes.smoothedExpSum eta q x (alpha + (a : ℝ) / p)‖ ^ 2 := by sorrySource
Terence Tao, "Every odd number greater than 1 is the sum of at most five primes", Mathematics of Computation 83 (2014), 997-1038; arXiv:1201.6656, https://arxiv.org/abs/1201.6656, Section 4, Lemma 4.4 (Montgomery's uncertainty principle), the case of a prime modulus