Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix, Eq. (31): if ρD=1\rho^D = 1ρD=1, the retailer is better off

Proved
FalseFailureReturns.TargetRebate.retailer_gain_corner

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

contractsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Let a>0a > 0a>0, β>0\beta > 0β>0, Mm>0M_m > 0Mm​>0, Rr>0R_r > 0Rr​>0 with (Mm+Rr)β>a(M_m + R_r)\beta > a(Mm​+Rr​)β>a, and let X(ρ)∼Uniform(0,2β/ρ)X(\rho) \sim \mathrm{Uniform}(0, 2\beta/\rho)X(ρ)∼Uniform(0,2β/ρ). Let (u,T)(u, T)(u,T) with u>0u > 0u>0, T>0T > 0T>0 and T<2β/ρCT < 2\beta/\rho^CT<2β/ρC coordinate the supply chain, and suppose the decentralized effort is at the minimum, ρD=1\rho^D = 1ρD=1. Then the retailer's gain is nonnegative:

ΔR=πR(ρC∣T,u)−πR(ρD)≥0.\Delta_R = \pi_R(\rho^C \mid T, u) - \pi_R(\rho^D) \ge 0.ΔR​=πR​(ρC∣T,u)−πR​(ρD)≥0.

This is the second of the two cases of the retailer half of Proposition 2.

Preamble
import Mathlib
import Definitions.Def_FalseFailureReturns_TargetRebate_Model
import Definitions.Def_FalseFailureReturns_TargetRebate_UniformRebate
Formal statement
namespace FalseFailureReturns.TargetRebate

theorem retailer_gain_corner (P : Params) (T u : ℝ)
    (ha : 0 < P.a) (hβ : 0 < P.β) (hM : 0 < P.Mm) (hR : 0 < P.Rr)
    (hint : P.a < (P.Mm + P.Rr) * P.β) (hu : 0 < u) (hT : 0 < T)
    (hTlt : T < 2 * P.β / coordEffort P) (hcoord : Coordinates P T u)
    (hD : decentrEffort P = 1) :
    0 ≤ rebateRetailerProfit P T u (coordEffort P) - retailerProfit P (decentrEffort P) := by sorry

end FalseFailureReturns.TargetRebate
Source
Ferguson, Guide & Souza, Supply Chain Coordination for False Failure Returns, MSOM 8(4) 2006, pp. 392–393, Appendix, Eq. (31)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me