Skip to main content
Contents
Embed
Dark Mode Prev Up Next
\(\newcommand{\foo}{b^{ar}}
\newcommand{\aug}{\fboxsep=-\fboxrule\!\!\!\fbox{\strut}\!\!\!}
\newcommand{\Nul}{\operatorname{Nul}}
\newcommand{\Col}{\operatorname{Col}}
\newcommand{\Row}{\operatorname{Row}}
\newcommand{\Span}{\operatorname{Span}}
\renewcommand{\det}{\operatorname{det}}
\newcommand{\rank}{\operatorname{rank}}
\newcommand{\proj}{\operatorname{proj}}
\newcommand{\dist}{\operatorname{dist}}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 3.1 Introduction to Determinants
Handout 3.1 Introduction to Determinants
Objectives: Topics
Objectives: Goals
Definition 3.1 . Determinant.
Suppose
\(A\) is
\(n\times n\) with entries
\(a_{ij}\text{.}\) Then the
determinant of
\(A\text{,}\) written
\(\det(A)\) or
\(\det A\) or
\(\left| A\right|\text{,}\) is defined by the following recursive formula.
\begin{equation*}
\operatorname{det}(A)
=
a_{11}\operatorname{det}(A_{11})
- a_{12}\operatorname{det}(A_{12})
+ \cdots
+ (-1)^{1+n} a_{1n}\operatorname{det}(A_{1n}),
\end{equation*}
where
\(A_{ij}\) is the submatrix obtained by deleting row
\(i\) and column
\(j\) of
\(A\text{.}\)
Example 3.2 .
Compute
\(\operatorname{det}\!\begin{bmatrix} a \amp b\\ c \amp d \end{bmatrix}\text{.}\)
Example 3.3 .
\begin{equation*}
\operatorname{det}
\begin{bmatrix}
1 \amp -5 \amp 2\\
2 \amp 4 \amp -1\\
0 \amp 3 \amp 0
\end{bmatrix}.
\end{equation*}
Example 3.4 .
\begin{equation*}
\operatorname{det}
\begin{bmatrix}
0 \amp 3 \amp 0\\
2 \amp 4 \amp -1\\
1 \amp -5 \amp 2
\end{bmatrix}.
\end{equation*}
Definition 3.5 . Cofactor.
For an
\(n\times n\) matrix
\(A\text{,}\) the
\((i,j)\) cofactor is
\begin{equation*}
C_{ij} = (-1)^{i+j}\operatorname{det}(A_{ij}).
\end{equation*}
The sign pattern alternates in a checkerboard:
\begin{equation*}
\begin{bmatrix}
+ \amp - \amp + \amp - \amp \cdots\\
- \amp + \amp - \amp + \amp \cdots\\
+ \amp - \amp + \amp - \amp \cdots\\
- \amp + \amp - \amp + \amp \cdots\\
\vdots \amp \vdots \amp \vdots \amp \vdots \amp \ddots
\end{bmatrix}
\end{equation*}
Theorem 3.6 . Cofactor Expansion along Any Row or Column.
The determinant of
\(A\) can be computed by expanding along any row or any column. For example, expanding down the
\(j\) -th column:
\begin{equation*}
\operatorname{det}(A) = a_{1j}C_{1j} + a_{2j}C_{2j} + \cdots + a_{nj}C_{nj}.
\end{equation*}
This gives a practical way to compute determinants more efficiently by choosing rows or columns with many zeros.
Example 3.7 .
Use
TheoremΒ 3.6 to compute the determinant of
\(A\) in an efficient manner.
\begin{equation*}
A = \begin{bmatrix}
5 \amp 4 \amp 3 \amp 2\\
0 \amp 1 \amp 2 \amp 0\\
0 \amp -1 \amp 1 \amp 0\\
0 \amp 1 \amp 1 \amp 3
\end{bmatrix}.
\end{equation*}
Theorem 3.8 . Determinant of a Triangular Matrix.
If
\(A\) is triangular (upper or lower), then
\begin{equation*}
\operatorname{det}(A) = a_{11}a_{22}a_{33}\cdots a_{nn},
\end{equation*}
the product of its diagonal entries.
Example 3.9 .
Compute the determinant of the following triangular matrix.
\begin{equation*}
A = \begin{bmatrix}
7 \amp \pi \amp \pi^2 \amp \pi^3 \amp \pi^4 \amp \pi^5 \amp \pi^6 \\
0 \amp 6 \amp \pi \amp \pi^2 \amp \pi^3 \amp \pi^4 \amp \pi^5 \\
0 \amp 0 \amp 5 \amp \pi \amp \pi^2 \amp \pi^3 \amp \pi^4 \\
0 \amp 0 \amp 0 \amp 4 \amp \pi \amp \pi^2 \amp \pi^3 \\
0 \amp 0 \amp 0 \amp 0 \amp 3 \amp \pi \amp \pi^2 \\
0 \amp 0 \amp 0 \amp 0 \amp 0 \amp 2 \amp \pi\\
0 \amp 0 \amp 0 \amp 0 \amp 0 \amp 0 \amp 1
\end{bmatrix}.
\end{equation*}
A naive cofactor expansion for an \(N\times N\) matrix requires on the order of \(N!\) multiplications, which grows very quickly:
A \(10\times 10\) matrix requires roughly \(10! = 3{,}628{,}800\) multiplications.
A \(20\times 20\) matrix requires approximately \(20!\approx 2.4\times 10^{18}\) multiplications.
This doesnβt mean that determinants are not useful.
We will briefly study more efficient methods for computing determinants.
We will learn some application of determinants, such as solving linear systems and calculating area/volume of certain regions.
Determinants are used in multivariable calculus (e.g., Jacobians for change of variables in integrals).