Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Telescoping: ∑t=1TΨ(It−1/c)(It−1−It)=∑k=IT+1cΨ(k/c)\sum_{t=1}^T\Psi(I^{t-1}/c)(I^{t-1}-I^t)=\sum_{k=I^T+1}^{c}\Psi(k/c)∑t=1T​Ψ(It−1/c)(It−1−It)=∑k=IT+1c​Ψ(k/c)

Proved
PersonalizedAssortment.IB.telescoping_sum

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsinventoryp2o-batch-rm-cafterp2o-gran-per-chapterp2o-plan-paperp2o-v1telescoping-sums

Let Ψ:R→R\Psi:\mathbb R\to\mathbb RΨ:R→R be any function and ccc a natural number. Let I0,I1,…,ITI^0,I^1,\dots,I^TI0,I1,…,IT be natural numbers with I0=cI^0=cI0=c that fall by 000 or 111 in each step: It−1−It∈{0,1}I^{t-1}-I^t\in\{0,1\}It−1−It∈{0,1} for 1≤t≤T1\le t\le T1≤t≤T. Then

∑t=1TΨ ⁣(It−1c)(It−1−It)  =  ∑k=IT+1cΨ ⁣(kc).\sum_{t=1}^{T}\Psi\!\left(\frac{I^{t-1}}{c}\right)\left(I^{t-1}-I^{t}\right)\;=\;\sum_{k=I^T+1}^{c}\Psi\!\left(\frac kc\right).t=1∑T​Ψ(cIt−1​)(It−1−It)=k=IT+1∑c​Ψ(ck​).

Each unit sold is counted once, at the inventory level just before its sale. This is the pathwise content of the final equality in the paper's computation of the expected dual objective.

Formalization Note The path is indexed from 000. The left side is written ∑t=0T−1Ψ(It/c)(It−It+1)\sum_{t=0}^{T-1}\Psi(I_t/c)(I_t-I_{t+1})∑t=0T−1​Ψ(It​/c)(It​−It+1​) with real-valued differences, and the right side sums over the integers kkk with IT<k≤cI_T<k\le cIT​<k≤c.

Preamble
import Mathlib
Formal statement
namespace PersonalizedAssortment.IB

/-- The final equality of the expected-dual display in §A.3 (p. 1549), pathwise: if the inventory
of a product starts at `c` and falls by `0` or `1` in each of `T` periods, then
`∑_{t=1}^T Ψ(I^{t-1}/c)(I^{t-1} - I^t) = ∑_{k=I^T+1}^{c} Ψ(k/c)` (the `k`th sold unit
contributes `Ψ((c - k + 1)/c)`). Periods are indexed from `0` here. -/
theorem telescoping_sum (Ψ : ℝ → ℝ) (c : ℕ) (T : ℕ) (I : ℕ → ℕ) (hI0 : I 0 = c)
    (hstep : ∀ t < T, I (t + 1) ≤ I t ∧ I t ≤ I (t + 1) + 1) :
    ∑ t ∈ Finset.range T, Ψ ((I t : ℝ) / (c : ℝ)) * ((I t : ℝ) - (I (t + 1) : ℝ)) =
      ∑ k ∈ Finset.Ioc (I T) c, Ψ ((k : ℝ) / (c : ℝ)) := by sorry

end PersonalizedAssortment.IB
Source
Golrezaei, Nazerzadeh, Rusmevichientong, Real-Time Optimization of Personalized Assortments, Management Sci. 60(6), 2014, https://doi.org/10.1287/mnsc.2014.1939, p. 1549, Section A.3, proof of Theorem 1, first paragraph ('The final equality follows because the kth sold unit ...')
Read-back

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

Let Ψ:R→R\Psi : \mathbb R\to\mathbb RΨ:R→R be an arbitrary function; nothing at all is assumed about it. Let ccc and TTT be natural numbers. Let I0,I1,I2,…I_0, I_1, I_2, \dotsI0​,I1​,I2​,… be a sequence of natural numbers such that:

  • I0=cI_0 = cI0​=c;
  • for every t<Tt < Tt<T, It+1≤It≤It+1+1I_{t+1} \le I_t \le I_{t+1} + 1It+1​≤It​≤It+1​+1, so each of the first TTT steps decreases the value by 000 or 111.

Values ItI_tIt​ for t>Tt > Tt>T are unconstrained and do not appear. The statement asserts

∑t=0T−1Ψ ⁣(Itc)(It−It+1)  =  ∑k=IT+1cΨ ⁣(kc).\sum_{t=0}^{T-1} \Psi\!\left(\frac{I_t}{c}\right)\big(I_t - I_{t+1}\big) \;=\; \sum_{k = I_T + 1}^{c} \Psi\!\left(\frac kc\right).t=0∑T−1​Ψ(cIt​​)(It​−It+1​)=k=IT​+1∑c​Ψ(ck​).

The differences on the left are taken in the reals. On the right, kkk runs over the integers in (IT,c](I_T, c](IT​,c].

Degenerate cases.

  • If T=0T = 0T=0, both sides are 000: the left is an empty sum, and the right runs over the empty range (c,c](c, c](c,c].
  • If c=0c = 0c=0, the hypotheses force I0=⋯=IT=0I_0 = \dots = I_T = 0I0​=⋯=IT​=0. Every ratio uses x/0=0x/0 = 0x/0=0, and both sides are 000.
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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