Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Problem 10.1: C^2(y2)\hat C_2(y_2)C^2​(y2​) is convex in y2y_2y2​, and it has a minimizer

Proved
InventoryControl.cs_total_cost_convex

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

clark-scarfconvex-optimizationinventory-controlmulti-echelonoperations-research

Let S1S_1S1​ satisfy the fractile condition (10.8), with e1,e2≥0e_1, e_2 \ge 0e1​,e2​≥0, b1>0b_1 > 0b1​>0 and σ>0\sigma > 0σ>0. Then the total cost C^2\hat C_2C^2​ of Eq. (10.9) is a convex function of the echelon position y2y_2y2​ on R\mathbb{R}R, and, when e2>0e_2 > 0e2​>0, it attains its minimum at some y2∗y_2^{*}y2∗​.

Convexity is the content of the book's Problem 10.1: x↦C^1(min⁡{S1,x})x \mapsto \hat C_1(\min\{S_1, x\})x↦C^1​(min{S1​,x}) is convex exactly because S1S_1S1​ minimizes the convex function C^1\hat C_1C^1​, and convexity survives the expectation over D(L2)D(L_2)D(L2​) and the addition of the linear term h2(y2−μ2′)h_2(y_2 - \mu_2')h2​(y2​−μ2′​). For e2>0e_2 > 0e2​>0 the minimum exists because C^2(y2)→∞\hat C_2(y_2) \to \inftyC^2​(y2​)→∞ in both directions: like h2y2h_2y_2h2​y2​ as y2→∞y_2 \to \inftyy2​→∞ and like −b1y2-b_1y_2−b1​y2​ as y2→−∞y_2 \to -\inftyy2​→−∞.

The guard e2>0e_2 > 0e2​>0 is needed. When e2=h2=0e_2 = h_2 = 0e2​=h2​=0 and L2≥1L_2 \ge 1L2​≥1, C^2(y2)\hat C_2(y_2)C^2​(y2​) is strictly above C^1(S1)\hat C_1(S_1)C^1​(S1​) for every y2y_2y2​, because C^1\hat C_1C^1​ is strictly convex with its unique minimum at S1S_1S1​ and D(L2)D(L_2)D(L2​) is unbounded, and it tends to C^1(S1)\hat C_1(S_1)C^1​(S1​) as y2→∞y_2 \to \inftyy2​→∞. So there is no minimizer. This is the upstream mirror of the book's remark that e1=0e_1 = 0e1​=0 forces S1e→∞S_1^{e} \to \inftyS1e​→∞ (p. 196): with free upstream holding the optimal y2y_2y2​ runs off to infinity. Convexity is what the book uses to justify searching for a local minimum only, and y2∗y_2^{*}y2∗​ is the echelon order-up-to level S2eS_2^{e}S2e​ of installation 2.

Preamble
import Definitions.Def_InventoryControl_clarkScarf
Formal statement
namespace InventoryControl

theorem cs_total_cost_convex (e1 e2 b1 mu sigma : ℝ) (he1 : 0 ≤ e1) (he2 : 0 ≤ e2) (hb : 0 < b1)
    (hs : 0 < sigma) (L1 L2 : ℕ) (S1 : ℝ)
    (hS1 : ProbabilityTheory.cdf (ProbabilityTheory.gaussianReal 0 1)
      ((S1 - (L1 + 1) * mu) / (Real.sqrt (L1 + 1) * sigma)) = (e2 + b1) / (e1 + e2 + b1)) :
    ConvexOn ℝ Set.univ (csTotalCost e1 e2 b1 mu sigma L1 L2 S1)
      ∧ (0 < e2 → ∃ S2 : ℝ, ∀ y2 : ℝ, csTotalCost e1 e2 b1 mu sigma L1 L2 S1 S2
          ≤ csTotalCost e1 e2 b1 mu sigma L1 L2 S1 y2) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 196, Sect. 10.1.1: 'It is easy to verify that C-hat2(y2) is convex in y2, which means that we only have to look for a local minimum. Denote the optimal solution by y*2'; Problem 10.1 p. 221
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