Factorization of positive-semidefinite operators with absolutely summable entries
arXiv:2409.20372
Abstract
A problem by Feichtinger, Heil, and Larson asks whether every infinite matrix with (an equivalent substitute for the Feichtinger algebra) that is positive-semidefinite admits a symmetric rank-one decomposition with . In the finite-dimensional setting, we analyze the corresponding quantitative optimization problem by an exact reformulation as a linear program over measures, derive its dual, and prove strong duality. We then obtain an equivalent adjoint formulation regarding the quality of a convex relaxation. In the infinite-dimensional setting, we first provide a negative answer to this question using a concurrent finite-dimensional result by Bandeira-Mixon-Steinerberger. We further study the collection of operators for which such decomposition exists, showing that they are dense in a suitable topology and invariant under the action of the positive-coefficient analytic Wiener subalgebra. In addition, we give a sufficient condition for successful rank-one decomposition in terms of -summing factorization, and we characterize exactly when is -summing.
27 pages, significant update in the infinite-dimensional settings. Abstract update