Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — E[C(TB)]≤E[C(P)]+2K⋅E[N]E[\mathcal C(TB)] \le E[\mathcal C(P)] + 2K\cdot E[N]E[C(TB)]≤E[C(P)]+2K⋅E[N]

Proved
LeviBalancing.TripleBalancing.lemma_6_2

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

approximation-algorithminventory-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-lot-sizing

Let TB be the triple-balancing policy for a stochastic lot-sizing model with conditional demand law III, and let NNN be the number of orders TB places. Then every feasible policy PPP satisfies

E[C(TB)]≤E[C(P)]+2K⋅E[N].E[\mathcal C(TB)]\le E[\mathcal C(P)]+2K\cdot E[N].E[C(TB)]≤E[C(P)]+2K⋅E[N].

The paper writes E[C(TB)−C(OPT)]≤2K⋅E[N]E[\mathcal C(TB)-\mathcal C(OPT)]\le 2K\cdot E[N]E[C(TB)−C(OPT)]≤2K⋅E[N] for an optimal policy OPT. The additive form is the same inequality whenever the expectations are finite, and it remains meaningful when E[C(P)]=∞E[\mathcal C(P)]=\inftyE[C(P)]=∞; the proof uses only the feasibility of OPT. Together with Lemma 6.1 it gives Theorem 6.1.

Formalization Note All quantities are in [0,∞][0,\infty][0,∞] (lower Lebesgue integrals).

Preamble
import Mathlib
import Definitions.Def_LeviBalancing_TripleBalancing_Model
import Definitions.Def_LeviBalancing_TripleBalancing_Policy
import Definitions.Def_LeviBalancing_TripleBalancing_TBPolicy

open MeasureTheory ProbabilityTheory
Formal statement
namespace LeviBalancing.TripleBalancing

/-- Lemma 6.2 (p. 300), stated for every feasible policy `P` in place of an optimal policy and in
additive form: `E[𝒞(TB)] ≤ E[𝒞(P)] + 2K · E[N]`. -/
theorem lemma_6_2 {Ω : Type*} [MeasurableSpace Ω] (M : LotSizingModel Ω)
    (I : ℕ → Kernel Ω (ℕ → ℝ)) (hI : M.IsCondDemandLaw I)
    (TB : ℕ → Ω → ℝ) (hTB : IsTripleBalancing M I TB)
    (P : ℕ → Ω → ℝ) (hP : IsFeasiblePolicy M P) :
    expectedCost M TB ≤
      expectedCost M P + 2 * ENNReal.ofReal M.K * ∫⁻ ω, (numOrders M TB ω : ENNReal) ∂M.μ := by sorry

end LeviBalancing.TripleBalancing
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. 300 (PDF 17), Lemma 6.2
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