Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, §8 — for a fixed label-set size, the Unique Label Cover → MAX-CUT reduction of §8.1 is polynomial-time computable

Open
OptInapprox.MaxCut.reductionGraph_polyTime

by tianyipeng · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

hardness-of-approximationmax-cutpolynomial-timeturing-machineunique-games-conjecture

Fix natural numbers M0M_0M0​ (the label-set size), RRR, KKK, ppp and qqq. Then the map sending a Unique Label Cover instance L\mathcal LL with label set [M0][M_0][M0​] to the weighted MAX-CUT instance GR,K,p,q(L)G_{R,K,p,q}(\mathcal L)GR,K,p,q​(L) of the §8.1 reduction (reductionGraph) is computable in polynomial time on encodings: there is a function ggg from strings over the Label Cover alphabet to strings over the MAX-CUT alphabet, computable in polynomial time by a one-tape Turing machine, such that

g(encULC(L))=encMaxCut(GR,K,p,q(L))for every L with M=M0.g\big(\mathrm{enc}_{\mathrm{ULC}}(\mathcal L)\big)=\mathrm{enc}_{\mathrm{MaxCut}}\big(G_{R,K,p,q}(\mathcal L)\big)\qquad\text{for every }\mathcal L\text{ with }M=M_0.g(encULC​(L))=encMaxCut​(GR,K,p,q​(L))for every L with M=M0​.

This is the "the reduction runs in polynomial time" part of the proof of Theorem 1: since the label-set size M0M_0M0​ is a constant, the Long Code tables have constant size 2M02^{M_0}2M0​, and the instance has ∣W∣ R 2M0|W|\,R\,2^{M_0}∣W∣R2M0​ vertices and at most ∣V∣⋅2K∣W∣2⋅R2 4M0(2q)M0|V|\cdot 2K|W|^2\cdot R^2\,4^{M_0}(2q)^{M_0}∣V∣⋅2K∣W∣2⋅R24M0​(2q)M0​ edges (with multiplicity), each written with O(∣W∣R2M0)O(|W|R2^{M_0})O(∣W∣R2M0​) symbols, so the output has polynomial length and is produced by nested loops over vvv, pairs of neighbours of vvv, copies, and the constant-size cube.

Formalization Note. Encodings are the ones of the mission's definitions (encULC: ∣V∣,∣W∣,M|V|,|W|,M∣V∣,∣W∣,M in unary and, for every pair (v,w)(v,w)(v,w) in lexicographic order, a non-edge marker or an edge marker followed by the table of σv,w\sigma_{v,w}σv,w​; encMaxCut: the vertex count and the endpoints of every listed edge in unary). The output depends only on data present in encULC(L)\mathrm{enc}_{\mathrm{ULC}}(\mathcal L)encULC​(L) (the permutations are consulted only on edges), so ggg is well defined. Polynomial-time computability is Cook's PolyTimeComputable.

Preamble
import Mathlib
import Definitions.Def_OptInapprox_MaxCut_ReductionGraph
Formal statement
namespace OptInapprox.MaxCut

theorem reductionGraph_polyTime (M₀ R K p q : ℕ) :
    ∃ g : List ULCSym → List MCSym, CookPvsNP.PolyTimeComputable g ∧
      ∀ L : ULC, L.M = M₀ → g (encULC L) = encMaxCut (reductionGraph L R K p q) := by
  sorry

end OptInapprox.MaxCut
Source
Khot, Kindler, Mossel & O'Donnell, Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?, SIAM J. Comput. 37(1), 2007 (authors' version of February 7, 2007), §8 (the reduction of §8.1 used in the proof of Theorem 1, p. 11), polynomial running time for constant M

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