Je bent je ingevulde velden bij deze pagina aan het verwijderen. Ben je zeker dat je dit wilt doen?
You are erasing your filled-in fields on this page. Are you sure that is what you want?
Nieuwe Versie BeschikbaarNew Version Available
Er is een update van deze pagina. Als je update naar de meest recente versie, verlies je mogelijk je huidige antwoorden voor deze pagina. Hoe wil je verdergaan ?
There is an updated version of this page. If you update to the most recent version, then your current progress on this page will be erased. Regardless, your record of completion will remain. How would you like to proceed?
In this section we will prove the following important results:
1.
A square matrix is singular if and only if its determinant is equal to 0.
2.
The determinant of a product is the product of the determinants.
To get us started, we need the following lemma.
Let \(A\) be a square matrix, and let \(E\) be an elementary matrix, then
\[\det {EA}=\det {E}\det {A}\]
Recall that if \(E\) is obtained from \(I\) using an elementary row operation, then the same elementary row operation carries \(A\) to \(EA\). There
are three types of elementary row operations and three types of elementary matrices, so we will have to consider three
cases.
Case 1. Suppose \(E\) is obtained from \(I\) by interchanging two rows, then
Recall that we first introduced determinants in the context of invertibility of \(2\times 2\) matrices. Specifically, we found that \(A=\begin{bmatrix}a&b\\c&d\end{bmatrix}\) is invertible if
and only if \(\det {A}\neq 0\). (A logically equivalent statement is: \(A\) is singular if and only if \(\det {A}=0\).) We are now in the position to prove this result for all
square matrices.
A square matrix \(A\) is singular if and only if \(\det {A}=0\).
Let \(A\) be a square matrix. To determine whether \(A\) is singular we need to find \(\mbox {rref}(A)\). In Elementary Matrices we found that there exist
elementary matrices \(E_1,\ldots ,E_k\) such that
Suppose that \(A\) is singular, then \(\mbox {rref}(A)\neq I\). But then \(\mbox {rref}(A)\) contains a row of zeros, and \(\det {\big (\mbox {rref}(A)\big )}=0\). (Lemma ??) Since determinants of elementary
matrices are non-zero, we conclude that \(\det {A}=0\).
Now suppose that \(A\) is not invertible. Then \(AB\) is also not invertible. So, \(\det {A}=0\) and \(\det {AB}=0\). Thus \(\det {AB}=0=\det {A}\det {B}\).
The following theorem is a nice consequence of Theorem 8. We leave the proof to the reader. (Practice Problem
)
Let \(A\) be a nonsingular matrix, then
\[\det {A^{-1}}=\frac {1}{\det {A}}\]
Practice Problems
Without doing written computations, determine whether matrix \(A\) is singular.