Geometry of Matrix Polynomial Spaces

We study how small perturbations of general matrix polynomials may change their elementary divisors and minimal indices by constructing the closure hierarchy (stratification) graphs of matrix polynomials’ orbits and bundles. To solve this problem, we construct the stratification graphs for the first companion Fiedler linearization of matrix polynomials. Recall that the first companion Fiedler linearization as well as all the Fiedler linearizations is matrix pencils with particular block structures. Moreover, we show that the stratification graphs do not depend on the choice of Fiedler linearization which means that all the spaces of the matrix polynomial Fiedler linearizations have the same geometry (topology). This geometry coincides with the geometry of the space of matrix polynomials. The novel results are illustrated by examples using the software tool StratiGraph extended with associated new functionality.


Introduction
For a long-time matrix polynomials P(λ) = λ d A d + · · · + λA 1 + A 0 , A i ∈ C m×n , i = 0, . . . , d, and A d = 0, (1) have been important objects to investigate. Due to challenging applications [27,28,37,41,42], matrix polynomials have received much attention in the last decade, resulting in rapid developments of corresponding theories [5][6][7]19,32,37] and computational techniques [3,27,34,36,39] (see also the recent survey [38]). In a number of cases, the canonical structure information, i.e. elementary divisors and minimal indices of the matrix polynomials, are the actual objects of interest. This information is usually computed via linearizations [3], in particular, Fiedler linearizations [1], i.e. matrix polynomials of degree d = 1 which are matrix pencils with a particular block structure. However, the canonical structure information is sensitive to perturbations in the coefficient matrices of the polynomial. How small perturbations may change the canonical structure information can be studied through constructing the orbit and bundle closure hierarchy (or stratification) graphs. Each node of such a graph represents a set of matrix polynomials with a certain canonical structure information, and there is an edge from one node to another if we can perturb any matrix polynomial associated with the first node such that its canonical structure information becomes equal to one of the matrix polynomials associated with the second node. The theory to compute and construct the stratification graphs is already known for several matrix problems: matrices under similarity (i.e. Jordan canonical form) [4,21,35,40], matrix pencils (i.e. Kronecker canonical form) [21], skew-symmetric matrix pencils [16], controllability and observability pairs [22], state-space system pencils [15], as well as full (normal)-rank matrix polynomials [32]. Many of these results are already implemented in StratiGraph [29,31,33], which is a java-based tool developed to construct and visualize such closure hierarchy graphs. The Matrix Canonical Structure (MCS) Toolbox for MATLAB [14,29,31] was also developed for simplifying the work with the matrices in canonical forms and connecting MATLAB with StratiGraph. For more details on each of these cases, we recommend to check the corresponding papers and their references; some control applications are discussed in [33].
In this paper, we study how small perturbations of general matrix polynomials, with rectangular matrix coefficients, may change their elementary divisors and minimal indices by constructing the closure hierarchy graphs of the orbits and bundles of matrix polynomial and their Fiedler linearizations. Our new results generalize and extend results from [32], where the study concerned full-rank matrix polynomials. Other recent results that are crucial for this study include necessary and sufficient conditions for a matrix polynomial with certain degree and canonical structure information to exist [7]; the strong linearization templates and how the minimal indices of such linearizations are related to the minimal indices of the polynomials [6]; the correspondence between perturbations of the linearizations and perturbations of matrix polynomials [32]; as well as the algorithm for the stratification of general matrix pencils [21]. In particular, the results in [6] and [7] allow us to consider polynomials with both left and right minimal indices, in contrast to [32] (recall that full-rank matrix polynomials may have either left or right minimal indices, not both types); as well as to use any Fiedler linearization in contrast to the fixed choice of either the first or second companion forms (depending on which type of the minimal indices is present).
The rest of the paper is organized as follows. Sections 2-5 present necessary background to matrix polynomials, their linearizations and perturbations, and to matrix pencils. Codimension computation is presented in Sect. 6. Section 7 is devoted to stratifications of Fiedler linearizations of matrix polynomials. Section 7.1 recalls cover relations for complete eigenstructures, a concept frequently used in the results that follow on neighbours in the stratifications. Sections 7.2 and 7.3 provide the results for neighbouring orbits and bundles, respectively. All results are illustrated with examples. Finally, in Sect. 8 stratification results from Sect. 7 are expressed in terms of matrix polynomial invariants. Altogether, we complete the stratification theory for general matrix polynomials and the associated Fiedler linearizations.
All matrices that we consider have complex entries.

Matrix Polynomials with Prescribed Invariants
In this section, we consider matrix polynomials (1) and recall the definitions of the canonical structure information for matrix polynomials, i.e. the elementary divisors and minimal indices, and state Theorem 2 (proven in [7]) that explains which canonical structure information a matrix polynomial may have.

