pith. sign in

arxiv: 1501.06000 · v1 · pith:U3PPMUC2new · submitted 2015-01-24 · 🧮 math.FA

Convex entire noncommutative functions are polynomials of degree two or less

classification 🧮 math.FA
keywords convexmatrixdegreelessldotspolynomialanalyticfunction
0
0 comments X
read the original abstract

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result: that a function of $x$ that is matrix convex near $0$ and also that is "analytic" in some neighborhood of the set of all self-adjoint matrix tuples is in fact a polynomial of degree two or less. More generally, we prove that a function $F$ in two classes of noncommuting variables, $a = (a_1, \ldots, a_{\tilde{g}})$ and $x = (x_1, \ldots, x_g)$ that is "analytic" and matrix convex in $x$ on a "noncommutative open set" in $a$ is a polynomial of degree two or less.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.