Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 36 — Σ_{t<T} √(Σ_{i<t} 1/(T−i−1)²) ≤ 2√T + √2

Proved
ResolvingNRM.FRUpper.sqrt_sum_bound

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

inequalityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

For every integer T≥1T \ge 1T≥1,

∑t=0T−1∑i=0t−11(T−i−1)2 ≤ 2T+2.\sum_{t=0}^{T-1} \sqrt{\sum_{i=0}^{t-1} \frac{1}{(T - i - 1)^2}} \ \le\ 2\sqrt{T} + \sqrt{2}.t=0∑T−1​i=0∑t−1​(T−i−1)21​​ ≤ 2T​+2​.

This is the analytic step of the proof of Proposition 3 that turns the per-period bounds of Lemma 8 into the O(T)O(\sqrt{T})O(T​) total: the ttt-th summand is of order 1/T−t1/\sqrt{T - t}1/T−t​, and these sum to order T\sqrt{T}T​.

Formalization Note. For t≤T−1t \le T - 1t≤T−1 and i≤t−1i \le t - 1i≤t−1 the denominator T−i−1T - i - 1T−i−1 is at least 111, so no division by zero occurs. An empty inner sum (at t=0t = 0t=0) is 000.

Preamble
import Mathlib
import Definitions.Def_RLPBidPrice_Unbiased_Model
import Definitions.Def_ResolvingNRM_FRUpper_Model

open RLPBidPrice.Unbiased Matrix
Formal statement
namespace ResolvingNRM.FRUpper

/-- The summation chain of App. C.2, p. 36:
`∑_{t=0}^{T-1} √(∑_{i=0}^{t-1} 1 / (T − i − 1)²) ≤ 2√T + √2` for every integer `T ≥ 1`. -/
theorem sqrt_sum_bound (T : ℕ) (hT : 1 ≤ T) :
    ∑ t ∈ Finset.range T, Real.sqrt (∑ i ∈ Finset.range t, 1 / ((T : ℝ) - i - 1) ^ 2)
      ≤ 2 * Real.sqrt T + Real.sqrt 2 := by sorry

end ResolvingNRM.FRUpper
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, App. C.2, chain of inequalities at the top of p. 36
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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