Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.2 — 3-colorability reduces to deciding whether σ=0\sigma = 0σ=0 is an ℓ2\ell^2ℓ2- or ℓ3\ell^3ℓ3-singular value

Proved
TensorNP.Bilinear.theorem_6_2

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

complexity-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1singular-valuestensors

Let F=RF = \mathbb RF=R or F=CF = \mathbb CF=C and p∈{2,3}p \in \{2, 3\}p∈{2,3}. Graph 3-colorability is polynomial-time many-one reducible to the problem of deciding, for a rational tensor A\mathcal AA, whether σ=0\sigma = 0σ=0 is an ℓp\ell^pℓp-singular value of A\mathcal AA over FFF (Definition 6.1):

3-COLORABILITY≤p{A:0 is an ℓp-singular value of A over F}\textsf{3-COLORABILITY} \le_p \{\mathcal A : 0 \text{ is an } \ell^p\text{-singular value of } \mathcal A \text{ over } F\}3-COLORABILITY≤p​{A:0 is an ℓp-singular value of A over F}

for each of the four choices of (F,p)(F, p)(F,p).

By the NP-completeness of 3-colorability (cited, not formalized), deciding whether 000 is an ℓ2\ell^2ℓ2- or ℓ3\ell^3ℓ3-singular value of a tensor is NP-hard over R\mathbb RR and over C\mathbb CC, which is the paper's statement.

Formalization Note "NP-hard" is rendered as a polynomial-time many-one reduction from 3-colorability, the reduction the paper's argument gives ("immediate from Theorem 3.7"). "(ℓ2\ell^2ℓ2 or ℓ3\ell^3ℓ3)" is read as the claim for each of the two notions. Codes and polynomial-time computability are as in Theorem 3.7.

Preamble
import Mathlib
import Definitions.Def_CookPvsNP_defs
import Definitions.Def_TensorNP_Bilinear_Encoding
import Definitions.Def_TensorNP_Bilinear_SingularValue
Formal statement
namespace TensorNP.Bilinear

open CookPvsNP

/-- Theorem 6.2 (p. 0:22): graph 3-colorability is polynomial-time many-one reducible to deciding
whether `σ = 0` is an ℓ²-singular value, and to deciding whether `σ = 0` is an ℓ³-singular
value, of a rational tensor, over `ℝ` and over `ℂ`. -/
theorem theorem_6_2 :
    PolyReducible TensorNP.Eigen.threeColLang (zeroL2SingLang ℝ) ∧ PolyReducible TensorNP.Eigen.threeColLang (zeroL2SingLang ℂ) ∧
      PolyReducible TensorNP.Eigen.threeColLang (zeroL3SingLang ℝ) ∧
        PolyReducible TensorNP.Eigen.threeColLang (zeroL3SingLang ℂ) := by sorry

end TensorNP.Bilinear
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), p. 0:22, Theorem 6.2; p. 0:21, Definition 6.1 and the remark after (21)
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