Choosing a Sparse Row or Column

Choose Where to Expand Before You Calculate

Cofactor expansion can turn a determinant into a sum of smaller determinants, but the amount of work depends on where the expansion begins. If a row contains several zeros, those entries contribute no terms. Choosing a row or column with few nonzero entries therefore often reduces the number of minors that need to be evaluated. The choice is a practical strategy, not a change to the determinant: expansion along any row or column gives the same value.

For an \(n\times n\) matrix \(\mathbf{A}=[a_{ij}]\), the minor \(M_{ij}\) is the determinant of the matrix formed by deleting row \(i\) and column \(j\). The cofactor at position \((i,j)\) is \(C_{ij}=(-1)^{i+j}M_{ij}\). The cofactor expansion theorem states that expansion along row \(i\) or column \(j\) gives

In each formula, the row or column being expanded is fixed, and the sum runs over the other index. This theorem applies to every square matrix. When an entry is zero, its entire term is zero, so its minor need not be calculated. The sign still comes from the entry’s position \((i,j)\) in the matrix currently being expanded.

What Sparsity Guarantees

Two immediate consequences make sparse expansion especially useful. A completely zero row or column forces the determinant to be zero. A row or column with exactly one nonzero entry reduces the determinant to one signed entry times one smaller determinant. Both statements follow directly from the expansion formula.

Proof. Expand along the zero row, or along the zero column. Every term in the corresponding cofactor expansion contains an entry from that row or column as a factor. Each such entry is zero, so every term is zero and their sum is zero. \(\square\)

Proof. Expand along row \(i\). Every term except the one indexed by \(k\) contains a zero entry, so those terms vanish. The remaining term is \(a_{ik}(-1)^{i+k}M_{ik}\). If column \(k\) has exactly one nonzero entry, expansion along that column likewise has only the term indexed by \(i\) left. \(\square\)

Counting nonzero entries is a reliable way to reduce the number of terms at the next step: if the chosen row or column has \(r\) nonzero entries, its expansion has exactly \(r\) potentially nonzero terms. This count does not, by itself, determine the total work. The resulting minors can have different patterns of zeros, so it is useful to inspect the minors as well as the original matrix.

Worked Examples: Following the Sparse Entries

Signs and the Size of Each Minor

A sparse choice saves work only if the signs and the minors are handled correctly. The sign belongs to the position of an entry in the matrix at the moment of expansion. After deleting a row and a column, a smaller matrix has its own row and column positions. If expanding a minor, use those new positions to determine its cofactor signs.

The minor \(M_{ij}\) is formed by deleting row \(i\) and column \(j\); it is not formed by deleting the row and column containing zeros, unless those are the indices of the particular cofactor being calculated. Keep the selected nonzero entry and its indices visible while constructing the minor. This helps prevent both sign mistakes and deletion of the wrong row or column.

For a \(2\times2\) matrix, the determinant used at the end of an expansion is \(ad-bc\):

For a larger minor, apply cofactor expansion again or use the \(3\times3\) computation rule already established for determinants. The sparse strategy is recursive: at each stage, choose a row or column with few nonzero entries in the current minor, rather than relying only on the pattern of the original matrix.

Common Mistake: Using the Wrong Cofactor Sign

In the third example, the sole nonzero entry in row 2 is at position \((2,4)\). A common error is to assign it a negative sign and write \(\det\mathbf{C}=-3(21)=-63\). The correction is to calculate the exponent: \(2+4=6\), so \((-1)^{2+4}=(-1)^6=1\). The correct expansion is \(\det\mathbf{C}=3(21)=63\).

Do not decide a sign from the value of an entry or from the appearance of the matrix. Use \((-1)^{i+j}\) for the entry’s current position. Also, zeros only remove terms: they do not change the sign pattern of the remaining cofactors.

In practice, sparse expansion is most valuable when it reduces a large determinant to a small number of manageable minors. It is a choice of route through the calculation, not a separate determinant rule. The cofactor expansion theorem licenses the route; counting nonzero entries helps choose it; careful index tracking ensures that the final value is correct.