Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1.3 — 000 is a real eigenvalue of A\mathcal AA iff a square quadratic system is feasible

Proved
TensorNP.Eigen.eigen_zero_iff_square_feasible

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-feasibilitytensor-eigenvalue

Let A=[ ⁣[aijk] ⁣]∈Qn×n×n\mathcal A=[\![a_{ijk}]\!]\in\mathbb Q^{n\times n\times n}A=[[aijk​]]∈Qn×n×n and, for k=1,…,nk=1,\dots,nk=1,…,n, let Ak∈Qn×nA_k\in\mathbb Q^{n\times n}Ak​∈Qn×n be its slice Ak(i,j)=aijkA_k(i,j)=a_{ijk}Ak​(i,j)=aijk​. Then 000 is an eigenvalue of A\mathcal AA over R\mathbb RR, i.e. there is 0≠x∈Rn\mathbf 0\ne\mathbf x\in\mathbb R^n0=x∈Rn with ∑i,jaijkxixj=0\sum_{i,j}a_{ijk}x_ix_j=0∑i,j​aijk​xi​xj​=0 for all kkk, if and only if the square system

x⊤Akx=0,k=1,…,n,\mathbf x^\top A_k\mathbf x=0,\qquad k=1,\dots,n,x⊤Ak​x=0,k=1,…,n,

of nnn quadratic equations in nnn unknowns has a nonzero real solution.

This identifies tensor 000-eigenvalue with square quadratic feasibility (m=nm=nm=n in Problem 2.2), the first step of the paper's proof of Theorem 1.3.

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

open Matrix

/-- Proof of Theorem 1.3, first sentence: `0` is a real eigenvalue of `A ∈ ℚ^{n×n×n}` if and only
if the square system `xᵀ A_k x = 0` (`k = 1, …, n`) with `A_k(i, j) = a_{ijk}` has a nonzero
real solution. -/
theorem eigen_zero_iff_square_feasible {n : ℕ} (A : Fin n → Fin n → Fin n → ℚ) :
    IsEigenvalue (castTensor ℝ A) 0 ↔
      QuadSolvable (castMatrices ℝ (fun k : Fin n => Matrix.of fun i j => A i j k)) := 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:20, proof of Theorem 1.3
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