§7.5, p. 318 — if is a sum of squares, so is
ProvedSemialgebraicSDP.Copositive.formPr_sos_succcopositive-matricesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sum-of-squares
Let be a real symmetric matrix with associated forms , , where . For every ,
This makes the sum-of-squares tests on a hierarchy of increasingly powerful sufficient conditions for copositivity of .
Formalization Note "Sum of squares" is Mathlib's IsSumSq in MvPolynomial (Fin n) ℝ.
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Copositive_Forms
Formal statement
namespace SemialgebraicSDP.Copositive
/-- §7.5, p. 318: if `P_i` is a sum of squares, then `P_{i+1}` is also a sum of squares. -/
theorem formPr_sos_succ {n : ℕ} (M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) (i : ℕ)
(h : IsSumSq (formPr M i)) : IsSumSq (formPr M (i + 1)) := 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 ("if P_i is a sum of squares, then P_{i+1} is also a sum of squares")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.