Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The weighted difference sum

Definition
LL_Decomp1537b_Irho

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

For natural numbers N,N1N,N_1N,N1​, an integer hhh and complex numbers ρ,ρ′\rho,\rho'ρ,ρ′, let I(h,ρ,ρ′)=∑mρ−1(m−h)ρ′−1I(h,\rho,\rho')=\sum m^{\rho-1}(m-h)^{\rho'-1}I(h,ρ,ρ′)=∑mρ−1(m−h)ρ′−1, the sum over natural numbers mmm with N1<m<NN_1<m<NN1​<m<N and N1<m−h<NN_1<m-h<NN1​<m−h<N, with complex powers taken via the principal branch as in Mathlib.

Definition code
import Mathlib

namespace LL_Decomp1537b

open Finset Real

noncomputable def Irho (N N1 : ℕ) (h : ℤ) (ρ ρ' : ℂ) : ℂ :=
  ∑ m ∈ (Ioo N1 N).filter (fun m : ℕ => (N1 : ℤ) < (m : ℤ) - h ∧ (m : ℤ) - h < N),
    (m : ℂ) ^ (ρ - 1) * (((m : ℤ) - h : ℤ) : ℂ) ^ (ρ' - 1)

end LL_Decomp1537b
Read-back

What the Lean code literally says, in plain math · claude-haiku

Iρ(N,N1,h,ρ,ρ′)I_\rho(N, N_1, h, \rho, \rho')Iρ​(N,N1​,h,ρ,ρ′) is a complex number, where N,N1N, N_1N,N1​ are natural numbers, hhh is an integer, and ρ,ρ′\rho, \rho'ρ,ρ′ are arbitrary complex numbers. It is the sum, over all natural numbers mmm with N1<m<NN_1 < m < NN1​<m<N and, in the integers, N1<m−h<NN_1 < m - h < NN1​<m−h<N, of

mρ−1 (m−h)ρ′−1.m^{\rho-1}\,(m-h)^{\rho'-1}.mρ−1(m−h)ρ′−1.

Here mmm is cast to C\mathbb{C}C, and m−hm-hm−h is formed as an integer before casting. Equivalently, mmm runs over integers with N1+max⁡(h,0)<m<N+min⁡(h,0)N_1 + \max(h,0) < m < N + \min(h,0)N1​+max(h,0)<m<N+min(h,0), so hhh shifts and can shrink the window. The sum is empty, and hence 000, whenever this interval contains no integer, for example when N≤N1+1N \le N_1 + 1N≤N1​+1. Both bases are positive integers, since m>N1≥0m > N_1 \ge 0m>N1​≥0 and m−h>N1≥0m - h > N_1 \ge 0m−h>N1​≥0, so the powers are ordinary principal powers of positive reals, with no zero base and no branch-cut junk value. Both bounds are strict, and ρ,ρ′\rho, \rho'ρ,ρ′ are unrestricted.

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