§4.2 — is the set of sums of squares and the smallest cone
ProvedSemialgebraicSDP.Psatz.cone_empty_eq_isSumSqconep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positivstellensatzsum-of-squares
In , the cone generated by the empty set consists exactly of the polynomials that are sums of squares:
and it is the smallest cone: for every cone of , i.e. every subset with , , and for every polynomial .
This identifies the "sum of squares" multipliers of the Positivstellensatz with the elements of .
Formalization Note Cones are those of Definition 4.5 (closed under sums, products and containing all squares). "Smallest cone" is rendered as inclusion in every subset satisfying the three properties of Definition 4.5.
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Psatz_Cone
Formal statement
namespace SemialgebraicSDP.Psatz
open MvPolynomial
theorem cone_empty_eq_isSumSq (n : ℕ) :
cone (∅ : Set (MvPolynomial (Fin n) ℝ)) = {a | IsSumSq a} ∧
∀ P : Set (MvPolynomial (Fin n) ℝ),
(∀ a ∈ P, ∀ b ∈ P, a + b ∈ P) → (∀ a ∈ P, ∀ b ∈ P, a * b ∈ P) →
(∀ a : MvPolynomial (Fin n) ℝ, a ^ 2 ∈ P) → cone ∅ ⊆ P := by sorry
end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 304, §4.2, after Definition 4.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.