Kernel sum conditional on the Wang and Chen input
ProvedLL_Decomp1543a.inner_l_sumAssume and . For every natural , real , real and real , , where the subtraction and division in the bracket are natural-number operations.
import Mathlib import Definitions.Def_LL_Decomp1543a_nint import Definitions.Def_LL_Decomp1543a_minK import Definitions.Def_LL_Decomp1543a_Dioph import Definitions.Def_LL_Decomp1543a_lRange import Definitions.Def_LL_Decomp1543a_WCLemma2 open Real Finset ArithmeticFunction
namespace LL_Decomp1543a
theorem inner_l_sum (hwc : WCLemma2) (α : ℝ) (a : ℤ) (q : ℕ) (hD : Dioph α a q) (N : ℕ)
(U Y X : ℝ) (hU : 0 ≤ U) (hX : 0 < X) (m : ℕ) :
∑ l ∈ lRange N U Y, minK X (α * ((m : ℝ) - l)) ≤
((((⌊Y⌋₊ - ⌊U⌋₊) / q : ℕ) : ℝ) + 1) * (5 * X + q * Real.log q) := by sorry
end LL_Decomp1543aRead-back
What the Lean code literally says, in plain math · claude-haiku
Fix a real , an integer , natural numbers , , , and reals , , . Assume a term of type WCLemma2, a term of type , , and . Then
Here is the finite set given by lRange, and the index is cast to a real. is minK with parameter . The term is real subtraction. is the floor returned as a natural number, so it is for negative input. is truncated subtraction, giving when . The division by is natural floor division. If , the bracket equals and , so the bound is . The variables , and do not occur in the bound. The statement ends in sorry, so no proof is given.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.