Papers
Topics
Authors
Recent
Search
2000 character limit reached

Convex entire noncommutative functions are polynomials of degree two or less

Published 24 Jan 2015 in math.FA | (1501.06000v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.