Hollow matrix

A hollow matrix may be one with "few" non-zero entries: that is, a sparse matrix.[1]

A hollow matrix may be a square matrix whose diagonal elements are all equal to zero.[2] That is, an n × n matrix A = (a_ij) is hollow if a_ij = 0 whenever i = j (i.e. a_ii = 0 for all i). The most obvious example is the real skew-symmetric matrix. Other examples are the adjacency matrix of a finite simple graph; a distance matrix or Euclidean distance matrix.

In other words, any square matrix that takes the form

${\displaystyle {\begin{pmatrix}0&\ast &&\ast &\ast \\\ast &0&&\ast &\ast \\&&\ddots \\\ast &\ast &&0&\ast \\\ast &\ast &&\ast &0\end{pmatrix}}}$

is a hollow matrix, where the symbol ${\displaystyle \ast }$ denotes an arbitrary entry.

For example,

${\displaystyle {\begin{pmatrix}0&2&6&{\frac {1}{3}}&4\\2&0&4&8&0\\9&4&0&2&933\\1&4&4&0&6\\7&9&23&8&0\end{pmatrix}}}$

is a hollow matrix.

• The trace of a hollow matrix is zero.
• If A represents a linear map ${\displaystyle L:V\to V}$with respect to a fixed basis, then it maps each basis vector e into the complement of the span of e. That is, ${\displaystyle L(e)\cap \langle e\rangle =\emptyset }$ where ${\displaystyle \langle e\rangle =\{\lambda e:\lambda \in F\}}$
• The Gershgorin circle theorem shows that the moduli of the eigenvalues of a hollow matrix are less or equal to the sum of the moduli of the non-diagonal row entries.

A hollow matrix may be a square n × n matrix with an r × s block of zeroes where r + s > n.[3]