Partial summation bound for
ProvedLL_Decomp1543c.S2_lenumber-theory
For real , , and natural , , where and , read as when is an integer.
Preamble
import Mathlib import Definitions.Def_LL_Decomp1543c_e import Definitions.Def_LL_Decomp1543c_nint import Definitions.Def_LL_Decomp1543c_minK import Definitions.Def_LL_Decomp1543c_rangeN import Definitions.Def_LL_Decomp1543c_Ssum import Definitions.Def_LL_Decomp1543c_lam2 open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem S2_le (c : ℝ) (hc : 0 ≤ c) (N : ℕ) (V α : ℝ) :
‖Ssum (lam2 V) c N α‖ ≤
Real.log N * ∑ t ∈ Icc 1 ⌊V⌋₊, minK ((N : ℝ) / t) (α * t) := by sorry
end LL_Decomp1543cSource
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, p. 170, proof of Lemma 6.5, first line. https://doi.org/10.4064/aa105-2-3
Read-back
What the Lean code literally says, in plain math · claude-haiku
For real , natural , and real and , the statement asserts
where is the norm (modulus) of the value, is lam2 applied to , and is the real logarithm of . For or the right side is , since . is the natural-number floor, so the sum is empty and equals when . Each is real division with , so no division by zero occurs. Ssum, lam2 and minK are defined in other items and are used here only as applied. The only hypothesis on is . The statement is closed with sorry, so no proof is given here.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.