Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 159 — if (1, 1) maximizes u₁u₂ on a convex S, no point of S has u₁ + u₂ > 2

Proved
NashBargainingProblem.Axiomatic.sum_le_two_of_one_one_max

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 convex, let (1,1)∈S(1,1)\in S(1,1)∈S, and suppose (1,1)(1,1)(1,1) is a point of maximum of u1u2u_1u_2u1​u2​ over SSS in the closed first quadrant: s1s2≤1s_1s_2\le1s1​s2​≤1 for every s∈Ss\in Ss∈S with s1,s2≥0s_1,s_2\ge0s1​,s2​≥0. Then

u1+u2≤2for every u∈S.u_1+u_2\le 2\qquad\text{for every } u\in S .u1​+u2​≤2for every u∈S.

In Nash's proof this places the whole set of alternatives on one side of the line u1+u2=2u_1+u_2=2u1​+u2​=2, which touches the hyperbola u1u2=1u_1u_2=1u1​u2​=1 at (1,1)(1,1)(1,1) (Figure 1).

Formalization Note The conclusion holds for every point of SSS, not only for those in the first quadrant, as the paper's "for no points of the set" says. The hypothesis is the weak maximum (≤1\le1≤1), which is what the paper's argument uses; the strict maximizer of the previous steps satisfies it.

Preamble
import Mathlib
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem sum_le_two_of_one_one_max (S : Set (ℝ × ℝ))
    (hS_convex : Convex ℝ S) (h11 : ((1 : ℝ), (1 : ℝ)) ∈ S)
    (hmax : ∀ s ∈ S, 0 ≤ s.1 → 0 ≤ s.2 → s.1 * s.2 ≤ 1) :
    ∀ u ∈ S, u.1 + u.2 ≤ 2 := by sorry
end NashBargainingProblem.Axiomatic
Source
Nash, The Bargaining Problem, Econometrica 18 (1950), p. 159, Two Person Theory, proof of the assertion ("For no points of the set will u1 + u2 > 2, now, since …"), Figure 1 (p. 160)
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