Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 30 — with K=⌈log⁡log⁡T/log⁡(6/5)⌉K = \lceil \log\log T/\log(6/5)\rceilK=⌈loglogT/log(6/5)⌉, T(5/6)K≤eT^{(5/6)^K} \le eT(5/6)K≤e

Proved
ResolvingNRM.IRT.tau_Kirt_le_exp_one

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)⌉ be the number of re-solves of the IRT policy. For every real T≥1T \ge 1T≥1,

T(5/6)K(T)≤e.T^{(5/6)^{K(T)}} \le e .T(5/6)K(T)≤e.

In words: the time remaining at the last re-solving time of IRT, τK=T(5/6)K\tau_K = T^{(5/6)^K}τK​=T(5/6)K, is at most eee, so the last epoch of IRT, where no thresholds are used, has bounded length.

Formalization Note For 1≤T≤e1 \le T \le e1≤T≤e the printed formula for KKK is undefined (T=1T = 1T=1, log⁡0\log 0log0) or negative; with Lean's conventions log⁡0=0\log 0 = 0log0=0 and ⌈y⌉N=0\lceil y\rceil_{\mathbb N} = 0⌈y⌉N​=0 for y≤0y \le 0y≤0, K(T)=0K(T) = 0K(T)=0 there and the claim reads T≤eT \le eT≤e.

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 tau_Kirt_le_exp_one (T : ℝ) (hT : 1 ≤ T) :
    T ^ ((5 / 6 : ℝ) ^ Kirt T) ≤ Real.exp 1 := 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, first line ('using the fact that T^{(5/6)^K} ≤ e'); K defined in Algorithm 3, p. 15
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