Definition 1
Let P(λ) and Q(λ) be two m × n matrix polynomials. Then, P(λ) and Q(λ) are unimodulary equivalent if there exist two unimodular matrix polynomials The transformation P(λ) → U (λ)P(λ)V (λ) is called a unimodular equivalence transformation, and the canonical form with respect to such transformations is the Smith form [24], recalled in the following theorem.
Moreover, the canonical form (2) is unique.
The integer r is the (normal) rank of the matrix polynomial P(λ), and P(λ) is called full rank if r = min{m, n}.
Each g j (λ) is called an invariant polynomial of P(λ) and can be uniquely factored as where l j 0, δ j1 , . . . , δ jl j > 0 are integers. If l j = 0, then g j (λ) = 1. The numbers α 1 , . . . , α l j ∈ C are finite eigenvalues (zeros) of P(λ). The elementary divisors of P(λ) associated with the finite eigenvalue α k is the collection of factors (λ − α k ) δ jk , including repetitions. We say that λ = ∞ is an eigenvalue of the matrix polynomial P(λ) if zero is an eigenvalue of rev P(λ) := λ d P(1/λ). The elementary divisors λ γ k , γ k > 0 for the zero eigenvalue of rev P(λ) are the elementary divisors associated with ∞ of P(λ).
Define the left and right null-spaces, over the field of rational functions C(λ), for an m × n matrix polynomial P(λ) as follows, e.g. see [7]: Every subspace V of the vector space C(λ) n has bases consisting entirely of vector polynomials. Recall that a minimal basis of V is a basis of V consisting of vector polynomials whose sum of degrees is minimal among all bases of V consisting of vector polynomials. The ordered list of degrees of the vector polynomials in any minimal basis of V is always the same. These degrees are called the minimal indices of V . We use the concepts above in the context of matrix polynomials as follows: let the sets {y 1 (λ) T , . . . , y m−r (λ) T } and {x 1 (λ), . . . , x n−r (λ)} be minimal bases of N left (P) and N right (P), respectively, ordered so that 0 deg(y 1 ) . . . deg(y m−r ) and 0 deg(x 1 ) . . . deg(x n−r ). Let η k = deg(y k ) for i = 1, . . . , m − r and ε k = deg(x k ) for i = 1, . . . , n − r . Then, the scalars 0 η 1 η 2 . . . η m−r and 0 ε 1 ε 2 . . . ε n−r are, respectively, the left and right minimal indices of P(λ).
The condition γ 1 = 0 guarantees that A d in (1) is a nonzero m × n matrix.

Fiedler Linearizations of Matrix Polynomials
Let us first define Fiedler linearizations [1], with all the details, for the square matrix polynomials (m = n). Let G(λ) = d k=0 λ k A k be an n × n matrix polynomial. Given any bijection σ : where Note that σ (k) describes the position of the factor M k in the product defining the zero-degree term in (4), i.e. σ (k) = j means that M k is the j th factor in the product. All the non-specified blocks of M k matrices are conforming size submatrices with zero entries. By using bijections σ , we can construct Fiedler linearizations via a "multiplication free" algorithm (i.e. by avoiding multiplying the matrices M k ) [6]. The advantage of such an algorithm is that it can be adapted to rectangular matrix polynomials. Note that the "shapes" of the linearizations (i.e. positions of the coefficient matrices in the linearization pencils) for the rectangular matrix polynomials are the same as for the square matrix polynomials [6]. Moreover, different linearizations of rectangular matrix polynomials have different sizes, see Example 3.
Likely, the best known Fiedler linearizations are the first and second (a.k.a. Frobenius) companion forms. For an m × n matrix polynomial P(λ) of degree d, they can be expressed as the matrix pencils and of size (m + n(d − 1)) × nd and md × (n + m(d − 1)), respectively. Fiedler linearizations preserve finite and infinite elementary divisors but do not, in general, preserve the left and right minimal indices (in some cases, the minimal indices may also be preserved, e.g. for full-rank matrix polynomials [32]). In Theorem 3, proven in [6], we recall the relation between the minimal indices of polynomials and their Fiedler linearizations; see also [5] for the similar results on square matrix polynomials.
are the right and left minimal indices of F σ P(λ) .

Perturbations of Matrix Polynomials
Recall that for every matrix X = [x i j ], its Frobenius norm is given by ||X || := Define a norm of a matrix polynomial P(λ) = d k=0 λ k A k as follows Definition 2 Let P(λ) and E(λ) be two m × n matrix polynomials, with deg P(λ) ≥ deg E(λ). A matrix polynomial P(λ) := P(λ) + E(λ) is called a perturbation of an m × n matrix polynomial P(λ).
We remark that Definition 2 is also applicable to matrix pencils and matrices (they are polynomials of degrees one and zero, respectively).
Theorem 4 (proven in [32]) ensures that each perturbation of the linearization of an m × n matrix polynomial of degree d can be smoothly reduced by strict equivalence to the one in which only the blocks We refer to (8) as a perturbation of the linearization and to (9) as the linearization of a perturbed matrix polynomial. The relation between these two types of perturbations is reflected in the following theorem, which is a slightly adapted formulation of Theorem 2.5 from [10], see also Theorem 5.21 in [19], as well as [32,43].

