Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.7 — 3-colorability reduces to tensor bilinear feasibility over R\mathbb RR and over C\mathbb CC

Proved
TensorNP.Bilinear.theorem_3_7

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

complexity-theorygraph-coloringnp-hardnessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1tensors

Let F=RF = \mathbb RF=R or F=CF = \mathbb CF=C. Graph 3-colorability is polynomial-time many-one reducible to tensor bilinear feasibility over FFF (Problem 3.1): there is a function fff, computable by a Turing machine in time polynomial in the length of its input, such that for every binary word xxx,

x∈3-COLORABILITY  ⟺  f(x)∈TBFF,x \in \textsf{3-COLORABILITY} \iff f(x) \in \textsf{TBF}_F ,x∈3-COLORABILITY⟺f(x)∈TBFF​,

where TBFF\textsf{TBF}_FTBFF​ is the language of codes of rational tensors A∈Ql×m×n\mathcal A \in \mathbb Q^{l\times m\times n}A∈Ql×m×n for which (9) has a solution with u∈Fl\mathbf u\in F^lu∈Fl, v∈Fm\mathbf v\in F^mv∈Fm, w∈Fn\mathbf w\in F^nw∈Fn all nonzero. The statement asserts this for F=RF = \mathbb RF=R and for F=CF = \mathbb CF=C.

Since 3-colorability is NP-complete (Karp 1972), tensor bilinear feasibility is NP-hard over R\mathbb RR and over C\mathbb CC; that consequence is cited by the paper and is not part of the formal statement.

Formalization Note The paper's §1.4 calls a problem polynomially reducible to another in the oracle (Cook) sense; the statement here is the stronger many-one (Karp) reducibility of the published definition CookPvsNP.PolyReducible, which is what the paper's proof constructs. Graphs and rational tensors are coded in binary as in TensorNP.Bilinear.Encoding. Polynomial-time computability refers to Cook's one-tape Turing machines. The reduction must map every word, including words that are not graph codes, and must handle the empty graph, for which the paper's tensor AG\mathcal A_GAG​ has no slices.

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

open CookPvsNP

/-- Theorem 3.7 (p. 0:17): graph 3-colorability is polynomial-time many-one reducible to tensor
bilinear feasibility (Problem 3.1), over `ℝ` and over `ℂ`. -/
theorem theorem_3_7 :
    PolyReducible TensorNP.Eigen.threeColLang (tbfLang ℝ) ∧ PolyReducible TensorNP.Eigen.threeColLang (tbfLang ℂ) := 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:17, Theorem 3.7 and its proof
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