Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (D.18): J(c1,c2)≤B1(c1)+B2(c2)\mathcal J(c_1,c_2)\le B_1(c_1)+B_2(c_2)J(c1​,c2​)≤B1​(c1​)+B2​(c2​)

Proved
TwoStageRnQ.stagewise_upper_bound

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

inventoryoperations-research

This is eq. (D.18), the second inequality of eq. (22): the joint value is bounded by two separate cycle calculations.

  1. For all integers m1,m2≥1m_1,m_2\ge1m1​,m2​≥1,
Vm1,m2≤H0+Hm1(P)+Hm2(Fup).V_{m_1,m_2}\le H_0+\mathcal H_{m_1}(P)+\mathcal H_{m_2}(F_{\mathrm{up}}).Vm1​,m2​​≤H0​+Hm1​​(P)+Hm2​​(Fup​).
  1. For all setup coefficients c1,c2≥0c_1,c_2\ge0c1​,c2​≥0,
J(c1,c2)≤B1(c1)+B2(c2).\mathcal J(c_1,c_2)\le B_1(c_1)+B_2(c_2).J(c1​,c2​)≤B1​(c1​)+B2​(c2​).

It links the joint calculation, which upper-bounds classical policies, to the single-stage benchmarks that appear in the lower bound LtwoL_{\mathrm{two}}Ltwo​.

Preamble
import Definitions.Def_TwoStageRnQ_Analytic
Formal statement
namespace TwoStageRnQ

theorem stagewise_upper_bound (P : Params) :
    (∀ m1 m2 : ℕ+, P.Vjoint m1 m2 ≤ P.H0 + latInf m1 P.lossDown + latInf m2 P.lossUp) ∧
    ∀ c1 c2 : ℝ, 0 ≤ c1 → 0 ≤ c2 → P.Jjoint c1 c2 ≤ P.B1 c1 + P.B2 c2 := 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. Eq. (22), second inequality; eq. (D.18).
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