Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 161 — Bill and Jack: the Nash product is maximized at the vertex (12, 5), reached by one exchange

Proved
NashBargainingProblem.Axiomatic.bill_jack_solution

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

bargainingexamplenash-bargaining-solutionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

In Nash's Bill–Jack barter (goods, additive utilities, exchange gains and the set of alternatives SBJS_{BJ}SBJ​ as in the definition BillJack):

  1. (12,5)∈SBJ(12,5)\in S_{BJ}(12,5)∈SBJ​, and it is the strict maximizer of the product of the utility gains over SBJS_{BJ}SBJ​ in the closed first quadrant: every s∈SBJs\in S_{BJ}s∈SBJ​ with s1,s2≥0s_1,s_2\ge0s1​,s2​≥0 and s≠(12,5)s\ne(12,5)s=(12,5) has s1s2<60s_1s_2<60s1​s2​<60;
  2. (12,5)(12,5)(12,5) is an extreme point (a vertex) of the polygon SBJS_{BJ}SBJ​;
  3. exactly one exchange has gain (12,5)(12,5)(12,5): gain(X,Y)=(12,5)\mathrm{gain}(X,Y)=(12,5)gain(X,Y)=(12,5) if and only if Bill gives Jack X={book, whip, ball, bat}X=\{\text{book, whip, ball, bat}\}X={book, whip, ball, bat} and Jack gives Bill Y={pen, toy, knife}Y=\{\text{pen, toy, knife}\}Y={pen, toy, knife}.

This is the solution Nash reports for the example: Bill gains 20−8=1220-8=1220−8=12 and Jack gains 9−4=59-4=59−4=5.

Formalization Note "There is but one corresponding anticipation" is read for pure exchanges: a lottery over exchanges whose expected gain is a vertex of the hull is degenerate. "A convex polygon" is not stated separately, since the convex hull of finitely many points is one.

Preamble
import Mathlib
import Definitions.Def_NashBargainingProblem_Axiomatic_BillJack
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem bill_jack_solution :
    ((12 : ℝ), (5 : ℝ)) ∈ billJackSet ∧
    (∀ s ∈ billJackSet, 0 ≤ s.1 → 0 ≤ s.2 → s ≠ ((12 : ℝ), (5 : ℝ)) →
      s.1 * s.2 < 12 * 5) ∧
    ((12 : ℝ), (5 : ℝ)) ∈ billJackSet.extremePoints ℝ ∧
    ∀ (X : Finset BillGood) (Y : Finset JackGood),
      billJackGain (X, Y) = ((12 : ℝ), (5 : ℝ)) ↔
        X = {BillGood.book, BillGood.whip, BillGood.ball, BillGood.bat} ∧
        Y = {JackGood.pen, JackGood.toy, JackGood.knife} := by sorry
end NashBargainingProblem.Axiomatic
Source
Nash, The Bargaining Problem, Econometrica 18 (1950), p. 161, Examples ("It turns out to be a convex polygon in which the point where the product of the utility gains is maximized is at a vertex and where there is but one corresponding anticipation."), Figure 2
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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