2000 character limit reached
Pfister's theorem fails in the free case (1102.1768v1)
Published 9 Feb 2011 in math.RA
Abstract: Artin solved Hilbert's $17{th}$ problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if $p$ is a positive semi-definite polynomial in $n$ variables, then there is a polynomial $q$ so that $q2p$ is a sum of at most $2n$ squares. As shown by D'Angelo and Lebl, the analog of Pfister's theorem fails in the case of Hermitian polynomials. Specifically, it was shown that the rank of any multiple of the polynomial $|z|{2d} \equiv (\sum_j |z_j|2)d$ is bounded below by a quantity depending on $d$. Here we prove that a similar result holds in a free $\ast$-algebra.