Rational and real positive semidefinite rank can be different
Optimization and Control
2014-04-21 v1
Abstract
Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank, where the matrix factors are required to be rational symmetric psd matrices. It is clear that the rational-restricted psd rank is always an upper bound to the usual psd rank. We show that this inequality may be strict by exhibiting a matrix with psd rank four whose rational-restricted psd rank is strictly greater than four.
Keywords
Cite
@article{arxiv.1404.4864,
title = {Rational and real positive semidefinite rank can be different},
author = {João Gouveia and Hamza Fawzi and Richard Z. Robinson},
journal= {arXiv preprint arXiv:1404.4864},
year = {2014}
}
Comments
3 pages