Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The linear strategies of Example 1 solve the linked differential equations (3a)–(3b)

Proved
ChatterjeeSamuelson.UniformEquilibrium.linear_solves_linked_odes

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

bargaininggame-theoryincomplete-informationp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0≤k≤10 \le k \le 10≤k≤1 and vˉ>0\bar v > 0vˉ>0, let both beliefs be uniform on [0,vˉ][0, \bar v][0,vˉ], so Fb(v)=Fs(v)=v/vˉF_b(v) = F_s(v) = v/\bar vFb​(v)=Fs​(v)=v/vˉ on [0,vˉ][0, \bar v][0,vˉ] with density fb=fs=1/vˉf_b = f_s = 1/\bar vfb​=fs​=1/vˉ, and let Slin(v)=v2−k+1−k2vˉS_{\mathrm{lin}}(v) = \frac{v}{2-k} + \frac{1-k}{2}\bar vSlin​(v)=2−kv​+21−k​vˉ and Blin(v)=v1+k+k(1−k)2(1+k)vˉB_{\mathrm{lin}}(v) = \frac{v}{1+k} + \frac{k(1-k)}{2(1+k)}\bar vBlin​(v)=1+kv​+2(1+k)k(1−k)​vˉ. Then:

  1. (3a) for every seller value y∈[0,vˉ]y \in [0, \bar v]y∈[0,vˉ] and every xxx with Blin(x)=Slin(y)B_{\mathrm{lin}}(x) = S_{\mathrm{lin}}(y)Blin​(x)=Slin​(y),
kFb(y) Slin′(y)+fb(y) Slin(y)=x fb(y);k F_b(y)\, S_{\mathrm{lin}}'(y) + f_b(y)\, S_{\mathrm{lin}}(y) = x\, f_b(y);kFb​(y)Slin′​(y)+fb​(y)Slin​(y)=xfb​(y);
  1. (3b) for every buyer value x∈[0,vˉ]x \in [0, \bar v]x∈[0,vˉ] and every yyy with Slin(y)=Blin(x)S_{\mathrm{lin}}(y) = B_{\mathrm{lin}}(x)Slin​(y)=Blin​(x),
(1−k)(1−Fs(x)) Blin′(x)−fs(x) Blin(x)=− y fs(x).(1-k)\bigl(1 - F_s(x)\bigr)\, B_{\mathrm{lin}}'(x) - f_s(x)\, B_{\mathrm{lin}}(x) = -\,y\, f_s(x).(1−k)(1−Fs​(x))Blin′​(x)−fs​(x)Blin​(x)=−yfs​(x).

Here xxx plays the role of the paper's B−1(S(y))B^{-1}(S(y))B−1(S(y)) and yyy that of S−1(B(x))S^{-1}(B(x))S−1(B(x)). Equations (3a)–(3b) are the linked differential equations that Theorem 2 of the paper derives as necessary conditions for well-behaved equilibria; this statement records that the linear strategies of Example 1(a) satisfy them for uniform beliefs, which is the paper's justification of Example 1(a).

Formalization Note FbF_bFb​ and FsF_sFs​ are the distribution function of the uniform belief UvˉU_{\bar v}Uvˉ​; the density 1/vˉ1/\bar v1/vˉ is written as a constant; derivatives are Mathlib's deriv. The inverse functions are replaced by bound variables with Blin(x)=Slin(y)B_{\mathrm{lin}}(x) = S_{\mathrm{lin}}(y)Blin​(x)=Slin​(y), which determine them uniquely.

Preamble
import Mathlib
import Definitions.Def_ChatterjeeSamuelson_Shared_unif
import Definitions.Def_ChatterjeeSamuelson_Shared_sellerLinear
import Definitions.Def_ChatterjeeSamuelson_Shared_buyerLinear

open MeasureTheory ProbabilityTheory Set
Formal statement
namespace ChatterjeeSamuelson.UniformEquilibrium

/-- The linear strategies of Example 1(a) solve the linked differential equations (3a) and
(3b) (Chatterjee & Samuelson, *Bargaining under Incomplete Information*, Oper. Res. 31(5)
1983, §3, pp. 842–843 [PDF 8–9], unnumbered text after Example 1: "By simple inspection
one can check that linear offer strategies above constitute solutions of Equations 3a and
3b when both distribution functions are linear."; equations (3a), (3b) are Theorem 2,
p. 840 [PDF 6]).

With `F_b = F_s = cdf (unif v̄)` (equal to `v/v̄` on `[0, v̄]`) and densities
`f_b = f_s = 1/v̄`, `Slin = sellerLinear k v̄`, `Blin = buyerLinear k v̄`:

* (3a) `k F_b(y) S′(y) + f_b(y) S(y) = B⁻¹(S(y)) f_b(y)`: for every seller value
  `y ∈ [0, v̄]` and every `x` with `Blin x = Slin y`,
  `k · F_b(y) · Slin′(y) + (1/v̄) · Slin(y) = x · (1/v̄)`;
* (3b) `(1 − k)(1 − F_s(x)) B′(x) − f_s(x) B(x) = −S⁻¹(B(x)) f_s(x)`: for every buyer value
  `x ∈ [0, v̄]` and every `y` with `Slin y = Blin x`,
  `(1 − k)(1 − F_s(x)) · Blin′(x) − (1/v̄) · Blin(x) = −(y · (1/v̄))`.

*Formalization Note.* `B⁻¹(S(y))` is written as a bound variable `x` with `Blin x = Slin y`
(both linear maps are injective for `0 ≤ k ≤ 1`, so `x` is unique), and `S⁻¹(B(x))` likewise.
`S′`, `B′` are Mathlib's `deriv`. The density `1/v̄` is written as a constant: it is the
derivative of `F(v) = v/v̄` on `(0, v̄)`. The identities are checked on the whole value
interval `[0, v̄]`, including values where the equilibrium strategy of Example 1(a) leaves
the linear branch. -/
theorem linear_solves_linked_odes (k vbar : ℝ) (hk0 : 0 ≤ k) (hk1 : k ≤ 1) (hvbar : 0 < vbar) :
    (∀ y ∈ Icc (0 : ℝ) vbar, ∀ x : ℝ, Shared.buyerLinear k vbar x = Shared.sellerLinear k vbar y →
        k * cdf (Shared.unif vbar) y * deriv (Shared.sellerLinear k vbar) y
            + (1 / vbar) * Shared.sellerLinear k vbar y = x * (1 / vbar)) ∧
      (∀ x ∈ Icc (0 : ℝ) vbar, ∀ y : ℝ, Shared.sellerLinear k vbar y = Shared.buyerLinear k vbar x →
        (1 - k) * (1 - cdf (Shared.unif vbar) x) * deriv (Shared.buyerLinear k vbar) x
            - (1 / vbar) * Shared.buyerLinear k vbar x = -(y * (1 / vbar))) := by sorry

end ChatterjeeSamuelson.UniformEquilibrium
Source
Chatterjee & Samuelson, Bargaining under Incomplete Information, Oper. Res. 31(5) (1983), https://doi.org/10.1287/opre.31.5.835, pp. 842–843 [PDF 8–9], text following Example 1 ("By simple inspection one can check…"); equations (3a), (3b) from Theorem 2, p. 840 [PDF 6]
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