Tao Corollary 3.8 — unconditional odd large sieve
ProvedTaoFivePrimes.large_sieve_odd_unconditionalcircle-methodlarge-sievenumber-theorytao-five-primes
For square-summable complex sequences on the integers and intervals , of length at least two, suppose and for every integer . Then
This discharges the uniform bilinear-sieve hypothesis in TaoFivePrimes.large_sieve_odd using the unconditional bilinear theorem. The sequence norms remain global square sums, and the exact half-open integer interval convention of the existing platform statement is retained.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_Explicit open scoped BigOperators open Finset
Formal statement
theorem TaoFivePrimes.large_sieve_odd_unconditional (a b : ℤ → ℂ)
(ha : Summable (fun n : ℤ => ‖a n‖ ^ 2)) (hb : Summable (fun n : ℤ => ‖b n‖ ^ 2))
(alpha : ℝ) (xI yI xJ yJ : ℝ) (hI : 2 ≤ yI - xI) (hJ : 2 ≤ yJ - xJ)
(delta : ℝ) (hdelta : 0 < delta)
(hd : ∀ j : ℤ, 1 ≤ j → (j : ℝ) ≤ (yJ - xJ) / 2 →
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 (∑' 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.8, 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.