Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 159 — multiplying the utilities by positive constants moves the maximizer of u₁u₂ accordingly

Proved
NashBargainingProblem.Axiomatic.nash_point_rescale

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

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

Let S⊆R2S\subseteq\mathbb R^2S⊆R2 and let p∈Sp\in Sp∈S with p1≥0p_1\ge0p1​≥0, p2≥0p_2\ge0p2​≥0 be the strict maximizer of u1u2u_1u_2u1​u2​ over SSS in the closed first quadrant: every s∈Ss\in Ss∈S with s1,s2≥0s_1,s_2\ge0s1​,s2​≥0 and s≠ps\ne ps=p has s1s2<p1p2s_1s_2<p_1p_2s1​s2​<p1​p2​. Let α1,α2>0\alpha_1,\alpha_2>0α1​,α2​>0, and let

S′={(α1u1, α2u2):u∈S},p′=(α1p1, α2p2)S'=\{(\alpha_1u_1,\ \alpha_2u_2) : u\in S\},\qquad p'=(\alpha_1p_1,\ \alpha_2p_2)S′={(α1​u1​, α2​u2​):u∈S},p′=(α1​p1​, α2​p2​)

be the images under the change of utility scales u↦(α1u1,α2u2)u\mapsto(\alpha_1u_1,\alpha_2u_2)u↦(α1​u1​,α2​u2​). Then p′∈S′p'\in S'p′∈S′, p1′,p2′≥0p'_1,p'_2\ge0p1′​,p2′​≥0, and p′p'p′ is the strict maximizer of u1u2u_1u_2u1​u2​ over S′S'S′ in the closed first quadrant.

Nash applies this with αi=1/pi\alpha_i=1/p_iαi​=1/pi​ (possible because p1,p2>0p_1,p_2>0p1​,p2​>0), so that the maximizer becomes the point (1,1)(1,1)(1,1); the statement is given for arbitrary positive constants, of which that choice is an instance.

Formalization Note The normalization of p. 158 fixes each utility up to multiplication by a positive number; the map u↦(α1u1,α2u2)u\mapsto(\alpha_1u_1,\alpha_2u_2)u↦(α1​u1​,α2​u2​) with αi>0\alpha_i>0αi​>0 is exactly that change of scale.

Preamble
import Mathlib
Formal statement
namespace NashBargainingProblem.Axiomatic
theorem nash_point_rescale (S : Set (ℝ × ℝ)) (p : ℝ × ℝ)
    (hp_mem : p ∈ S) (hp1 : 0 ≤ p.1) (hp2 : 0 ≤ p.2)
    (hp_max : ∀ s ∈ S, 0 ≤ s.1 → 0 ≤ s.2 → s ≠ p → s.1 * s.2 < p.1 * p.2)
    (α₁ α₂ : ℝ) (hα₁ : 0 < α₁) (hα₂ : 0 < α₂) :
    let S' := (fun u : ℝ × ℝ => (α₁ * u.1, α₂ * u.2)) '' S
    let p' : ℝ × ℝ := (α₁ * p.1, α₂ * p.2)
    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 ("Let us now choose the utility functions so that the above-mentioned point is transformed into the point (1, 1). Since this involves the multiplication of the utilities by constants, (1, 1) will now be the point of maximum 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