Theorem 5.3 — one-period carry-safe cap closure
ProvedInventoryBounds.carry_cap_closureinventoryprobabilitysample-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 InventoryBoundsSource
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 satisfying , , , , and , both and hold. The second expression is the definition of the continuation value applied to and . No nonnegativity condition is imposed on or ; all inequalities in the assumptions are non-strict, so , , , , and are allowed whenever the remaining assumptions hold. The assumptions imply .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.