Proposition 5.5 — pathwise one-period truncation identities
ProvedInventoryBounds.one_step_exact_truncationFor 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.
import Definitions.Def_InventoryBounds_Primitives import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false
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 InventoryBoundsRead-back
What the Lean code literally says, in plain math · gpt-6
For every real satisfying , all three statements hold simultaneously: ; ; and . 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 by . There are no sign restrictions on any of the five real variables, including the coefficients , and no assumed ordering of and . Equality is included; when , the replacement leaves unchanged and the cost difference is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.