Tao Corollary 3.9 — unconditional subdivision large sieve
ProvedTaoFivePrimes.large_sieve_subdivision_unconditionalcircle-methodlarge-sievenumber-theorytao-five-primes
For square-summable complex sequences on the integers, intervals , of length at least two, , and , suppose for every integer . Then
This discharges the uniform bilinear-sieve hypothesis in TaoFivePrimes.large_sieve_subdivision using the unconditional bilinear theorem. It preserves the original block-count constant and half-open interval convention. No bilinear 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_subdivision_unconditional (a b : ℤ → ℂ)
(ha : Summable (fun n : ℤ => ‖a n‖ ^ 2)) (hb : Summable (fun n : ℤ => ‖b n‖ ^ 2))
(alpha : ℝ) (xI yI xJ yJ M : ℝ)
(hI : 2 ≤ yI - xI) (hJ : 2 ≤ yJ - xJ) (hM : 1 ≤ M)
(delta : ℝ) (hdelta : 0 < delta)
(hd : ∀ j : ℤ, 1 ≤ j → (j : ℝ) ≤ M →
delta ≤ |(j : ℝ) * (4 * alpha) - round ((j : ℝ) * (4 * alpha))|)
:
‖∑ n ∈ (Finset.Ioc ⌊xI⌋ ⌊yI⌋).filter (fun n : ℤ => Odd n),
∑ m ∈ (Finset.Ioc ⌊xJ⌋ ⌊yJ⌋).filter (fun m : ℤ => Odd m),
a n * b m * TaoFivePrimes.eR (alpha * (n : ℝ) * (m : ℝ))‖
≤ Real.sqrt ((yI - xI) / 2 + 1 / delta)
* Real.sqrt ((⌊(yJ - xJ) / (2 * M)⌋₊ : ℝ) + 1)
* 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.9, 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.