Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9, last sentence (second half) — d_i^min ≥ MmS^N_{d_i}(M) for chores

Proved
MmSChores.RoundRobin.mms_le_dmin

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

choresfair-divisionmaximin-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let N≥1N\ge 1N≥1 agents have additive utilities over a nonempty finite set M\mathcal MM of items, and let agent iii's utilities be non-positive: di(j)≤0d_i(j)\le 0di​(j)≤0 for every j∈Mj\in\mathcal Mj∈M. With dimin⁡=min⁡j∈Mdi(j)d_i^{\min}=\min_{j\in\mathcal M} d_i(j)dimin​=minj∈M​di​(j) and MmSdiN(M)\mathrm{MmS}^N_{d_i}(\mathcal M)MmSdi​N​(M) her max-min share over all allocations into NNN (possibly empty) bundles,

dimin⁡ ≥ MmSdiN(M).d_i^{\min}\ \ge\ \mathrm{MmS}^N_{d_i}(\mathcal M).dimin​ ≥ MmSdi​N​(M).

For chores, no allocation can give every bundle more than the worst single chore. Together with the proportional-share bound and the averaged form of eq. (1) it gives Theorem 9.

Formalization Note dimin⁡d_i^{\min}dimin​ is Finset.univ.inf' hm (d i) and the max-min share is LittleCharity.MMS.mms (bval d i) N univ.

Differences from the source:

  • generalization: in every chores setting (all agents, d_i(j) ≤ 0, d_i ≢ 0) → only agent i's utilities are non-positive, and d_i ≢ 0 is dropped; reason: the bound for agent i uses only her own signs; chores instances satisfy the hypotheses
  • encoding: M nonempty, implicit in d_i^min = min_{j∈M} d_i(j) → explicit hypothesis that the chore set is nonempty; reason: the minimum is defined only on a nonempty set
Preamble
import Mathlib
import Definitions.Def_LittleCharity_MMS_Setting
import Definitions.Def_MmSChores_RoundRobin_Setting
Formal statement
namespace MmSChores.RoundRobin

open Finset

/-- Proof of Theorem 9 (PDF p. 4), second half of the last sentence: `d_i^min ≥ MmS^N_{d_i}(M)`
when all of agent `i`'s utilities are non-positive. -/
theorem mms_le_dmin {N m : ℕ} (hN : 0 < N) (hm : (univ : Finset (Fin m)).Nonempty)
    (d : Fin N → Fin m → ℝ) (i : Fin N) (hd : ∀ j, d i j ≤ 0) :
    LittleCharity.MMS.mms (bval d i) N univ ≤ univ.inf' hm (d i) := by sorry

end MmSChores.RoundRobin
Source
Aziz, Rauchecker, Schryen & Walsh, Algorithms for Max-Min Share Fair Allocation of Indivisible Chores, AAAI 2017, PDF p. 4, proof of Theorem 9, sentence after the display after eq. (1)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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