Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 for |P| = 2, pp. 321–322 — under WPO, An, S. Inv and Mon, F^P(S) ≧ K^P(S) for two-agent groups

Proved
ThomsonKS.Char.theorem_2_card_two

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

bargainingkalai-smorodinskyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1population-monotonicity

Let FFF be a solution: for every finite group PPP of agents and every S∈ΣPS \in \Sigma^PS∈ΣP it selects a point FP(S)∈SF^P(S) \in SFP(S)∈S. Suppose FFF satisfies weak Pareto-optimality (WPO), anonymity (An), scale invariance (S. Inv) and population monotonicity (Mon). Then for every two-agent group PPP (∣P∣=2|P| = 2∣P∣=2) and every S∈ΣPS \in \Sigma^PS∈ΣP,

FP(S)≧KP(S),F^P(S) \geqq K^P(S),FP(S)≧KP(S),

i.e. FiP(S)≥KiP(S)F^P_i(S) \ge K^P_i(S)FiP​(S)≥KiP​(S) for both agents i∈Pi \in Pi∈P, where KKK is the Kalai–Smorodinsky solution.

This is the case of Theorem 2 that the paper proves in the body of §3, by adding a single third agent; the general case is Theorem 2 (appendix).

Formalization Note Continuity is not assumed. The statement is the "only if" content of Theorem 2 restricted to ∣P∣=2|P| = 2∣P∣=2; the printed "if" direction is not part of it (see the Theorem 2 item).

Preamble
import Mathlib
import Definitions.Def_ThomsonKS_Char_Setting
Formal statement
namespace ThomsonKS.Char

theorem theorem_2_card_two (F : Solution) (hF : IsSolution F) (hW : WPO F) (hA : An F)
    (hI : SInv F) (hM : Mon F) (P : Finset ℕ) (hP : P.card = 2) (S : Set (P → ℝ))
    (hS : S ∈ DivProb P) : KS P S ≤ F P S := by sorry

end ThomsonKS.Char
Source
Thomson, The fair division of a fixed supply among a growing population, Math. Oper. Res. 8 (1983), pp. 321–322, Theorem 2, proof for |P| = 2 in §3
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