Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM — characterization of perfect-equilibrium partitions

Disproved
RubinsteinBargaining.PEP.pep_characterization

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

bargainingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1perfect-equilibrium

Assume each player's complete, reflexive, transitive preference relation satisfies (A-1)–(A-5). Let AAA and BBB be the perfect-equilibrium partition sets for the two opening orders, and let Δ1,Δ2\Delta_1,\Delta_2Δ1​,Δ2​ be the projections of the one-period threshold correspondence. Then

A=Δ1≠∅,B=Δ2≠∅.A=\Delta_1\ne\varnothing,\qquad B=\Delta_2\ne\varnothing.A=Δ1​=∅,B=Δ2​=∅.

Both AAA and BBB are nonempty closed intervals. There is e≥0e\ge0e≥0 such that

B={a−e:a∈A}.B=\{a-e:a\in A\}.B={a−e:a∈A}.

The result characterizes all player-1 shares obtainable from perfect equilibria, including cases with more than one partition.

Formalization Note A closed interval is an actual [ℓ,u][\ell,u][ℓ,u] with ℓ≤u\ell\le uℓ≤u; a singleton is permitted. The translate is an image under a↦a−ea\mapsto a-ea↦a−e, not a set difference.

Preamble
import Definitions.Def_RubinsteinBargaining_PEP_EquilibriumSets
import Definitions.Def_RubinsteinBargaining_PEP_Delta
Formal statement
namespace RubinsteinBargaining.PEP

theorem pep_characterization (p : Preferences) (h : FullAxioms p) :
    A p = Delta1 p ∧
    (A p).Nonempty ∧
    B p = Delta2 p ∧
    (B p).Nonempty ∧
    (∃ lo hi : ℝ, lo ≤ hi ∧ A p = Set.Icc lo hi) ∧
    (∃ lo hi : ℝ, lo ≤ hi ∧ B p = Set.Icc lo hi) ∧
    ∃ e : ℝ, 0 ≤ e ∧ B p = (fun x : ℝ => x - e) '' A p := by sorry

end RubinsteinBargaining.PEP
Source
Rubinstein, Perfect Equilibrium in a Bargaining Model, Econometrica 50 (1982), p. 106, THEOREM, https://doi.org/10.2307/1912531
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