Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Assembly of the four Vaughan exponential sums

Proved
LL_Decomp1543a.S_split

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

number-theory

For every real c,U,V,αc,U,V,\alphac,U,V,α and natural NNN with V≥1V\ge1V≥1, SΛ(c,N,α)=SΛ1(U,⋅)(c,N,α)+SΛ2(V,⋅)(c,N,α)+SΛ3(U,V,⋅)(c,N,α)+SΛ4(U,V,⋅)(c,N,α)S_\Lambda(c,N,\alpha)=S_{\Lambda_1(U,\cdot)}(c,N,\alpha)+S_{\Lambda_2(V,\cdot)}(c,N,\alpha)+S_{\Lambda_3(U,V,\cdot)}(c,N,\alpha)+S_{\Lambda_4(U,V,\cdot)}(c,N,\alpha)SΛ​(c,N,α)=SΛ1​(U,⋅)​(c,N,α)+SΛ2​(V,⋅)​(c,N,α)+SΛ3​(U,V,⋅)​(c,N,α)+SΛ4​(U,V,⋅)​(c,N,α). All sums use the strict lower cutoff cN<ncN<ncN<n and 1≤n≤N1\le n\le N1≤n≤N; this is the lab assembly conditional on the coefficient identity.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543a_e
import Definitions.Def_LL_Decomp1543a_rangeN
import Definitions.Def_LL_Decomp1543a_Ssum
import Definitions.Def_LL_Decomp1543a_lam1
import Definitions.Def_LL_Decomp1543a_lam2
import Definitions.Def_LL_Decomp1543a_lam3
import Definitions.Def_LL_Decomp1543a_am
import Definitions.Def_LL_Decomp1543a_lam4

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem S_split (c : ℝ) (N : ℕ) (U V α : ℝ) (hV : 1 ≤ V) :
    Ssum (fun n => (vonMangoldt n : ℝ)) c N α =
      Ssum (lam1 U) c N α + Ssum (lam2 V) c N α + Ssum (lam3 U V) c N α +
        Ssum (lam4 U V) c N α := 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. 168, equation 6.7, with definitions in equation 6.8 on p. 169. https://doi.org/10.4064/aa105-2-3
Read-back

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

For real numbers ccc, α\alphaα, UUU, VVV and a natural number NNN, assuming only 1≤V1 \le V1≤V, the following equality holds. Nothing else is assumed: UUU may be zero or negative, and N=0N = 0N=0 is allowed.

S(Λ,c,N,α)=S(λ1U,c,N,α)+S(λ2V,c,N,α)+S(λ3U,V,c,N,α)+S(λ4U,V,c,N,α)S(\Lambda, c, N, \alpha) = S(\lambda_1^{U}, c, N, \alpha) + S(\lambda_2^{V}, c, N, \alpha) + S(\lambda_3^{U,V}, c, N, \alpha) + S(\lambda_4^{U,V}, c, N, \alpha)S(Λ,c,N,α)=S(λ1U​,c,N,α)+S(λ2V​,c,N,α)+S(λ3U,V​,c,N,α)+S(λ4U,V​,c,N,α)

Here SSS denotes Ssum and λ1,…,λ4\lambda_1, \dots, \lambda_4λ1​,…,λ4​ denote lam1 to lam4, all defined in other items; this text shows only their arguments. Λ(n)\Lambda(n)Λ(n) is the von Mangoldt function, which is already real valued, so the real cast is redundant, and Λ(0)=0\Lambda(0) = 0Λ(0)=0 as is standard for arithmetic functions. The hypothesis 1≤V1 \le V1≤V is satisfiable, so the statement is not vacuous. The proof is a placeholder (sorry), so the equality is asserted, not established.

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