Proof of Claim 1 — started outside X(s), the process reaches X(s) along any demand path with divergent cumulative demand
ProvedLostSalesOldNew.StateReduction.reaches_XsLet . Let satisfy , let , and let be an initial state. Let be a demand path with for all and
Then the state process , (order , demand ) visits : there is a period with .
This is the entrance half of the proof of Claim 1: "If the process starts outside , it must eventually reach because until then."
Formalization Note. The paper leaves implicit why the process must reach ; the divergence of the cumulative demand is the pathwise condition under which the sentence holds (with demand identically and no orders, a state with stays put forever). It is a hypothesis of this pathwise milestone only; the goal theorem assumes instead an i.i.d. demand law with , under which the cumulative demand diverges almost surely. The conclusion holds also when already (take ).
import Mathlib import Definitions.Def_LostSalesOldNew_StateReduction_Model
namespace LostSalesOldNew.StateReduction
theorem reaches_Xs {L : ℕ} (hL : 0 < L)
(s : Fin (L + 1) → ℝ) (hs : IsLevelVector s)
(z : (Fin L → ℝ) → ℝ) (hz : z ∈ Zs s) (x : Fin L → ℝ) (hx : ∀ i, 0 ≤ x i)
(ds : ℕ → ℝ) (hds : ∀ t, 0 ≤ ds t)
(hdiv : Filter.Tendsto (fun n => ∑ t ∈ Finset.range n, ds t) Filter.atTop Filter.atTop) :
∃ t, traj z x ds t ∈ Xs s := by sorry
end LostSalesOldNew.StateReduction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.