Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3 — for α ∈ (1/3, 1/2) some optimal allocation gives each vertex agent ≤ 1 vertex item and obeys the four-step rule

Proved
NSWApxHard.Reduction.lemma_2_3

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. Then there is an allocation xxx of maximum Nash social welfare in which every vertex agent holds at most one vertex item and every shared item i(v,e)i(v,e)i(v,e) satisfies the following rule:

  1. if a(v)a(v)a(v) has 1 vertex item, a(e)a(e)a(e) gets i(v,e)i(v,e)i(v,e);
  2. else, if a(e)a(e)a(e) has 1 shared item other than i(v,e)i(v,e)i(v,e), a(v)a(v)a(v) gets i(v,e)i(v,e)i(v,e);
  3. else, if a(v)a(v)a(v) has 2 shared items other than i(v,e)i(v,e)i(v,e), a(e)a(e)a(e) gets i(v,e)i(v,e)i(v,e);
  4. else a(v)a(v)a(v) gets i(v,e)i(v,e)i(v,e).

The rule pins down the structure of an optimal allocation completely enough to count the agents of each utility level, which is what Lemma 2.4 does.

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 Lemma 2.2, which needs only fewer vertex items than vertex agents, and k = c_min N is the page's case.
  • reading: "a(e) has 1 shared item other than i(v, e)", "a(v) has 2 shared items other than i(v, e)" → the number of all shared items other than i(v, e) held by the agent is 1, resp. 2; reason: literal reading; in an optimal allocation no agent holds a shared item worth 0 to it, so the count equals the count of the agent's own shared items.
  • reading: the section's standing assumption that G is 3-regular (p. 2) → an explicit hypothesis; reason: Lemma 2.3's sentence does not repeat it.
Preamble
import Mathlib
import Definitions.Def_NSWApxHard_Reduction_Instance
Formal statement
namespace NSWApxHard.Reduction

/-- Lemma 2.3 (Lee, p. 3): for `α ∈ (1/3, 1/2)` and `k < N`, some optimal allocation of the
reduced instance gives each vertex agent at most one vertex item, and every shared item
`i(v, e)` is allocated by the four-step rule `Rule`. -/
theorem lemma_2_3 {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) ∧
      ∀ s : Inc G, Rule x s := by sorry

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