Legendre upper bound for the logarithm of a factorial
ProvedLL_Decomp1528a.log_factorial_le_sumnumber-theory
For every natural number , , where both sums run over primes.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem log_factorial_le_sum (n : ℕ) :
log (n.factorial : ℝ) ≤
(n : ℝ) * ∑ p ∈ Nat.primesLE n, log p / p +
(n : ℝ) * ∑ p ∈ Nat.primesLE n, log p / ((p : ℝ) * ((p : ℝ) - 1)) := by sorry
end LL_Decomp1528aSource
Legendre formula; Ingham, The Distribution of Prime Numbers, Theorem 7; Rosser and Schoenfeld 1962, p. 70 style. Source context: https://arxiv.org/abs/2608.09488v1
Read-back
What the Lean code literally says, in plain math · claude-haiku
For every natural number , no hypotheses:
is Real.log, cast to , ranges over Nat.primesLE n. The big operators stop before the +, so the right side is . All casts precede division and the subtraction , so no truncation. Edge cases: give ; gives . No division by zero since every . Non-strict inequality; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.