Proper prime-power contamination in the binary von Mangoldt convolution
ProvedGoldbach.vonMangoldt_proper_power_contamination_boundLet be the von Mangoldt function on natural numbers: it equals at a positive power of a prime , and is zero otherwise. For every natural number , put and , using the natural logarithm-to-base-two convention at .
The part of the ordered binary convolution contributed by pairs that are not both prime satisfies
This is an unconditional elementary finite-support estimate. It removes the proper-prime-power contribution when transferring analytic lower bounds for a von Mangoldt convolution to actual prime-pair counts. It supplies no lower bound for that convolution and does not prove strong Goldbach.
Formalization note: the square root and base-two logarithm are Nat.sqrt and Nat.log 2; the real logarithm at zero follows Mathlib's convention Real.log 0 = 0. The endpoint sum includes both and .
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Data.Nat.Sqrt import Mathlib.Algebra.BigOperators.Intervals open scoped BigOperators set_option autoImplicit false
theorem Goldbach.vonMangoldt_proper_power_contamination_bound (N : ℕ) :
(∑ m ∈ Finset.range (N+1),
if Nat.Prime m ∧ Nat.Prime (N-m) then (0:ℝ) else
ArithmeticFunction.vonMangoldt m * ArithmeticFunction.vonMangoldt (N-m)) ≤
2 * (Nat.sqrt N * Nat.log 2 N : ℕ) * (Real.log N)^2 := by sorry