Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.6 numerics, third term

Proved
LL_Decomp1543c.n66c

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 5(N/q)log⁡2(UV)≤0.0131 (N/q) L25(N/q)\log^2(UV)\le0.0131\,(N/\sqrt q)\,L^25(N/q)log2(UV)≤0.0131(N/q​)L2.

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 n66c (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 (Uf N * Vf N) * Real.log (Uf N * Vf N) ≤
      0.0131 * 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.6. https://doi.org/10.4064/aa105-2-3
Read-back

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

Let N,q∈NN, q \in \mathbb{N}N,q∈N. Assume log⁡N≥3100\log N \ge 3100logN≥3100 (so N≥e3100N \ge e^{3100}N≥e3100, which excludes N=0N = 0N=0) and

c1(log⁡N)4<q<c2 N(log⁡N)5,c_1 (\log N)^4 < q < c_2 \, \frac{N}{(\log N)^5},c1​(logN)4<q<c2​(logN)5N​,

where c1=(0.281.0012)2≈0.0782c_1 = \left(\tfrac{0.28}{1.0012}\right)^2 \approx 0.0782c1​=(1.00120.28​)2≈0.0782 and c2=(1.00120.09)2≈123.75c_2 = \left(\tfrac{1.0012}{0.09}\right)^2 \approx 123.75c2​=(0.091.0012​)2≈123.75. Then, with all divisions and roots taken in R\mathbb{R}R (the casts make them real, so no natural-number truncation occurs):

5Nq (log⁡(UNVN))2≤0.0131 Nq (log⁡N)2.\frac{5N}{q}\,\big(\log(U_N V_N)\big)^2 \le \frac{0.0131\,N}{\sqrt{q}}\,(\log N)^2.q5N​(log(UN​VN​))2≤q​0.0131N​(logN)2.

UNU_NUN​ and VNV_NVN​ are functions of NNN imported from other files, which were not read here; their types are unknown and they are cast to R\mathbb{R}R. Here log⁡\loglog is the real logarithm with log⁡x=log⁡∣x∣\log x = \log|x|logx=log∣x∣ and log⁡0=0\log 0 = 0log0=0, so the left side equals 000 whenever UNVN=0U_N V_N = 0UN​VN​=0. The lower bound forces q≥1q \ge 1q≥1, so no division by zero occurs. For large NNN the interval for qqq is nonempty and contains integers, so the hypotheses are satisfiable and 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