Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 30 — the right-hand side of (13) at K=K(T)K = K(T)K=K(T) is bounded uniformly in TTT

Proved
ResolvingNRM.IRT.schedule_sum_bounded

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

analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1re-solving

Let K(T)=⌈log⁡log⁡T/log⁡(6/5)⌉K(T) = \lceil \log\log T / \log(6/5) \rceilK(T)=⌈loglogT/log(6/5)⌉. For every κ>0\kappa > 0κ>0 there is a constant BBB such that for every real T≥1T \ge 1T≥1,

∑u=0K(T)−1T(5/6)uexp⁡(−κ T(5/6)u/6)+T(5/6)K(T)/2≤B.\sum_{u=0}^{K(T)-1} T^{(5/6)^u}\exp\big(-\kappa\,T^{(5/6)^u/6}\big) + T^{(5/6)^{K(T)}/2} \le B .u=0∑K(T)−1​T(5/6)uexp(−κT(5/6)u/6)+T(5/6)K(T)/2≤B.

This is the analytic half of the proof of Theorem 1: it shows that both terms of the regret decomposition (13), evaluated at the IRT schedule, are O(1)O(1)O(1).

Formalization Note Only the bound is stated, not the chain of inequalities printed on p. 30; its second inequality replaces x=T(5/6)K−ℓx = T^{(5/6)^{K-\ell}}x=T(5/6)K−ℓ by the upper bound e(6/5)ℓe^{(6/5)^\ell}e(6/5)ℓ inside xe−κx1/6x e^{-\kappa x^{1/6}}xe−κx1/6, a function that is not increasing for x>(6/κ)6x > (6/\kappa)^6x>(6/κ)6. The bound itself holds because T(5/6)K−ℓ≥e(6/5)ℓ−1T^{(5/6)^{K-\ell}} \ge e^{(6/5)^{\ell-1}}T(5/6)K−ℓ≥e(6/5)ℓ−1 grows doubly exponentially in ℓ\ellℓ. The convention for K(T)K(T)K(T) at 1≤T≤e1 \le T \le e1≤T≤e is that of the definition file (K=0K = 0K=0).

Preamble
import Mathlib
import Definitions.Def_RLPBidPrice_Unbiased_Model
import Definitions.Def_ResolvingNRM_IRT_Model

open RLPBidPrice.Unbiased Matrix
Formal statement
namespace ResolvingNRM.IRT

theorem schedule_sum_bounded (κ : ℝ) (hκ : 0 < κ) :
    ∃ B : ℝ, ∀ T : ℝ, 1 ≤ T →
      (∑ u ∈ Finset.range (Kirt T),
          T ^ ((5 / 6 : ℝ) ^ u) * Real.exp (-κ * T ^ ((5 / 6 : ℝ) ^ u / 6))) +
        T ^ ((5 / 6 : ℝ) ^ Kirt T / 2) ≤ B := by sorry

end ResolvingNRM.IRT
Source
Bumpensanti, Wang, A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management, arXiv:1802.06192v3, Appendix B.1, p. 30 (bound on the right-hand side of (13))
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