Spectrahedron characterization of psd rank for normalized matrices
Let have rank and satisfy
Let and be the two polytopes corresponding to in the nested-polytope representation. Spectrahedron nesting conjecture. The matrix has psd rank at most if and only if a spectrahedron of size can be nested between and . The preceding lemma proves this equivalence in a restricted matrix-size setting; the conjecture asserts that it holds for matrices of any size.
References
Primary source
Kaie Kubjas, Elina Robeva and Richard Z. Robinson, “Positive semidefinite rank and nested spectrahedra”, arXiv:1512.08766 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.