§3.2 — the vector of monomials of degree has length
ProvedSemialgebraicSDP.Psatz.monomial_vector_cardcombinatoricsmonomialsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sum-of-squares
Let and let be the vector of all monomials in variables of total degree at most , as in (3.5). Then the length of is
This fixes the size of the Gram matrices in the semidefinite programs of Theorem 3.3 and Theorem 5.1.
Preamble
import Mathlib import Definitions.Def_SemialgebraicSDP_Psatz_Gram
Formal statement
namespace SemialgebraicSDP.Psatz
open MvPolynomial
theorem monomial_vector_card (n d : ℕ) :
Fintype.card (Mon n d) = (n + d).choose d := by sorry
end SemialgebraicSDP.Psatz
Source
Parrilo, Semidefinite programming relaxations for semialgebraic problems, Math. Program. Ser. B 96 (2003) 293–320, p. 298, §3.2, sentence after (3.5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.