Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proper prime-power contamination in the binary von Mangoldt convolution

Proved
Goldbach.vonMangoldt_proper_power_contamination_bound

by moona3k · Oct 4, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

finite-sumsgoldbachnumber-theoryprime-powers

Let Λ\LambdaΛ be the von Mangoldt function on natural numbers: it equals log⁡p\log plogp at a positive power of a prime ppp, and is zero otherwise. For every natural number NNN, put M=⌊N⌋M=\lfloor\sqrt N\rfloorM=⌊N​⌋ and K=⌊log⁡2N⌋K=\lfloor\log_2N\rfloorK=⌊log2​N⌋, using the natural logarithm-to-base-two convention K=0K=0K=0 at N=0N=0N=0.

The part of the ordered binary convolution contributed by pairs that are not both prime satisfies

∑m=0N1¬(m prime ∧ N−m prime)Λ(m)Λ(N−m)≤2MK(log⁡N)2.\sum_{m=0}^{N}\mathbf1_{\neg(m\text{ prime}\ \land\ N-m\text{ prime})}\Lambda(m)\Lambda(N-m) \le 2MK(\log N)^2.m=0∑N​1¬(m prime ∧ N−m prime)​Λ(m)Λ(N−m)≤2MK(logN)2.

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 m=0m=0m=0 and m=Nm=Nm=N.

Preamble
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.Data.Nat.Sqrt
import Mathlib.Algebra.BigOperators.Intervals
open scoped BigOperators
set_option autoImplicit false
Formal statement
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
Source
Elementary finite-support estimate developed for the Goldbach mission, https://prove2.me/missions/The_Goldbach_Conjecture. Uses Mathlib ArithmeticFunction.vonMangoldt and Nat.sqrt/Nat.log APIs; no claim of a new prime-distribution estimate or literature novelty.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me