Lemma 6.6 numerics, first term
ProvedLL_Decomp1543c.n66anumber-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 n66a (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 (Uf N * Vf N) ≤
0.0005 * √N * √q * Real.log N ^ (2.5 : ℝ) := 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 and be natural numbers, where (real natural logarithm), so . is excluded since . is cast to the reals.
Hypotheses (both strict, real division):
For every such this window for is nonempty, and follows.
Conclusion, where and are real numbers defined in imported files, not unfolded here:
The inequality is non-strict. Junk values: for and , so if the left side is . The proof is unfinished.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.