Extreme Points of Spectrahedra

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Waghmare, Kartik G., Panaretos, Victor M.
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909443139043328
author Waghmare, Kartik G.
Panaretos, Victor M.
author_facet Waghmare, Kartik G.
Panaretos, Victor M.
contents We consider the problem of characterizing extreme points of the convex set of positive linear operators on a possibly infinite-dimensional Hilbert space under linear constraints. We show that even perturbations of points in such sets admit what resembles a Douglas factorization. Using this result, we prove that an operator is extreme iff a corresponding set of linear operators is dense in the space of trace-class self-adjoint operators with range contained in the closure of the range of that operator. If the number of constraints is finite, we show that the extreme point must be of low-rank relative to the number of constraints and derive a purely rank-based characterization of the extreme points. In the finite-dimensional setting, our results lead to a remarkably simple characterization of the elliptope, that is, the set of correlation matrices, in terms of the Hadamard product which allows us to characterize the set of matrices which constitute the equality case of the Hadamard rank inequality when the involved matrices are equal and positive semi-definite. We illustrate the importance of our results using examples from statistics and quantum mechanics.
format Preprint
id arxiv_https___arxiv_org_abs_2410_14889
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Extreme Points of Spectrahedra
Waghmare, Kartik G.
Panaretos, Victor M.
Optimization and Control
Functional Analysis
90C22, 46C05, 62R10, 47L07
We consider the problem of characterizing extreme points of the convex set of positive linear operators on a possibly infinite-dimensional Hilbert space under linear constraints. We show that even perturbations of points in such sets admit what resembles a Douglas factorization. Using this result, we prove that an operator is extreme iff a corresponding set of linear operators is dense in the space of trace-class self-adjoint operators with range contained in the closure of the range of that operator. If the number of constraints is finite, we show that the extreme point must be of low-rank relative to the number of constraints and derive a purely rank-based characterization of the extreme points. In the finite-dimensional setting, our results lead to a remarkably simple characterization of the elliptope, that is, the set of correlation matrices, in terms of the Hadamard product which allows us to characterize the set of matrices which constitute the equality case of the Hadamard rank inequality when the involved matrices are equal and positive semi-definite. We illustrate the importance of our results using examples from statistics and quantum mechanics.
title Extreme Points of Spectrahedra
topic Optimization and Control
Functional Analysis
90C22, 46C05, 62R10, 47L07
url https://arxiv.org/abs/2410.14889