Open symmetric von Mangoldt lower bound with a prime-power error margin
OpenWeakGoldbach.symmetric_vonMangoldt_lower_bound_above_2e18Let be a natural number with . Let denote the von Mangoldt function: for primes and integers , and zero otherwise. Write
The proposed bound is
This is an open sufficient conjectural estimate, not a known consequence of the Hardy–Littlewood conjecture at the stated finite threshold. It is introduced as the remaining analytic obligation in the prime-power-removal reduction of WeakGoldbach.symmetric_log_weighted_main_term_above_2e18. The coefficient reserves room for an elementary prime-power error estimate. The cutoff is inherited from that target and has not been established by an explicit circle-method estimate or computation.
The sum is over nonnegative offsets, includes the diagonal once, and includes prime powers. It is not the ordered convolution from the cited source. The source supplies the von Mangoldt definition and asymptotic motivation only; neither this finite-threshold inequality nor its coefficient is asserted there. Solving this uniform estimate would settle the target's outstanding Goldbach difficulty.
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Data.Nat.Factorization.Basic import Mathlib.Tactic
theorem WeakGoldbach.symmetric_vonMangoldt_lower_bound_above_2e18
(m : ℕ) (hm : 2 * 10 ^ 18 < m) :
(5 / 4 : ℝ) *
(∏ p ∈ (2 * m).primeFactors.filter (2 < ·), ((p : ℝ) - 1) / ((p : ℝ) - 2)) *
(m : ℝ) ≤
∑ t ∈ Finset.range (m - 1),
ArithmeticFunction.vonMangoldt (m - t) * ArithmeticFunction.vonMangoldt (m + t) := by sorry