Proof of Theorem 5.1 — with SOS
ProvedSemialgebraicSDP.Psatz.cone_squarefree_formconep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positivstellensatzsum-of-squares
Let . A polynomial belongs to the cone if and only if it can be written with one sum-of-squares multiplier per squarefree product of the :
with every a sum of squares (the empty product being ).
This is the parameterization of the cone part of a Positivstellensatz certificate used to set up the SDP in the proof of Theorem 5.1: it reduces the search over the cone to finitely many sum-of-squares unknowns.
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Psatz_Cone
Formal statement
namespace SemialgebraicSDP.Psatz
open MvPolynomial
theorem cone_squarefree_form {n s : ℕ} (f : Fin s → MvPolynomial (Fin n) ℝ)
(x : MvPolynomial (Fin n) ℝ) :
x ∈ cone (Set.range f) ↔
∃ p : Finset (Fin s) → MvPolynomial (Fin n) ℝ,
(∀ T, IsSumSq (p T)) ∧ x = ∑ T : Finset (Fin s), p T * ∏ j ∈ T, f j := by sorry
end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 306, proof of Theorem 5.1, display 'f = p₀ + p₁f₁ + ⋯'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.