Theorem 4 Let P(λ) be an m × n matrix polynomial of degree d, and let
, i.e. there exist two non-singular matrices X and Y (they are small perturbations of the identity matrices) such that , and moreover, The following corollary to Theorem 4 shows that the canonical structure information of all pencils that are attainable by perturbations of the form (8) are also attainable by perturbations of the form (9).

Corollary 1 Let P(λ) and Q(λ) be two m × n matrix polynomials of degree d, and
There exist an arbitrarily small perturbation of P(λ), denoted P(λ), and non-singular matrices U , V , such that if and only if there exist an arbitrarily small perturbation of the linearization of the matrix polynomial P(λ), C 1 P(λ) , and non-singular matrices U , V , such that Proof By Theorem 4, we have X · C 1 P(λ) · Y = C 1

P(λ)
and substituting C 1 The "vice versa" part is obvious.
An alternative way to derive the results of Corollary 1 is to use the theory of versal deformations [2,12,13] as it was done for state-space system pencils in [15] and skewsymmetric polynomials in [9]. See also Theorem 9, which generalizes the above results for any Fiedler linearization.

Matrix Pencils
We recall the Kronecker canonical form of general matrix pencils A − λB (a matrix polynomial of degree one) under strict equivalence.
where μ ∈ C, and for each k = 0, 1, . . ., define the k × (k + 1) matrices All non-specified entries of J k (μ), I k , F k , and G k are zeros. An m × n matrix pencil A − λB is called strictly equivalent to C − λD if there are non-singular matrices Q and R such that Q −1 AR = C and Q −1 B R = D. The set of matrix pencils strictly equivalent to A − λB forms a manifold in the complex 2mn dimensional space. This manifold is the orbit of A − λB under the action of the group G L m (C) × G L n (C) on the space of all matrix pencils by strict equivalence: The dimension of O e A−λB is the dimension of its tangent space The orthogonal complement to T e A−λB , with respect to the Frobenius inner product is called the normal space to this orbit. The dimension of the normal space is the . Explicit expressions for the codimensions of strict equivalence orbits are presented in [8].
Theorem 5 [24,Sect. XII,4] Each m × n matrix pencil A − λB is strictly equivalent to a direct sum, uniquely determined up to permutation of summands, of pencils of the form where j 1 and k 0. The j's and k's may be different in each block.
The canonical form defined by the E j , L k and L T k blocks in Theorem 5 is known as the Kronecker canonical form (KCF) of the pencil A − λB. The blocks E j (μ) (with up to min{m, n} different eigenvalues μ i ) and E j (∞) correspond to the finite and infinite eigenvalues, respectively, and altogether form the regular part of A − λB. The blocks L k and L T k correspond to the right (column) and left (row) minimal indices, respectively, and form the singular part of the matrix pencil.
A bundle B e A−λB of a matrix pencil A−λB is a union of orbits O e A−λB with the same singular structures and the same regular structures, except that the distinct eigenvalues may be different.

Orbits of Linearizations of Matrix Polynomials and Their Codimensions
Let P(λ) be an m×n matrix polynomial of degree d and C 1 P(λ) be its (m+n(d−1))×nd first companion form. The generalized Sylvester space at P(λ) is defined as (see [32] and references therein) where GSYL 1 m×n is a (d +1)mn-dimensional affine subspace in the (2d 2 n 2 +2dn(m − n))-dimensional pencil space; each fixed element in the linearization decreases the degree of freedom by one. If there is no risk of confusion, we write GSYL instead of GSYL 1 m×n . We define the orbit of linearizations of matrix polynomials as Note that all the elements of O C 1

P(λ)
have the block structure of C 1 P(λ) , see (5). By [32, is a manifold in the matrix pencil space. Codimensions of this manifold are also of our interest, since they define the level of the orbit in the stratification graph: an orbit has only orbits with higher codimensions in its closure. Recall that dim O e where N denotes the normal space (see Sect. 5). Define ). (16) The following lemma shows that the codimensions of O C 1

P(λ)
and O e C 1
We also refer to [32, Section 9] for a slightly different explanation of the analogous results.
Lemma 1 Let C 1 P(λ) be the first companion form for the matrix polynomial P(λ), then . Proof A general matrix pencil of the same size as C 1 P(λ) belongs to the pencil space (14) is the subspace of all first companion forms of m×n matrix polynomials. Following the arguments in [32,43], GSYL is an affine subspace in P that together with the tangent space T e spans the complete P [32, proof of Lemma 9.2], and since GSYL ∩ T e see also [23,Section 2] for details. Knowing the dimensions of the tangent and the normal spaces and using (16) and (17), we finally get .
We remark that there are other examples where codimension equalities similar to the one in Lemma 1 do hold [22,32] as well as examples where they are not valid [15,17,18].

