Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5.5 — pathwise one-period truncation identities

Proved
InventoryBounds.one_step_exact_truncation

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

inventoryprobabilitysample-complexity

For any real holding and shortage coefficients and action y at or below a cap a, replacing d by min(d,a) preserves sales and leftover inventory. Original stage cost minus truncated stage cost equals p times the removed demand. This is the one-period algebraic component, not the full policy-gap theorem.

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

set_option autoImplicit false
Formal statement
namespace InventoryBounds

theorem one_step_exact_truncation (h p y d a : ℝ) (hya : y ≤ a) :
    sales y d = sales y (min d a) ∧
    lostNext y d = lostNext y (min d a) ∧
    stageCost h p y d - stageCost h p y (min d a) = p * (d - min d a) := 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, Proposition 5.5, proof
Read-back

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

For every real h,p,y,d,ah,p,y,d,ah,p,y,d,a satisfying y≤ay\le ay≤a, all three statements hold simultaneously: min⁡(d,y)=min⁡(min⁡(d,a),y)\min(d,y)=\min(\min(d,a),y)min(d,y)=min(min(d,a),y); max⁡(y−d,0)=max⁡(y−min⁡(d,a),0)\max(y-d,0)=\max(y-\min(d,a),0)max(y−d,0)=max(y−min(d,a),0); and [hmax⁡(y−d,0)+pmax⁡(d−y,0)]−[hmax⁡(y−min⁡(d,a),0)+pmax⁡(min⁡(d,a)−y,0)]=p(d−min⁡(d,a))[h\max(y-d,0)+p\max(d-y,0)]-[h\max(y-\min(d,a),0)+p\max(\min(d,a)-y,0)]=p(d-\min(d,a))[hmax(y−d,0)+pmax(d−y,0)]−[hmax(y−min(d,a),0)+pmax(min(d,a)−y,0)]=p(d−min(d,a)). These expressions are respectively the equality of the two defined sales values, the equality of the two defined nonnegative continuation values, and the exact difference of the two defined stage costs before and after replacing ddd by min⁡(d,a)\min(d,a)min(d,a). There are no sign restrictions on any of the five real variables, including the coefficients h,ph,ph,p, and no assumed ordering of ddd and aaa. Equality y=ay=ay=a is included; when d≤ad\le ad≤a, the replacement leaves ddd unchanged and the cost difference is zero.

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