Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.6 numerics, first term

Proved
LL_Decomp1543c.n66a

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, U=N2/5L−4/5U=N^{2/5}L^{-4/5}U=N2/5L−4/5 and V=N2/5L1/5V=N^{2/5}L^{1/5}V=N2/5L1/5, one has (5q+1.5 qlog⁡q)log⁡(UV)≤0.0005Nq L2.5(5q+1.5\,q\log q)\log(UV)\le0.0005\sqrt N\sqrt q\,L^{2.5}(5q+1.5qlogq)log(UV)≤0.0005N​q​L2.5.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1543c_Uf
import Definitions.Def_LL_Decomp1543c_Vf

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem n66a (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 * q + 1.5 * q * Real.log q) * Real.log (Uf N * Vf N) ≤
      0.0005 * √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. 170, proof of Lemma 6.6. https://doi.org/10.4064/aa105-2-3
Read-back

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

Let NNN and qqq be natural numbers, where log⁡N≥3100\log N \ge 3100logN≥3100 (real natural logarithm), so N≥e3100N \ge e^{3100}N≥e3100. N=0N=0N=0 is excluded since log⁡0=0\log 0 = 0log0=0. qqq is cast to the reals.

Hypotheses (both strict, real division):

(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​

For every such NNN this window for qqq is nonempty, and q≥1q \ge 1q≥1 follows.

Conclusion, where Uf(N)U_f(N)Uf​(N) and Vf(N)V_f(N)Vf​(N) are real numbers defined in imported files, not unfolded here:

(5q+1.5 qlog⁡q) log⁡(Uf(N) Vf(N))≤0.0005 N q (log⁡N)5/2(5q + 1.5\,q\log q)\,\log\big(U_f(N)\,V_f(N)\big) \le 0.0005\,\sqrt{N}\,\sqrt{q}\,(\log N)^{5/2}(5q+1.5qlogq)log(Uf​(N)Vf​(N))≤0.0005N​q​(logN)5/2

The inequality is non-strict. Junk values: log⁡x=log⁡∣x∣\log x = \log|x|logx=log∣x∣ for x≠0x \ne 0x=0 and log⁡0=0\log 0 = 0log0=0, so if Uf(N)Vf(N)=0U_f(N)V_f(N)=0Uf​(N)Vf​(N)=0 the left side is 000. The proof is unfinished.

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