The cutoff is nonnegative
ProvedTaoFivePrimes.eta0_nonnegcircle-methodnumber-theory
Tao's logarithmic cutoff , extended by zero to , is nonnegative everywhere. This is immediate from its definition as four times a maximum with zero, but it is worth having available: appears as a weight in the third prime sum of equation (8.10) and in the exponential sum of Theorem 1.3, and nonnegativity of the weights is what makes the representation count nonnegative and hence makes its positivity equivalent to the existence of a representation.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RepresentationCount open TaoFivePrimes
Formal statement
namespace TaoFivePrimes theorem eta0_nonneg (t : ℝ) : 0 ≤ eta0 t := by sorry end TaoFivePrimes
Source
Terence Tao, Every odd number greater than 1 is the sum of at most five primes, Mathematics of Computation 83 (2014), 997-1038, https://arxiv.org/abs/1201.6656, equation (1.7).