Below the sifted von Mangoldt weight is supported on the primes
ProvedTaoFivePrimes.siftedVonMangoldt_prime_of_ne_zerochebyshevnumber-theorysieve-methodsvon-mangoldt
Fix a cutoff and let
be the von Mangoldt function with every prime factor up to sifted out, where is the primorial of , the product of all primes at most , and is the integer square root of . This is the weight attached to the prime sums of Section 8 of the source.
If and , then is prime.
In other words, below the cutoff the sifted weight sees no proper prime powers: sifting out the primes up to removes every with that is at most . This is what allows the sums of Section 8 to be read as sums over primes rather than over prime powers, so that a lower bound on the sifted mass produces genuine primes.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_RepresentationCount open TaoFivePrimes open scoped ArithmeticFunction.vonMangoldt
Formal statement
theorem TaoFivePrimes.siftedVonMangoldt_prime_of_ne_zero {N n : ℕ} (hn : n ≤ N)
(h : TaoFivePrimes.siftedVonMangoldt N n ≠ 0) : n.Prime := 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.