Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, display before (22) and (22) — M_l = 1 + (ω − l)/(lω); M_ω = 1, M_l > 1 for l < ω, M_l < 1 for l > ω

Proved
TensorNP.SpectralNorm.display_22

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

clique-numbergraph-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1quadratic-optimization

Let GGG be a simple graph on v≥1v\ge1v≥1 vertices with clique number ω\omegaω, let lll be a positive integer, Ql=AG+1lJQ_l=A_G+\frac1lJQl​=AG​+l1​J, and Ml=max⁡x∈Δvx⊤QlxM_l=\max_{\mathbf x\in\Delta_v}\mathbf x^\top Q_l\mathbf xMl​=maxx∈Δv​​x⊤Ql​x. Then the maximum is attained and

Ml=1+ω−ll ω.M_l = 1+\frac{\omega-l}{l\,\omega}.Ml​=1+lωω−l​.

Consequently Mω=1M_\omega=1Mω​=1, and

Ml>1  if l<ω,Ml<1  if l>ω.(22)M_l>1 \ \text{ if } l<\omega,\qquad M_l<1\ \text{ if } l>\omega. \tag{22}Ml​>1  if l<ω,Ml​<1  if l>ω.(22)

This translates the Motzkin–Straus theorem into a family of quadratic programs, indexed by lll, whose optimal value crosses 111 exactly at l=ωl=\omegal=ω.

Formalization Note The first clause is IsGreatest of the image of the simplex under x↦x⊤Qlx\mathbf x\mapsto\mathbf x^\top Q_l\mathbf xx↦x⊤Ql​x with value 1+(ω−l)/(lω)1+(\omega-l)/(l\omega)1+(ω−l)/(lω); the second says that the sSup-based definition Mval G l has this value. Hypotheses v≥1v\ge1v≥1 and l≥1l\ge1l≥1 are the paper's standing ones (lll is a "positive integer", and ω≥1\omega\ge1ω≥1 requires a nonempty vertex set).

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

open Matrix

/-- **The value of `M_l` and (22)** (p. 0:22). For a simple graph `G` on `v ≥ 1` vertices with
clique number `ω` and a positive integer `l`, the maximum of `xᵀ Q_l x` over `Δ_v` is
`1 + (ω − l)/(lω)`; hence `M_ω = 1`, `M_l > 1` if `l < ω`, and `M_l < 1` if `l > ω`. -/
theorem display_22 {v : ℕ} (hv : 0 < v) (G : SimpleGraph (Fin v)) [DecidableRel G.Adj]
    (l : ℕ) (hl : 1 ≤ l) :
    IsGreatest ((fun x : Fin v → ℝ => x ⬝ᵥ (Qmat G l *ᵥ x)) '' stdSimplex ℝ (Fin v))
        (1 + ((G.cliqueNum : ℝ) - l) / ((l : ℝ) * G.cliqueNum)) ∧
      Mval G l = 1 + ((G.cliqueNum : ℝ) - l) / ((l : ℝ) * G.cliqueNum) ∧
      (l = G.cliqueNum → Mval G l = 1) ∧
      (l < G.cliqueNum → 1 < Mval G l) ∧
      (G.cliqueNum < l → Mval G l < 1) := 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:22, display defining M_l and (22)
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