Generic matrix polynomials with fixed rank and fixed degree
Abstract
The set Pm× nr,d of m × n complex matrix polynomials of grade d and (normal) rank at most r in a complex (d+1)mn dimensional space is studied. For r = 1, … , \m, n\-1, we show that Pm× nr,d is the union of the closures of the rd+1 sets of matrix polynomials with rank r, degree exactly d, and explicitly described complete eigenstructures. In addition, for the full-rank rectangular polynomials, i.e. r= \m, n\ and m ≠ n, we show that Pm× nr,d coincides with the closure of a single set of the polynomials with rank r, degree exactly d, and the described complete eigenstructure. These complete eigenstructures correspond to generic m × n matrix polynomials of grade d and rank at most~r.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.