Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.3 — graph 3-colorability reduces to tensor 000-eigenvalue over R\mathbb RR

Proved
TensorNP.Eigen.theorem_1_3

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

graph-coloringnp-hardnessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reductiontensor-eigenvalue

Graph 3-colorability is polynomial-time many-one reducible to tensor 000-eigenvalue over R\mathbb RR: there is a function fff, computable by a Turing machine in time polynomial in the length of its input, such that for every binary string www,

w∈3-COL  ⟺  f(w)∈TENSOR-0-EIGR.w\in\textsf{3-COL}\iff f(w)\in\textsf{TENSOR-0-EIG}_{\mathbb R}.w∈3-COL⟺f(w)∈TENSOR-0-EIGR​.

Here 3-COL\textsf{3-COL}3-COL is the set of binary codes of simple graphs having a proper 3-coloring, and TENSOR-0-EIGR\textsf{TENSOR-0-EIG}_{\mathbb R}TENSOR-0-EIGR​ is the set of binary codes of rational tensors A=[ ⁣[aijk] ⁣]∈Qn×n×n\mathcal A=[\![a_{ijk}]\!]\in\mathbb Q^{n\times n\times n}A=[[aijk​]]∈Qn×n×n (any nnn) for which there is 0≠x∈Rn\mathbf 0\ne\mathbf x\in\mathbb R^n0=x∈Rn with

∑i,j=1naijkxixj=0,k=1,…,n,\sum_{i,j=1}^{n}a_{ijk}x_ix_j=0,\qquad k=1,\dots,n,i,j=1∑n​aijk​xi​xj​=0,k=1,…,n,

that is, for which λ=0\lambda=0λ=0 is an eigenvalue with a real eigenvector (Problem 1.2 with F=RF=\mathbb RF=R, λ=0\lambda=0λ=0).

Since graph 3-colorability is NP-complete (Karp 1972, cited by the paper and not formalized here), deciding tensor eigenvalue over R\mathbb RR is NP-hard.

Formalization Note "Polynomially reducible" is stated as Cook's polynomial-time many-one reducibility (CookPvsNP.PolyReducible): the paper's reduction maps one graph to one tensor, and a many-one reduction implies the oracle notion of the paper's §1.4. Instances are coded in binary as fixed in the definition file (rationals as numerator and denominator); the reduction produces integer tensors, which are rationals with denominator 1. NP-completeness of 3-colorability is not part of the statement.

Preamble
import Mathlib
import Definitions.Def_TensorNP_Eigen_Defs
Formal statement
namespace TensorNP.Eigen

open CookPvsNP

/-- Theorem 1.3: graph 3-colorability is polynomial-time many-one reducible to tensor
`0`-eigenvalue over `ℝ` (Problem 1.2 with `F = ℝ`, `λ = 0`, rational tensors). -/
theorem theorem_1_3 : PolyReducible threeColLang tensorZeroEigLangR := by sorry

end TensorNP.Eigen
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), p. 0:7, Theorem 1.3 (proof p. 0:20)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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