Minors And Cofactors Of A Matrix

Minors and Cofactors of a Matrix: The Hidden Engine Behind Matrix Inversion

You've probably crunched numbers in a matrix before — adding rows, multiplying by scalars, maybe even row-reducing until your eyes glazed over. But there's a quieter, more elegant operation hiding beneath the surface: the minor and its slightly more refined cousin, the cofactor. Also, these aren't just textbook curiosities tossed in to make linear algebra feel more abstract. They're the actual mechanism that makes matrix inversion possible, and once you get them, a whole lot of matrix theory clicks into place.

Let me walk you through what minors and cofactors really are, why they matter, and how to work with them without losing your mind.

What Is a Minor of a Matrix?

At its core, a minor is what you get when you zoom in on a single entry in a matrix and look at the determinant of the smaller matrix that remains after you delete that entry's row and column.

Here's how it works in practice. Say you've got a 3×3 matrix:

$ A = \begin{pmatrix} a_{11} & a_{12} & a_{13} \ a_{21} & a_{22} & a_{23} \ a_{31} & a_{32} & a_{33} \end{pmatrix} $

To find the minor of entry $a_{11}$, you delete the first row and first column. What's left is a 2×2 matrix:

$ \begin{pmatrix} a_{22} & a_{23} \ a_{32} & a_{33} \end{pmatrix} $

The minor, denoted $M_{11}$, is just the determinant of that 2×2 matrix:

$ M_{11} = a_{22}a_{33} - a_{23}a_{32} $

Every Entry Has Its Own Minor

This process works for every entry in the matrix. The minor $M_{ij}$ corresponds to entry $a_{ij}$, and it's always the determinant of the submatrix formed by deleting row $i$ and column $j$.

For a 3×3 matrix, you end up with nine minors — one for each entry. Each one is a number that tells you something about how that entry relates to the rest of the matrix's structure.

Minors in Larger Matrices

The same logic applies to larger matrices. For a 4×4 matrix, the minor of any entry is the determinant of the 3×3 matrix that remains after deleting the appropriate row and column. But here's where it gets recursive: to compute that 3×3 determinant, you'll likely use cofactor expansion again, which means computing more minors. It nests inside itself.

This recursive nature is why minors and cofactors show up everywhere in linear algebra — they're built into the very definition of a determinant.

What's the Difference Between a Minor and a Cofactor?

If a minor is the determinant of the submatrix, then a cofactor is the minor with a sign attached. Specifically:

$ C_{ij} = (-1)^{i+j} \cdot M_{ij} $

That alternating sign pattern is the key difference. It creates a checkerboard pattern across the matrix:

$ \begin{pmatrix}

• & - & + \

• & + & - \

• & - & + \end{pmatrix} $

So if $M_{12}$ is the minor of entry $a_{12}$, the cofactor $C_{12} = -M_{12}$ because $(-1)^{1+2} = -1$.

Why the Sign Matters

The alternating signs aren't just mathematical decoration. They see to it that when you use cofactors to compute a determinant or invert a matrix, the signs work out correctly so that everything cancels or combines in the right way. Without them, the whole system falls apart.

Why Minors and Cofactors Actually Matter

This isn't just theoretical machinery. Minors and cofactors are the engine behind two operations you probably care about: computing determinants and inverting matrices.

Cofactor Expansion: One Way to Compute Determinants

You can compute the determinant of any square matrix using cofactor expansion (also called Laplace expansion). Pick any row or column, and for each entry in that row or column, multiply the entry by its cofactor, then add them all up.

For a 3×3 matrix, expanding along the first row:

$ \det(A) = a_{11}C_{11} + a_{12}C_{12} + a_{13}C_{13} $

Since $C_{ij} = (-1)^{i+j} M_{ij}$, this becomes:

$ \det(A) = a_{11}M_{11} - a_{12}M_{12} + a_{13}M_{13} $

You can expand along any row or column — the result is always the same. This is especially handy when a row or column has zeros, because those terms drop out and you do less work.

If you found this helpful, you might also enjoy how many neutrons are in iodine or how many electrons can each shell hold.

