Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit asymptotic for the difference count

Proved
LL_Decomp1537b.abs_I1_sub

by sthubbar · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

For all natural numbers N,N1N,N_1N,N1​ and every integer hhh, one has ∣I(h)−N∣≤∣h∣+N1+1|I(h)-N|\le|h|+N_1+1∣I(h)−N∣≤∣h∣+N1​+1.

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 NNN, N1N_1N1​ and every integer hhh, the following holds in R\mathbb{R}R, where I1(N,N1,h)\mathrm{I1}(N,N_1,h)I1(N,N1​,h) is the value of the imported item I1\mathrm{I1}I1 at (N,N1,h)(N,N_1,h)(N,N1​,h), cast to R\mathbb{R}R:

∣I1(N,N1,h)−N∣≤∣h∣+N1+1.\left|\mathrm{I1}(N,N_1,h) - N\right| \le |h| + N_1 + 1.∣I1(N,N1​,h)−N∣≤∣h∣+N1​+1.

Here NNN and N1N_1N1​ are cast from N\mathbb{N}N to R\mathbb{R}R, hhh is cast from Z\mathbb{Z}Z to R\mathbb{R}R, and ∣h∣|h|∣h∣ is the real absolute value of that cast. The inequality is non-strict and has no further hypotheses, so it covers N=0N=0N=0, N1=0N_1=0N1​=0 and h=0h=0h=0. The statement contains no natural subtraction or division. The definition of I1\mathrm{I1}I1 lies in another item and is not shown here, so whether the bound is strong, and what junk values I1\mathrm{I1}I1 may take, cannot be checked from this text. The declaration ends in sorry, so it asserts the bound without a proof.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

  • Endorsed by sthubbar · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me