Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, p. 321 — the Kalai–Smorodinsky solution satisfies WPO, An, S. Inv, Cont and Mon

Proved
ThomsonKS.Char.theorem_1

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

axiomatic-characterizationbargainingkalai-smorodinskyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K={KP}K = \{K^P\}K={KP} be the Kalai–Smorodinsky solution: for every finite group PPP of agents and every division problem S∈ΣPS \in \Sigma^PS∈ΣP, KP(S)K^P(S)KP(S) is the largest point of SSS on the segment from the origin to the ideal point a(S)a(S)a(S), ai(S)=max⁡x∈Sxia_i(S) = \max_{x \in S} x_iai​(S)=maxx∈S​xi​. Then

KP(S)∈S for all S∈ΣP,and K satisfies WPO, An, S. Inv, Cont and Mon.K^P(S) \in S \text{ for all } S \in \Sigma^P, \quad\text{and } K \text{ satisfies WPO, An, S. Inv, Cont and Mon.}KP(S)∈S for all S∈ΣP,and K satisfies WPO, An, S. Inv, Cont and Mon.

That is: KP(S)K^P(S)KP(S) is weakly Pareto-optimal in SSS; it commutes with relabellings of the agents; it commutes with positive coordinatewise rescalings of utilities; it depends continuously on SSS in the Hausdorff metric; and when a group PPP is enlarged to Q⊇PQ \supseteq PQ⊇P with S=T∩RPS = T \cap \mathbb R^PS=T∩RP, no member of PPP receives more in TTT than in SSS, KiQ(T)≤KiP(S)K^Q_i(T) \le K^P_i(S)KiQ​(T)≤KiP​(S).

This is the sufficiency half of the paper's characterization of the Kalai–Smorodinsky solution.

Formalization Note The fact that KP(S)K^P(S)KP(S) is a point of SSS for every S∈ΣPS \in \Sigma^PS∈ΣP is implicit on the page (the solution selects "the maximal element of SSS on the segment"); it is stated here as the first conjunct IsSolution KS.

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

theorem theorem_1 : IsSolution KS ∧ WPO KS ∧ An KS ∧ SInv KS ∧ Cont KS ∧ Mon KS := by sorry

end ThomsonKS.Char
Source
Thomson, The fair division of a fixed supply among a growing population, Math. Oper. Res. 8 (1983), p. 321, Theorem 1
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