Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Each gjg_jgj​ of the Clark-Scarf recursion is convex under sequential minimization

Proved
SupplyChainTheory.cs_g_convex

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexitymultiechelonoperations-researchsupply-chain

For echelon holding costs hj≥0h_j \ge 0hj​≥0, stockout cost p≥0p \ge 0p≥0, lead-time demands of finite mean, and a base-stock vector SSS built by the sequential minimization (6.26) (each SjS_jSj​ minimizes gj(⋅∣S)g_j(\cdot \mid S)gj​(⋅∣S)), every function gj(⋅∣S)g_j(\cdot \mid S)gj​(⋅∣S), j≤Nj \le Nj≤N, is convex on R\mathbb{R}R.

This is the remark the book attaches to Theorem 6.3: at each iteration one minimizes a single-variable convex function. The induction is that gˉ0\bar g_0gˉ​0​ is convex, g^j\hat g_jg^​j​ adds a linear term to gˉj−1\bar g_{j-1}gˉ​j−1​, gjg_jgj​ is an expectation of translates of g^j\hat g_jg^​j​, and gˉj(x)=gj(min⁡{Sj,x})\bar g_j(x) = g_j(\min\{S_j, x\})gˉ​j​(x)=gj​(min{Sj​,x}) is convex because SjS_jSj​ is a minimizer of the convex gjg_jgj​: it is gjg_jgj​ to the left of SjS_jSj​ and constant to the right. The last step is where sequential optimality is used; for an arbitrary SSS the functions gˉj\bar g_jgˉ​j​ need not be convex.

Preamble
import Definitions.Def_SupplyChainTheory_multiechelon
Formal statement
namespace SupplyChainTheory

theorem cs_g_convex (N : ℕ) (h : ℕ → ℝ) (p : ℝ) (D : ℕ → MeasureTheory.Measure ℝ) (S : ℕ → ℝ)
    [∀ j, MeasureTheory.IsProbabilityMeasure (D j)]
    (hD : ∀ j, MeasureTheory.Integrable (fun x => x) (D j))
    (hh : ∀ j, 0 ≤ h j) (hp : 0 ≤ p) (hS : CSSequential N h p D S) (j : ℕ) (hj : j ≤ N) :
    ConvexOn ℝ Set.univ (csG N h p D S j) := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 196, Sect. 6.2.2, the remark after Theorem 6.3: 'Moreover, gj(y) is known to be convex, so at each iteration we only need to minimize a single-variable, convex function'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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