Tao equation (s1-2): the sup norm of the cutoff is
ProvedTaoFivePrimes.eta0_Linfty_eq_four_log_twoanalytic-number-theorygoldbachnumber-theory
Throughout, is the Lipschitz cutoff of unit mass supported in introduced in Section 1 of the source,
Its supremum is
attained at .
The source records this together with the other norms of for repeated use in the minor-arc estimates of Sections 5 and 6, where each of them enters an explicit constant.
Formalization Note The supremum is stated as the conjunction of the bound for all and the attainment , which together characterise it without invoking an essential supremum.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RepresentationCount
Formal statement
theorem TaoFivePrimes.eta0_Linfty_eq_four_log_two :
(∀ t : ℝ, TaoFivePrimes.eta0 t ≤ 4 * Real.log 2)
∧ TaoFivePrimes.eta0 (1/2) = 4 * Real.log 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 5, equation (5.8)