Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound for S1S_1S1​ (Lemma 6.2)

Open
LL_Decomp1543c.lemma62_S1

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

number-theory

For every real ccc, α\alphaα and natural NNN with log⁡N≥3100\log N\ge3100logN≥3100, ∣SΛ1(U,⋅)(c,N,α)∣≤1.02 U|S_{\Lambda_1(U,\cdot)}(c,N,\alpha)|\le1.02\,U∣SΛ1​(U,⋅)​(c,N,α)∣≤1.02U, where U=N2/5(log⁡N)−4/5U=N^{2/5}(\log N)^{-4/5}U=N2/5(logN)−4/5 and Λ1(U,n)\Lambda_1(U,n)Λ1​(U,n) is Λ(n)\Lambda(n)Λ(n) for n≤Un\le Un≤U and 000 otherwise. No sign condition on ccc is assumed.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543c_e
import Definitions.Def_LL_Decomp1543c_rangeN
import Definitions.Def_LL_Decomp1543c_Ssum
import Definitions.Def_LL_Decomp1543c_lam1
import Definitions.Def_LL_Decomp1543c_Uf

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem lemma62_S1 (c : ℝ) (N : ℕ) (hL : 3100 ≤ Real.log N) (α : ℝ) :
    ‖Ssum (lam1 (Uf N)) c N α‖ ≤ 1.02 * Uf N := 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. 169, Lemma 6.2. https://doi.org/10.4064/aa105-2-3
Read-back

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

For every real ccc, every natural number NNN and every real α\alphaα, assuming only 3100≤log⁡N3100 \le \log N3100≤logN, where log⁡\loglog is the natural logarithm of (N:R)(N : \mathbb{R})(N:R) (so N≥e3100N \ge e^{3100}N≥e3100, which is satisfiable), the following holds:

∥S(λ1(Uf(N)), c, N, α)∥≤1.02⋅Uf(N)\left\| S\bigl(\lambda_1(U_f(N)),\, c,\, N,\, \alpha\bigr) \right\| \le 1.02 \cdot U_f(N)​S(λ1​(Uf​(N)),c,N,α)​≤1.02⋅Uf​(N)

Here ∥⋅∥\|\cdot\|∥⋅∥ is the norm of the value of SSS. The objects SSS, λ1\lambda_1λ1​ and UfU_fUf​ are imported definitions whose internal meaning is not shown in this text; 1.021.021.02 is a real literal. No hypothesis restricts ccc or α\alphaα. Since a norm is nonnegative, the inequality forces 1.02⋅Uf(N)≥01.02 \cdot U_f(N) \ge 01.02⋅Uf​(N)≥0, hence Uf(N)≥0U_f(N) \ge 0Uf​(N)≥0, for every such NNN. Nothing in this text guarantees that sign, so the statement is false if Uf(N)<0U_f(N) < 0Uf​(N)<0 for some such NNN. The proof is omitted (a placeholder), so the statement is not proved 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