Odd arguments carry weight at most 2 log 2 times theta
ProvedLL_Decomp1526a.sum_rep_odd_leFor all natural numbers , the sum of over odd with is at most , where is the first Chebyshev function.
import Mathlib import Definitions.Def_LL_Decomp1526a_rep open Finset Real open scoped Chebyshev Classical
namespace LL_Decomp1526a
theorem sum_rep_odd_le (a b : ℕ) :
∑ N ∈ (Ioc a b).filter (fun N => ¬ Even N), rep N ≤ 2 * Real.log 2 * θ (b : ℝ) := by sorry
end LL_Decomp1526aRead-back
What the Lean code literally says, in plain math · claude-haiku
Read-back: LL_Decomp1526a.sum_rep_odd_le
For all natural numbers and , with no hypothesis relating them, the following inequality holds:
The index set consists of the odd natural numbers with . When the index set is empty, the left side is the empty sum , and the claim reduces to .
The symbol is not unfolded here. Its definition lives in an imported file that was outside the scope of this read-back, so it is not stated whether is a real number or a natural number cast to , and whether it is nonnegative is not known from this statement.
The symbol is taken as the Chebyshev function of the standard Mathlib sense, , evaluated at the real number (the natural number is cast to ). The constant is the natural logarithm of .
Degenerate cases: for we have , so the right side is . In particular, for and the index set is and the statement says . For the right side is strictly positive, and the bound does not depend on , so it is a bound on the odd part of the sum over alone.
Both sides are real numbers, and the inequality is non-strict.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.