Theorem 2 ("only if"), pp. 321, 324–325 — a solution satisfying WPO, An, S. Inv and Mon dominates the Kalai–Smorodinsky solution
ProvedThomsonKS.Char.theorem_2Let be a solution: for every finite group of agents and every it selects a point . If satisfies weak Pareto-optimality (WPO), anonymity (An), scale invariance (S. Inv) and population monotonicity (Mon), then
where is the Kalai–Smorodinsky solution and is the coordinatewise order.
This is the key step of the characterization: together with the fact that is the only weakly Pareto-optimal point of on its ray, it pins down on problems where weak and strong Pareto-optimality agree (Corollary 1), and with continuity everywhere (Theorem 3).
Formalization Note The paper prints Theorem 2 as an "if and only if". Only the "only if" direction is stated here. The "if" direction, that every solution with satisfies WPO, An, S. Inv and Mon, is false (a solution can dominate and violate S. Inv or An, e.g. by selecting on and elsewhere), neither proof in the paper argues it, and no later result uses it.
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
namespace ThomsonKS.Char
theorem theorem_2 (F : Solution) (hF : IsSolution F) (hW : WPO F) (hA : An F)
(hI : SInv F) (hM : Mon F) : ∀ P : Finset ℕ, ∀ S ∈ DivProb P, KS P S ≤ F P S := by sorry
end ThomsonKS.Char
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.