Matrix Inversion via the Adjugate

Here's where it gets really useful. The inverse of a matrix $A$ (when it exists) can be computed using the cofactor matrix and the adjugate (also called the adjoint):

$ A^{-1} = \frac{1}{\det(A)} \cdot \text{adj}(A) $

The adjugate is the transpose of the cofactor matrix. So you:

1. Compute all cofactors $C_{ij}$ for every entry in $A$.
2. Arrange them into the cofactor matrix.
3. Transpose that matrix to get the adjugate.
4. Divide by the determinant.

This is how matrix inversion works under the hood, even if your calculator or software uses a different algorithm internally. Understanding cofactors gives you insight into what's actually happening.

How to Compute Minors and Cofactors: A Step-by-Step Walkthrough

Let's work through a concrete example with a 3×3 matrix:

$ A = \begin{pmatrix} 2 & 1 & 3 \ 0 & 4 & 1 \ 5 & 2 & 0 \end{pmatrix} $

Step 1: Compute a Minor

Find $M_{11}$ — the minor of entry $a_{11} = 2$.

Delete row 1 and column 1:

$ \begin{pmatrix} 4 & 1 \ 2 & 0 \end{pmatrix} $

$ M_{11} = (4)(0) - (1)(2) = -2 $

Step 2: Apply the Sign for the Cofactor

$ C_{11} = (-1)^{1+1} \cdot M_{11} = (+1)(-2) = -2 $

Step 3: Repeat for All Entries

Do the same for every entry. Here are a few more:

$M_{12}$: Delete row 1, column 2:

$ \begin{pmatrix} 0 & 1 \ 5 & 0 \end{pmatrix} \Rightarrow M_{12} = (0)(0) - (1)(5) = -5 $

$ C_{12} = (-1)^{1+2} \cdot (-5) = (-1)(-5) = 5 $

$M_{22}$: Delete row 2, column 2:

$ \begin{pmatrix} 2 & 3 \ 5 & 0 \end{pmatrix} \Rightarrow M_{22} = (2)(0) - (3)(5) = -15 $

$ C_{22} = (-1)^{2+2} \cdot (-15) = (+1)(-15) = -15 $

Step 4: Build the Cofactor Matrix

Once you've computed all nine cofactors, arrange them in the same positions:

$ C = \begin{pmatrix} -2 & 5 & -18 \ 4 & -15 & 14 \ -1

5 & 20 & -8 \end{pmatrix} $

(Note: The values above represent the completed cofactor matrix derived from our original matrix $A$.)

Step 5: Find the Adjugate Matrix

The adjugate matrix, $\text{adj}(A)$, is the transpose of the cofactor matrix $C$. We switch the rows and columns:

$ \text{adj}(A) = C^T = \begin{pmatrix} -2 & 4 & -15 \ 5 & -15 & 20 \ -18 & 14 & -8 \end{pmatrix} $

Step 6: Calculate the Determinant and Final Inverse

First, let's find $\det(A)$ using the first row of $A$ and the first row of the cofactor matrix:

$ \det(A) = (2)(-2) + (1)(5) + (3)(-18) = -4 + 5 - 54 = -53 $

Now, apply the formula for the inverse:

$ A^{-1} = \frac{1}{-53} \begin{pmatrix} -2 & 4 & -15 \ 5 & -15 & 20 \ -18 & 14 & -8 \end{pmatrix} = \begin{pmatrix} 2/53 & -4/53 & 15/53 \ -5/53 & 15/53 & -20/53 \ 18/53 & -14/53 & 8/53 \end{pmatrix} $

Conclusion

While the method of cofactor expansion and the adjugate matrix might seem tedious for large matrices, it provides the fundamental theoretical framework for linear algebra. It reveals the deep connection between the determinant, the structure of a matrix, and the existence of its inverse. For $n \times n$ matrices where $n > 3$, computational methods like Gaussian elimination are much faster, but the concept of the cofactor remains essential for understanding the properties of linear transformations and the geometry of higher-dimensional spaces.