Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: strict gap for the whole classical class, remainder varying by outcome

Proved
TwoStageRnQ.impossibility_strict_inf_rand

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

inventoryoperations-research

Theorem 2 with a strict gap for the whole classical class, the upstream remainder varying by outcome. Let ρ∘=(1+3)/2\rho_\circ=(1+\sqrt3)/2ρ∘​=(1+3​)/2. For every r<ρ∘r<\rho_\circr<ρ∘​ there is an instance with λ,L1,L2,h1,h2,p,K1,K2>0\lambda,L_1,L_2,h_1,h_2,p,K_1,K_2>0λ,L1​,L2​,h1​,h2​,p,K1​,K2​>0 and 0<OPTsh<∞0<\mathrm{OPT}^{\mathrm{sh}}<\infty0<OPTsh<∞ such that

r OPTsh<inf⁡S, cCSsh(c),r OPTsh<inf⁡S, cCSlot(c),r\,\mathrm{OPT}^{\mathrm{sh}}<\inf_{S,\,c}C^{\mathrm{sh}}_S(c),\qquad r\,\mathrm{OPT}^{\mathrm{sh}}<\inf_{S,\,c}C^{\mathrm{lot}}_S(c),rOPTsh<S,cinf​CSsh​(c),rOPTsh<S,cinf​CSlot​(c), r OPTsh<inf⁡Csh(π),r OPTsh<inf⁡C(Q,nQ)lot(π).r\,\mathrm{OPT}^{\mathrm{sh}}<\inf C^{\mathrm{sh}}(\pi),\qquad r\,\mathrm{OPT}^{\mathrm{sh}}<\inf C^{\mathrm{lot}}_{(Q,nQ)}(\pi).rOPTsh<infCsh(π),rOPTsh<infC(Q,nQ)lot​(π).

The first two infima run over all demand environments and all classical controls of the counter construction. The last two run over every demand environment SSS, every shipment policy π\piπ and all fixed controls (R1,R2,Q,n)(R_1,R_2,Q,n)(R1​,R2​,Q,n) such that π\piπ follows the classical rule from a compatible initialization whose upstream remainder is any time-0 random variable (RuleRand.FollowsRnQRand). The benchmark is OPTsh\mathrm{OPT}^{\mathrm{sh}}OPTsh in all four comparisons, and the class contains a policy whose costs are finite in both accountings, so the strict inequalities are not satisfied by an empty infimum.

Formalization Note This extends TwoStageRnQ.impossibility_strict_inf, whose policy infima cover compatible initializations with a fixed remainder (part of the controls). Together with TwoStageRnQ.paper_rule_follows_rand it covers every compatible initialization of the paper, with fixed or outcome-dependent remainder.

Preamble
import Definitions.Def_TwoStageRnQ_RuleRand
Formal statement
namespace TwoStageRnQ

theorem impossibility_strict_inf_rand (r : ℝ) (hr : r < (1 + Real.sqrt 3) / 2) :
    ∃ P : Params, 0 < P.lam ∧ 0 < P.L1 ∧ 0 < P.L2 ∧ 0 < P.h1 ∧ 0 < P.h2 ∧ 0 < P.p ∧
      0 < P.K1 ∧ 0 < P.K2 ∧ 0 < OPTsh P ∧ OPTsh P < ⊤ ∧
      ENNReal.ofReal r * OPTsh P
        < ⨅ (S : DemandSpace P) (c : ClassicalControls), classicalShipCost P S c ∧
      ENNReal.ofReal r * OPTsh P
        < ⨅ (S : DemandSpace P) (c : ClassicalControls), classicalLotCost P S c ∧
      ENNReal.ofReal r * OPTsh P
        < ⨅ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 : ℤ) (R2 : ℤ) (Q : ℕ+)
            (n : ℕ+) (_ : RuleRand.FollowsRnQRand S π R1 R2 Q n), π.shipCost ∧
      ENNReal.ofReal r * OPTsh P
        < ⨅ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 : ℤ) (R2 : ℤ) (Q : ℕ+)
            (n : ℕ+) (_ : RuleRand.FollowsRnQRand S π R1 R2 Q n), π.lotCost (Q, n * Q) ∧
      ∃ (S : DemandSpace P) (π : ShipmentPolicy P S) (R1 R2 : ℤ) (Q n : ℕ+),
        RuleRand.FollowsRnQRand S π R1 R2 Q n ∧ π.shipCost < ⊤ ∧ π.lotCost (Q, n * Q) < ⊤ := 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. Theorem 2, eq. (28); Appendix E; Appendices A.2-A.3 (compatible initialization, Lemma A.2).
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