Vinogradov block estimate with coprimality (source Lemma 3.4, block form)
ProvedTaoFivePrimes.vinogradov_block_coprimeThe single-block Vinogradov estimate, with the coprimality hypothesis restored.
Let , let and , let be an integer coprime to , and let with . Then for every real and every integer ,
where denotes when the sine vanishes and otherwise.
This is the inequality to which the source's Lemma 3.4 reduces by subdivision: Tao's proof says "by subdivision of the interval it suffices to show that for all ; the claim then follows from [8, Lemma 1]". It is the block estimate, not the subdivided one, that carries the analytic content, and it is stated here on its own so that the subdivision step (a purely combinatorial covering argument, already formalised as TaoFivePrimes.vinogradov_lemma_if_form_from_block) is separated from it.
Why the coprimality hypothesis is needed. The platform's TaoFivePrimes.vinogradov_block_if_form was Disproved, and TaoFivePrimes.vinogradov_lemma_if_form is false, for the same reason: without the phase can be constant modulo . For , one has for every , so each of the terms of a block contributes while the right-hand side pays only . With the residues run through all of as runs over any consecutive integers, so the phase can vanish for at most one in the block; that single term is what the slot pays for.
Formalization note. The summand is written with an explicit if at the zeros of the sine rather than as a bare min: in Lean's real division is , so min A' (B/|sin|) would silently contribute at a vanishing phase, whereas the source's convention (and the mathematically correct value of the minimum there) is . The block is the integer interval , matching the shape that the subdivision lemma consumes. The variables are fixed first so that the statement can be used uniformly inside an induction over blocks.
import Mathlib open Finset
theorem TaoFivePrimes.vinogradov_block_coprime
(B : ℝ) (hB : 0 ≤ B) (q : ℕ) (hq : 0 < q)
(A' alpha' beta' theta' : ℝ) (a' : ℤ) (hA' : 0 ≤ A')
(ha'q : Nat.Coprime a'.natAbs q)
(halpha' : alpha' = (a' : ℝ) / q + beta') (hbeta' : |beta'| ≤ 1 / (q : ℝ) ^ 2)
(m : ℤ) :
(∑ n ∈ Finset.Ioc m (m + (q : ℤ)),
(if Real.sin (Real.pi * alpha' * (n : ℝ) + theta') = 0 then A'
else min A' (B / |Real.sin (Real.pi * alpha' * (n : ℝ) + theta')|)))
≤ 2 * A' + (2 / Real.pi) * B * (q : ℝ) * Real.log (4 * q) := by
sorry