Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9, last sentence (first half) — (1/N)·d_i(M) ≥ MmS^N_{d_i}(M)

Proved
MmSChores.RoundRobin.mms_le_average

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

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

Let N≥1N\ge 1N≥1 agents have additive utilities did_idi​ over a finite set M\mathcal MM of items, and let

MmSdiN(M)=max⁡(S1,…,SN)∈ΠN(M) min⁡j∈[N]di(Sj)\mathrm{MmS}^N_{d_i}(\mathcal M)=\max_{(S_1,\dots,S_N)\in\Pi_N(\mathcal M)}\ \min_{j\in[N]} d_i(S_j)MmSdi​N​(M)=(S1​,…,SN​)∈ΠN​(M)max​ j∈[N]min​di​(Sj​)

be agent iii's max-min share, the maximum ranging over all allocations of M\mathcal MM into NNN (possibly empty) bundles. Then for every agent iii,

1N⋅di(M) ≥ MmSdiN(M).\frac1N\cdot d_i(\mathcal M)\ \ge\ \mathrm{MmS}^N_{d_i}(\mathcal M).N1​⋅di​(M) ≥ MmSdi​N​(M).

The max-min share never exceeds the proportional share. The paper states this "in every chores setting"; it holds for arbitrary real additive utilities.

Formalization Note The max-min share is the published LittleCharity.MMS.mms (bval d i) N univ, a supremum over labelled maps Fin m → Fin N (bundles may be empty) of the minimum bundle value; for N ≥ 1 both index types are finite and nonempty, so it is the true max-min.

Differences from the source:

  • generalization: in every chores setting (d_i(j) ≤ 0, d_i ≢ 0) → arbitrary real utilities d_i, no sign condition; reason: the inequality holds for every additive utility and specializes to chores instances
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), first half of the last sentence: `1/N · d_i(M) ≥ MmS^N_{d_i}(M)`.
It holds for every real additive utility, with no sign condition. -/
theorem mms_le_average {N m : ℕ} (hN : 0 < N) (d : Fin N → Fin m → ℝ) (i : Fin N) :
    LittleCharity.MMS.mms (bval d i) N univ ≤ (1 / (N : ℝ)) * bval d i univ := 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