Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (14.8): Q0Q_0Q0​ maximizes the chain profit iff Fˉ(Q0)=(c−v)/(r−v+p)\bar F(Q_0) = (c - v)/(r - v + p)Fˉ(Q0​)=(c−v)/(r−v+p), and such a Q0Q_0Q0​ exists

Proved
SupplyChainTheory.chain_optimal_fractile

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

contractsnewsvendoroperations-researchsupply-chain

For a demand law with finite mean and continuous distribution function FFF, the total supply chain profit Π(Q)=(r−v+p)S(Q)−(c−v)Q−pμ\Pi(Q) = (r - v + p)S(Q) - (c - v)Q - p\muΠ(Q)=(r−v+p)S(Q)−(c−v)Q−pμ is maximized exactly at the order quantities Q0Q_0Q0​ with

Fˉ(Q0)  =  c−vr−v+p,\bar F(Q_0) \;=\; \frac{c - v}{r - v + p},Fˉ(Q0​)=r−v+pc−v​,

and at least one such Q0Q_0Q0​ exists. This is (14.8): S′(Q)=Fˉ(Q)S'(Q) = \bar F(Q)S′(Q)=Fˉ(Q) by (14.2), Π\PiΠ is concave, and its stationary points are its maximizers. The book identifies it with the newsvendor critical fractile for the chain acting as one newsvendor with cost ccc, price rrr, penalty ppp and salvage vvv. The fractile lies strictly between 000 and 111 because v<c<rv < c < rv<c<r.

Preamble
import Definitions.Def_SupplyChainTheory_contracts
Formal statement
namespace SupplyChainTheory

theorem chain_optimal_fractile (P : ContractData) (D : MeasureTheory.Measure ℝ) [MeasureTheory.IsProbabilityMeasure D]
    [MeasureTheory.NullSingletonClass D] (hD : MeasureTheory.Integrable (fun x => x) D) :
    (∀ Q, IsMaxOn (chainProfit P D) Set.univ Q ↔ 1 - ProbabilityTheory.cdf D Q = (P.c - P.v) / (P.r - P.v + P.p))
      ∧ ∃ Q0, IsMaxOn (chainProfit P D) Set.univ Q0 := 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, pp. 567-568, Sect. 14.4, Eq. (14.7)-(14.8) and the concavity remark 'Q0 is a maximizer, not a minimizer'
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).

  • Endorsed by mikedeng1 · Oct 6, 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