Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, proof of Theorem 2, p. 325 — the replica problem T ∈ Σ^Q with |Q| = 3|P| − 2 in which every agent faces a copy of agent 1's position in S

Proved
ThomsonKS.Char.replica_problem_exists

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

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

Let PPP be a finite group of agents, i0∈Pi_0 \in Pi0​∈P, and S∈ΣPS \in \Sigma^PS∈ΣP a division problem normalized so that its ideal point is a(S)=ePa(S) = e^Pa(S)=eP (all coordinates 111). Let a≥0a \ge 0a≥0 be such that a eP∈Sa\,e^P \in SaeP∈S. Then there is a larger group Q⊇PQ \supseteq PQ⊇P with

∣Q∣=3∣P∣−2|Q| = 3|P| - 2∣Q∣=3∣P∣−2

and a division problem T∈ΣQT \in \Sigma^QT∈ΣQ such that

  1. T∩RP=ST \cap \mathbb R^P = ST∩RP=S (the zero-extension of x∈RPx \in \mathbb R^Px∈RP lies in TTT exactly when x∈Sx \in Sx∈S);
  2. a eQ∈Ta\,e^Q \in TaeQ∈T;
  3. for every agent j∈Qj \in Qj∈Q there is a group Pj⊆QP_j \subseteq QPj​⊆Q with j∈Pjj \in P_jj∈Pj​ and a bijection σ:P→Pj\sigma : P \to P_jσ:P→Pj​ with σ(i0)=j\sigma(i_0) = jσ(i0​)=j such that T∩RPjT \cap \mathbb R^{P_j}T∩RPj​ is the relabelling of SSS along σ\sigmaσ, i.e. T∩RPj={x′:∃x∈S, xσ(i)′=xi ∀i∈P}T \cap \mathbb R^{P_j} = \{x' : \exists x \in S,\ x'_{\sigma(i)} = x_i\ \forall i \in P\}T∩RPj​={x′:∃x∈S, xσ(i)′​=xi​ ∀i∈P}.

In words: every member of QQQ faces, in a subproblem of TTT, an exact replica of the position held by agent i0i_0i0​ in SSS. This is the construction on which the general proof of Theorem 2 rests; the paper builds Q=P∪P2∪P3Q = P \cup P^2 \cup P^3Q=P∪P2∪P3 with P1=P∖{i0}P^1 = P \setminus\{i_0\}P1=P∖{i0​} and ∣P2∣=∣P3∣=∣P1∣|P^2| = |P^3| = |P^1|∣P2∣=∣P3∣=∣P1∣, and T=cch{S,Si,x∗}T = \mathrm{cch}\{S, S^i, x^*\}T=cch{S,Si,x∗} with x∗=aeQx^* = a e^Qx∗=aeQ, and asserts that T∈ΣQT \in \Sigma^QT∈ΣQ, T∩RP=ST \cap \mathbb R^P = ST∩RP=S and T∩RPi=SiT \cap \mathbb R^{P_i} = S^iT∩RPi​=Si.

Formalization Note The page fixes i0=1i_0 = 1i0​=1 after an application of An; here i0i_0i0​ is any member of PPP, a harmless generalization. The page's explicit construction (the sets P2,P3P^2, P^3P2,P3, the bijections γ1,γ2\gamma^1, \gamma^2γ1,γ2, the replicas SiS^iSi and the hull TTT) is stated existentially: what the proof of Theorem 2 uses is the existence of QQQ, TTT and the replica subproblems with the listed properties. The cardinality 3∣P∣−23|P| - 23∣P∣−2 is the count the paper states in §4.2 (p. 323) for this construction; since i0∈Pi_0 \in Pi0​∈P, ∣P∣≥1|P| \ge 1∣P∣≥1 and the natural-number subtraction is exact.

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

theorem replica_problem_exists (P : Finset ℕ) (i₀ : ℕ) (hi₀ : i₀ ∈ P) (S : Set (P → ℝ))
    (hS : S ∈ DivProb P) (ha : idealPt S = fun _ => 1) (a : ℝ) (haS : (fun _ => a) ∈ S) :
    ∃ Q : Finset ℕ, ∃ hPQ : P ⊆ Q, Q.card = 3 * P.card - 2 ∧
      ∃ T ∈ DivProb Q, {x | zeroExt hPQ x ∈ T} = S ∧ (fun _ => a) ∈ T ∧
        ∀ j ∈ Q, ∃ Pj : Finset ℕ, ∃ hPj : Pj ⊆ Q, ∃ hj : j ∈ Pj,
          ∃ σ : P ≃ Pj, σ ⟨i₀, hi₀⟩ = ⟨j, hj⟩ ∧
            {x | zeroExt hPj x ∈ T} = relabel σ 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. 325, Appendix, proof of Theorem 2 (the construction of T and the claim 'It is clear that T is in Σ^Q, that T ∩ R^P = S and for each i ..., T ∩ R^{P_i} = S^i'); cardinality 3|P| − 2 from §4.2, p. 323
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