Elementary Chebyshev bound for the sifted von Mangoldt weight:
ProvedTaoFivePrimes.sum_siftedVonMangoldt_le_log_fourchebyshevnumber-theoryprimorialsieve-methodsvon-mangoldt
With the von Mangoldt function sifted of all prime factors up to , as in Section 8 of the source,
Every explicit estimate of this kind in the source routes through the Rosser--Schoenfeld inequality , which rests on an explicit zero-free region together with a numerical verification. The bound above is the elementary alternative: it is weaker by a factor , but it is unconditional and rests only on Chebyshev's estimate for the primorial. It is therefore available wherever a crude upper bound on the sifted prime mass suffices.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RepresentationCount open TaoFivePrimes open scoped ArithmeticFunction.vonMangoldt
Formal statement
theorem TaoFivePrimes.sum_siftedVonMangoldt_le_log_four (N : ℕ) :
∑ n ∈ Finset.range (N + 1), TaoFivePrimes.siftedVonMangoldt N n ≤ (N : ℝ) * Real.log 4 := 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, https://arxiv.org/abs/1201.6656, Section 2 (Notation), the sifted von Mangoldt convention Λ_{q_0}(n) = Λ(n) 1_{(n,q_0)=1} with q_0 = (√x)^♯ taken as in Section 8; combined with the elementary Chebyshev bound n^♯ ≤ 4^n of P. Erdős, Beweis eines Satzes von Tschebyschef, Acta Sci. Math. (Szeged) 5 (1932), 194-198, as formalised in Mathlib as primorial_le_four_pow.