Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The weighted sum at the pole

Proved
LL_Decomp1537b.Irho_one_one

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,1,1)=I(h)I(h,1,1)=I(h)I(h,1,1)=I(h).

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1537b_I1
import Definitions.Def_LL_Decomp1537b_Irho

open Finset Real
Formal statement
namespace LL_Decomp1537b
theorem Irho_one_one (N N1 : ℕ) (h : ℤ) : Irho N N1 h 1 1 = I1 N N1 h := 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 and N1N_1N1​ (including N=0N = 0N=0 and N1=0N_1 = 0N1​=0) and every integer hhh, the statement asserts that

Iρ(N,N1,h; 1,1)=I1(N,N1,h).I_\rho(N, N_1, h;\, 1, 1) = I_1(N, N_1, h).Iρ​(N,N1​,h;1,1)=I1​(N,N1​,h).

The left side is IρI_\rhoIρ​ evaluated at (N,N1,h)(N, N_1, h)(N,N1​,h) and then at the two further arguments 111 and 111, whose types and meaning are fixed by the signature of IρI_\rhoIρ​ in another module. The right side is I1I_1I1​ evaluated at (N,N1,h)(N, N_1, h)(N,N1​,h). Both sides are taken in whatever type those functions return, which this text does not show, so no explicit cast appears. The statement contains no division and no natural subtraction. There are no other hypotheses, so the equality is claimed unconditionally for all these inputs.

The proof is a placeholder, so this file asserts the equality without proving it. The meanings of IρI_\rhoIρ​ and I1I_1I1​ are not given here.

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