Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

gˉ(R)/Q\bar g(R)/Qgˉ​(R)/Q is a lower bound on the long-run cost of any feasible policy

Proved
InventoryControl.rq_policy_lower_bound

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventory-controloperations-researchoptimal-controlreorder-pointstochastic-processes

The first half of Proposition 6.1. Under compound Poisson demand with the aperiodicity assumption, let orders be restricted to multiples of a batch quantity Q≥1Q \ge 1Q≥1 and be triggered only by demands, let the lead-time demand distribution be that of the demand over an interval of length L≥0L \ge 0L≥0, let ggg be its holding-plus-shortage cost rate with h,b1>0h, b_1 > 0h,b1​>0, and let RRR minimize gˉ(y)=∑j=1Qg(y+j)\bar g(y) = \sum_{j=1}^{Q} g(y+j)gˉ​(y)=∑j=1Q​g(y+j). Then for every ordering rule mmm whatsoever and every initial position y0y_0y0​, almost surely,

lim inf⁡T→∞ 1T∫0Tg(yt−Lm) dt  ≥  gˉ(R)Q,\liminf_{T \to \infty}\ \frac{1}{T}\int_0^T g\big(y^{m}_{t-L}\big)\,\mathrm{d}t \;\ge\; \frac{\bar g(R)}{Q},T→∞liminf​ T1​∫0T​g(yt−Lm​)dt≥Qgˉ​(R)​,

where ytmy^m_tytm​ is the inventory position under mmm.

The argument is pathwise: every policy's position is congruent modulo QQQ to y0−SN(t)y_0 - S_{N(t)}y0​−SN(t)​, so by Lemma 6.1 its cost rate is at least g(yt′)g(y_t')g(yt′​) at every instant, and the long-run average of g(yt′)g(y_t')g(yt′​) is gˉ(R)/Q\bar g(R)/Qgˉ​(R)/Q. No measurability, adaptedness or stability of the rule is needed; a rule under which the position drifts to infinity simply has infinite average cost.

Formalization Note "lim inf⁡≥c\liminf \ge climinf≥c" is written without a liminf: for every ε>0\varepsilon > 0ε>0 the average eventually exceeds c−εc - \varepsilonc−ε. The lead-time demand law DDD is tied to the process by the hypothesis that DDD is the distribution of the demand in (0,L](0, L](0,L].

Preamble
import Definitions.Def_InventoryControl_rqPolicy
Formal statement
namespace InventoryControl

theorem rq_policy_lower_bound {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] (X : CompoundPoissonDemand P) (D : DiscreteDemand)
    (h b1 L : ℝ) (hh : 0 < h) (hb : 0 < b1) (hL : 0 ≤ L)
    (hD : ∀ j : ℕ, D.p j = P.real {ω | X.cumDemand (X.count L ω) ω = j})
    (Q : ℕ) (hQ : 0 < Q) (R : ℤ)
    (hR : ∀ y : ℤ, windowCost D h b1 Q R ≤ windowCost D h b1 Q y) (y0 : ℤ)
    (m : ℕ → Ω → ℕ) :
    ∀ᵐ ω ∂P, ∀ ε : ℝ, 0 < ε →
      ∀ᶠ T in Filter.atTop, windowCost D h b1 Q R / Q - ε ≤ avgCost X D h b1 L Q y0 m T ω := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 115, Sect. 6.2.1, proof of Proposition 6.1: 'From Lemma 6.1 we know that g(yt) >= g(y't) ... Consequently, the long-run average cost must be greater than or equal to the long-run average value of g(y't) ... This is a lower bound on the long-run cost of any feasible policy'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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