Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — P[X_t(S)·1^τ > S | X₁ = x₁] ≤ F(x₁·1^τ − S)^{t−τ}

Proved
AdaptiveBaseStock.Regret.position_tail

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

inventorymarkov-chainp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the lost-sales system with lead time τ≥1\tau \ge 1τ≥1 and i.i.d. continuous demand of infinite support, operated under the order-up-to-SSS policy with S≥0S \ge 0S≥0 from an initial inventory vector x1∈R+τx_1 \in \mathbb R^\tau_+x1​∈R+τ​. Then for every period t≥τt \ge \taut≥τ,

P[Xt(S)⋅1τ>S ∣ X1(S)=x1]≤F(x1⋅1τ−S)t−τ.\mathcal P\big[X_t(S)\cdot \mathbf 1^\tau > S \,\big|\, X_1(S) = x_1\big] \le F(x_1\cdot \mathbf 1^\tau - S)^{t-\tau}.P[Xt​(S)⋅1τ>S​X1​(S)=x1​]≤F(x1​⋅1τ−S)t−τ.

The inventory position can exceed SSS only while the initial excess has not been consumed, so this bounds the transient phase of the chain; together with the coalescence bound it yields the ergodicity rate of Theorem 3.

Formalization Note The conditioning on X1(S)=x1X_1(S) = x_1X1​(S)=x1​ is a deterministic start. Lean period ttt is the paper's period t+1t+1t+1, so the paper's t≥τt \ge \taut≥τ reads τ≤t+1\tau \le t+1τ≤t+1 and the exponent t−τt - \taut−τ reads t+1−τt + 1 - \taut+1−τ. Only the infinite-support case of the paper's lemma is stated.

Preamble
import Mathlib
import Definitions.Def_AdaptiveBaseStock_Regret_Model
Formal statement
namespace AdaptiveBaseStock.Regret

open MeasureTheory ProbabilityTheory

/-- Lemma 6 (infinite-support case), p. 16: under the order-up-to-`S` policy started from
`x₁ ∈ ℝ^τ_+`, `P[X_t(S) · 1^τ > S] ≤ F(x₁ · 1^τ - S)^{t-τ}` for every period `t ≥ τ`. Lean period
`t` is the paper's period `t + 1`, so the paper's `t ≥ τ` reads `τ ≤ t + 1` and its exponent
`t - τ` reads `t + 1 - τ`. -/
theorem position_tail {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (D : ℕ → Ω → ℝ) (hD : IsDemandModel P D) (hinf : HasInfiniteSupport P (D 0))
    (τ : ℕ) (hτ : 1 ≤ τ) (S : ℝ) (hS : 0 ≤ S) (x₁ : InvVec τ) (hx₁ : IsNonneg x₁)
    (t : ℕ) (ht : τ ≤ t + 1) :
    P.real {ω | S < position (run (fun _ => S) x₁ (fun n => D n ω) t)}
      ≤ demandCdf P (D 0) (position x₁ - S) ^ (t + 1 - τ) := by sorry

end AdaptiveBaseStock.Regret
Source
Huh, Janakiraman, Muckstadt, Rusmevichientong, An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand, working paper, February 8, 2007 (published version: Math. Oper. Res., 2009, DOI 10.1287/moor.1080.0367), Lemma 6 (first case), p. 16
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