Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, (1), p. 1346 — G(r|μ) = (p + s − c)r − sμ − (p + s − u)E[r − X]⁺, and the retailer buys r*_NC = min[μ + z_εσ_ε, Q]

Proved
TsayQF.NoCommit.retailer_purchase

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

newsvendorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Let p>c>m>0p > c > m > 0p>c>m>0, u<mu < mu<m, s≥0s \ge 0s≥0 be the costs of Tsay (1999), let σε≥0\sigma_\varepsilon \ge 0σε​≥0, and let zε=Φ−1((p+s−c)/(p+s−u))z_\varepsilon = \Phi^{-1}\big((p+s-c)/(p+s-u)\big)zε​=Φ−1((p+s−c)/(p+s−u)), where Φ\PhiΦ is the standard normal distribution function. Given the signal μ\muμ, demand is X∼N(μ,σε2)X \sim N(\mu, \sigma_\varepsilon^2)X∼N(μ,σε2​) and the retailer's expected profit from purchase rrr is

G(r∣μ)=EX∣μ{pmin⁡[X,r]−c r−s[X−r]++u[r−X]+}.G(r\mid\mu) = E_{X\mid\mu}\{p\min[X,r] - c\,r - s[X-r]^+ + u[r-X]^+\}.G(r∣μ)=EX∣μ​{pmin[X,r]−cr−s[X−r]++u[r−X]+}.

Then:

  1. for every rrr and μ\muμ,
G(r∣μ)=(p+s−c) r−s μ−(p+s−u) EX∣μ{[r−X]+};G(r\mid\mu) = (p+s-c)\,r - s\,\mu - (p+s-u)\,E_{X\mid\mu}\{[r-X]^+\};G(r∣μ)=(p+s−c)r−sμ−(p+s−u)EX∣μ​{[r−X]+};
  1. for every μ\muμ and every production QQQ, a purchase r≤Qr \le Qr≤Q maximizes G(⋅∣μ)G(\cdot\mid\mu)G(⋅∣μ) over {r≤Q}\{r \le Q\}{r≤Q} if and only if
r=rNC∗(Q,μ)=min⁡[μ+zεσε, Q].r = r^*_{NC}(Q,\mu) = \min[\mu + z_\varepsilon\sigma_\varepsilon,\ Q].r=rNC∗​(Q,μ)=min[μ+zε​σε​, Q].

This is the retailer's step of the backward induction: the EM's production problem anticipates this purchase.

Formalization Note zεz_\varepsilonzε​ enters as a real number zzz with the hypothesis Φ(z)=(p+s−c)/(p+s−u)\Phi(z) = (p+s-c)/(p+s-u)Φ(z)=(p+s−c)/(p+s−u); since Φ\PhiΦ is continuous and strictly increasing it exists and is unique. The case σε=0\sigma_\varepsilon = 0σε​=0 is included (then X=μX = \muX=μ). The constraint r≤Qr \le Qr≤Q appears in the conjunction because a maximizer over {r≤Q}\{r \le Q\}{r≤Q} is required to be feasible.

Preamble
import Mathlib
import Definitions.Def_TsayQF_NoCommit_Model
open MeasureTheory ProbabilityTheory
open scoped NNReal
Formal statement
namespace TsayQF.NoCommit

theorem retailer_purchase (D : Data) (v : ℝ≥0) (z : ℝ)
    (hz : cdf (gaussianReal 0 1) z = kR D) :
    (∀ r μ : ℝ, G D v r μ = (D.p + D.s - D.c) * r - D.s * μ
        - (D.p + D.s - D.u) * ∫ x, max (r - x) 0 ∂(gaussianReal μ v)) ∧
      ∀ μ Q r : ℝ, (r ≤ Q ∧ IsMaxOn (fun r' => G D v r' μ) (Set.Iic Q) r) ↔
        r = ncPurchase v z μ Q := by sorry

end TsayQF.NoCommit
Source
Tsay, The quantity flexibility contract and supplier-customer incentives, Management Science 45(10) (1999), p. 1346, §5.1, (1)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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