Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.8 — padding a real quadratic system to r≥m+1r\ge m+1r≥m+1 equations in s≥ns\ge ns≥n unknowns

Proved
TensorNP.Eigen.lemma_2_8

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-feasibility

Let A1,…,Am∈Rn×nA_1,\dots,A_m\in\mathbb R^{n\times n}A1​,…,Am​∈Rn×n and Gi(x)=x⊤AixG_i(\mathbf x)=\mathbf x^\top A_i\mathbf xGi​(x)=x⊤Ai​x. Let r≥m+1r\ge m+1r≥m+1 and s≥ns\ge ns≥n, and define the rrr matrices of size s×ss\times ss×s

Bi=[Ai000] (i=1,…,m),Bj=[0000] (j=m+1,…,r−1),Br=[000I],B_i=\begin{bmatrix}A_i&0\\0&0\end{bmatrix}\ (i=1,\dots,m),\qquad B_j=\begin{bmatrix}0&0\\0&0\end{bmatrix}\ (j=m+1,\dots,r-1),\qquad B_r=\begin{bmatrix}0&0\\0&I\end{bmatrix},Bi​=[Ai​0​00​] (i=1,…,m),Bj​=[00​00​] (j=m+1,…,r−1),Br​=[00​0I​],

where III is the (s−n)×(s−n)(s-n)\times(s-n)(s−n)×(s−n) identity matrix, and Hi(x)=x⊤BixH_i(\mathbf x)=\mathbf x^\top B_i\mathbf xHi​(x)=x⊤Bi​x. Then {Hi(x)=0}i=1r\{H_i(\mathbf x)=0\}_{i=1}^{r}{Hi​(x)=0}i=1r​ has a nonzero solution x∈Rs\mathbf x\in\mathbb R^sx∈Rs if and only if {Gi(x)=0}i=1m\{G_i(\mathbf x)=0\}_{i=1}^{m}{Gi​(x)=0}i=1m​ has a nonzero solution x∈Rn\mathbf x\in\mathbb R^nx∈Rn.

The lemma lets a quadratic system be made square, the shape of the eigenvalue equations of a tensor.

Formalization Note The case s=ns=ns=n is included, where Br=0B_r=0Br​=0. Indices are 0-based, so BrB_rBr​ is matrix number r−1r-1r−1.

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

open Matrix

/-- Lemma 2.8: for `A_1, …, A_m ∈ ℝ^{n×n}`, `r ≥ m + 1` and `s ≥ n`, the padded system
`xᵀ B_i x = 0` (`i = 1, …, r`) with `B_i = [A_i 0; 0 0]`, `B_j = 0` (`m < j < r`),
`B_r = [0 0; 0 I]` has a nonzero solution `x ∈ ℝ^s` if and only if `{xᵀ A_i x = 0}_{i=1}^m` has
a nonzero solution `x ∈ ℝ^n`. -/
theorem lemma_2_8 {m n r s : ℕ} (A : Fin m → Matrix (Fin n) (Fin n) ℝ) (hr : m + 1 ≤ r)
    (hs : n ≤ s) :
    QuadSolvable (padSystem A r s) ↔ QuadSolvable A := 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:14, Lemma 2.8
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