Explicit bound for the prime sum through
ProvedLL_Decomp1528a.sum_log_div_pp1_headnumber-theory
The finite sum over primes satisfies .
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem sum_log_div_pp1_head :
∑ p ∈ Nat.primesLE 1000, log p / ((p : ℝ) * ((p : ℝ) - 1)) ≤ 0.7545 := by sorry
end LL_Decomp1528aSource
Rosser and Schoenfeld 1962, equation 2.11 and the constant E on p. 70; the bound 0.7545 is the lab leaf. Source context: https://arxiv.org/abs/2608.09488v1
Read-back
What the Lean code literally says, in plain math · claude-haiku
No binders, no hypotheses:
a finite sum over the 168 primes up to 997. is Real.log; is real subtraction; exactly. Non-strict; a closed numerical claim; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.