Pfister's theorem fails in the free case
Martin Harrison

TL;DR
This paper investigates the limitations of Pfister's theorem in the context of free *-algebras, showing that a similar lower bound on polynomial rank applies in this non-commutative setting.
Contribution
It extends the failure of Pfister's theorem from Hermitian polynomials to free *-algebras, establishing a lower bound on polynomial rank in this non-commutative framework.
Findings
Pfister's theorem does not hold in free *-algebras.
A lower bound on polynomial rank similar to the Hermitian case is proven.
The result generalizes the failure of Pfister's theorem to a broader algebraic setting.
Abstract
Artin solved Hilbert's 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 is a positive semi-definite polynomial in variables, then there is a polynomial so that is a sum of at most 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 is bounded below by a quantity depending on . Here we prove that a similar result holds in a free -algebra.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Numerical Methods and Algorithms · Advanced Optimization Algorithms Research