Stratifications of Matrix Polynomial Linearizations
In this section, we start by presenting an algorithm for computing the stratification of the Fiedler linearizations of general m × n matrix polynomials (1). The algorithm relies on the results presented in Sects. 4-5. Section 7.1 introduces cover relations for complete eigenstructures. Based on these concepts, Sect. 7.2 presents the results for orbit stratifications. Similar results for bundle stratifications are presented in Sect. 7.3.
Stratifications or closure hierarchy graphs for orbits of the matrix polynomial linearizations are defined as follows. Each node (vertex) of the graph represents the orbit of a matrix polynomial linearization, and each edge represents a cover relation, i.e. there is an upward path from a node associated with F σ P(λ) to a node associated with F σ Q(λ) if and only if P(λ) can be transformed by an arbitrarily small perturbation to a matrix polynomial whose canonical structure information coincides with the one for Q(λ).
The closure hierarchy graph obtained by the following algorithm is the orbit stratification of the first companion form of m × n matrix polynomials of degree d.

Algorithm 6
Steps 1-3 produce the orbit stratification of the first companion linearizations of m × n matrix polynomials of degree d.

Step 2. Extract from the stratification obtained in
Step 1 the orbits (nodes) that correspond to the first companion linearizations of m × n matrix polynomials of degree d (using Theorems 2 and 3, as well as Remark 1).

Step 3. Put an edge between two nodes obtained in
Step 2 if there is an upward path between these nodes in the graph obtained in Step 1 and do not put an edge between these nodes otherwise (justified by Theorem 4 and Corollary 1).

Theorem 7
The stratification graphs for a matrix polynomial P(λ) and any of its Fiedler linearizations F σ P(λ) are the same, up to the fact that the nodes in the graph for the Fiedler linearization represent complete eigenstructures with the minimal indices "shifted", see Theorem 3.
Proof We take the stratification graph for C 1 P(λ) as a starting point since we know how to construct it using Algorithm 6. Let also P 1 (λ) and P 2 (λ) be matrix polynomials belonging to two different orbits in this stratification graph. If there is an arrow from C 1 P 1 (λ) to C 1 P 2 (λ) in the stratification of the first companion forms, then P 1 (λ) + E(λ), for some small perturbation E(λ), and P 2 (λ) have the same canonical structure information. Therefore, there is an arrow from P 1 (λ) and P 2 (λ) in the stratification of matrix polynomials. Moreover, for every σ the pencils F σ P 1 (λ)+E(λ) and F σ P 2 (λ) have the same canonical structure information, and thus, there is an arrow from F σ P 1 (λ) to F σ P 2 (λ) in the stratifications of all the Fiedler linearizations of P 1 (λ) and P 2 (λ).
Remark 2 Theorem 7 does not contradict the fact that for a particular matrix polynomial, some linerizations may be better conditioned, more favourable with respect to backward errors, and/or structure preserving, and therefore, the choice of linearization is typically application driven.

Cover Relation for Complete Eigenstructures
A sequence of integers N = (n 1 , n 2 , n 3 , . . . ) such that n 1 + n 2 + n 3 + · · · = n and n 1 n 2 . . . 0 is called an integer partition of n (for more details and references see [21]). For any a ∈ Z, we define N + a as the integer partition  the partition (4, 3, 2, 1, 1), on the left, we apply two minimal leftward coin moves: first (i) is a move of a dark grey coin one column leftward, and then, (ii) is a move of a light grey coin one row upward. Note that monotonicity must be preserved. The resulting partition is (4, 4, 2, 1), on the right (n 1 + a, n 2 + a, n 3 + a, . . . ). The additive union of two integer partitions N and M is defined as K = N M where all the elements from N and M are ordered such that K is monotonically non-increasing (i.e. K is a multiset sum of N and M , see, e.g. [26,Chap. 1.2.4], ordered non-increasingly). For example, if N = (3, 3, 1) and M = (7, 3, 2, 2), then K = N M = (7, 3, 3, 3, 2, 2, 1). We write N M if and only if n 1 + n 2 + · · · + n i m 1 + m 2 + · · · + m i , for i 1. The set of all integer partitions forms a poset (even a lattice) with respect to the order " ".
With every matrix pencil W ≡ A − λB (with eigenvalues μ i ∈ C ∪ {∞}), we associate the set of integer partitions R(W ), L (W ), and where q is the number of distinct eigenvalues of W (e.g. see [21]). Altogether, these partitions, known as the Weyr characteristics, are constructed as follows: blocks with the indices η i greater than or equal to k (the position numeration starting from 0).
The associated partitions are: An integer partition N = (n 1 , n 2 , n 3 , . . . ) can also be represented by n piles of coins, where the first pile has n 1 coins, the second n 2 coins and so on. Moving one coin one column rightwards or one row downwards in the integer partition N , and keeping N monotonically non-increasing, is called a minimum rightward coin move. Similarly, moving one coin one column leftwards or one row upwards in the integer partition N , and keeping N monotonically non-increasing, is called a minimum leftward coin move. These two types of coin moves are defined in [21], see also Fig. 1.
By X we denote the closure of a set X in the Euclidean topology. For a matrix polynomial P(λ), define O F σ P(λ) to be a set of matrix pencils strictly equivalent to F σ P(λ) and with the same block structure as F σ P(λ) (this definition is analogous to the definition of O C 1

P(λ)
for the first companion linearization C 1 P(λ) ). We say that the orbit is higher up in the graph).

