Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.10 (He–Li–Zhang) — max over u, v of Σ (uᵀA_k v)² equals max over v of Σ (vᵀA_k v)² for symmetric A_k

Proved
TensorNP.SpectralNorm.proposition_6_10

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

matrix-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-optimizationspectral-norm

Let A1,…,Am∈Rn×nA_1,\dots,A_m\in\mathbb R^{n\times n}A1​,…,Am​∈Rn×n be symmetric matrices. Then

max⁡∥u∥2=∥v∥2=1∑k=1m(u⊤Akv)2=max⁡∥v∥2=1∑k=1m(v⊤Akv)2.(25)\max_{\|\mathbf u\|_2=\|\mathbf v\|_2=1}\sum_{k=1}^m(\mathbf u^\top A_k\mathbf v)^2=\max_{\|\mathbf v\|_2=1}\sum_{k=1}^m(\mathbf v^\top A_k\mathbf v)^2. \tag{25}∥u∥2​=∥v∥2​=1max​k=1∑m​(u⊤Ak​v)2=∥v∥2​=1max​k=1∑m​(v⊤Ak​v)2.(25)

The proposition, embedded in a proof of He, Li and Zhang (2010), lets the bilinear maximization produced by Cauchy–Schwarz in Lemma 6.11 be replaced by the quadratic maximization NlN_lNl​.

Formalization Note The two maxima are written as sSup of the sets of attained values over the unit spheres; both sets are compact, so the suprema are maxima when n≥1n\ge1n≥1 (for n=0n=0n=0 both sets are empty and both sides are 000). Symmetry is Mathlib's Matrix.IsSymm. The paper's printed proof claims that f(u,v,w,x)=∑k(u⊤Akv)(w⊤Akx)f(\mathbf u,\mathbf v,\mathbf w,\mathbf x)=\sum_k(\mathbf u^\top A_k\mathbf v)(\mathbf w^\top A_k\mathbf x)f(u,v,w,x)=∑k​(u⊤Ak​v)(w⊤Ak​x) is the 4-linear form of a symmetric 4-tensor, which is not literally true (it is not symmetric under u↔w\mathbf u\leftrightarrow\mathbf wu↔w); the proposition itself is true, and only the statement is posed here.

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

open Matrix

/-- **Proposition 6.10 (He–Li–Zhang).** For symmetric real matrices `A_1, …, A_m ∈ ℝ^{n×n}`,
`max_{‖u‖₂=‖v‖₂=1} Σ_k (uᵀA_k v)² = max_{‖v‖₂=1} Σ_k (vᵀA_k v)²` (25). -/
theorem proposition_6_10 {m n : ℕ} (A : Fin m → Matrix (Fin n) (Fin n) ℝ)
    (hA : ∀ k, (A k).IsSymm) :
    sSup {t : ℝ | ∃ u v : Fin n → ℝ, l2norm u = 1 ∧ l2norm v = 1 ∧
        t = ∑ k, (u ⬝ᵥ (A k *ᵥ v)) ^ 2} =
      sSup {t : ℝ | ∃ v : Fin n → ℝ, l2norm v = 1 ∧ t = ∑ k, (v ⬝ᵥ (A k *ᵥ v)) ^ 2} := 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), p. 0:23, Proposition 6.10 (He–Li–Zhang 2010), (25)
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