§7.5, p. 317 — is copositive iff the form is positive semidefinite
ProvedSemialgebraicSDP.Copositive.copositive_iff_formP_nonnegcopositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials
Let be a real symmetric matrix. Recall that is copositive if for every with for all , and let be the associated fourth order form. Then
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 , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.