Neighbouring Orbits in the Stratification
By representing the canonical structure information as integer partitions, we can express the cover relations between two orbits by utilizing minimal coin moves and combinatorial rules on these integer partitions.
In Theorem 8, the rules are formulated for the first companion form C 1 is defined as in (15). Moreover, in Corollary 2 we show that these rules are actually the same for any Fiedler linearization F σ P(λ) . See also Sect. 8 where the stratification rules for matrix polynomial invariants are presented.

Theorem 8 (Orbit upward rules-matrix polynomial linearizations) Let P 1 (λ) and P 2 (λ) be two m × n matrix polynomials of degree d with the corresponding Fiedler
if and only if the canonical structure information of C 1 P 2 (λ) can be obtained by applying one of the rules below to the structure integer partitions representing the canonical structure information of Proof We first show that applying any of the rules (a)-(d) to the structure integer partitions of C 1 P 1 (λ) for an m × n matrix polynomial P 1 (λ) of degree d, there exits 1 The rule is not allowed to do coin moves that affect r 0 or l 0 (first column in R or L , respectively). 2 If μ i = ∞ for some i, then j μ i 1 (first column in J μ i ) has to remain strictly less than the rank of the corresponding matrix polynomial (this restrict the matrix polynomials to those with a nonzero leading coefficient matrix). 3 Cannot be applied if the total number of nonzero columns of all J μ i is greater than k − 1.
an m × n matrix polynomial P 2 (λ) of degree d such that C 1 P 2 (λ) has the obtained new partitions. We prove the existence of such polynomial P 2(λ) by checking that the associated invariants satisfy the index sum identity (3) in Theorem 2. Below, this is shown to hold for each of the rules (a)-(d). Then, we show that if C 1 P 2 (λ) covers C 1 P 1 (λ) the partitions of C 1 P 2 (λ) are obtained from C 1 P 1 (λ) by one and only one of the rules (a)-(d).
Applying rule (a) either effects the partition R or L and does not change the sum of the invariants ε j or η j , respectively, in (3). Thus, the index sum identity holds for rule (a). Applying rule (b) moves one coin from J to R or L , i.e. the rule simultaneously subtracts 1 from either δ j or γ j and adds 1 to either ε j or η j . Thus, the index sum identity holds for rule (b). Proof for rule (c) is analogous to the proof of rule (a). Applying rule (d) removes ε+d (= ε+1+i(σ )) coins from R and η+1 (= η+1+c(σ )) coins from L (where i(σ ) = d −1 and c(σ ) = 0 are the number of inversions and consecutions, respectively, see Sect. 3 and Remark 1; we also add 1 since the numbering in R and L starts from 0). From Theorem 3, this corresponds to the fact that the sum ε j in (3) is decreased by ε and η j by η. Furthermore, the rule adds k − 1 coins to one or several J μ i , where now k = ε + d + η + 1, which corresponds to that the degrees δ of the new invariant polynomials g r +1 (λ) in Theorem 2 is δ = ε + d + η + 1 − 1 = ε + η + d, where r is the rank of P 1 (λ). After applying rule (d) and since the identity (3) holds for P 1 (λ), the right hand side of the identity (3) loses ε + η but gains δ = ε + η + d; and r increases by 1, and hence, the left hand side changes from rd to (r + 1)d. Thus, the index sum identity holds for rule (d). Moreover, to ensure that the leading coefficient matrix A d in (1) is nonzero the condition j ∞ 1 < r is added (footnote 2 of rule (d)), where r is the rank of the corresponding matrix polynomial. Summing up, the partitions obtained by applying any of rules (a)-(d) correspond to some O C 1 in the stratification of the companion linearizations. By Theorem 4 and Corollary 1 (see also Algorithm 6, Step 3), there is a path from O e in the stratification of equivalence orbits of general matrix pencils of size (m + n(d − 1)) × nd. Therefore, the partitions of C 1 P 2 (λ) are obtained from the partitions of C 1 P 1 (λ) by a sequence of the rules for general matrix pencils [21,30], which indeed are similar to the rules (a)-(d) (see also Remark 3). If the sequence consists of more than one rule, then we have a contradiction with O C 1 must be obtained by one of the rules (a)-(d).

