Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.5 numerics, first term

Proved
LL_Decomp1543c.n65a

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, one has (5q+1.5 qlog⁡q)log⁡N≤0.0006Nq L2.5(5q+1.5\,q\log q)\log N\le0.0006\sqrt N\sqrt q\,L^{2.5}(5q+1.5qlogq)logN≤0.0006N​q​L2.5.

Preamble
import Mathlib

open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem n65a (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 N ≤
      0.0006 * √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.5. 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, with log⁡\loglog the real natural logarithm applied to NNN and to qqq cast to R\mathbb{R}R. Assume

3100≤log⁡N,(0.281.0012)2(log⁡N)4<q,q<(1.00120.09)2N(log⁡N)5.3100 \le \log N, \qquad \left(\tfrac{0.28}{1.0012}\right)^2 (\log N)^4 < q, \qquad q < \left(\tfrac{1.0012}{0.09}\right)^2 \frac{N}{(\log N)^5}.3100≤logN,(1.00120.28​)2(logN)4<q,q<(0.091.0012​)2(logN)5N​.

Then

(5q+1.5 qlog⁡q)log⁡N≤0.0006 N q (log⁡N)5/2.\left(5q + 1.5\, q \log q\right) \log N \le 0.0006\, \sqrt{N}\, \sqrt{q}\, (\log N)^{5/2}.(5q+1.5qlogq)logN≤0.0006N​q​(logN)5/2.

The decimal literals are exact rationals. ⋅\sqrt{\cdot}⋅​ is the nonnegative square root, and (log⁡N)5/2(\log N)^{5/2}(logN)5/2 is a real power of a positive base. Edge cases: the first hypothesis forces q≥1q \ge 1q≥1, so log⁡q\log qlogq is never log⁡0\log 0log0. The hypothesis 3100≤log⁡N3100 \le \log N3100≤logN forces N≥e3100N \ge e^{3100}N≥e3100, so (log⁡N)5≠0(\log N)^5 \ne 0(logN)5=0 and there is no division by zero. Not vacuous: for every NNN with log⁡N≥3100\log N \ge 3100logN≥3100, the admissible qqq form a nonempty set of integers. Both hypotheses are strict; the conclusion is non-strict.

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