Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

C(Q+1)≥C(Q)C(Q+1) \ge C(Q)C(Q+1)≥C(Q) iff min⁡{g(R∗(Q)),g(R∗(Q)+Q+1)}≥C(Q)\min\{g(R^*(Q)), g(R^*(Q)+Q+1)\} \ge C(Q)min{g(R∗(Q)),g(R∗(Q)+Q+1)}≥C(Q), and the minimum increases with QQQ

Proved
InventoryControl.rq_discrete_marginal_mono

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

discrete-optimizationinventory-controloperations-researchreorder-point

Two facts about the marginal cost of the (Q+1)(Q+1)(Q+1)-th unit of the batch. Under a discrete lead-time demand with finite mean, ordering cost AAA, demand rate μ\muμ, and costs h>0h > 0h>0, b1>0b_1 > 0b1​>0, let R∗(Q)R^{*}(Q)R∗(Q) and R∗(Q+1)R^{*}(Q+1)R∗(Q+1) be optimal reorder points for the batch quantities Q≥1Q \ge 1Q≥1 and Q+1Q + 1Q+1, and write m(Q)=min⁡{g(R∗(Q)), g(R∗(Q)+Q+1)}m(Q) = \min\{g(R^{*}(Q)),\, g(R^{*}(Q) + Q + 1)\}m(Q)=min{g(R∗(Q)),g(R∗(Q)+Q+1)} for the cost of the cheaper neighbour of the optimal window. Then

  1. C(R∗(Q+1),Q+1)≥C(R∗(Q),Q)C(R^{*}(Q+1), Q+1) \ge C(R^{*}(Q), Q)C(R∗(Q+1),Q+1)≥C(R∗(Q),Q) if and only if m(Q)≥C(R∗(Q),Q)m(Q) \ge C(R^{*}(Q), Q)m(Q)≥C(R∗(Q),Q);
  2. m(Q)≤m(Q+1)m(Q) \le m(Q+1)m(Q)≤m(Q+1).

The first is read off Eq. (6.7): C(Q+1)C(Q+1)C(Q+1) is a weighted average of C(Q)C(Q)C(Q) and m(Q)m(Q)m(Q) with weights Q/(Q+1)Q/(Q+1)Q/(Q+1) and 1/(Q+1)1/(Q+1)1/(Q+1), so it exceeds C(Q)C(Q)C(Q) exactly when m(Q)m(Q)m(Q) does. The second is the book's "obvious" step: as the optimal window grows, the neighbours it has not yet absorbed lie further out on a convex ggg and can only cost more. Together they are what makes the stopping rule of Sect. 6.1.1.1 correct.

Formalization Note The reorder points may be any optimal ones for their batch quantities; by Eq. (6.7) the value m(Q)m(Q)m(Q) does not depend on the choice.

Preamble
import Definitions.Def_InventoryControl_rqDiscrete
Formal statement
namespace InventoryControl

theorem rq_discrete_marginal_mono (D : DiscreteDemand) (h b1 A μ : ℝ) (hh : 0 < h) (hb : 0 < b1)
    (Q : ℕ) (hQ : 0 < Q) (Rstar Rnext : ℤ)
    (hR : ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ R Q)
    (hR' : ∀ R : ℤ, rqDiscreteCost D h b1 A μ Rnext (Q + 1) ≤ rqDiscreteCost D h b1 A μ R (Q + 1)) :
    (rqDiscreteCost D h b1 A μ Rstar Q ≤ rqDiscreteCost D h b1 A μ Rnext (Q + 1)
        ↔ rqDiscreteCost D h b1 A μ Rstar Q
            ≤ min (sPolicyCost D h b1 Rstar) (sPolicyCost D h b1 (Rstar + Q + 1)))
      ∧ min (sPolicyCost D h b1 Rstar) (sPolicyCost D h b1 (Rstar + Q + 1))
          ≤ min (sPolicyCost D h b1 Rnext) (sPolicyCost D h b1 (Rnext + (Q + 1) + 1)) := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 109, Sect. 6.1.1.1, the two sentences after Eq. (6.7): 'It is evident from Eq. (6.7) that C(Q + 1) >= C(Q) if and only if min{g(R*(Q)), g(R*(Q) + Q + 1)} >= C(Q). Furthermore, it is obvious that min{g(R*(Q)), g(R*(Q) + Q + 1)} is increasing with Q'
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