Year: 2026
Type: preprint
Abstract: The main result of this paper is a semialgebraic description of the set of matrices of rank at most 3 and psd rank at most 2. Such a semialgebraic description allows one to check whether a matrix has rank at most 3 and psd rank at most 2. This description builds on the geometric characterization of matrices of rank 3 and psd rank 2 using the existence of an ellipse nested between two polygons. The main step towards deriving the semialgebraic description is the observation that we need to consider only finitely many ellipses that go through some of the vertices of the inner polygon and are tangent to some of the edges of the outer polygon. Although the description is not completely quantifier-free, for a general matrix, the quantified variables satisfy a system of polynomial equations that has at most four solutions corresponding to reduced conics.
Source: arXiv (Cornell University)
Authors: Kubjas, Kaie, Metsälampi, Lilja, Orlich, Milo
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236690433
