Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5 numerics, third term

Proved
LL_Decomp1543c.n65c

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 5(N/q)log⁡V log⁡N≤0.0282 (N/q) L25(N/q)\log V\,\log N\le0.0282\,(N/\sqrt q)\,L^25(N/q)logVlogN≤0.0282(N/q​)L2.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543c_Vf

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem n65c (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) :
    5 * N / q * Real.log (Vf N) * Real.log N ≤ 0.0282 * N / √q * Real.log N ^ 2 := 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 all natural numbers NNN and qqq with log⁡N≥3100\log N \ge 3100logN≥3100, (0.281.0012)2(log⁡N)4<q\left(\frac{0.28}{1.0012}\right)^2(\log N)^4 < q(1.00120.28​)2(logN)4<q, and q<(1.00120.09)2N(log⁡N)5q < \left(\frac{1.0012}{0.09}\right)^2\frac{N}{(\log N)^5}q<(0.091.0012​)2(logN)5N​, we have

5Nq log⁡Vf(N) log⁡N≤0.0282 Nq (log⁡N)2.\frac{5N}{q}\,\log V_f(N)\,\log N \le \frac{0.0282\,N}{\sqrt{q}}\,(\log N)^2.q5N​logVf​(N)logN≤q​0.0282N​(logN)2.

Here NNN and qqq are cast to the reals, log⁡\loglog is the real natural logarithm, q\sqrt{q}q​ is the real square root, and all divisions are real. The function VfV_fVf​ is defined in an imported file that was not read, so its type and values are unknown. Real logarithm is defined on all reals as log⁡∣x∣\log|x|log∣x∣ with log⁡0=0\log 0 = 0log0=0, so log⁡Vf(N)\log V_f(N)logVf​(N) is a junk value when Vf(N)=0V_f(N)=0Vf​(N)=0, and no positivity of Vf(N)V_f(N)Vf​(N) is assumed. The first hypothesis forces N≥e3100N \ge e^{3100}N≥e3100, so N≥1N \ge 1N≥1 and log⁡N≠0\log N \neq 0logN=0. The two bounds on qqq force q≥1q \ge 1q≥1. Both hypotheses hold together for sufficiently large NNN, so the statement is not vacuous.

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