Uniform binary von Mangoldt lower bound above the verified Goldbach range
OpenGoldbach.vonMangoldt_convolution_lower_bound_above_verified_rangebinary-correlationgoldbachnumber-theoryopen-problem
Let be the von Mangoldt function. For every even natural number , the proposed quantitative binary-correlation obligation is
This is an unproved sufficient analytic condition for the strong Goldbach mission, not an established estimate. The right-hand side bounds the contamination by pairs containing proper prime powers, so this strict estimate forces an actual prime pair. Together with the separately registered finite verification up to , it would imply the original conjecture. Its uniform quantifier is essential: an average estimate or a bound outside an exceptional set does not establish this obligation.
Preamble
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Data.Nat.Sqrt open scoped BigOperators set_option autoImplicit false
Formal statement
theorem Goldbach.vonMangoldt_convolution_lower_bound_above_verified_range
(N : ℕ) (hN : 4*10^18 < N) (he : Even N) :
2 * (Nat.sqrt N * Nat.log 2 N : ℕ) * (Real.log N)^2 <
∑ m ∈ Finset.range (N+1),
ArithmeticFunction.vonMangoldt m * ArithmeticFunction.vonMangoldt (N-m) := by sorrySource
Sufficient quantitative research obligation for https://prove2.me/missions/The_Goldbach_Conjecture, applying Goldbach.vonMangoldt_convolution_extract_prime_pair, https://prove2.me/theorems/83119b08-dc6a-47ea-b6ae-f7063d47a82f. This is proposed proof architecture, not a claimed literature theorem.