Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.3 — one-period carry-safe cap closure

Proved
InventoryBounds.carry_cap_closure

by visuddhi · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventoryprobabilitysample-complexity

If current inventory and a base-stock threshold are at most a nonnegative cap a, demand is nonnegative, and the next cap b is at least a, the post-order level is at most a and next lost-sales inventory is at most b. Optimal-threshold containment is a separate theorem.

Preamble
import Definitions.Def_InventoryBounds_Primitives
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false
Formal statement
namespace InventoryBounds

theorem carry_cap_closure (x s d a b : ℝ)
    (hx : x ≤ a) (hs : s ≤ a) (hd : 0 ≤ d)
    (ha : 0 ≤ a) (hab : a ≤ b) :
    max x s ≤ a ∧ lostNext (max x s) d ≤ b := by sorry

end InventoryBounds
Source
Hanzhang Qin, David Simchi-Levi, Ruihao Zhu, Information Limits of Multistage Inventory Control: Learning, Valuation, and Censoring, arXiv:2609.37380v1 (29 September 2026), https://arxiv.org/abs/2609.37380v1, Theorem 5.3, proof
Read-back

What the Lean code literally says, in plain math · gpt-6

For every real x,s,d,a,bx,s,d,a,bx,s,d,a,b satisfying x≤ax\le ax≤a, s≤as\le as≤a, d≥0d\ge0d≥0, a≥0a\ge0a≥0, and a≤ba\le ba≤b, both max⁡(x,s)≤a\max(x,s)\le amax(x,s)≤a and max⁡(max⁡(x,s)−d,0)≤b\max(\max(x,s)-d,0)\le bmax(max(x,s)−d,0)≤b hold. The second expression is the definition of the continuation value applied to max⁡(x,s)\max(x,s)max(x,s) and ddd. No nonnegativity condition is imposed on xxx or sss; all inequalities in the assumptions are non-strict, so d=0d=0d=0, a=0a=0a=0, a=ba=ba=b, x=ax=ax=a, and s=as=as=a are allowed whenever the remaining assumptions hold. The assumptions imply b≥0b\ge0b≥0.

Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by visuddhi · Oct 15, 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