Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.1: under the (R,Q)(R,Q)(R,Q) policy the inventory position is uniform on {R+1,…,R+Q}\{R+1,\dots,R+Q\}{R+1,…,R+Q}

Proved
InventoryControl.rq_position_uniform

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

inventory-controlmarkov-chainoperations-researchreorder-pointstochastic-processes

Proposition 5.1 in its ergodic form. Under compound Poisson demand whose demand sizes are not all multiples of some integer larger than one, an (R,Q)(R,Q)(R,Q) policy with Q≥1Q \ge 1Q≥1 started from any initial inventory position y0y_0y0​ spends, in the long run, a fraction 1/Q1/Q1/Q of the time at each of the positions R+1,…,R+QR+1, \dots, R+QR+1,…,R+Q: for every such jjj, almost surely

1T∫0T1{yN(t)=j} dt  ⟶  1Q(T→∞),\frac{1}{T}\int_0^T \mathbf{1}\{y_{N(t)} = j\}\,\mathrm{d}t \;\longrightarrow\; \frac{1}{Q} \qquad (T \to \infty),T1​∫0T​1{yN(t)​=j}dt⟶Q1​(T→∞),

where yny_nyn​ is the position after the nnn-th demand under the policy.

The book proves the proposition for the embedded chain at demand epochs by showing that the transition matrix is doubly stochastic (Eq. 5.33-5.34), which makes the uniform distribution stationary, and irreducibility, which comes from the aperiodicity assumption, makes it the unique one. Here the statement is about time averages, which is how the proposition is used: the cost of the (R,Q)(R,Q)(R,Q) policy is the average of ggg over the band. The initial position may lie above the band; the policy enters the band after finitely many demands and the initial segment does not affect the limit.

Preamble
import Definitions.Def_InventoryControl_rqPolicy
Formal statement
namespace InventoryControl

theorem rq_position_uniform {Ω : Type*} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω}
    [MeasureTheory.IsProbabilityMeasure P] (X : CompoundPoissonDemand P) (R : ℤ) (Q : ℕ)
    (hQ : 0 < Q) (y0 : ℤ) (j : ℤ) (hj1 : R + 1 ≤ j) (hj2 : j ≤ R + Q) :
    ∀ᵐ ω ∂P, Filter.Tendsto
      (fun T : ℝ => (1 / T) * ∫ t in (0 : ℝ)..T,
          (if rqIP X R Q y0 (X.count t ω) ω = j then (1 : ℝ) else 0))
      Filter.atTop (nhds (1 / (Q : ℝ))) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 74, Sect. 5.3.1, Proposition 5.1: 'In steady state the inventory position is uniformly distributed on the integers R + 1, R + 2, ..., R + Q'; used on p. 115: 'Using an (R, Q) policy the inventory position is also uniform on {R + 1, R + 2, ..., R + Q}'
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