Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§3, p. 382: in the interesting case, ρC>1\rho^C > 1ρC>1

Proved
FalseFailureReturns.TargetRebate.coord_effort_gt_one

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

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

Let a>0a > 0a>0, β>0\beta > 0β>0, Mm>0M_m > 0Mm​>0 and Rr>0R_r > 0Rr​>0 be as in the model. Suppose the total potential saving of avoiding false failures exceeds the marginal cost of the minimum effort level,

(Mm+Rr) β>a.(M_m + R_r)\,\beta > a.(Mm​+Rr​)β>a.

Then the coordinated effort exceeds the minimum effort level:

ρC=[Mm+Rra β]1/3>1.\rho^C = \Big[\frac{M_m + R_r}{a}\,\beta\Big]^{1/3} > 1.ρC=[aMm​+Rr​​β]1/3>1.

This is the "interesting case" of the paper, in which the coordinated supply chain exerts more than the minimum effort; every later result about coordinating contracts is stated in it.

Formalization Note The paper writes the condition as (m+r)β>a(m + r)\beta > a(m+r)β>a. That condition does not imply ρC>1\rho^C > 1ρC>1 when δm(w−c)+δr(p−w)<0\delta_m(w - c) + \delta_r(p - w) < 0δm​(w−c)+δr​(p−w)<0; the condition the conclusion rests on is (Mm+Rr)β>a(M_m + R_r)\beta > a(Mm​+Rr​)β>a, which is used here.

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

theorem coord_effort_gt_one (P : Params)
    (ha : 0 < P.a) (hβ : 0 < P.β) (hM : 0 < P.Mm) (hR : 0 < P.Rr)
    (hint : P.a < (P.Mm + P.Rr) * P.β) :
    1 < coordEffort P := by sorry

end FalseFailureReturns.TargetRebate
Source
Ferguson, Guide & Souza, Supply Chain Coordination for False Failure Returns, MSOM 8(4) 2006, p. 382, §3
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