Upper bound for the weighted von Mangoldt sum
ProvedLL_Decomp1528a.vonMangoldt_sum_lenumber-theory
For every natural number , , where is the von Mangoldt function and . The statement includes .
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem vonMangoldt_sum_le (n : ℕ) :
(n : ℝ) * ∑ m ∈ Icc 1 n, ArithmeticFunction.vonMangoldt m / m ≤
log (n.factorial : ℝ) + ψ n := by sorry
end LL_Decomp1528aSource
Montgomery and Vaughan, Multiplicative Number Theory I, Section 2.2; lab unit U-1528. Source context: https://arxiv.org/abs/2608.09488v1
Read-back
What the Lean code literally says, in plain math · claude-haiku
For every , no hypotheses:
is Chebyshev.psi at . Division by is real division, . : . The factor multiplies the whole sum. Non-strict; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.