English

Non-Commutative Partial Matrix Convexity

Functional Analysis 2008-04-07 v1 Optimization and Control

Abstract

Let pp be a polynomial in the non-commuting variables (a,x)=(a1,...,aga,x1,...,xgx)(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x}). If pp is convex in the variables xx, then pp has degree two in xx and moreover, pp has the form p=L+ΛTΛ,p = L + \Lambda ^T \Lambda, where LL has degree at most one in xx and Λ\Lambda is a (column) vector which is linear in x,x, so that ΛTΛ\Lambda^T\Lambda is a both sum of squares and homogeneous of degree two. Of course the converse is true also. Further results involving various convexity hypotheses on the xx and aa variables separately are presented.

Keywords

Cite

@article{arxiv.0804.0633,
  title  = {Non-Commutative Partial Matrix Convexity},
  author = {Damon M. Hay and J. William Helton and Adrian Lim and Scott McCullough},
  journal= {arXiv preprint arXiv:0804.0633},
  year   = {2008}
}

Comments

24 pages

R2 v1 2026-06-21T10:27:33.776Z