Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Kernel sum conditional on the Wang and Chen input

Proved
LL_Decomp1543a.inner_l_sum

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Assume WCLemma2\mathrm{WCLemma2}WCLemma2 and Dioph⁡(α,a,q)\operatorname{Dioph}(\alpha,a,q)Dioph(α,a,q). For every natural N,mN,mN,m, real U≥0U\ge0U≥0, real YYY and real X>0X>0X>0, ∑l∈L(N,U,Y)K(X,α(m−l))≤(⌊max⁡(⌊Y⌋+−⌊U⌋+,0)q⌋+1)(5X+qlog⁡q)\sum_{l\in L(N,U,Y)}K(X,\alpha(m-l))\le\left(\left\lfloor\frac{\max(\lfloor Y\rfloor_+-\lfloor U\rfloor_+,0)}q\right\rfloor+1\right)(5X+q\log q)∑l∈L(N,U,Y)​K(X,α(m−l))≤(⌊qmax(⌊Y⌋+​−⌊U⌋+​,0)​⌋+1)(5X+qlogq), where the subtraction and division in the bracket are natural-number operations.

Preamble
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
Formal statement
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_Decomp1543a
Source
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, p. 171, equation 6.12. https://doi.org/10.4064/aa105-2-3
Read-back

What the Lean code literally says, in plain math · claude-haiku

Fix a real α\alphaα, an integer aaa, natural numbers qqq, NNN, mmm, and reals UUU, XXX, YYY. Assume a term HHH of type WCLemma2, a term DDD of type Dioph(α,a,q)\mathrm{Dioph}(\alpha,a,q)Dioph(α,a,q), 0≤U0 \le U0≤U, and 0<X0 < X0<X. Then

∑l∈LN(U,Y)KX(α(m−l))≤(⌊⌊Y⌋+⊖⌊U⌋+q⌋+1)(5X+qlog⁡q)\sum_{l \in L_N(U,Y)} K_X\big(\alpha(m-l)\big) \le \left(\left\lfloor \frac{\lfloor Y\rfloor_+ \ominus \lfloor U\rfloor_+}{q} \right\rfloor + 1\right)\big(5X + q\log q\big)l∈LN​(U,Y)∑​KX​(α(m−l))≤(⌊q⌊Y⌋+​⊖⌊U⌋+​​⌋+1)(5X+qlogq)

Here LN(U,Y)L_N(U,Y)LN​(U,Y) is the finite set given by lRange, and the index lll is cast to a real. KXK_XKX​ is minK with parameter XXX. The term m−lm-lm−l is real subtraction. ⌊⋅⌋+\lfloor\cdot\rfloor_+⌊⋅⌋+​ is the floor returned as a natural number, so it is 000 for negative input. ⊖\ominus⊖ is truncated subtraction, giving 000 when ⌊Y⌋+<⌊U⌋+\lfloor Y\rfloor_+ < \lfloor U\rfloor_+⌊Y⌋+​<⌊U⌋+​. The division by qqq is natural floor division. If q=0q=0q=0, the bracket equals 111 and qlog⁡q=0q\log q=0qlogq=0, so the bound is 5X5X5X. The variables aaa, HHH and DDD do not occur in the bound. The statement ends in sorry, so no proof is given.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me