Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — some optimal allocation gives each vertex agent at most one vertex item

Proved
NSWApxHard.Reduction.lemma_2_2

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

exchange-argumentnash-social-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1soundness

Let GGG be a 3-regular graph on NNN vertices, let α∈(1/3,1/2)\alpha\in(1/3,1/2)α∈(1/3,1/2), and consider the reduced instance with k<Nk<Nk<N vertex items (fewer vertex items than vertex agents). Then there is an allocation xxx of maximum Nash social welfare such that

vItemsx(v)≤1for every vertex v,\mathrm{vItems}_x(v)\le 1\qquad\text{for every vertex } v,vItemsx​(v)≤1for every vertex v,

i.e. every vertex agent holds at most one vertex item.

This is the first normal form of an optimal allocation used in the soundness analysis.

Differences from the source:

  • generalization: c_min N vertex items with c_min N < N → any number k < N of vertex items; reason: the proof uses only that there are fewer vertex items than vertex agents (p. 3), and k = c_min N is the page's case.
  • reading: the section's standing assumptions (G 3-regular, "Let α be a constant in (1/3, 1/2)", p. 2) → explicit hypotheses; reason: Lemma 2.2's sentence does not repeat them.
Preamble
import Mathlib
import Definitions.Def_NSWApxHard_Reduction_Instance
Formal statement
namespace NSWApxHard.Reduction

/-- Lemma 2.2 (Lee, p. 2): if there are fewer vertex items than vertex agents (`k < N`), some
optimal allocation of the reduced instance gives each vertex agent at most one vertex item. -/
theorem lemma_2_2 {N : ℕ} (G : SimpleGraph (Fin N)) [DecidableRel G.Adj] (k : ℕ) (α : ℝ)
    (hG : IsCubic G) (hα₁ : 1 / 3 < α) (hα₂ : α < 1 / 2) (hk : k < N) :
    ∃ x : Item G k → Agent G,
      IsOptimal (redUtil G k α) x ∧ ∀ v : Fin N, vItems x v ≤ 1 := by sorry

end NSWApxHard.Reduction
Source
Lee, APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items, arXiv:1507.01159v1, p. 2, Lemma 2.2 (proof p. 3)
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