Lemma 6.5 numerics, third term
ProvedLL_Decomp1543c.n65cnumber-theory
For natural with and and , one has .
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_Decomp1543cSource
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 and with , , and , we have
Here and are cast to the reals, is the real natural logarithm, is the real square root, and all divisions are real. The function 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 with , so is a junk value when , and no positivity of is assumed. The first hypothesis forces , so and . The two bounds on force . Both hypotheses hold together for sufficiently large , so the statement is not vacuous.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.