Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra (Q1752981)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra
scientific article

    Statements

    Handelman's Positivstellensatz for polynomial matrices positive definite on polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    In the paper under review the authors establish a matrix version of Handelman's Positivstellensatz: \par Let $P$ be a convex, compact polyhedron in $\mathbb{R}^n$ with non-empty interior, bounded by linear polynomials $L_1,\dots,L_m\in \mathbb{R}[X]=\mathbb{R}[X_1,\dots,X_n]$. Let $\mathbf{F}=\mathbf{F}(X)$ be a polynomial matrix that is positive definite on $P$; i.e. $\mathbf{F}$ is a symmetric $t\times t$-matrix for some natural number $t$ with entries from $\mathbb{R}[X]$ such that for every $x\in P$ the real $t\times t$-matrix $\mathbf{F}(x)$ is positive definite. The main result states that there is a natural number $N_0$ with the following property: For every $N\geq N_0$ there is a representation \[ \mathbf{F}=\sum_{|\alpha|=N+d}\mathbf{F}_\alpha L^\alpha \] where $d$ is the degree of $\mathbf{F}$, each $F_\alpha$ is a positive definite $t\times t$-matrix and $L=(L_1,\dots,L_m)$. The authors give a lower bound for the number $N_0$ in terms of $\mathbf{F}$.
    0 references
    0 references
    polyhedron
    0 references
    matrix polynomial
    0 references
    positive definite
    0 references
    Positivstellensatz
    0 references
    Handelman's theorem
    0 references
    standard simplex
    0 references
    Schmüdgen's theorem
    0 references
    Pólya's theorem
    0 references
    polynomial matrix
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references