A theorem concerning certain sign symmetric matrices whose inverses are Morishima (Q1068103): Difference between revisions

Given a real \(n\times n\) matrix A we associated with it the digraph D(A) having n points labelled 1,2,...,n. The ordered pair (i,j) is an edge in D(A) iff \(a_{ij}\neq 0\). A real \(n\times n\) matrix A is Morishima if there exists a permutation matrix P such that \(P^ TAP=\left[ \begin{matrix} A_{11}\\ A_{21}\end{matrix} \begin{matrix} A_{12}\\ A_{22}\end{matrix} \right]\) where \(A_{12}\) and \(A_{21}\) are non-negative matrices and \(A_{11}\) and \(A_{22}\) are square matrices whose off-diagonal elements are non negative. A is anti-Morishima if -A is Morishima. The main result is: Theorem. Suppose A is an invertible sign symmetric matrix and D(A) is a tree. Then \(A^{-1}\) will be Morishima iff \(sgn \det A(H-\{v\})=sgn \det A\) or 0 for all interior points v in D(A). \(A^{-1}\) will be anti- Morishima iff sng det \(A(H-\{v\})=-\)sgn det \(A\) or 0 for all interior points v in D(A).