Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1, (6.8), p. 937 — 0 = v_{n,0} ≤ v_{n,1} ≤ ⋯ ≤ v_{n,k} ≤ w_n

Proved
SethiChengSS.Infinite.theorem_6_1_eq_6_8

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programminginfinite-horizoninventoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-iteration

Under the standing assumptions (2.1)–(2.2) and 0<α<10 < \alpha < 10<α<1, the values vn,kv_{n,k}vn,k​ of the kkk-period truncations (6.4) increase in kkk and are bounded by the order-nothing cost wnw_nwn​ of (6.6):

0=vn,0≤vn,1≤⋯≤vn,k≤wn.(6.8)0 = v_{n,0} \le v_{n,1} \le \cdots \le v_{n,k} \le w_n. \tag{6.8}0=vn,0​≤vn,1​≤⋯≤vn,k​≤wn​.(6.8)

Monotonicity and the bound wnw_nwn​ make the limit vn=lim⁡kvn,kv_n = \lim_k v_{n,k}vn​=limk​vn,k​ exist, which is the first step of the successive approximation of the infinite-horizon problem.

Formalization Note. Values are in [0,∞][0,\infty][0,∞]. The paper allows α=1\alpha = 1α=1; α<1\alpha < 1α<1 is assumed throughout the mission (the Appendix divides by 1−α1-\alpha1−α).

Preamble
import Mathlib
import Definitions.Def_BertsekasKConvex
import Definitions.Def_SethiChengSS_Infinite_Model
Formal statement
namespace SethiChengSS.Infinite

theorem theorem_6_1_eq_6_8 {L : ℕ} (D : Model L) (α : ℝ) (hD : Standing D) (hα0 : 0 < α)
    (hα1 : α < 1) :
    (∀ n i x, vTrunc D α n 0 i x = 0) ∧
    (∀ n k i x, vTrunc D α n k i x ≤ vTrunc D α n (k + 1) i x) ∧
    (∀ n k i x, vTrunc D α n k i x ≤ w D α n i x) := by sorry

end SethiChengSS.Infinite
Source
Sethi and Cheng, Optimality of (s, S) policies in inventory models with Markovian demand, Oper. Res. 45(6) (1997), DOI 10.1287/opre.45.6.931, p. 937, Theorem 6.1, (6.8)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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