Remark 3
The rules for obtaining the neighbouring orbit above in the stratification graph of a first companion form linearization orbit (and any Fiedler linearization orbit, which is shown in Corollary 2) of a matrix polynomial coincide with the stratification rules for general matrix pencil orbits [30, ∈ {a, b, c, d}) if and only if F σ P 1 (λ) is obtained from F σ P 2 (λ) by applying exactly the same rule (x). The linearization C 1 P 1 (λ) is obtained from C 1 P 2 (λ) by applying rule (a) if and only if the canonical structure information of C 1 P 2 (λ) and C 1 P 1 (λ) differs only in two right minimal indices: . Thus, F σ P 1 (λ) and F σ P 2 (λ) differ only in two right minimal indices too: ε 1 +i(σ ) and . The latter is equivalent to the fact that the linearization F σ P 1 (λ) is obtained from F σ P 2 (λ) by applying rule (a). The same explanation works for rule (a) applied to the left minimal indices.
Note that all the Fiedler linearizations of the same matrix polynomial (including the first companion form) have the same number of right (left) minimal indices (thus the first column of R (and L ) has the same number of coins for any Fiedler linearization) as well as that the integer partitions for the regular parts are exactly the same for all the Fiedler linearizations. Therefore, we can apply (b) to C 1 P 2 (λ) if and only if we can apply (b) to F σ P 2 (λ) . Moreover, the change in the complete eigenstructure of C 1 P 2 (λ) is done by applying rule (b) if and only if the change in the structure of any other Fiedler linearization is done by applying rule (b).
The case of rule (c) follows from the fact that the integer partitions for the regular parts are exactly the same for all the Fiedler linearizations.
Theorem 8 and Corollary 2 provide the rules to obtain neighbouring pencils in the stratification graphs of O C 1 and O F σ P(λ) , respectively, under block-structure preserving perturbations of these linearizations. The following theorem generalizes Theorem 4 by relating block-structure preserving perturbations and full perturbations of matrix pencils for any Fiedler linearization, see also [19,Theorem 6.23].

Theorem 9
Let P(λ) be an m × n matrix polynomial. If there exists a matrix pencil R such that F σ P(λ) is strictly equivalent to R, for some arbitrarily small perturbation of F σ P(λ) , then 1) There exists an m × n matrix polynomial Q(λ) such that R is strictly equivalent to F σ Q(λ) ; 2) There exists an arbitrarily small perturbation P(λ) of P(λ) such that F σ Proof First note that the case when small perturbations do not change the eigenstructure of F σ P(λ) , i.e. X · F σ P(λ) ·Y = F σ P(λ) , is obvious. For small perturbations that change the complete eigenstructure of F σ P(λ) , the canonical form of F σ P(λ) is one of the canonical forms in the stratification graph of (m c(σ ) + n i(σ ) + m) × (m c(σ ) + n i(σ ) + n) matrix pencils to which there is an upward path from F σ P(λ) . By [21,Theorem 3.2], the canonical form of F σ P(λ) can be obtained from the canonical form of F σ P(λ) by applying a sequence of rules (1)-(4) of [21,Theorem 3.2]. Since rules (1)-(4) of [21,Theorem 3.2] coincide with rules (a)-(d) of Corollary 2 (i.e. they make exactly the same changes in the complete eigenstructure), by Corollary 2 there exists F σ has the same complete eigenstructure as F σ P(λ) .

Remark 4
Theorem 9 justifies that an algorithm similar to Algorithm 6 can be used to construct a stratification of any Fiedler linearization.
By Theorem 4 and Corollary 1, perturbations of Fiedler linearization pencils correspond to perturbations in the matrix coefficients of the underlying matrix polynomials. Thus, we can investigate changes of the canonical structure information of the corresponding matrix pencil linearizations. Notably, the sets of the corresponding matrix pencil linearizations are different for different linearizations since Fiedler linearizations preserve elementary divisors but, by Theorem 3, "shift" the minimal indices. In this case, the following shifts are possible: for the first companion form (5), we have +2 for the right and no shift for the left minimal indices; for the second companion form (6), we have no shift for the right and +2 for the left minimal indices; for the Fiedler linearizations with 1 inversion and 1 consecution, we have +1 for the right and +1 for the left minimal indices. We obtain the same stratification graph for all the linearizations, see Fig. 2 and Theorem 7, otherwise it would mean that different linearizations "behave" generally different under small perturbations, but see also Remark 2. Table 1 There exists a 2×2 matrix polynomial of degree 3 ( A 3 = 0) with the canonical structure information δ 1 , δ 2 , γ 1 , γ 2 , ε 1 , and η 1 if and only if δ 1 , δ 2 , γ 1 , γ 2 , ε 1 , and η 1 are those in one of the columns of this table. Columns 1-10 correspond to singular polynomials and columns 11-26 to regular polynomials. (The  table is split into two parts just to fit on the page)   1  2  3  4  5  6  7  8  9  10  11  12  13 14 Note that δ j is just the degree of g j (λ) and it gives a few alternatives for the powers δ jk of the elementary divisors. To be exact, the number of these alternatives is the number of ways the integer δ j can be written as a sum of positive integers, i.e. δ j = δ j1 + δ j2 + · · · + δ jl j . Thus, some columns in Table 1 correspond to more than one node in the graph in Fig. 2. Since the considered matrix polynomials may have rank at most 2 and A 3 = 0, by [7, Lemma 2.6] these polynomials may have at most 1 infinite elementary divisor. Therefore, the eigenvalues in the nodes of Fig. 2 which have two Jordan blocks associated with them can not be infinite.

