Uniform bound for the integer tail beyond
ProvedLL_Decomp1528a.sum_log_div_pp1_tailnumber-theory
For every natural number , , with the sum over integers and with an empty sum when .
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem sum_log_div_pp1_tail (n : ℕ) :
∑ m ∈ Ioc 1000 n, log m / ((m : ℝ) * ((m : ℝ) - 1)) ≤ 0.009 := by sorry
end LL_Decomp1528aSource
Rosser and Schoenfeld 1962, p. 70 style; elementary tail estimate stated in the lab. 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:
summing over all integers in Ioc 1000 n, not only primes. Casts to before log and division; , no zero denominators. exactly. For the sum is empty. Terms are positive, so it bounds every partial sum of the series. Non-strict; proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.