Matrix pencils completion problems (Q2463618): Difference between revisions

The paper deals with matrix pencils completion problems. In general, this problem consists in the study of possible Kronecker invariants of a matrix pencil (i.e. its strict equivalence class), when a subpencil is prescribed. Specifically, the author studies and solves the following problem: Let \(F\) be a field. Let \(A(\lambda) \in F[\lambda]^{(n+p) \times (n+l+m)}\) be a matrix pencil. Give necessary and sufficient conditions for the existence of a matrix pencil \(X(\lambda) \in F[\lambda]^{l \times (n+l+m)}\), such that the matrix pencil \[ M(\lambda)= \left[ \frac{A(\lambda)}{X(\lambda)} \right] \in F[\lambda]^{(n+p+l) \times (n+l+m)} \] has a prescribed strict equivalence class. By using a technical result (Lemma 9 of the paper), the author splits the above problem into two less general ones. In order to give a complete solution of the problem, she first solves it in the case when both pencils \(A(\lambda)\) and \(M(\lambda)\) do not have row (column) minimal indices as Kronecker invariants. These results are unified and the complete solution to above problem is given. In the main result, the author obtains a list of necessary and sufficient conditions that guarantee the existence of a matrix pencil \(X(\lambda)\) such that \(M(\lambda)\) has a prescribed homogeneous invariants factors, row and column minimal indices.