Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1, p. 322 — under WPO, An, S. Inv and Mon, F coincides with K on Σ̃^P

Proved
ThomsonKS.Char.corollary_1

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. If FFF satisfies WPO, An, S. Inv and Mon, then

FP(S)=KP(S)for every finite group P and every S∈Σ~P,F^P(S) = K^P(S) \qquad \text{for every finite group } P \text{ and every } S \in \tilde\Sigma^P,FP(S)=KP(S)for every finite group P and every S∈Σ~P,

where Σ~P\tilde\Sigma^PΣ~P is the class of problems in ΣP\Sigma^PΣP satisfying (c): for all x,y∈Sx, y \in Sx,y∈S with y⩾xy \geqslant xy⩾x (y≧xy \geqq xy≧x, y≠xy \ne xy=x) there is z∈Sz \in Sz∈S with z>xz > xz>x in every coordinate. On such problems weakly Pareto-optimal points are Pareto-optimal.

Continuity is not needed on this restricted class; it enters only to pass from Σ~P\tilde\Sigma^PΣ~P to all of ΣP\Sigma^PΣP (Theorem 3).

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

theorem corollary_1 (F : Solution) (hF : IsSolution F) (hW : WPO F) (hA : An F)
    (hI : SInv F) (hM : Mon F) : ∀ P : Finset ℕ, ∀ S ∈ DivProbTilde P, F P S = KS 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), p. 322, Corollary 1 (condition (c) on the same page)
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