Matrix evaluations of noncommutative rational functions and Waring problems
Matej Bre\v{s}ar, Jurij Vol\v{c}i\v{c}

TL;DR
This paper demonstrates that large matrices can realize noncommutative rational functions with distinct eigenvalues and applies this to solve Waring problems, showing that matrices can be expressed as differences or products of polynomial evaluations.
Contribution
It establishes the existence of matrices with prescribed eigenvalues for noncommutative rational functions and applies this to Waring problems in matrix algebras, including polynomial and rational cases.
Findings
Existence of matrices with n distinct eigenvalues for large n
Every matrix in sl_n(K) can be expressed as a difference of rational function evaluations
Every nonscalar matrix in GL_n(K) can be written as a product of polynomial evaluations
Abstract
Let be a nonconstant noncommutative rational function in variables over an algebraically closed field of characteristic 0. We show that for large enough, there exists an such that has distinct and nonzero eigenvalues. This result is used to study the linear and multiplicative Waring problems for matrix algebras. Concerning the linear problem, we show that for large enough, every matrix in can be written as for some . We also discuss variations of this result for the case where is a noncommutative polynomial. Concerning the multiplicative problem, we show, among other results, that if and are nonconstant polynomials, then, for large enough, every nonscalar matrix in can be written as for some .
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
TopicsMatrix Theory and Algorithms · Finite Group Theory Research · Tensor decomposition and applications
