Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, p. 323 — every problem in Σ^P is a Hausdorff limit of problems in Σ̃^P

Proved
ThomsonKS.Char.sigmaTilde_dense

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

bargainingconvex-setshausdorff-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For every finite group PPP of agents and every division problem S∈ΣPS \in \Sigma^PS∈ΣP there is a sequence (Sk)k≥0(S^k)_{k \ge 0}(Sk)k≥0​ of problems in Σ~P\tilde\Sigma^PΣ~P converging to SSS in the Hausdorff metric:

Sk∈Σ~P for all k,dH(Sk,S)→0.S^k \in \tilde\Sigma^P \ \text{for all } k, \qquad d_H(S^k, S) \to 0 .Sk∈Σ~P for all k,dH​(Sk,S)→0.

Here Σ~P\tilde\Sigma^PΣ~P is the class of problems of ΣP\Sigma^PΣP satisfying condition (c) (for all x,y∈Sx, y \in Sx,y∈S with y⩾xy \geqslant xy⩾x there is z∈Sz \in Sz∈S with z>xz > xz>x). 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 RP\mathbb R^PRP; 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
  • 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