Finsler's Lemma for Matrix Polynomials
classification
🧮 math.AG
keywords
polynomialsrealfinslerlemmamatricessymmetricadditionalalgebraic
read the original abstract
Finsler's Lemma charactrizes all pairs of symmetric $n \times n$ real matrices $A$ and $B$ which satisfy the property that $v^T A v>0$ for every nonzero $v \in \mathbb{R}^n$ such that $v^T B v=0$. We extend this characterization to all symmetric matrices of real multivariate polynomials, but we need an additional assumption that $B$ is negative semidefinite outside some ball. We also give two applications of this result to Noncommutative Real Algebraic Geometry which for $n=1$ reduce to the usual characterizations of positive polynomials on varieties and on compact sets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.