Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.7, p. 318 — a feasible solution of the SDPs (7.7) makes P1(z)≥0P_1(z) \ge 0P1​(z)≥0 and MMM copositive; (7.6) implies (7.7) is feasible

Proved
SemialgebraicSDP.Copositive.theorem_7_7

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

copositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1semidefinite-programmingsum-of-squares

Let M=(mij)M = (m_{ij})M=(mij​) be a real symmetric n×nn \times nn×n matrix and P1(z)=∑i,j,kmijzi2zj2zk2P_1(z) = \sum_{i,j,k} m_{ij} z_i^2 z_j^2 z_k^2P1​(z)=∑i,j,k​mij​zi2​zj2​zk2​. Consider the SDPs (7.7) in nnn symmetric matrices Λ1,…,Λn∈Sn\Lambda^1, \dots, \Lambda^n \in \mathcal S^nΛ1,…,Λn∈Sn:

M−Λi⪰0,i=1,…,n,Λiii=0,i=1,…,n,Λjji+Λjij+Λijj=0,i≠j,Λjki+Λkij+Λijk≥0,i,j,k pairwise distinct.\begin{aligned} M - \Lambda^i &\succeq 0, && i = 1, \dots, n,\\ \Lambda^i_{ii} &= 0, && i = 1, \dots, n,\\ \Lambda^i_{jj} + \Lambda^j_{ji} + \Lambda^j_{ij} &= 0, && i \ne j,\\ \Lambda^i_{jk} + \Lambda^j_{ki} + \Lambda^k_{ij} &\ge 0, && i, j, k \text{ pairwise distinct}. \end{aligned}M−ΛiΛiii​Λjji​+Λjij​+Λijj​Λjki​+Λkij​+Λijk​​⪰0,=0,=0,≥0,​​i=1,…,n,i=1,…,n,i=j,i,j,k pairwise distinct.​

Then:

  1. If (7.7) has a feasible solution, then P1(z)≥0P_1(z) \ge 0P1​(z)≥0 for every z∈Rnz \in \mathbb R^nz∈Rn, and MMM is copositive (xTMx≥0x^T M x \ge 0xTMx≥0 whenever xi≥0x_i \ge 0xi​≥0 for all iii).
  2. The test is at least as powerful as condition (7.6): if M=P+NM = P + NM=P+N with P⪰0P \succeq 0P⪰0 and nij≥0n_{ij} \ge 0nij​≥0 for all i,ji, ji,j, then (7.7) has a feasible solution.

Theorem 7.7 is the first level (r=1r = 1r=1) of a hierarchy of semidefinite programming tests for copositivity, a property for which deciding that a given matrix is not copositive is NP-complete. It gives an explicit semidefinite program that certifies copositivity of every matrix covered by the classical decomposition test (7.6).

Formalization Note "At least as powerful as condition (7.6)" is formalized as the implication (7.6) ⇒\Rightarrow⇒ (7.7) feasible, i.e. every matrix certified by (7.6) is also certified by (7.7). "i≠j≠ki \ne j \ne ki=j=k" is read as pairwise distinct (see the definition Feasible77). Copositivity is the published MurtyKabadi.Reduction.Copositive.

Preamble
import Mathlib
import Definitions.Def_MurtyKabadi_Reduction_QuadraticProblems
import Definitions.Def_SemialgebraicSDP_Copositive_Forms
import Definitions.Def_SemialgebraicSDP_Copositive_Certificates
Formal statement
namespace SemialgebraicSDP.Copositive

open MvPolynomial

/-- Theorem 7.7 (Parrilo 2003, p. 318). Let `M` be a real symmetric `n × n` matrix. If the
SDPs (7.7) have a feasible solution, then `P₁(z)` is nonnegative, and therefore `M` is
copositive. Furthermore, the test is at least as powerful as condition (7.6): whenever (7.6)
holds, (7.7) is feasible. -/
theorem theorem_7_7 {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) :
    (Feasible77 M →
        (∀ z : Fin n → ℝ, 0 ≤ eval z (formP1 M)) ∧ MurtyKabadi.Reduction.Copositive M) ∧
      (Cond76 M → Feasible77 M) := by sorry

end SemialgebraicSDP.Copositive
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 318, Theorem 7.7
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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