Matrix coefficient realization theory of noncommutative rational functions
Jurij Vol\v{c}i\v{c}

TL;DR
This paper develops a comprehensive realization theory for noncommutative rational functions, enabling minimal realization computation, domain analysis, and complexity measurement, with applications in algebra, geometry, and control theory.
Contribution
It introduces a realization framework applicable to all noncommutative rational functions, including methods for minimal realization and complexity analysis.
Findings
Provides a method to obtain minimal realizations efficiently.
Defines a numerical invariant to measure function complexity.
Establishes size bounds for rational identity testing.
Abstract
Noncommutative rational functions, i.e., elements of the universal skew field of fractions of a free algebra, can be defined through evaluations of noncommutative rational expressions on tuples of matrices. This interpretation extends their traditional important role in the theory of division rings and gives rise to their applications in other areas, from free real algebraic geometry to systems and control theory. If a noncommutative rational function is analytic at the origin, it can be described by a linear object, called a {\em realization}. In this article we present a realization theory that is applicable to {\em arbitrary} noncommutative rationals function and is well-adapted for studying matrix evaluations. Of special interest are the minimal realizations, which compensate the absence of a canonical form for noncommutative rational functions. The non-minimality of a realization…
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.
