Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Completeness, p. 2 — a vertex cover of size c_min N gives an allocation with Nash social welfare (1+α)^{β/2.5}

Proved
NSWApxHard.Reduction.completeness

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

completenessnash-social-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1vertex-cover

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 suppose GGG has a vertex cover CCC with ∣C∣=k|C|=k∣C∣=k. In the reduced instance with kkk vertex items there is an allocation xxx with

NSW(x)=(1+α)3k−1.5N2.5N.\mathrm{NSW}(x) = (1+\alpha)^{\frac{3k-1.5N}{2.5N}} .NSW(x)=(1+α)2.5N3k−1.5N​.

With k=cmin⁡Nk=c_{\min}Nk=cmin​N and β=3(cmin⁡−0.5)\beta=3(c_{\min}-0.5)β=3(cmin​−0.5) the exponent is βN/n=β/2.5\beta N/n=\beta/2.5βN/n=β/2.5, the paper's value (1+α)β/2.5(1+\alpha)^{\beta/2.5}(1+α)β/2.5.

This is the completeness half of the reduction: a small vertex cover yields high Nash social welfare.

Differences from the source:

  • generalization: a vertex cover of size c_min N → a vertex cover of any size k, with k vertex items; reason: the page's computation is valid for every k, and k = c_min N gives (1+α)^{β/2.5}.
  • encoding: (1+α)^{β/2.5} → (1+α)^{(3k − 1.5N)/(2.5N)}; reason: βN = 3c_min N − 1.5N = 3k − 1.5N and n = 2.5N, the same number.
  • reading: "the Nash social welfare of the above allocation is (1+α)^{β/2.5}" → some allocation has Nash social welfare exactly (1+α)^{β/2.5}; reason: the explicit allocation is the page's proof, and the claim used on p. 5 is that the reduced instance has this welfare.
  • encoding: a 3-regular graph with N vertices → a graph on Fin N, N = 0 allowed; reason: for N = 0 there are no agents and both sides equal 1, so no instance of the page changes.
Preamble
import Mathlib
import Definitions.Def_NSWApxHard_Reduction_Instance
Formal statement
namespace NSWApxHard.Reduction

/-- Completeness (Lee, p. 2): if the 3-regular graph `G` has a vertex cover `C` of size `k`, the
reduced instance with `k` vertex items has an allocation of Nash social welfare
`(1 + α)^{(3k - 1.5N)/(2.5N)}`, i.e. `(1 + α)^{β/2.5}` with `β N = 3k - 1.5N`. -/
theorem completeness {N : ℕ} (G : SimpleGraph (Fin N)) [DecidableRel G.Adj] (k : ℕ) (α : ℝ)
    (hG : IsCubic G) (hα₁ : 1 / 3 < α) (hα₂ : α < 1 / 2)
    (C : Finset (Fin N)) (hC : G.IsVertexCover ↑C) (hCk : C.card = k) :
    ∃ x : Item G k → Agent G,
      nsw (redUtil G k α) x = (1 + α) ^ ((3 * (k : ℝ) - 3 * N / 2) / (5 * N / 2)) := by sorry

end NSWApxHard.Reduction
Source
Lee, APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items, arXiv:1507.01159v1, p. 2, §2, Completeness
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