Sparse edit

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

Block of zeroes edit

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

Diagonal entries all zero edit

A hollow matrix may be a square matrix whose diagonal elements are all equal to zero.^[3] 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, and a distance matrix or Euclidean distance matrix.

In other words, any square matrix that takes the form

For example,

Properties edit

• 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(\langle e\rangle )\cap \langle e\rangle =\langle 0\rangle }$  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.