§4.2 — for a finite set
ProvedSemialgebraicSDP.Psatz.cone_finite_formconep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1positivstellensatzsum-of-squares
Let be finite and let be the multiplicative monoid generated by the (finite products, the empty product included). Then
This is the explicit description of the cone generated by finitely many polynomials that is used to parameterize Positivstellensatz certificates.
Formalization Note The finite set is the range of a family ( allowed); the monoid is the submonoid closure of that range.
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Psatz_Cone
Formal statement
namespace SemialgebraicSDP.Psatz
open MvPolynomial
theorem cone_finite_form {n m : ℕ} (a : Fin m → MvPolynomial (Fin n) ℝ) :
cone (Set.range a) =
{x | ∃ (r : ℕ) (p : MvPolynomial (Fin n) ℝ) (q b : Fin r → MvPolynomial (Fin n) ℝ),
p ∈ cone ∅ ∧ (∀ i, q i ∈ cone ∅) ∧ (∀ i, b i ∈ Submonoid.closure (Set.range a)) ∧
x = p + ∑ i, q i * b i} := by sorry
end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, pp. 304–305, §4.2, display at the top of p. 305
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.