Tao Corollary 3.7 — unconditional bilinear large sieve
ProvedTaoFivePrimes.large_sieve_bilinear_unconditionalcircle-methodlarge-sievenumber-theorytao-five-primes
For square-summable complex sequences on the integers, intervals and of length at least one, and with for every integer , the bilinear exponential sum satisfies
This removes the explicit unrestricted large-sieve hypothesis from TaoFivePrimes.large_sieve_bilinear. That unrestricted hypothesis is formally refuted on the platform. Here the spacing assumption at implies , so the proved corrected large sieve with suffices. No large-sieve estimate is assumed as a hypothesis.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_Explicit open scoped BigOperators open Finset
Formal statement
theorem TaoFivePrimes.large_sieve_bilinear_unconditional (a b : ℤ → ℂ)
(ha : Summable (fun n : ℤ => ‖a n‖ ^ 2)) (hb : Summable (fun n : ℤ => ‖b n‖ ^ 2))
(alpha : ℝ) (u1 v1 u2 v2 : ℝ) (hI : 1 ≤ v1 - u1) (hJ : 1 ≤ v2 - u2)
(delta : ℝ) (hdelta : 0 < delta)
(hd : ∀ j : ℤ, 1 ≤ j → (j : ℝ) ≤ v2 - u2 →
delta ≤ |(j : ℝ) * alpha - round ((j : ℝ) * alpha)|)
:
‖∑ n ∈ Finset.Ioc ⌊u1⌋ ⌊v1⌋, ∑ m ∈ Finset.Ioc ⌊u2⌋ ⌊v2⌋,
a n * b m * TaoFivePrimes.eR (alpha * (n : ℝ) * (m : ℝ))‖
≤ Real.sqrt ((v1 - u1) + 1 / delta)
* Real.sqrt (∑' n : ℤ, ‖a n‖ ^ 2) * Real.sqrt (∑' n : ℤ, ‖b n‖ ^ 2) := by sorrySource
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, arXiv:1201.6656v4, Corollary 3.7, pp. 14-15, https://arxiv.org/abs/1201.6656. Retains the platform half-open interval convention; discharges the previously explicit large-sieve/bilinear assumption using the proved spacing_le_one correction.