Proof of Theorem 3, p. 323 — every problem in Σ^P is a Hausdorff limit of problems in Σ̃^P
ProvedThomsonKS.Char.sigmaTilde_densebargainingconvex-setshausdorff-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
For every finite group of agents and every division problem there is a sequence of problems in converging to in the Hausdorff metric:
Here is the class of problems of satisfying condition (c) (for all with there is with ). This density fact is the second ingredient of the proof of Theorem 3, alongside Theorem 2.
Formalization Note The Hausdorff distance is the extended Hausdorff distance for the sup metric on ; groups are nonempty, as everywhere in the mission (see the Setting item).
Preamble
import Mathlib import Definitions.Def_ThomsonKS_Char_Setting
Formal statement
namespace ThomsonKS.Char
open Filter Topology
theorem sigmaTilde_dense : ∀ P : Finset ℕ, ∀ S ∈ DivProb P, ∃ Sk : ℕ → Set (P → ℝ),
(∀ k, Sk k ∈ DivProbTilde P) ∧
Tendsto (fun k => Metric.hausdorffEDist (Sk k) S) atTop (𝓝 0) := by sorry
end ThomsonKS.Char
Source
Thomson, The fair division of a fixed supply among a growing population, Math. Oper. Res. 8 (1983), p. 323, proof of Theorem 3 ('any element of Σ^P can be approximated by a sequence of elements of Σ̃^P')
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.