Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9.3 (core) — α(G) is the largest l ≤ v for which 2√(⅔(1 − 1/l)) is an ℓ²-eigenvalue of S_G

Proved
TensorNP.SymEigen.theorem_9_3_core

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

np-hardnessp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stability-numbertensor-eigenvalue

Let GGG be a simple graph on v≥1v\ge1v≥1 vertices with stability number α(G)\alpha(G)α(G), let SG\mathcal S_GSG​ be its symmetric tensor from §9, and for l≥1l\ge1l≥1 let λl=223(1−1l)\lambda_l=2\sqrt{\frac23\left(1-\frac1l\right)}λl​=232​(1−l1​)​. Then α(G)\alpha(G)α(G) is the greatest element of

{ l∈{1,…,v}: λl is a unit ℓ2-eigenvalue of SG }.\{\,l\in\{1,\dots,v\}:\ \lambda_l\text{ is a unit }\ell^2\text{-eigenvalue of }\mathcal S_G\,\}.{l∈{1,…,v}: λl​ is a unit ℓ2-eigenvalue of SG​}.

Equivalently: (a) λα(G)\lambda_{\alpha(G)}λα(G)​ is an ℓ2\ell^2ℓ2-eigenvalue of SG\mathcal S_GSG​, and (b) for every lll with α(G)<l≤v\alpha(G)<l\le vα(G)<l≤v, λl\lambda_lλl​ is not.

This is the mathematical core of Hillar and Lim's proof that symmetric tensor eigenvalue over R\mathbb RR is NP-hard (Theorem 9.3): querying an oracle for Problem 9.1 with λv,λv−1,…,λ1\lambda_v,\lambda_{v-1},\dots,\lambda_1λv​,λv−1​,…,λ1​, the first "yes" occurs at l=α(G)l=\alpha(G)l=α(G), so at most vvv queries compute the stability number, which is NP-hard (Karp 1972, via α(G)=ω(G‾)\alpha(G)=\omega(\overline G)α(G)=ω(G)).

Formalization Note Only the characterization is formalized. The oracle procedure, the polynomial size of SG\mathcal S_GSG​, the input model with quadratic irrationalities λl\lambda_lλl​ (Remark 9.4), and the NP-completeness of the stability number are not. Eigenvalues are taken with a unit eigenvector; with the paper's bare condition x≠0\mathbf x\neq\mathbf 0x=0, part (b) would be false by scaling.

Preamble
import Mathlib
import Definitions.Def_TensorNP_SymEigen_Defs
import Definitions.Def_TensorNP_SymEigen_StabTensor
Formal statement
namespace TensorNP.SymEigen

theorem theorem_9_3_core {v : ℕ} (hv : 0 < v) (G : SimpleGraph (Fin v)) :
    IsGreatest {l : ℕ | 1 ≤ l ∧ l ≤ v ∧ IsUnitL2Eigenvalue (stabTensor G) (lambdaL l)}
      G.indepNum := by sorry

end TensorNP.SymEigen
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), p. 0:28, Theorem 9.3 and its proof; Problem 9.1, p. 0:27
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