Lemma 6.6 numerics, second term
ProvedLL_Decomp1543c.n66bnumber-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 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_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 be natural numbers. The hypotheses are , where is the real logarithm of , so ; ; and , with cast to a real. All operations are real, and , so the bounds involve no division by zero. The conclusion is
Here denotes the natural logarithm, and and are real powers. and 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 , , or . The interval for is nonempty for large . The proof is sorry, so the statement is unproven.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.