Divisor bound for
ProvedLL_Decomp1543c.S3_lenumber-theory
For real , , and natural , , where .
Preamble
import Mathlib import Definitions.Def_LL_Decomp1543c_e import Definitions.Def_LL_Decomp1543c_nint import Definitions.Def_LL_Decomp1543c_minK import Definitions.Def_LL_Decomp1543c_rangeN import Definitions.Def_LL_Decomp1543c_Ssum import Definitions.Def_LL_Decomp1543c_lam3 open Real Finset ArithmeticFunction
Formal statement
namespace LL_Decomp1543c
theorem S3_le (c : ℝ) (hc : 0 ≤ c) (N : ℕ) (U V α : ℝ) (hU : 1 ≤ U) (hV : 1 ≤ V) :
‖Ssum (lam3 U V) c N α‖ ≤
Real.log (U * V) * ∑ k ∈ Icc 1 ⌊U * V⌋₊, minK ((N : ℝ) / k) (α * k) := 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, first line. https://doi.org/10.4064/aa105-2-3
Read-back
What the Lean code literally says, in plain math · claude-haiku
For reals , , , a real , and a natural number with no further bound, the statement asserts
where is the natural logarithm, is the natural-number floor, and and are cast to reals. The sum is over natural with , which is nonempty since . The codomain of the norm and the definitions of , and are not shown here. Nothing relates or to , and and are allowed. The statement ends in sorry, so it is unproved.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.