Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ggg is convex on Z\mathbb{Z}Z and g(k)→∞g(k) \to \inftyg(k)→∞ as ∣k∣→∞|k| \to \infty∣k∣→∞

Proved
InventoryControl.s_policy_cost_convex

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

discrete-optimizationinventory-controloperations-researchreorder-point

For a discrete lead-time demand with finite mean and costs h>0h > 0h>0, b1>0b_1 > 0b1​>0, the SSS-policy cost rate ggg is a convex function of the inventory position k∈Zk \in \mathbb{Z}k∈Z, in the sense that its increments are nondecreasing,

g(k+1)−g(k)  ≤  g(k+2)−g(k+1)for all k,g(k+1) - g(k) \;\le\; g(k+2) - g(k+1) \qquad\text{for all } k,g(k+1)−g(k)≤g(k+2)−g(k+1)for all k,

and g(k)→∞g(k) \to \inftyg(k)→∞ as ∣k∣→∞|k| \to \infty∣k∣→∞.

Both follow from the increment identity g(k+1)−g(k)=−b1+(h+b1)Pr⁡[D(L)≤k]g(k+1) - g(k) = -b_1 + (h+b_1)\Pr[D(L) \le k]g(k+1)−g(k)=−b1​+(h+b1​)Pr[D(L)≤k]: the distribution function is nondecreasing, and the increments tend to −b1<0-b_1 < 0−b1​<0 as k→−∞k \to -\inftyk→−∞ and to h>0h > 0h>0 as k→+∞k \to +\inftyk→+∞. These are the two properties Sect. 6.1.1.1 needs of ggg: convexity makes the best set of QQQ consecutive positions grow by one neighbour at a time, and the growth at infinity guarantees that every cost minimization over RRR is attained.

Formalization Note Divergence is stated as Tendsto g (cocompact ℤ) atTop, that is, g(k)→∞g(k) \to \inftyg(k)→∞ along ∣k∣→∞|k| \to \infty∣k∣→∞ in both directions.

Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl

theorem s_policy_cost_convex (D : DiscreteDemand) (h b1 : ℝ) (hh : 0 < h) (hb : 0 < b1) :
    (∀ k : ℤ, sPolicyCost D h b1 (k + 1) - sPolicyCost D h b1 k
        ≤ sPolicyCost D h b1 (k + 2) - sPolicyCost D h b1 (k + 1))
      ∧ Filter.Tendsto (sPolicyCost D h b1) (Filter.cocompact ℤ) Filter.atTop := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 108, Sect. 6.1.1.1: 'The results in Sect. 5.9.1 imply that g(k) is a convex function of the inventory position k. Furthermore g(k) -> infinity as |k| -> infinity'; restated p. 114 after Eq. (6.20)
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