Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1 for log⁡N≥3100\log N\ge3100logN≥3100

Open
LL_Decomp1543c.prop61_large

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

number-theory

For real c≥0c\ge0c≥0 and α\alphaα, integer aaa and natural N,qN,qN,q with Dioph⁡(α,a,q)\operatorname{Dioph}(\alpha,a,q)Dioph(α,a,q), that is q≥1q\ge1q≥1, gcd⁡(a,q)=1\gcd(a,q)=1gcd(a,q)=1, ∣α−a/q∣≤q−2|\alpha-a/q|\le q^{-2}∣α−a/q∣≤q−2, and with L=log⁡N≥3100L=\log N\ge3100L=logN≥3100 and (0.28/1.0012)2L4<q<(1.0012/0.09)2N/L5(0.28/1.0012)^2L^4<q<(1.0012/0.09)^2N/L^5(0.28/1.0012)2L4<q<(1.0012/0.09)2N/L5, one has ∣SΛ(c,N,α)∣≤0.28 (N/q)L2+4N4/5L1.4+0.09Nq L2.5|S_\Lambda(c,N,\alpha)|\le0.28\,(N/\sqrt q)L^2+4N^{4/5}L^{1.4}+0.09\sqrt N\sqrt q\,L^{2.5}∣SΛ​(c,N,α)∣≤0.28(N/q​)L2+4N4/5L1.4+0.09N​q​L2.5, where SΛ(c,N,α)=∑1≤n≤N, cN<nΛ(n)e(αn)S_\Lambda(c,N,\alpha)=\sum_{1\le n\le N,\ cN<n}\Lambda(n)e(\alpha n)SΛ​(c,N,α)=∑1≤n≤N, cN<n​Λ(n)e(αn). In the lab this is proved conditional on the open items here and on open leaves of Decomp1543a and Decomp1543b.

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_Dioph

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem prop61_large (c : ℝ) (hc : 0 ≤ c) (N : ℕ) (hL : 3100 ≤ Real.log N) (α : ℝ) (a : ℤ)
    (q : ℕ) (hD : Dioph α a q) (hq1 : (0.28 / 1.0012) ^ 2 * Real.log N ^ 4 < q)
    (hq2 : (q : ℝ) < (1.0012 / 0.09) ^ 2 * N / Real.log N ^ 5) :
    ‖Ssum (fun n => (vonMangoldt n : ℝ)) c N α‖ ≤ 0.28 * N / √q * Real.log N ^ 2 +
      4 * (N : ℝ) ^ ((4 : ℝ) / 5) * Real.log N ^ (1.4 : ℝ) +
        0.09 * √N * √q * Real.log N ^ (2.5 : ℝ) := 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. 168, Proposition 6.1, (6.2), in the range (6.3). https://doi.org/10.4064/aa105-2-3
Read-back

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

Let c≥0c \ge 0c≥0 be real, NNN a natural number, α\alphaα real, aaa an integer and qqq a natural number. The hypotheses are:

  • log⁡N≥3100\log N \ge 3100logN≥3100, with NNN cast to a real, so N≥e3100N \ge e^{3100}N≥e3100 and log⁡N>0\log N > 0logN>0.
  • Dioph(α,a,q)\mathrm{Dioph}(\alpha,a,q)Dioph(α,a,q) holds, a predicate from another item whose meaning is not shown here.
  • (0.28/1.0012)2(log⁡N)4<q(0.28/1.0012)^2(\log N)^4 < q(0.28/1.0012)2(logN)4<q, which forces q≥1q \ge 1q≥1, so q≠0\sqrt{q} \ne 0q​=0.
  • q<(1.0012/0.09)2 N/(log⁡N)5q < (1.0012/0.09)^2\, N/(\log N)^5q<(1.0012/0.09)2N/(logN)5.

Let S=Ssum(Λ,c,N,α)S = \mathrm{Ssum}(\Lambda, c, N, \alpha)S=Ssum(Λ,c,N,α), with Λ\LambdaΛ the von Mangoldt function cast to reals. Its definition is not shown here. The conclusion is

∣S∣≤0.28 Nq(log⁡N)2+4N4/5(log⁡N)1.4+0.09 Nq (log⁡N)2.5.|S| \le \frac{0.28\,N}{\sqrt{q}}(\log N)^2 + 4N^{4/5}(\log N)^{1.4} + 0.09\,\sqrt{N}\sqrt{q}\,(\log N)^{2.5}.∣S∣≤q​0.28N​(logN)2+4N4/5(logN)1.4+0.09N​q​(logN)2.5.

The bound is one-sided, and ccc and α\alphaα enter only through SSS. Non-integer exponents are real powers. The hypotheses are not vacuous: for large NNN the qqq-interval is nonempty. The proof is sorry, so the statement is unproved.

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