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
ProvedThomsonKS.Char.replica_problem_existsLet be a finite group of agents, , and a division problem normalized so that its ideal point is (all coordinates ). Let be such that . Then there is a larger group with
and a division problem such that
- (the zero-extension of lies in exactly when );
- ;
- for every agent there is a group with and a bijection with such that is the relabelling of along , i.e. .
In words: every member of faces, in a subproblem of , an exact replica of the position held by agent in . This is the construction on which the general proof of Theorem 2 rests; the paper builds with and , and with , and asserts that , and .
Formalization Note The page fixes after an application of An; here is any member of , a harmless generalization. The page's explicit construction (the sets , the bijections , the replicas and the hull ) is stated existentially: what the proof of Theorem 2 uses is the existence of , and the replica subproblems with the listed properties. The cardinality is the count the paper states in §4.2 (p. 323) for this construction; since , and the natural-number subtraction is exact.
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.