谱面体的极值点
Extreme Points of Spectrahedra
AI总结:
本文研究线性约束下正线性算子凸集的极值点,利用Douglas分解型结果建立极值点的稠密性刻画,并在有限约束下给出基于秩的极值点判据,进而用Hadamard乘积简洁刻画相关矩阵椭圆体及Hadamard秩不等式等号情形。
摘要:
我们考虑在可能无限维的希尔伯特空间上,在线性约束条件下刻画正线性算子凸集的极值点问题。我们证明,即使对此类集合中点的扰动也承认类似于Douglas分解的结构。利用这一结果,我们证明一个算子是极值点当且仅当相应的线性算子集合在迹类自伴算子空间中稠密,且这些算子的值域包含在该算子值域的闭包中。如果约束个数有限,我们证明极值点相对于约束个数必须是低秩的,并推导出极值点的纯粹基于秩的刻画。在有限维情形下,我们的结果给出了椭圆体(即相关矩阵集合)的一个非常简洁的刻画,该刻画基于Hadamard乘积,使我们能够刻画当所涉及的矩阵相等且半正定时构成Hadamard秩不等式等号情形的矩阵集合。我们利用统计学和量子力学中的例子说明了这些结果的重要性。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。