Factorial bounded by the weighted von Mangoldt sum
ProvedLL_Decomp1528a.log_factorial_le_vonMangoldt_sumnumber-theory
For every natural number , , where is the von Mangoldt function and the sum is empty for .
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem log_factorial_le_vonMangoldt_sum (n : ℕ) :
log (n.factorial : ℝ) ≤ (n : ℝ) * ∑ m ∈ Icc 1 n, ArithmeticFunction.vonMangoldt m / m := 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:
sum over all in Icc 1 n, real division, von Mangoldt valued in . and hold with equality. Factor sits outside the sum. Non-strict; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.