Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.6 numerics, second term

Proved
LL_Decomp1543c.n66b

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 UVlog⁡q log⁡(UV)≤0.8 N4/5L1.4UV\log q\,\log(UV)\le0.8\,N^{4/5}L^{1.4}UVlogqlog(UV)≤0.8N4/5L1.4.

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

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

Let N,qN, qN,q be natural numbers. The hypotheses are log⁡N≥3100\log N \ge 3100logN≥3100, where log⁡\loglog is the real logarithm of NNN, so N≥e3100N \ge e^{3100}N≥e3100; (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; and q<(1.0012/0.09)2N/(log⁡N)5q < (1.0012/0.09)^2 N/(\log N)^5q<(1.0012/0.09)2N/(logN)5, with qqq cast to a real. All operations are real, and log⁡N>0\log N > 0logN>0, so the bounds involve no division by zero. The conclusion is

UNVNlog⁡q log⁡(UNVN)≤0.8 N4/5(log⁡N)1.4.U_N V_N \log q \,\log(U_N V_N) \le 0.8\, N^{4/5}(\log N)^{1.4}.UN​VN​logqlog(UN​VN​)≤0.8N4/5(logN)1.4.

Here log⁡\loglog denotes the natural logarithm, and N4/5N^{4/5}N4/5 and (log⁡N)1.4(\log N)^{1.4}(logN)1.4 are real powers. UNU_NUN​ and VNV_NVN​ are the functions Uf and Vf from other files, which were not read, so their types and values are unknown. Nothing else is assumed about UNU_NUN​, VNV_NVN​, or qqq. The interval for qqq is nonempty for large NNN. The proof is sorry, so the statement is unproven.

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