Endpoint and logarithmic bounds for the dyadic count
ProvedLL_Decomp1543a.J_propsnumber-theory
For natural and positive real satisfying , let . Then and , with natural-number subtraction in .
Preamble
import Mathlib import Definitions.Def_LL_Decomp1543a_Jn open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543a
theorem J_props (N : ℕ) (U V : ℝ) (hU : 0 < U) (hV : 0 < V) (hUV : U * V ≤ N) :
2 ^ (Jn N U V - 1) * V ≤ N / U ∧
(Jn N U V : ℝ) ≤ 1 + Real.log (N / (U * V)) / Real.log 2 := by sorry
end LL_Decomp1543aSource
M. C. Liu and T. Z. Wang, On the Vinogradov bound in the three primes Goldbach conjecture, Acta Arith. 105, 2002, p. 170, equation 6.10. https://doi.org/10.4064/aa105-2-3
Read-back
What the Lean code literally says, in plain math · claude-haiku
For a natural number and real numbers , assume , , and , with cast to . Write for the value of Jn at ; its definition is not given in this text. The statement asserts both of the following.
Here is the real natural logarithm, all divisions are real, and the second inequality casts to . Since , no denominator is zero. If is natural-valued, then truncates: when , . The hypothesis forces , so the case is vacuous. For the hypotheses are satisfiable, for example . The type of is not stated in this text.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.