Lemma 6.6 numerics, third term
ProvedLL_Decomp1543c.n66cnumber-theory
For natural with and , and , one has .
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_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.6. https://doi.org/10.4064/aa105-2-3
Read-back
What the Lean code literally says, in plain math · claude-haiku
Let . Assume (so , which excludes ) and
where and . Then, with all divisions and roots taken in (the casts make them real, so no natural-number truncation occurs):
and are functions of imported from other files, which were not read here; their types are unknown and they are cast to . Here is the real logarithm with and , so the left side equals whenever . The lower bound forces , so no division by zero occurs. For large the interval for is nonempty and contains integers, so the hypotheses are satisfiable and not vacuous.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.