Lemma 6.5 numerics, first term
ProvedLL_Decomp1543c.n65anumber-theory
For natural with and , one has .
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_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
Let , with the real natural logarithm applied to and to cast to . Assume
Then
The decimal literals are exact rationals. is the nonnegative square root, and is a real power of a positive base. Edge cases: the first hypothesis forces , so is never . The hypothesis forces , so and there is no division by zero. Not vacuous: for every with , the admissible form a nonempty set of integers. Both hypotheses are strict; the conclusion is non-strict.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.