Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 159 — a square under u₁ + u₂ = 2, symmetric in u₁ = u₂, encloses S

Proved
NashBargainingProblem.Axiomatic.exists_enclosing_square

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

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

For h>0h>0h>0 let

Qh={u∈R2:2−2h≤u1+u2≤2, ∣u1−u2∣≤h}.Q_h=\{u\in\mathbb R^2 : 2-2h\le u_1+u_2\le 2,\ |u_1-u_2|\le h\}.Qh​={u∈R2:2−2h≤u1​+u2​≤2, ∣u1​−u2​∣≤h}.

In the rotated coordinates (u1+u2)/2(u_1+u_2)/\sqrt2(u1​+u2​)/2​ and (u1−u2)/2(u_1-u_2)/\sqrt2(u1​−u2​)/2​ this is a square of side 2 h\sqrt2\,h2​h; it lies in the region u1+u2≤2u_1+u_2\le2u1​+u2​≤2, it is symmetric with respect to the line u1=u2u_1=u_2u1​=u2​, and one of its sides, {u1+u2=2, ∣u1−u2∣≤h}\{u_1+u_2=2,\ |u_1-u_2|\le h\}{u1​+u2​=2, ∣u1​−u2​∣≤h}, lies on the line u1+u2=2u_1+u_2=2u1​+u2​=2 and passes through (1,1)(1,1)(1,1).

Let S⊆R2S\subseteq\mathbb R^2S⊆R2 be compact with u1+u2≤2u_1+u_2\le2u1​+u2​≤2 for all u∈Su\in Su∈S. Then there is h>0h>0h>0 such that S⊆QhS\subseteq Q_hS⊆Qh​; moreover QhQ_hQh​ is compact and convex, and (a,b)∈Qh(a,b)\in Q_h(a,b)∈Qh​ if and only if (b,a)∈Qh(b,a)\in Q_h(b,a)∈Qh​.

This is the square Nash builds around the set of alternatives, after the previous step has shown that the set lies under the line u1+u2=2u_1+u_2=2u1​+u2​=2.

Formalization Note The paper's "a square in the region u1+u2⩽2u_1+u_2\leqslant2u1​+u2​⩽2 which is symmetrical in the line u1=u2u_1=u_2u1​=u2​, which has one side on the line u1+u2=2u_1+u_2=2u1​+u2​=2" is the explicit set QhQ_hQh​. Compactness, convexity and the literal symmetry (a,b)∈Qh  ⟺  (b,a)∈Qh(a,b)\in Q_h\iff(b,a)\in Q_h(a,b)∈Qh​⟺(b,a)∈Qh​ are stated as conclusions because the next steps use the square as a bargaining problem and apply the symmetry axiom to it.

Preamble
import Mathlib
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem exists_enclosing_square (S : Set (ℝ × ℝ))
    (hS_compact : IsCompact S) (hS_le : ∀ u ∈ S, u.1 + u.2 ≤ 2) :
    ∃ h : ℝ, 0 < h ∧
      S ⊆ {u : ℝ × ℝ | 2 - 2 * h ≤ u.1 + u.2 ∧ u.1 + u.2 ≤ 2 ∧ |u.1 - u.2| ≤ h} ∧
      IsCompact {u : ℝ × ℝ | 2 - 2 * h ≤ u.1 + u.2 ∧ u.1 + u.2 ≤ 2 ∧ |u.1 - u.2| ≤ h} ∧
      Convex ℝ {u : ℝ × ℝ | 2 - 2 * h ≤ u.1 + u.2 ∧ u.1 + u.2 ≤ 2 ∧ |u.1 - u.2| ≤ h} ∧
      (∀ a b : ℝ,
        (a, b) ∈ {u : ℝ × ℝ | 2 - 2 * h ≤ u.1 + u.2 ∧ u.1 + u.2 ≤ 2 ∧ |u.1 - u.2| ≤ h} ↔
        (b, a) ∈ {u : ℝ × ℝ | 2 - 2 * h ≤ u.1 + u.2 ∧ u.1 + u.2 ≤ 2 ∧ |u.1 - u.2| ≤ h}) := by sorry
end NashBargainingProblem.Axiomatic
Source
Nash, The Bargaining Problem, Econometrica 18 (1950), p. 159, Two Person Theory, proof of the assertion ("We may now construct a square in the region u1 + u2 ⩽ 2 which is symmetrical in the line u1 = u2, …")
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