Legendre lower bound using the Chebyshev function
ProvedLL_Decomp1528a.sum_sub_theta_le_log_factorialnumber-theory
For every natural number , , where and the sums run over primes.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem sum_sub_theta_le_log_factorial (n : ℕ) :
(n : ℝ) * ∑ p ∈ Nat.primesLE n, log p / p - θ n ≤ log (n.factorial : ℝ) := by sorry
end LL_Decomp1528aSource
Ingham, The Distribution of Prime Numbers, Theorem 7. 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:
with Chebyshev.theta at , . The sum body stops before the binary minus, so the reading is . Casts: and to , factorial computed in then cast. Edge cases : . Non-strict; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.