Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3, p. 27 — under (31) the retailer optimum is p* = E max(V, b − l), F̄(q*) = (w − b)/(E max(V, b − l) − b), r* = b − l

Proved
SuReturns.Coordination.prop3_proof_retailer_optimum

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

buy-backconsumer-returnsnewsvendorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a retailer under a differentiated buy-back contract (w,b,l)(w,b,l)(w,b,l): wholesale price www, credit bbb for each unsold unit and b−lb-lb−l for each returned unit. Valuations have law ν\nuν with finite mean and market demand X∼DX \sim DX∼D is nonnegative. The retailer's profit is (31),

ΠR(p,q,r)=[(p−b)Gˉ(r)+(p−r−l)G(r)] S(p,q,r)−(w−b)q,\Pi_R(p,q,r) = [(p-b)\bar G(r) + (p-r-l)G(r)]\,S(p,q,r) - (w-b)q,ΠR​(p,q,r)=[(p−b)Gˉ(r)+(p−r−l)G(r)]S(p,q,r)−(w−b)q,

with SSS the expected sales under the demand rule (6). Suppose Emax⁡(V,b−l)−b>0E\max(V,b-l) - b > 0Emax(V,b−l)−b>0 and let q∗q^*q∗ satisfy

Fˉ(q∗)=1−F(q∗)=w−bEmax⁡(V,b−l)−b,\bar F(q^*) = 1 - F(q^*) = \frac{w-b}{E\max(V,b-l)-b},Fˉ(q∗)=1−F(q∗)=Emax(V,b−l)−bw−b​,

where FFF is the distribution function of DDD. Then p∗=Emax⁡(V,b−l)p^* = E\max(V,b-l)p∗=Emax(V,b−l), q∗q^*q∗ and r∗=b−lr^* = b-lr∗=b−l are optimal for the retailer:

ΠR(p,q,r)≤ΠR(Emax⁡(V,b−l), q∗, b−l)for all p, r∈R, q≥0.\Pi_R(p,q,r) \le \Pi_R\big(E\max(V,b-l),\,q^*,\,b-l\big) \qquad \text{for all } p,\ r \in \mathbb R,\ q \ge 0.ΠR​(p,q,r)≤ΠR​(Emax(V,b−l),q∗,b−l)for all p, r∈R, q≥0.

This is the retailer's best response to an arbitrary differentiated buy-back; Proposition 3 then chooses (w,b,l)(w,b,l)(w,b,l) so that it coincides with the supply chain optimum.

Formalization Note The positivity of Emax⁡(V,b−l)−bE\max(V,b-l)-bEmax(V,b−l)−b is the condition under which the paper's fractile Fˉ−1((w−b)/(Emax⁡(V,b−l)−b))\bar F^{-1}\big((w-b)/(E\max(V,b-l)-b)\big)Fˉ−1((w−b)/(Emax(V,b−l)−b)) is defined; without it the fraction is Lean's junk value x/0=0x/0 = 0x/0=0. The optimal quantity is stated as any q∗q^*q∗ satisfying the fractile equation (the paper writes Fˉ−1\bar F^{-1}Fˉ−1); no continuity of DDD is assumed. Demand is nonnegative and competing stocks satisfy q≥0q \ge 0q≥0. Optimality, not uniqueness, is claimed.

Preamble
import Mathlib
import Definitions.Def_SuReturns_Coordination_Model

open MeasureTheory ProbabilityTheory
Formal statement
namespace SuReturns.Coordination

theorem prop3_proof_retailer_optimum (ν D : Measure ℝ) [IsProbabilityMeasure ν]
    [IsProbabilityMeasure D] (hν : Integrable (fun v => v) ν) (hD0 : D (Set.Iio 0) = 0)
    (w b l qstar : ℝ) (hpos : 0 < SuReturns.PartialRefunds.reservationPrice ν (b - l) - b)
    (hq : 1 - cdf D qstar = (w - b) / (SuReturns.PartialRefunds.reservationPrice ν (b - l) - b)) :
    ∀ p r q : ℝ, 0 ≤ q →
      retailerDiffBuyback ν D w b l p q r ≤
        retailerDiffBuyback ν D w b l (SuReturns.PartialRefunds.reservationPrice ν (b - l)) qstar (b - l) := by sorry

end SuReturns.Coordination
Source
Su, Consumer Returns Policies and Supply Chain Performance, SSRN 1020451 (version of August 2008), p. 27, proof of Proposition 3, after (31)
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