Skip to main content

Section 2.3 The Invertible Matrix Theorem

Handout 2.3 The Invertible Matrix Theorem

A synonym is a word you use when you can’t spell the other one.
―
Baltasar GraciΓ‘n
The theorem introduced in this section provides many equivalent ways of describing the same idea. Depending on the context, some formulations will be more convenient than others.
Motivating Question: When is a square matrix invertible? Let me count the ways!
Invertible matrices enjoy a rich set of equivalent descriptions.
The diagram below provides another perspective on the role of the inverse matrix.
Diagram showing a transformation undone by its inverse.
Diagram shows \(\vec x\text{,}\) transformed by multiplication by \(A\text{,}\) and reversed by multiplication by \(A^{-1}\text{.}\)
The matrix inverse \(A^{-1}\) transforms \(A\vec x\) back to \(\vec x\text{,}\) because
\begin{equation*} A^{-1}(A\vec x)=(A^{-1}A)\vec x=\vec x. \end{equation*}
Some comments on IMT:
  • The Invertible Matrix Theorem divides all square matrices into two classes: invertible and non-invertible.
  • As the course progresses, additional equivalent conditions involving determinants, eigenvalues, and other concepts will be added.
  • Note that items (j) and (k) of the Invertible Matrix Theorem lead directly to the following result.

Example 2.28.

Is \(A\) invertible?
\begin{equation*} A = \begin{bmatrix} 1 \amp 0 \amp -2\\ 3 \amp 1 \amp -2\\ -5 \amp -1 \amp 9 \end{bmatrix} \end{equation*}

Example 2.29.

For each matrix below, determine all values of \(h\) so that the matrix is singular (not invertible). If there are no values of \(h \text{,}\) explain why.
(a)
\(A = \begin{bmatrix} 1 \amp 0 \amp 1\\ 1 \amp h \amp 1\\ 0 \amp 0 \amp 1 \end{bmatrix}\)
(b)
\(B = \begin{bmatrix} 1 \amp h \amp 1\\ 0 \amp 1 \amp 1\\ 0 \amp 0 \amp 1 \end{bmatrix}\)
(c)
\(C = \begin{bmatrix} 1 \amp 0 \amp 0\\ 0 \amp 1 \amp 1\\ 0 \amp h \amp 1 \end{bmatrix}\)