Hyperbolic Polynomials and Generalized Clifford Algebras

We consider the problem of realizing hyperbolicity cones as spectrahedra, i.e. as linear slices of cones of positive semidefinite matrices. The generalized Lax conjecture states that this is always possible. We use generalized Clifford algebras for a new approach to the problem. Our main result is that if -1 is not a sum of hermitian squares in the Clifford algebra of a hyperbolic polynomial, then its hyperbolicity cone is spectrahedral. Our result also has computational applications, since this sufficient condition can be checked with a single semidefinite program

Tracial algebras and an embedding theorem

We prove that every positive trace on a countably generated *-algebra can be approximated by positive traces on algebras of generic matrices. This implies that every countably generated tracial *-algebra can be embedded into a metric ultraproduct of generic matrix algebras. As a particular consequence, every finite von Neumann algebra with separable pre-dual can be embedded into an ultraproduct of tracial *-algebras, which as *-algebras embed into a matrix-ring over a commutative algebra.Comment: 23 pages, no figure

Polynomials with and without determinantal representations

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal representation. Br\"and\'en has shown that the result does not extend to arbitrary numbers of variables, disproving the generalized Lax conjecture. We prove that in fact almost no real zero polynomial admits a determinantal representation; there are dimensional differences between the two sets. So the generalized Lax conjecture fails badly. The result follows from a general upper bound on the size of linear matrix polynomials. We then provide a large class of surprisingly simple explicit real zero polynomials that do not have a determinantal representation, improving upon Br\"and\'en's mostly unconstructive result. We finally characterize polynomials of which some power has a determinantal representation, in terms of an algebra with involution having a finite dimensional representation. We use the characterization to prove that any quadratic real zero polynomial has a determinantal representation, after taking a high enough power. Taking powers is thereby really necessary in general. The representations emerge explicitly, and we characterize them up to unitary equivalence