Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: strict gap for the infimum over all classical controls and fixed-remainder initializations

Proved
TwoStageRnQ.impossibility_strict_inf

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. 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),

where the infima run over all demand environments SSS and all classical controls c=(R1,R2,Q,n,ρ)c=(R_1,R_2,Q,n,\rho)c=(R1​,R2​,Q,n,ρ) of the counter construction, and

r OPTsh<inf⁡(S,π,c): π follows cCsh(π),r OPTsh<inf⁡(S,π,c): π follows cC(Q,nQ)lot(π),r\,\mathrm{OPT}^{\mathrm{sh}}<\inf_{(S,\pi,c):\ \pi\text{ follows }c}C^{\mathrm{sh}}(\pi),\qquad r\,\mathrm{OPT}^{\mathrm{sh}}<\inf_{(S,\pi,c):\ \pi\text{ follows }c}C^{\mathrm{lot}}_{(Q,nQ)}(\pi),rOPTsh<(S,π,c): π follows cinf​Csh(π),rOPTsh<(S,π,c): π follows cinf​C(Q,nQ)lot​(π),

where π\piπ ranges over every shipment policy, on every demand environment, that follows the classical rule with controls c=(R1,R2,Q,n,ρ)c=(R_1,R_2,Q,n,\rho)c=(R1​,R2​,Q,n,ρ) from a compatible initialization whose upstream remainder W(0) mod QW(0)\bmod QW(0)modQ equals the fixed control ρ\rhoρ (Rule.FollowsRnQ). The benchmark is the shipment-accounted OPTsh\mathrm{OPT}^{\mathrm{sh}}OPTsh in all four comparisons.

Formalization Note The paper states inf⁡Π∈P(R,nQ)Csh(Π)>r OPTsh\inf_{\Pi\in\mathcal P_{(R,nQ)}}C^{\mathrm{sh}}(\Pi)>r\,\mathrm{OPT}^{\mathrm{sh}}infΠ∈P(R,nQ)​​Csh(Π)>rOPTsh and the same with ClotC^{\mathrm{lot}}Clot. The earlier target TwoStageRnQ.impossibility asserts strictness separately on each demand environment; this target asserts it for the infimum over all environments, all controls including the remainder ρ\rhoρ, and all compatible initializations whose remainder equals that fixed ρ\rhoρ, and records 0<OPTsh<∞0<\mathrm{OPT}^{\mathrm{sh}}<\infty0<OPTsh<∞ so that the ratio form is meaningful. Compatible initializations whose remainder varies with the outcome are covered by TwoStageRnQ.impossibility_strict_inf_rand, and TwoStageRnQ.paper_rule_follows_rand shows that every paper-compatible initialization belongs to that larger class.

Preamble
import Definitions.Def_TwoStageRnQ_Rule
Formal statement
namespace TwoStageRnQ

theorem impossibility_strict_inf (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) (c : ClassicalControls)
            (_ : Rule.FollowsRnQ S π c), π.shipCost ∧
      ENNReal.ofReal r * OPTsh P
        < ⨅ (S : DemandSpace P) (π : ShipmentPolicy P S) (c : ClassicalControls)
            (_ : Rule.FollowsRnQ S π c), π.lotCost (Rule.qc c) := 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.
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