Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3, p. 294 — ∑t∈TΠΠtB≤ΠP\sum_{t\in\mathcal T_\Pi} \Pi_t^B \le \Pi^{P}∑t∈TΠ​​ΠtB​≤ΠP on every realization

Proved
LeviBalancing.DualBalancing.backlog_on_TPi_le

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

approximation-algorithmsinventory-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix an instance, a realization of the demands d1,…,dT≥0d_1, \dots, d_T \ge 0d1​,…,dT​≥0, and two order sequences QB,QPQ^B, Q^PQB,QP with nonnegative orders in periods 1,…,T1, \dots, T1,…,T. Let YtBY^B_tYtB​ and YtPY^P_tYtP​ be the resulting inventory positions after ordering, and let

TΠ={ t∈{1,…,T−L}:YtB≥YtP }\mathcal T_\Pi = \{\, t \in \{1, \dots, T-L\} : Y^B_t \ge Y^P_t \,\}TΠ​={t∈{1,…,T−L}:YtB​≥YtP​}

be the periods in which BBB holds at least as much inventory as PPP. Then the marginal backlogging cost of BBB over these periods is at most the total marginal backlogging cost of PPP:

∑t∈TΠΠtB  ≤  ΠP:=∑t=1T−LΠtP.\sum_{t \in \mathcal T_\Pi} \Pi^B_t \;\le\; \Pi^P := \sum_{t=1}^{T-L} \Pi^P_t .t∈TΠ​∑​ΠtB​≤ΠP:=t=1∑T−L​ΠtP​.

This is the backlogging half of the pathwise comparison behind Theorem 4.1.

Formalization Note As for Lemma 4.2, the statement holds for every realization and every pair of nonnegative order sequences, which strengthens the page's "for the dual-balancing policy and OPT, with probability one". ΠOPT\Pi^{OPT}ΠOPT is read as the marginal total ∑t=1T−LΠtP\sum_{t=1}^{T-L}\Pi^P_t∑t=1T−L​ΠtP​ of Eq. (4).

Preamble
import Mathlib
import Definitions.Def_LeviBalancing_DualBalancing_Model
open Finset
Formal statement
namespace LeviBalancing.DualBalancing

/-- Lemma 4.3, p. 294 (pathwise): for every demand realization and any two order processes with
nonnegative orders, the marginal backlogging cost of `B` over the periods
`𝒯_Π = {t : Y_t^B ≥ Y_t^P}` is at most the total marginal backlogging cost
`Π^P = ∑_{t=1}^{T−L} Π_t^P` of `P`. -/
theorem backlog_on_TPi_le (I : Instance) (d : ℤ → ℝ)
    (hd : ∀ t : ℤ, 1 ≤ t → t ≤ (I.T : ℤ) → 0 ≤ d t) (qB qP : ℤ → ℝ)
    (hqB : ∀ t : ℤ, 1 ≤ t → t ≤ (I.T : ℤ) → 0 ≤ qB t)
    (hqP : ∀ t : ℤ, 1 ≤ t → t ≤ (I.T : ℤ) → 0 ≤ qP t) :
    ∑ t ∈ (Icc (1 : ℤ) ((I.T : ℤ) - I.L)).filter
        (fun t => invPositionAfter I d qP t ≤ invPositionAfter I d qB t),
        marginalBacklog I d qB t ≤
      ∑ t ∈ Icc (1 : ℤ) ((I.T : ℤ) - I.L), marginalBacklog I d qP t := by sorry

end LeviBalancing.DualBalancing
Source
Levi, Pál, Roundy & Shmoys, Approximation Algorithms for Stochastic Inventory Control Models, Math. Oper. Res. 32(2):284–302 (2007), DOI 10.1287/moor.1060.0205, p. 294 (PDF p. 11), Lemma 4.3
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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