Explicit asymptotic for the difference count
ProvedLL_Decomp1537b.abs_I1_subnumber-theory
For all natural numbers and every integer , one has .
Preamble
import Mathlib import Definitions.Def_LL_Decomp1537b_I1 open Finset Real
Formal statement
namespace LL_Decomp1537b theorem abs_I1_sub (N N1 : ℕ) (h : ℤ) : |(I1 N N1 h : ℝ) - N| ≤ |(h : ℝ)| + N1 + 1 := by sorry end LL_Decomp1537b
Source
J. Pintz and I. Z. Ruzsa, On Linnik's approximation to Goldbach's problem II, Acta Mathematica Hungarica, 2020; Section 2, display (2.17), p. 4
Read-back
What the Lean code literally says, in plain math · claude-haiku
For all natural numbers , and every integer , the following holds in , where is the value of the imported item at , cast to :
Here and are cast from to , is cast from to , and is the real absolute value of that cast. The inequality is non-strict and has no further hypotheses, so it covers , and . The statement contains no natural subtraction or division. The definition of lies in another item and is not shown here, so whether the bound is strong, and what junk values may take, cannot be checked from this text. The declaration ends in sorry, so it asserts the bound without a proof.
Human review
Confirmed by the mission captain (proposal self-audit).