Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5 numerics, second term

Proved
LL_Decomp1543c.n65b

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

number-theory

For natural N,qN,qN,q 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 and V=N2/5L1/5V=N^{2/5}L^{1/5}V=N2/5L1/5, one has Vlog⁡q log⁡N≤0.0001 N4/5L1.4V\log q\,\log N\le0.0001\,N^{4/5}L^{1.4}VlogqlogN≤0.0001N4/5L1.4.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543c_Vf

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem n65b (N : ℕ) (hL : 3100 ≤ Real.log N) (q : ℕ)
    (hq1 : (0.28 / 1.0012) ^ 2 * Real.log N ^ 4 < q)
    (hq2 : (q : ℝ) < (1.0012 / 0.09) ^ 2 * N / Real.log N ^ 5) :
    Vf N * Real.log q * Real.log N ≤ 0.0001 * (N : ℝ) ^ ((4 : ℝ) / 5) * Real.log N ^ (1.4 : ℝ) := 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. https://doi.org/10.4064/aa105-2-3
Read-back

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

For every natural number NNN with log⁡N≥3100\log N \ge 3100logN≥3100 (so N≥e3100N \ge e^{3100}N≥e3100) and every natural number qqq with

(0.281.0012)2(log⁡N)4<q<(1.00120.09)2N(log⁡N)5,\left(\frac{0.28}{1.0012}\right)^2 (\log N)^4 < q < \left(\frac{1.0012}{0.09}\right)^2 \frac{N}{(\log N)^5},(1.00120.28​)2(logN)4<q<(0.091.0012​)2(logN)5N​,

where qqq is cast to a real number and log⁡\loglog is the real natural logarithm, the following holds:

Vf(N) log⁡q log⁡N≤0.0001 N4/5 (log⁡N)1.4.V_f(N)\,\log q\,\log N \le 0.0001\, N^{4/5}\,(\log N)^{1.4}.Vf​(N)logqlogN≤0.0001N4/5(logN)1.4.

Here Vf(N)V_f(N)Vf​(N) is a real-valued function from an imported module that was not inspected, so its sign and size are not constrained by this statement. The exponents 222, 444, 555 are natural-number powers; 4/54/54/5 and 1.41.41.4 are real powers. The lower bound on qqq is positive, so q≥1q \ge 1q≥1 and log⁡q≥0\log q \ge 0logq≥0. The window for qqq is nonempty for every such NNN, so the hypotheses are satisfiable. If Vf(N)≤0V_f(N) \le 0Vf​(N)≤0, the inequality holds trivially. The proof is a placeholder (sorry), so the statement is unproven in this file.

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