Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display after (1), proof of Theorem 9 — d_i(S_i) ≥ (1/N)·d_i(M) + (1 − 1/N)·d_i^min

Proved
MmSChores.RoundRobin.display_after_eq_1

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

choresfair-divisionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1round-robin

Let N≥1N\ge 1N≥1 agents have additive utilities did_idi​ over a nonempty finite set M\mathcal MM of chores with di(j)≤0d_i(j)\le 0di​(j)≤0 for all iii and jjj, and let (S1,…,SN)(S_1,\dots,S_N)(S1​,…,SN​) be the allocation produced by a run of the greedy round-robin protocol (Algorithm 1), under any tie-breaking rule. With dimin⁡=min⁡j∈Mdi(j)d_i^{\min}=\min_{j\in\mathcal M} d_i(j)dimin​=minj∈M​di​(j), every agent iii satisfies

di(Si) ≥ 1N⋅di(M)+(1−1N)⋅dimin⁡.d_i(S_i)\ \ge\ \frac1N\cdot d_i(\mathcal M)+\Big(1-\frac1N\Big)\cdot d_i^{\min}.di​(Si​) ≥ N1​⋅di​(M)+(1−N1​)⋅dimin​.

This averaged form of eq. (1) bounds an agent's round-robin bundle by her proportional share plus a correction of at most (1−1N)(1-\tfrac1N)(1−N1​) times her worst chore; together with the two upper bounds on the max-min share it yields Theorem 9.

Formalization Note As for eq. (1): the run is any σ with IsRoundRobinRun d σ, SiS_iSi​ is rrBundle σ i, di(M)d_i(\mathcal M)di​(M) is bval d i univ, and dimin⁡d_i^{\min}dimin​ is Finset.univ.inf' hm (d i). The factor 1/N1/N1/N is the real number 1 / (N : ℝ).

Differences from the source:

  • generalization: chores instance (d_i(j) ≤ 0 and d_i ≢ 0) → only d_i(j) ≤ 0 for all i, j; reason: the condition d_i ≢ 0 is not used, and every chores instance satisfies the Lean 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

/-- Display after (1), proof of Theorem 9 (PDF p. 4): in every round-robin run on non-positive
utilities, `d_i(S_i) ≥ (1/N) · d_i(M) + (1 - 1/N) · d_i^min` for every agent `i`. -/
theorem display_after_eq_1 {N m : ℕ} (hN : 0 < N) (hm : (univ : Finset (Fin m)).Nonempty)
    (d : Fin N → Fin m → ℝ) (hd : ∀ i j, d i j ≤ 0) (σ : Fin m ≃ Fin m)
    (hσ : IsRoundRobinRun d σ) (i : Fin N) :
    (1 / (N : ℝ)) * bval d i univ + (1 - 1 / (N : ℝ)) * univ.inf' hm (d i)
      ≤ bval d i (rrBundle σ 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, 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