Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (10.7)-(10.8): C^1\hat C_1C^1​ is convex and y^1\hat y_1y^​1​ is optimal iff Φ ⁣(y^1−μ1′′σ1′′)=e2+b1h1+b1\Phi\!\left(\frac{\hat y_1 - \mu_1''}{\sigma_1''}\right) = \frac{e_2 + b_1}{h_1 + b_1}Φ(σ1′′​y^​1​−μ1′′​​)=h1​+b1​e2​+b1​​

Proved
InventoryControl.cs_stage1_optimal

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

clark-scarfinventory-controlmulti-echelonoperations-researchoptimization

With echelon holding costs e1,e2≥0e_1, e_2 \ge 0e1​,e2​≥0, shortage cost b1>0b_1 > 0b1​>0 and σ>0\sigma > 0σ>0, the stage-1 cost C^1\hat C_1C^1​ of Eq. (10.6) is a convex function of y^1\hat y_1y^​1​ on R\mathbb{R}R, it is differentiable with

dC^1(y^1)dy^1  =  e1+(h1+b1)(Φ ⁣(y^1−μ1′′σ1′′)−1),\frac{\mathrm{d}\hat C_1(\hat y_1)}{\mathrm{d}\hat y_1} \;=\; e_1 + (h_1 + b_1)\left(\Phi\!\left(\frac{\hat y_1 - \mu_1''}{\sigma_1''}\right) - 1\right),dy^​1​dC^1​(y^​1​)​=e1​+(h1​+b1​)(Φ(σ1′′​y^​1​−μ1′′​​)−1),

and a level y^1\hat y_1y^​1​ minimizes C^1\hat C_1C^1​ over R\mathbb{R}R if and only if

Φ ⁣(y^1−μ1′′σ1′′)  =  e2+b1h1+b1,\Phi\!\left(\frac{\hat y_1 - \mu_1''}{\sigma_1''}\right) \;=\; \frac{e_2 + b_1}{h_1 + b_1},Φ(σ1′′​y^​1​−μ1′′​​)=h1​+b1​e2​+b1​​,

where h1=e1+e2h_1 = e_1 + e_2h1​=e1​+e2​, μ1′′=(L1+1)μ\mu_1'' = (L_1+1)\muμ1′′​=(L1​+1)μ and σ1′′=L1+1 σ\sigma_1'' = \sqrt{L_1+1}\,\sigmaσ1′′​=L1​+1​σ.

Convexity comes from that of the loss function GGG (Eq. 5.41), and the derivative from G′=Φ−1G' = \Phi - 1G′=Φ−1. The fractile is a newsboy critical fractile with overage cost e1e_1e1​ and underage cost e2+b1e_2 + b_1e2​+b1​: a unit held at installation 1 rather than at installation 2 costs the value added e1e_1e1​, and a unit short costs b1b_1b1​ plus the holding cost e2e_2e2​ it would have incurred anyway. When e1=0e_1 = 0e1​=0 the fractile is 111, no finite minimizer exists, and the book notes that installation 2 then never carries stock.

Formalization Note The fractile condition is stated as the characterization of the minimizers; existence and uniqueness of the solution for e1>0e_1 > 0e1​>0 follow from the strict monotonicity of Φ\PhiΦ as in the newsboy mission.

Preamble
import Definitions.Def_InventoryControl_clarkScarf
Formal statement
namespace InventoryControl

theorem cs_stage1_optimal (e1 e2 b1 mu sigma : ℝ) (he1 : 0 ≤ e1) (he2 : 0 ≤ e2) (hb : 0 < b1)
    (hs : 0 < sigma) (L1 : ℕ) (S1 : ℝ) :
    ConvexOn ℝ Set.univ (csStage1Cost e1 e2 b1 mu sigma L1)
      ∧ HasDerivAt (csStage1Cost e1 e2 b1 mu sigma L1)
          (e1 + (e1 + e2 + b1)
            * (ProbabilityTheory.cdf (ProbabilityTheory.gaussianReal 0 1)
                ((S1 - (L1 + 1) * mu) / (Real.sqrt (L1 + 1) * sigma)) - 1)) S1
      ∧ ((∀ y : ℝ, csStage1Cost e1 e2 b1 mu sigma L1 S1 ≤ csStage1Cost e1 e2 b1 mu sigma L1 y)
          ↔ ProbabilityTheory.cdf (ProbabilityTheory.gaussianReal 0 1)
              ((S1 - (L1 + 1) * mu) / (Real.sqrt (L1 + 1) * sigma))
              = (e2 + b1) / (e1 + e2 + b1)) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 195, Sect. 10.1.1, Eq. (10.7) and Eq. (10.8): 'it is easy to get the optimal y-hat1 from the first order condition ... or equivalently Phi((y-hat1 - mu''1)/sigma''1) = (e2 + b1)/(h1 + b1)'
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