Chebyshev identity for the logarithm of a factorial
ProvedLL_Decomp1528a.log_factorial_eq_vonMangoldtnumber-theory
For every natural number , , where if is a positive power of a prime , and otherwise.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem log_factorial_eq_vonMangoldt (n : ℕ) :
log (n.factorial : ℝ) =
∑ m ∈ Icc 1 n, ArithmeticFunction.vonMangoldt m * ((n / m : ℕ) : ℝ) := by sorry
end LL_Decomp1528aSource
Ingham, The Distribution of Prime Numbers, Theorem 7 proof; Montgomery and Vaughan, Multiplicative Number Theory I, Section 2.2. 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:
where ((n / m : ℕ) : ℝ) is natural-number floor division cast to , not real division. is ArithmeticFunction.vonMangoldt, . : both sides 0; : both sides 0. No junk values. Proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.