Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 3 — the sequential thresholds cdS1c_d^{S1}cdS1​ and cdS2c_d^{S2}cdS2​

Proved
InfoSharing.Diseconomy.prop_3_sequential_thresholds

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

information-sharingp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1subgame-perfect-equilibriumsupply-chain

For every ϕ>0\phi > 0ϕ>0 there are thresholds cdS1c_d^{S1}cdS1​, cdS2c_d^{S2}cdS2​, depending only on ϕ\phiϕ, with the following property. For every signal model, every aaa, b>0b > 0b>0, cd>0c_d > 0cd​>0, every pricing-equilibrium family and either first manufacturer kkk, the set NSN^SNS of numbers of informed manufacturers on the paths of subgame-perfect equilibria of sequential contracting satisfies

NS={0} if 0<cd<cdS1,1∈NS if cdS1≤cd<cdS2,2∈NS if cdS2≤cd,N^S = \{0\} \text{ if } 0 < c_d < c_d^{S1},\qquad 1 \in N^S \text{ if } c_d^{S1} \le c_d < c_d^{S2},\qquad 2 \in N^S \text{ if } c_d^{S2} \le c_d,NS={0} if 0<cd​<cdS1​,1∈NS if cdS1​≤cd​<cdS2​,2∈NS if cdS2​≤cd​,

and NS={1}N^S = \{1\}NS={1} for cdS1<cd<cdS2c_d^{S1} < c_d < c_d^{S2}cdS1​<cd​<cdS2​, NS={2}N^S = \{2\}NS={2} for cd>cdS2c_d > c_d^{S2}cd​>cdS2​.

Unlike concurrent contracting, partial sharing occurs for intermediate diseconomy.

Formalization Note. The pricing stage is the Bayesian game of §4.1 on the signal model; the ex ante profits MMM, RRR are those of an arbitrary pricing-equilibrium family, not the §4.2 closed forms. Wholesale strategies are measurable, square-integrable functions of the signal value (constants for an uninformed manufacturer); the production cost is bq+cq2bq + cq^2bq+cq2 with c=cd>0c = c_d > 0c=cd​>0 and b>0b > 0b>0; manufacturers are indexed by {0,1}\{0,1\}{0,1}. At the two thresholds the retailer is indifferent, which is why the closed ends of the regions state only that the value is attained.

Preamble
import Mathlib
import Definitions.Def_InfoSharing_Shared_IsSignalModel
import Definitions.Def_InfoSharing_Shared_IsSequentialSPE
open MeasureTheory
open InfoSharing.Shared
Formal statement
namespace InfoSharing.Diseconomy

universe u

/-- Proposition 3, p. 253: there exist `c_d^{S1}` and `c_d^{S2}`, depending only on `φ`, such
that under sequential information contracting (either manufacturer `k` first)
`n_d^S = 0` if `0 < c_d < c_d^{S1}`, `n_d^S = 1` if `c_d^{S1} ≤ c_d < c_d^{S2}`, and `n_d^S = 2`
if `c_d^{S2} ≤ c_d`. On each closed region the value is attained by an SPE; on its interior
every SPE has that value. -/
theorem prop_3_sequential_thresholds :
    ∀ φ : ℝ, 0 < φ → ∃ cS1 cS2 : ℝ,
    ∀ (Ω : Type u) [MeasurableSpace Ω] (μ : Measure Ω) (θ Y : Ω → ℝ) (a b c σ β : ℝ)
      (E : (Fin 2 → Status) → PricingProfile),
      IsSignalModel μ θ Y σ β → 0 < b → 0 < c → IsPricingEqFamily μ θ Y a b c φ β E → ∀ k : Fin 2,
      let P := payoffTable μ θ Y a b c φ E
      (c < cS1 → SeqOptN P k = {0}) ∧
      (cS1 ≤ c → c < cS2 → 1 ∈ SeqOptN P k) ∧
      (cS1 < c → c < cS2 → SeqOptN P k = {1}) ∧
      (cS2 ≤ c → 2 ∈ SeqOptN P k) ∧
      (cS2 < c → SeqOptN P k = {2}) := by sorry

end InfoSharing.Diseconomy
Source
Shang, Ha & Tong, Information Sharing in a Supply Chain with a Common Retailer, Management Sci. 62(1) 2016, p. 253, Proposition 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