Example 3
Consider rectangular 1 × 2 matrix polynomials of degree 3. Like in Example 2, we explain how small perturbations of the coefficient matrices of the polynomials may change their canonical structure information. By Theorem 2, such a polynomial has the canonical structure information δ 1 , γ 1 , and ε 1 , presented in one of the four columns of Table 2. Note that the ranks of these polynomials are 1 and that A 3 = 0. Thus, by [7, Lemma 2.6] we have no infinite elementary divisors in this case.
Since the polynomials are rectangular, the Fiedler linearizations are of different sizes: the first companion form is 5 × 6, the second companion form is 3 × 4, and both linearizations in (19) are 4 × 5. These Fiedler type linearizations "shift" the minimal indices exactly as in Example 2.
The three graphs in Fig. 3 have the same set of edges that connect nodes corresponding to matrix pencil orbits with the same regular structures (J k (μ) blocks) but that differ in the sizes of the singular structure (L k blocks). For example, the most generic nodes are L 5 for Fig. 3a, L 4 for Fig. 3b, and L 3 for Fig. 3c. Note that each of these graphs is a subgraph of the corresponding general matrix pencil stratification  (19), and the second companion form, respectively Table 2 There exists a 1 × 2 matrix polynomial of degree 3 (A 3 = 0) with the canonical structure information δ 1 , γ 1 , and ε 1 , if and only if δ 1 , γ 1 , and ε 1 take the values in one of the columns of this table graph; for example, the graph in Fig. 3c is a subgraph of the stratification graph of 3 × 4 matrix pencils, see Fig. 4. Note also that the polynomials in this example have full rank. Thus, we can apply the theory from [32] to construct graph (c) in Fig. 3 (but not (a) or (b) since in [32] the choice of the linearization is fixed).

Neighbouring Bundles in the Stratification
In the orbit stratifications, eigenvalues may appear and disappear but their values cannot change. However, in many applications, see for example [22,32,33], the eigenvalues of the underlying matrices may coalesce or split apart to different eigenvalues, which motivates so-called bundle stratifications. Theories for bundle stratifications are developed along with theories for the orbit stratifications and are known for a number of cases [15,16,[20][21][22]32]. Similarly, we consider stratifications of the bundles of matrix polynomial Fiedler linearizations. Defining a bundle may be a problem by itself, in particular, for the cases where the behaviour of an eigenvalue depends on its value, e.g. see [11,Section 6]. Nevertheless, in our case of the matrix polynomial Fiedler linearizations all the eigenvalues have the same behaviour and the restriction on the number of Jordan blocks associated with the infinite eigenvalue, for example  (19); the nodes represent 4 × 5 matrix pencils. Finally, graph c is the stratification of the second companion form; the nodes represent 3 × 4 matrix pencils in Theorem 8, is coming from our desire to have nonzero leading coefficient matrices of the polynomials but not from the geometrical properties.
Following the definition of bundles for general matrix pencils, we define a bundle B F σ P(λ) of the matrix polynomial linearization F σ P(λ) to be a union of orbits O F σ with the same singular structures and the same regular structures, except that the distinct eigenvalues may be different, see also [32]. Therefore, we have that two Fiedler linearizations F σ P(λ) and F σ R(λ) are in the same bundle if and only if they are in the same bundle as general matrix pencils. This ensures that the stratification algorithm for bundles of matrix polynomial Fiedler linearizations is analogous to Algorithm 6. So we extract the bundles that correspond to the linearizations from the stratification of the general matrix pencil bundles and put an edge between two of them if there is a path between them in the stratification graph for the general matrix pencils. In addition, the codimensions of the bundles of F σ P(λ) are defined as The definition for the cover relation is analogous to the one for orbits, see Sect. 7.1. The following theorem is the bundle analog of Theorem 8.
Theorem 10 (Bundle upward rules-matrix polynomial linearizations) Let P 1 (λ) and P 2 (λ) be two matrix polynomials with the corresponding Fiedler linearizations F σ P 1 (λ) and F σ P 2 (λ) , respectively. The bundle B F σ P 1 (λ) is covered by B F σ P 2 (λ) if and only if the canonical structure information of P 2 (λ) can be obtained by applying one of the rules below to the structure integer partitions representing the canonical structure information of P 1 (λ) (here μ i ∈ C ∪ {∞}):   Similarly, to Theorem 8, rules (a)-(e) above in Theorem 10 coincide with the analogous rules for the general matrix pencils presented in Table 3(D) in [30], see also [21,Theorem 3.3]. The proof is essentially the same as the proof of Theorem 8.

