Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Partial summation bound for S2S_2S2​

Proved
LL_Decomp1543c.S2_le

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

number-theory

For real c≥0c\ge0c≥0, VVV, α\alphaα and natural NNN, ∣SΛ2(V,⋅)(c,N,α)∣≤log⁡N∑t=1⌊V⌋K(N/t,αt)|S_{\Lambda_2(V,\cdot)}(c,N,\alpha)|\le \log N\sum_{t=1}^{\lfloor V\rfloor}K(N/t,\alpha t)∣SΛ2​(V,⋅)​(c,N,α)∣≤logN∑t=1⌊V⌋​K(N/t,αt), where Λ2(V,n)=∑t∣n, t≤Vμ(t)log⁡(n/t)\Lambda_2(V,n)=\sum_{t\mid n,\ t\le V}\mu(t)\log(n/t)Λ2​(V,n)=∑t∣n, t≤V​μ(t)log(n/t) and K(X,θ)=min⁡(X,1/(2∥θ∥))K(X,\theta)=\min(X,1/(2\|\theta\|))K(X,θ)=min(X,1/(2∥θ∥)), read as XXX when θ\thetaθ 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_Decomp1543c
Source
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 c≥0c \ge 0c≥0, natural NNN, and real VVV and α\alphaα, the statement asserts

∥Ssum(λV,c,N,α)∥≤log⁡N⋅∑t=1⌊V⌋+minK ⁣(Nt,αt),\bigl\|\mathrm{Ssum}(\lambda_V, c, N, \alpha)\bigr\| \le \log N \cdot \sum_{t=1}^{\lfloor V\rfloor_+} \mathrm{minK}\!\left(\frac{N}{t}, \alpha t\right),​Ssum(λV​,c,N,α)​≤logN⋅t=1∑⌊V⌋+​​minK(tN​,αt),

where ∥⋅∥\|\cdot\|∥⋅∥ is the norm (modulus) of the value, λV\lambda_VλV​ is lam2 applied to VVV, and log⁡N\log NlogN is the real logarithm of (N:R)(N:\mathbb{R})(N:R). For N=0N=0N=0 or N=1N=1N=1 the right side is 000, since log⁡0=0\log 0 = 0log0=0. ⌊V⌋+\lfloor V\rfloor_+⌊V⌋+​ is the natural-number floor, so the sum is empty and equals 000 when V<1V<1V<1. Each N/tN/tN/t is real division with t≥1t \ge 1t≥1, 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 ccc is 0≤c0 \le c0≤c. The statement is closed with sorry, so no proof is given here.

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