Prime sum bounded by a fixed head and an integer tail
ProvedLL_Decomp1528a.sum_log_div_pp1_splitnumber-theory
For every natural number , , where runs over primes and over integers.
Preamble
import Mathlib open Real Finset Chebyshev
Formal statement
namespace LL_Decomp1528a
theorem sum_log_div_pp1_split (n : ℕ) :
∑ p ∈ Nat.primesLE n, log p / ((p : ℝ) * ((p : ℝ) - 1)) ≤
∑ p ∈ Nat.primesLE 1000, log p / ((p : ℝ) * ((p : ℝ) - 1)) +
∑ m ∈ Ioc 1000 n, log m / ((m : ℝ) * ((m : ℝ) - 1)) := by sorry
end LL_Decomp1528aSource
Elementary finite-sum comparison in lab unit U-1528. 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:
The tail sum runs over all integers in , so it is a loose upper bound counting composites too. Real casts, no truncation, no zero denominators. : reduces to monotonicity of the prime sum. Proof is sorry.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.