p. 159 — a square under u₁ + u₂ = 2, symmetric in u₁ = u₂, encloses S
ProvedNashBargainingProblem.Axiomatic.exists_enclosing_squareFor let
In the rotated coordinates and this is a square of side ; it lies in the region , it is symmetric with respect to the line , and one of its sides, , lies on the line and passes through .
Let be compact with for all . Then there is such that ; moreover is compact and convex, and if and only if .
This is the square Nash builds around the set of alternatives, after the previous step has shown that the set lies under the line .
Formalization Note The paper's "a square in the region which is symmetrical in the line , which has one side on the line " is the explicit set . Compactness, convexity and the literal symmetry are stated as conclusions because the next steps use the square as a bargaining problem and apply the symmetry axiom to it.
import Mathlib
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.