Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.7, p. 21 — under the same hypotheses agent i's own bundle has at least two positive goods

Proved
StrategicAlloc.EFXTwoThirds.two_pos_goods_own

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

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

Let two agents have additive non-negative valuations over a finite set MMM of goods, and let (A1,A2)(A_1,A_2)(A1​,A2​) be an EFX allocation. If agent iii has maximin share μi>0\mu_i>0μi​>0 and vi(Ai)≤23μiv_i(A_i)\le\tfrac23\mu_ivi​(Ai​)≤32​μi​, then

∣{g∈Ai:vi(g)>0}∣ ≥ 2.\bigl|\{g\in A_i : v_i(g)>0\}\bigr|\ \ge\ 2 .​{g∈Ai​:vi​(g)>0}​ ≥ 2.

This is the second step of the proof of Theorem 4.7; it supplies the goods h3,h4h_3,h_4h3​,h4​ on which the auxiliary instance v∗v^*v∗ is built.

Formalization Note As for the previous step, the page argues for agent 1 after a "without loss of generality"; the statement is posed for an arbitrary agent iii, with the proof's context μi>0\mu_i>0μi​>0 and vi(Ai)≤23μiv_i(A_i)\le\tfrac23\mu_ivi​(Ai​)≤32​μi​ as hypotheses.

Preamble
import Mathlib
import Definitions.Def_StrategicAlloc_EFXTwoThirds_Setting
Formal statement
namespace StrategicAlloc.EFXTwoThirds

/-- Proof of Theorem 4.7 (p. 21, second paragraph): under the hypotheses of `k_eq_two`, agent
`i`'s own bundle `A_i` contains at least two goods of positive value to `i`. -/
theorem two_pos_goods_own {m : ℕ} (v : Fin 2 → Fin m → ℝ) (hv : ∀ i g, 0 ≤ v i g)
    (A : Fin 2 → Finset (Fin m)) (hA : IsAllocation A) (hEFX : IsEFX v A)
    (i : Fin 2) (hmu : 0 < StrategicAlloc.EFXFour.mu v i)
    (hle : val v i (A i) ≤ 2 / 3 * StrategicAlloc.EFXFour.mu v i) :
    2 ≤ ((A i).filter (fun g => 0 < v i g)).card := by sorry

end StrategicAlloc.EFXTwoThirds
Source
Amanatidis et al., Allocating Indivisible Goods to Strategic Agents, arXiv:2109.08644v2, p. 21, §4.2, proof of Theorem 4.7, second paragraph
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