Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.6 — v_1({h_1, h_4}) ≥ µ_1 and max{v_1({h_1}), v_1({h_2, h_3})} ≥ µ_1 for four sorted positive goods

Proved
StrategicAlloc.EFXFour.lemma_4_6

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

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

Consider two agents and four goods with additive non-negative valuations, and name the goods h1,h2,h3,h4h_1, h_2, h_3, h_4h1​,h2​,h3​,h4​ so that agent 1's values are sorted and all positive:

v1(h1)≥v1(h2)≥v1(h3)≥v1(h4)>0.v_1(h_1) \ge v_1(h_2) \ge v_1(h_3) \ge v_1(h_4) > 0.v1​(h1​)≥v1​(h2​)≥v1​(h3​)≥v1​(h4​)>0.

Then the maximin share μ1\mu_1μ1​ of agent 1 satisfies

v1({h1,h4})≥μ1andmax⁡{v1({h1}), v1({h2,h3})}≥μ1.v_1(\{h_1, h_4\}) \ge \mu_1 \qquad\text{and}\qquad \max\{v_1(\{h_1\}),\ v_1(\{h_2, h_3\})\} \ge \mu_1.v1​({h1​,h4​})≥μ1​andmax{v1​({h1​}), v1​({h2​,h3​})}≥μ1​.

The paper attributes the lemma to the proof of Theorem 5.1 of Amanatidis, Birmpas and Markakis, On truthful mechanisms for maximin share allocations (IJCAI 2016). In the proof of Theorem 4.5 it identifies three bundles that always guarantee agent 1 her maximin share, which reduces the possible bundles of an agent who misses it to a short list.

Formalization Note The renaming of the goods is a bijection hhh of Fin 4, with hjh_jhj​ = h (j - 1). The page writes viv_ivi​ in the conclusion; the context ("v1v_1v1​ as above") makes clear that v1v_1v1​ is meant, and the Lean states it for agent 1 (0).

Preamble
import Mathlib
import Definitions.Def_StrategicAlloc_EFXFour_Setting
Formal statement
namespace StrategicAlloc.EFXFour

theorem lemma_4_6 (v : Fin 2 → Fin 4 → ℝ) (hv : ∀ i g, 0 ≤ v i g) (h : Fin 4 ≃ Fin 4)
    (h01 : v 0 (h 1) ≤ v 0 (h 0)) (h12 : v 0 (h 2) ≤ v 0 (h 1)) (h23 : v 0 (h 3) ≤ v 0 (h 2))
    (h3pos : 0 < v 0 (h 3)) :
    mu v 0 ≤ StrategicAlloc.RRFair.val v 0 {h 0, h 3} ∧ mu v 0 ≤ max (StrategicAlloc.RRFair.val v 0 {h 0}) (StrategicAlloc.RRFair.val v 0 {h 1, h 2}) := by sorry

end StrategicAlloc.EFXFour
Source
Amanatidis et al., Allocating Indivisible Goods to Strategic Agents, arXiv:2109.08644v2, p. 19, Lemma 4.6 (renaming h_1, …, h_4 from the proof of Theorem 4.5, p. 19)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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