Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.11 — T_l = M_l^{1/2}; T_l = 1 iff l = ω, T_l > 1 iff l < ω, T_l < 1 iff l > ω

Proved
TensorNP.SpectralNorm.lemma_6_11

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

clique-numberp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-normtensor

Let GGG be a simple graph on v≥1v\ge1v≥1 vertices with clique number ω\omegaω and edges enumerated as {ik,jk}\{i_k,j_k\}{ik​,jk​}, k=1,…,ek=1,\dots,ek=1,…,e, and let lll be a positive integer. Let

Tl=max⁡∥u∥2=∥v∥2=∥w∥2=1{∑i=1l(u⊤1lIv)wi+∑k=1e(u⊤Ekv)wl+k+∑k=1e(u⊤Ekv)we+l+k},(26)T_l=\max_{\|\mathbf u\|_2=\|\mathbf v\|_2=\|\mathbf w\|_2=1}\Big\{\sum_{i=1}^l\Big(\mathbf u^\top\tfrac1lI\mathbf v\Big)w_i+\sum_{k=1}^e(\mathbf u^\top E_k\mathbf v)w_{l+k}+\sum_{k=1}^e(\mathbf u^\top E_k\mathbf v)w_{e+l+k}\Big\}, \tag{26}Tl​=∥u∥2​=∥v∥2​=∥w∥2​=1max​{i=1∑l​(u⊤l1​Iv)wi​+k=1∑e​(u⊤Ek​v)wl+k​+k=1∑e​(u⊤Ek​v)we+l+k​},(26)

with u,v∈Rv\mathbf u,\mathbf v\in\mathbb R^vu,v∈Rv and w∈Rl+2e\mathbf w\in\mathbb R^{l+2e}w∈Rl+2e. Then

Tl=Ml1/2,T_l=M_l^{1/2},Tl​=Ml1/2​,

and therefore Tl=1T_l=1Tl​=1 iff l=ωl=\omegal=ω, Tl>1T_l>1Tl​>1 iff l<ωl<\omegal<ω, and Tl<1T_l<1Tl​<1 iff l>ωl>\omegal>ω.

This identifies the maximum of the multilinear form (26), the form of the tensor Al\mathcal A_lAl​, with the square root of the Motzkin–Straus quantity MlM_lMl​, so that its comparison with 111 detects the clique number.

Formalization Note TlT_lTl​ and MlM_lMl​ are the sSup-based definitions Tval and Mval; the statement holds for every edge enumeration. The paper's statement of Lemma 6.11 prints wm+l+kw_{m+l+k}wm+l+k​ in the third sum; there is no mmm in this section and the proof (p. 0:24) uses we+l+kw_{e+l+k}we+l+k​, which is formalized here (0-based: coordinates l+e,…,l+2e−1l+e,\dots,l+2e-1l+e,…,l+2e−1 of w\mathbf ww).

Preamble
import Mathlib
import Definitions.Def_TensorNP_SpectralNorm_Tensor
import Definitions.Def_TensorNP_SpectralNorm_CliqueTensor
Formal statement
namespace TensorNP.SpectralNorm

/-- **Lemma 6.11.** For a simple graph `G` on `v ≥ 1` vertices with clique number `ω`, any
enumeration `ε` of its `e` edges and any positive integer `l`, the maximum `T_l` of the form (26)
over `‖u‖₂ = ‖v‖₂ = ‖w‖₂ = 1` equals `M_l^{1/2}`; thus `T_l = 1` iff `l = ω`, `T_l > 1` iff
`l < ω`, and `T_l < 1` iff `l > ω`. -/
theorem lemma_6_11 {v e : ℕ} (hv : 0 < v) (G : SimpleGraph (Fin v)) [DecidableRel G.Adj]
    (ε : Fin e ≃ G.edgeSet) (l : ℕ) (hl : 1 ≤ l) :
    Tval G ε l = Real.sqrt (Mval G l) ∧
      (Tval G ε l = 1 ↔ l = G.cliqueNum) ∧
      (1 < Tval G ε l ↔ l < G.cliqueNum) ∧
      (Tval G ε l < 1 ↔ G.cliqueNum < l) := by sorry

end TensorNP.SpectralNorm
Source
Hillar & Lim, Most Tensor Problems Are NP-Hard, J. ACM 60(6) (2013), Art. 45 (final version, arXiv:0911.1393v5), pp. 0:23–0:24, Lemma 6.11, (26), 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