Remark 5
Instead of Fiedler linearizations used in this paper, it is also possible to use a broader class of linearizations, namely the block Kronecker linearizations [19]. To do so, we would have to repeat the steps of this paper for the new linearization class, proving all the missing results.
Note also that using any of the Fiedler linearizations, e.g. the first companion form, is enough to describe the changes of the complete eigenstructure of a matrix polynomial under small perturbations, see the Supplementary Materials to this paper for the rules to obtain for a given matrix polynomial, the complete eigenstructures of its neighbouring matrix polynomials, both above and below. Fig. 5, we stratify the bundles of the Fiedler linerizations (19) of 2 × 2 matrix polynomials of degree 3. In the graph, each node represents a bundle and each edge a cover relation. An arbitrarily small perturbation of coefficient matrices of matrix polynomials, in any bundle, may change the canonical structure to any more generic node that we have an upward path to.

Example 4 In
We recall that the orbit stratification of the polynomials presented in Fig. 2 has eleven most generic orbits (all with codimension 6), marked by yellow colour. In Fig. 5, these eleven orbits are marked by yellow colour again but since eigenvalues are allowed to split apart in the bundle case, only one of them is the most generic (with codimension 0).

Example 5
Similarly, to Example 4, we stratify the bundles of the Fiedler linerizations of 1 × 2 matrix polynomials of degree 3 and present them in Fig. 6. Recall that the orbit stratification graphs are presented in Fig. 3, see Example 3. Notably, for the bundle case there is only one least generic node and one most generic node, the latter corresponds to the same canonical structures for both the orbit and bundle cases.

Stratification of Matrix Polynomial Invariants
In this section, we present rules for the orbit and bundle stratifications acting directly on the minimal indices and elementary divisors of the matrix polynomials, see Sect. 2 for the definitions of these invariants. These rules can sometimes be preferable over the rules for the Fiedler linearizations given in Sects. 7.2 and 7.3 since they are independent of any linearization. The rules for orbits are presented in Theorem 11 and the corresponding rules for bundles in Theorem 12. Moreover, these rules also separate the infinite eigenvalues from the finite.
Note that, orbits and bundles of matrix polynomials are defined by analogy with the matrix pencils, i.e. an orbit of a matrix polynomial P(λ) is a set of all the matrix polynomials with the same complete eigenstructure as P(λ); and a bundle of a matrix polynomial P(λ) is a union of orbits of matrix polynomials with the same complete eigenstructure as P(λ) but with possibly different values of the eigenvalues. A codimension of the orbit or bundle of a matrix polynomial P(λ) is defined to be the . In Fig. 7, we present the orbit and bundle stratification graphs for 1 × 2 matrix polynomials of degree 3. Since the stratification now is done on the invariants of matrix polynomials P(λ) (not on a linearization), the canonical structure information of the orbits/bundles in the graphs is represented by the set of right and left η minimal indices and the set δ(μ) of exponents of the elementary divisors for an eigenvalue μ. This in contrast to Theorems 8 and 10 where the stratification is done on a Fiedler linearization and the canonical structure information can be represented by Kronecker canonical blocks. Note that the geometry of graphs is the same as the corresponding graphs for the Fiedler linearizations in Figs. 3 and 6.
Theorem 11 (Orbit upward rules-matrix polynomial invariants) Let P 1 (λ) and P 2 (λ) be two matrix polynomials with the corresponding Fiedler linearizations F σ P 1 (λ) and F σ P 2 (λ) , respectively. The orbit O F σ P 1 (λ) is covered by O F σ P 2 (λ) if and only if the canonical structure information of P 2 (λ) can be obtained by applying one of the rules below to the structure integer partitions representing the canonical structure information of P 1 (λ).  coins as follows. First add one coin to each nonzero column in J ∞ and then distribute one coin to each nonzero column in all existing J μ i , μ i ∈ C. The remaining coins are distributed to J ∞ or any J μ i which may be empty initially. 4 Below follows the stratification rules for bundles. In addition to the differences between the orbit and bundle cases pointed out in Sect. 7.3, the following theorem has the two additional rules (f) and (g) for the specified infinite eigenvalue. The two rules are a direct consequence of that the infinite eigenvalue is treated as a specified eigenvalue.
Theorem 12 (Bundle upward rules-matrix polynomial invariants) Let P 1 (λ) and P 2 (λ) be two matrix polynomials with the corresponding Fiedler linearizations F σ P 1 (λ) and F σ P 2 (λ) , respectively. The bundle B F σ P 1 (λ) is covered by B F σ P 2 (λ) if and only if the canonical structure information of P 2 (λ) can be obtained by applying one of the rules below to the structure integer partitions representing the canonical structure information of P 1 (λ).