A matrix completion problem over integral domains: the case with \(2n-3\) prescribed entries (Q977479): Difference between revisions

The paper deals with the following inverse eigenvalue problem. Let \(\Lambda\) be a given multiset of \(n\) elements in an integral domain \(\mathfrak R\) and let \(P\) be a matrix of order \(n\) with at most \(2n-3\) prescribed entries that belong to \(\mathfrak R\). Under the assumption that each row, each column and the diagonal of \(P\) have at least one unprescribed entry, it is proved that \(P\) can be completed over \(\mathfrak R\) to obtain a matrix with spectrum \(\Lambda\). The authors explain also that the assumption of the existence of an unprescribed entry on the diagonal can be replaced by the alternative assumption that all elements of the diagonal are prescribed and their sum is \(\sum\Lambda\). The proof is by induction on \(n\) and implicitly contains an algorithm to construct the completion. The result is an extension to integral domains of a classical completion result by \textit{D. Hershkowitz} [Linear Multilinear Algebra 14, 315--342 (1983; Zbl 0529.15005)] for fields.