Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 159 — on a compact convex S ∋ 0 with a point where both gain, u₁u₂ has exactly one maximizer in the first quadrant

Proved
NashBargainingProblem.Axiomatic.nash_product_maximizer_exists_unique

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

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

Let S⊆R2S\subseteq\mathbb R^2S⊆R2 be a set of utility pairs u=(u1,u2)u=(u_1,u_2)u=(u1​,u2​), where the anticipation of no cooperation has been given utility 000 to both players. Assume that SSS is compact and convex, that it contains the origin (0,0)(0,0)(0,0), and that there is a possibility that both individuals could gain: some s∈Ss\in Ss∈S has s1>0s_1>0s1​>0 and s2>0s_2>0s2​>0.

Then there is exactly one point p∈Sp\in Sp∈S with p1>0p_1>0p1​>0 and p2>0p_2>0p2​>0 that maximizes the product u1u2u_1u_2u1​u2​ over the part of SSS in the closed first quadrant, strictly:

∀s∈S,s1≥0, s2≥0, s≠p ⟹ s1s2<p1p2.\forall s\in S,\quad s_1\ge 0,\ s_2\ge 0,\ s\ne p\ \Longrightarrow\ s_1s_2<p_1p_2 .∀s∈S,s1​≥0, s2​≥0, s=p ⟹ s1​s2​<p1​p2​.

This is the first step of Nash's proof: the point the axioms will single out exists (by compactness) and is unique (by convexity).

Formalization Note The paper's "first quadrant" is the closed quadrant u1≥0, u2≥0u_1\ge0,\ u_2\ge0u1​≥0, u2​≥0, and "the point where u1u2u_1u_2u1​u2​ is maximized" is read as the strict maximizer, in the form used by the goal theorem. The positivity p1,p2>0p_1,p_2>0p1​,p2​>0 is not written in the sentence; it follows from the point where both gain (p. 158) and is stated explicitly because the next step of the proof rescales ppp to (1,1)(1,1)(1,1).

Preamble
import Mathlib
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem nash_product_maximizer_exists_unique (S : Set (ℝ × ℝ))
    (hS_compact : IsCompact S) (hS_convex : Convex ℝ S) (hS_zero : ((0 : ℝ), (0 : ℝ)) ∈ S)
    (hS_gain : ∃ s ∈ S, 0 < s.1 ∧ 0 < s.2) :
    ∃! p : ℝ × ℝ, p ∈ S ∧ 0 < p.1 ∧ 0 < p.2 ∧
      ∀ s ∈ S, 0 ≤ s.1 → 0 ≤ s.2 → s ≠ p → s.1 * s.2 < p.1 * p.2 := by sorry
end NashBargainingProblem.Axiomatic
Source
Nash, The Bargaining Problem, Econometrica 18 (1950), p. 159, Two Person Theory, proof of the assertion ("We know some such point exists from the compactness. Convexity makes it unique."); standing assumptions p. 158 ("compact and convex", "a possibility that both individuals could gain")
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