Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1: exact cost of the classical (R,nQ)(R,nQ)(R,nQ) rule

Proved
TwoStageRnQ.exact_cost_classical

by Ming Hu · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventoryoperations-research

Proposition 1 (exact cost of the classical rule).

Let λ>0\lambda>0λ>0 and let (Ω,F,P,N)(\Omega,\mathcal F,\mathbb P,N)(Ω,F,P,N) be any demand environment (two-sided Poisson history with an arbitrary initial count). For R1,R2∈ZR_1,R_2\in\mathbb ZR1​,R2​∈Z and Q,n≥1Q,n\ge1Q,n≥1, the classical rule with zero initial upstream remainder has

Clot=k1Q+k2nQ+In,Q(R1+Q, R2−R1),C^{\mathrm{lot}}=\frac{k_1}{Q}+\frac{k_2}{nQ}+I_{n,Q}(R_1+Q,\,R_2-R_1),Clot=Qk1​​+nQk2​​+In,Q​(R1​+Q,R2​−R1​),

and Csh≤ClotC^{\mathrm{sh}}\le C^{\mathrm{lot}}Csh≤Clot.

Formalization Note The initial count is arbitrary, so the residue of NNN modulo nQnQnQ is uniform only in the limit; the long-run average absorbs the transient (paper, Lemma A.1).

Preamble
import Definitions.Def_TwoStageRnQ_Model
Formal statement
namespace TwoStageRnQ

theorem exact_cost_classical (P : Params) (hlam : 0 < P.lam) (S : DemandSpace P)
    (R1 R2 : ℤ) (Q n : ℕ+) :
    classicalLotCost P S ⟨(R1, R2, Q, n, 0), Q.pos⟩
        = ENNReal.ofReal (P.classicalFormula R1 R2 Q n) ∧
      classicalShipCost P S ⟨(R1, R2, Q, n, 0), Q.pos⟩
        ≤ classicalLotCost P S ⟨(R1, R2, Q, n, 0), Q.pos⟩ := by sorry

end TwoStageRnQ
Source
M. Hu, "A 5/3 Guarantee for Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems", manuscript rq_167.tex (Sept. 28, 2026 version); posted as arXiv:2609.06318. Proposition 1, eq. (9); Proposition A.1, Lemma A.1.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Ming Hu · Nov 17, 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