Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq. (9) — rα(d)=α−(1−α)Mα(d)r_\alpha(d) = \alpha - (1 - \alpha) M_\alpha(d)rα​(d)=α−(1−α)Mα​(d)

Proved
VeinottWagnerSS.RenewalCost.eq9_rAlpha_closed_form

by mikedeng1 · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

inventoryp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory

Let φ\varphiφ be a demand distribution and 0≤α≤10 \le \alpha \le 10≤α≤1 with αφ(0)<1\alpha\varphi(0) < 1αφ(0)<1. For every d=0,1,…d = 0, 1, \dotsd=0,1,…, the expected discount factor of the first period in which cumulative demand exceeds ddd,

rα(d)=∑i=1∞αi[Φi−1(d)−Φi(d)],r_\alpha(d) = \sum_{i=1}^{\infty} \alpha^i\bigl[\Phi^{i-1}(d) - \Phi^i(d)\bigr],rα​(d)=i=1∑∞​αi[Φi−1(d)−Φi(d)],

equals

rα(d)=α−(1−α)Mα(d).r_\alpha(d) = \alpha - (1 - \alpha) M_\alpha(d).rα​(d)=α−(1−α)Mα​(d).

It expresses the discounted set-up factor through the discount renewal function; in particular 1−rα(d)=(1−α)(1+Mα(d))1 - r_\alpha(d) = (1-\alpha)(1 + M_\alpha(d))1−rα​(d)=(1−α)(1+Mα​(d)).

Formalization Note rαr_\alpharα​ is defined by the first line of (9), i.e. as E[αT(d)]E[\alpha^{T(d)}]E[αT(d)] computed from the law Pr⁡[T(d)=i]=Φi−1(d)−Φi(d)\Pr[T(d) = i] = \Phi^{i-1}(d) - \Phi^i(d)Pr[T(d)=i]=Φi−1(d)−Φi(d).

Preamble
import Mathlib
import Definitions.Def_VeinottWagnerSS_RenewalCost_Demand
import Definitions.Def_VeinottWagnerSS_RenewalCost_RenewalFunctions
Formal statement
namespace VeinottWagnerSS.RenewalCost

/-- Veinott & Wagner (1965), Eq. (9), p. 533: under `0 ≤ α ≤ 1` and `α φ(0) < 1`,
`r_α(d) = ∑_{i=1}^{∞} αⁱ [Φ^{i−1}(d) − Φⁱ(d)] = α − (1 − α) M_α(d)` for `d = 0, 1, ⋯`. -/
theorem eq9_rAlpha_closed_form (D : DemandDist) (α : ℝ) (hα0 : 0 ≤ α) (hα1 : α ≤ 1)
    (hφ0 : α * D.φ 0 < 1) (d : ℕ) :
    rAlpha D.φ α d = α - (1 - α) * MAlpha D.φ α d := by sorry

end VeinottWagnerSS.RenewalCost
Source
Veinott & Wagner, Computing Optimal (s, S) Inventory Policies, Management Sci. 11 (1965), p. 533, Eq. (9)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me