Off-diagonal symmetric von Mangoldt lower bound above
OpenWeakGoldbach.symmetric_vonMangoldt_off_diagonal_lower_bound_triple_above_2e18For every natural number greater than , the sum of the symmetric von Mangoldt products over offsets is at least times times the singular-series factor over odd prime divisors of :
Role: this isolates the off-diagonal contribution needed for WeakGoldbach.symmetric_vonMangoldt_lower_bound_with_diagonal_triple_above_2e18. Writing for the full sum (including ) one has , so an off-diagonal lower bound of upgrades immediately to
It is the exact analogue of WeakGoldbach.symmetric_vonMangoldt_off_diagonal_lower_bound_above_2e18 with coefficient in place of .
This is an open quantitative sufficient estimate at the stated finite threshold; it is not derived here from the full-sum margin or from the circle-method integral form, so that those nodes remain independent of this leaf.
import Mathlib
namespace WeakGoldbach
theorem symmetric_vonMangoldt_off_diagonal_lower_bound_triple_above_2e18
(m : Nat) (hm : 2 * 10 ^ 18 < m) :
(3 / 2 : Real) *
Finset.prod ((2 * m).primeFactors.filter (fun p => 2 < p))
(fun p => ((p : Real) - 1) / ((p : Real) - 2)) *
(m : Real)
<= Finset.sum ((Finset.range (m - 1)).erase 0)
(fun t => (ArithmeticFunction.vonMangoldt (m - t) : Real) *
(ArithmeticFunction.vonMangoldt (m + t) : Real)) := by
sorry
end WeakGoldbach