Theorem 3.7 — zero-base-stock optimality on the hard family
ProvedInventoryBounds.bernoulli_zero_base_stock_optimalFor any finite horizon, real initial backlog state, and zero-demand probability rho in (1/2,1], the Bellman optimal value equals the value of always ordering to max(x,0). Unit holding and shortage costs and Bernoulli demands are fixed by the definitions.
import Definitions.Def_InventoryBounds_StationaryValuation set_option autoImplicit false open MeasureTheory ProbabilityTheory open scoped BigOperators
namespace InventoryBounds
theorem bernoulli_zero_base_stock_optimal (T : ℕ) (ρ x : ℝ)
(hρ : 1 / 2 < ρ) (hρ1 : ρ ≤ 1) :
bernoulliDP T ρ x = zeroBaseStockValue T ρ x := by sorry
end InventoryBoundsRead-back
What the Lean code literally says, in plain math · gpt-6
For every natural number and every real satisfying , one has . Here ; for all real ; , with the real infimum over real ; and . The continuation state in the second branch is the stated real value minus , without truncation at zero. The assertion includes , all negative as well as nonnegative initial states , and the endpoint ; it excludes . It asserts equality of these recursively defined values and makes no uniqueness assertion.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.