Proof of Theorem 11, p. 941 — if f̄_{t+1}(v; φ) is nondecreasing in φ, so is ḡ_t(v, ζ; φ)
ProvedZipkinLostSales.Variability.gbar_monotoneConsider the lost-sales model of Zipkin (2008) in the transformed state, with lead time , costs and discount factor . Suppose the demand distribution depends on a real parameter : for each , has law , a probability measure on with finite mean. Suppose is increasing in in the convex order: for ,
Write and for the optimal cost functions of recursion (1)–(2) with demand law .
Then for every period : if is nondecreasing in for every , then
This is the induction step of Theorem 11; with it, the infimum over carries the monotonicity to .
Formalization Note Time is indexed by the number of periods to go : the hypothesis is about with periods to go and the conclusion about with continuation at , for every . The convex order is the platform definition StochasticOrders.Convex.ConvexOrder applied to the identity random variable on and . Equal means are a consequence of the convex order and are not assumed. The conditions , read the paper's "unit cost" and "discount rate"; finite mean of every is added so that is finite.
import Mathlib import Definitions.Def_ZipkinLostSales_Variability_Model import Definitions.Def_StochasticOrders_Convex_ConvexOrder open MeasureTheory
namespace ZipkinLostSales.Variability
/-- Proof of Theorem 11 (Zipkin 2008, p. 941), the induction step: if the demand `d(φ)` with law
`μ φ` increases in `φ` in the convex order and `f̄_{t+1}(v; φ)` is nondecreasing in `φ` on `V`,
then `ḡ_t(v, ζ; φ)` is nondecreasing in `φ` for every `v ∈ ZipkinLostSales.LNatural.V` and `ζ ≤ 0`. Time is indexed by
the number of periods to go `k` (`gbar … k` has continuation `fbar … k`). -/
theorem gbar_monotone {L : ℕ} (hL : 0 < L) (c hh p γ : ℝ) (hc : 0 ≤ c) (hhh : 0 ≤ hh)
(hp : 0 ≤ p) (hγ0 : 0 < γ) (hγ1 : γ ≤ 1) (μ : ℝ → Measure ℝ)
(hμprob : ∀ φ, IsProbabilityMeasure (μ φ)) (hμnonneg : ∀ φ, μ φ (Set.Iio 0) = 0)
(hμint : ∀ φ, Integrable id (μ φ))
(hcx : ∀ φ φ' : ℝ, φ ≤ φ' → StochasticOrders.Convex.ConvexOrder (μ φ) (μ φ') id id) :
∀ k : ℕ, (∀ v ∈ ZipkinLostSales.LNatural.V L, Monotone (fun φ : ℝ => ZipkinLostSales.LNatural.fbar c hh p γ (μ φ) k v)) →
∀ v ∈ ZipkinLostSales.LNatural.V L, ∀ ζ : ℝ, ζ ≤ 0 → Monotone (fun φ : ℝ => ZipkinLostSales.LNatural.gbar c hh p γ (μ φ) k v ζ) := by sorry
end ZipkinLostSales.Variability
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.