§7.5, p. 318 — if is nonnegative, then so is
ProvedSemialgebraicSDP.Copositive.formP_nonneg_of_formPr_nonnegcopositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials
Let be a real symmetric matrix, and for some . If for every , then
Together with the equivalence between copositivity of and nonnegativity of , this shows that a certificate of nonnegativity for any certifies that is copositive.
Formalization Note Nonnegativity of a polynomial means nonnegativity of its evaluation at every point of .
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Copositive_Forms
Formal statement
namespace SemialgebraicSDP.Copositive
open MvPolynomial
/-- §7.5, p. 318: if `P_r(z)` is nonnegative, then so is `P(z)`. -/
theorem formP_nonneg_of_formPr_nonneg {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm)
(r : ℕ) (h : ∀ z : Fin n → ℝ, 0 ≤ eval z (formPr M r)) :
∀ 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. 318, §7.5 ("Additionally, if P_r(z) is nonnegative, then so is P(z).")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.