Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§5.3, pp. 20–21 — for k ≤ 1/2 free information raises the manufacturer's profit from Π^{NX_j}_M to Π^{SX_j}_M

Proved
CompetingChains.Cournot.manufacturer_gain

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

cournot-competitioninformation-sharingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1supply-chain

Let 1/3<k≤1/21/3<k\le1/21/3<k≤1/2, 0≤γC<10\le\gamma_C<10≤γC​<1, t>0t>0t>0, σ2>0\sigma^2>0σ2>0, and let ΠMi,CXiXj\Pi^{X_iX_j}_{M_i,C}ΠMi​,CXi​Xj​​ be manufacturer iii's equilibrium ex-ante profit under Cournot competition. Then for each Xj∈{S,N}X_j\in\{S,N\}Xj​∈{S,N},

ΠMi,CNXj<ΠMi,CSXj.\Pi^{NX_j}_{M_i,C}<\Pi^{SX_j}_{M_i,C}.ΠMi​,CNXj​​<ΠMi​,CSXj​​.

When the retailer shares for free, the manufacturer strictly gains, so sharing is a strictly dominant choice for each manufacturer in the stage-one game when k≤1/2k\le1/2k≤1/2.

Formalization Note The page states the case k≤1/2k\le1/2k≤1/2, and the item keeps that hypothesis. The proof of Proposition 7 (p. 31) prints "ΠMi,CNS>ΠMi,CNN\Pi^{NS}_{M_i,C}>\Pi^{NN}_{M_i,C}ΠMi​,CNS​>ΠMi​,CNN​" at this point; those two profits are equal, and the inequality needed there is this one.

Preamble
import Mathlib
import Definitions.Def_CompetingChains_Cournot_Setting
Formal statement
namespace CompetingChains.Cournot

theorem manufacturer_gain (a c k γ t σsq : ℝ) (hk : 1 / 3 < k) (hk2 : k ≤ 1 / 2) (hγ0 : 0 ≤ γ)
    (hγ1 : γ < 1) (ht : 0 < t) (hσ : 0 < σsq) :
    ∀ Xj : Arrangement, PiM a c k γ t σsq .N Xj < PiM a c k γ t σsq .S Xj := by sorry

end CompetingChains.Cournot
Source
Ha, Tian & Tong, Information Sharing in Competing Supply Chains with Production Cost Reduction (MSOM 2017, pre-published version), pp. 20–21, §5.3, third paragraph
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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