Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.5, p. 317 — MMM is copositive iff the form P(z)P(z)P(z) is positive semidefinite

Proved
SemialgebraicSDP.Copositive.copositive_iff_formP_nonneg

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

copositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials

Let M=(mij)M = (m_{ij})M=(mij​) be a real symmetric n×nn \times nn×n matrix. Recall that MMM is copositive if xTMx≥0x^T M x \ge 0xTMx≥0 for every x∈Rnx \in \mathbb R^nx∈Rn with xi≥0x_i \ge 0xi​≥0 for all iii, and let P(z)=∑i,jmijzi2zj2P(z) = \sum_{i,j} m_{ij} z_i^2 z_j^2P(z)=∑i,j​mij​zi2​zj2​ be the associated fourth order form. Then

M is copositive  ⟺  P(z)≥0 for all z∈Rn.M \text{ is copositive} \iff P(z) \ge 0 \text{ for all } z \in \mathbb R^n .M is copositive⟺P(z)≥0 for all z∈Rn.

This reduces copositivity, a condition on the nonnegative orthant, to global nonnegativity (positive semidefiniteness) of a form, so that any sufficient condition for nonnegativity of PPP, such as a sum-of-squares certificate, becomes a sufficient condition for copositivity.

Formalization Note A form is called positive semidefinite in the paper when it is nonnegative at every real point; this is stated directly as nonnegativity of the evaluation. Copositivity is the published definition MurtyKabadi.Reduction.Copositive.

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

open MvPolynomial

/-- §7.5, p. 317: a symmetric matrix `M` is copositive if and only if the form `P(z)` is
positive semidefinite, i.e. nonnegative at every real point. -/
theorem copositive_iff_formP_nonneg {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) :
    MurtyKabadi.Reduction.Copositive M ↔ ∀ z : Fin n → ℝ, 0 ≤ eval z (formP M) := by sorry

end SemialgebraicSDP.Copositive
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 317, §7.5 ("It is easy to verify that M is copositive if and only if the form P(z) is positive semidefinite.")
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