A semialgebraic description of matrices of positive semidefinite rank at most 2

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24237
Primary Topic
Advanced Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A semialgebraic description of matrices of positive semidefinite rank at most 2

Milo Orlich, Kaie Kubjas, Lilja Metsälampi
arXiv (Cornell University)
Advanced Optimization Algorithms Research
preprint

A semialgebraic description of matrices of positive semidefinite rank at most 2

Milo Orlich, Kaie Kubjas, Lilja Metsälampi
preprint en

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.

arXiv (Cornell University)
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon