Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 2 — the reduced instance has n = N + M = 2.5N agents and m = c_min N + M + 3N items

Proved
NSWApxHard.Reduction.instance_size

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

nash-social-welfarep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1reduction

Let GGG be a 3-regular graph on NNN vertices, so that it has M=1.5NM=1.5NM=1.5N edges, and build the reduced instance with kkk vertex items. Then the numbers nnn of agents and mmm of items satisfy

n=N+M=2.5N,m=k+M+3N=k+4.5N.n = N+M = 2.5N,\qquad m = k + M + 3N = k + 4.5N .n=N+M=2.5N,m=k+M+3N=k+4.5N.

With k=cmin⁡Nk=c_{\min}Nk=cmin​N this is the paper's m=(4.5+cmin⁡)Nm=(4.5+c_{\min})Nm=(4.5+cmin​)N.

The count fixes the exponent 1/n=1/(2.5N)1/n = 1/(2.5N)1/n=1/(2.5N) in every welfare computation of the reduction and shows the instance has polynomial size.

Formalization Note The identities are stated doubled, 2n=5N2n=5N2n=5N and 2m=2k+9N2m=2k+9N2m=2k+9N, in the natural numbers.

Differences from the source:

  • generalization: c_min N vertex items → any number k of vertex items; reason: the count holds for every k, and k = c_min N gives the page's identity.
  • encoding: n = 2.5N, m = (4.5 + c_min)N → 2n = 5N, 2m = 2k + 9N in ℕ; reason: same identities without fractions.
  • encoding: a 3-regular graph with N vertices → a graph on Fin N, N = 0 allowed; reason: for N = 0 both sides are 0, so no instance of the page changes.
Preamble
import Mathlib
import Definitions.Def_NSWApxHard_Reduction_Instance
Formal statement
namespace NSWApxHard.Reduction

/-- Lee, p. 2: for a 3-regular graph on `N` vertices with `k` vertex items, the reduced instance
has `n = N + M = 2.5N` agents and `m = k + M + 3N = k + 4.5N` items. -/
theorem instance_size {N : ℕ} (G : SimpleGraph (Fin N)) [DecidableRel G.Adj] (k : ℕ)
    (hG : IsCubic G) :
    2 * Fintype.card (Agent G) = 5 * N ∧ 2 * Fintype.card (Item G k) = 2 * k + 9 * N := by sorry

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