Furthermore, a square matrix \(M\) is invertible if and only if \(\det(M)\not=0\text{.}\)
Observation5.3.3.
Consider the linear transformation \(A : \IR^2 \rightarrow \IR^2\) given by the matrix \(A = \left[\begin{array}{cc} 2 & 2 \\ 0 & 3 \end{array}\right]\text{.}\)
Figure65.Transformation of the unit square by the linear transformation \(A\)
Let \(A \in M_{n,n}\text{.}\) An eigenvector for \(A\) is a vector \(\vec{x} \in \IR^n\) such that \(A\vec{x}\) is parallel to \(\vec{x}\text{.}\)
Figure66.The map \(A\) stretches out the eigenvector \(\left[\begin{array}{c}2 \\ 1 \end{array}\right]\) by a factor of \(3\) (the corresponding eigenvalue).
In other words, \(A\vec{x}=\lambda \vec{x}\) for some scalar \(\lambda\text{.}\) If \(\vec x\not=\vec 0\text{,}\) then we say \(\vec x\) is a nontrivial eigenvector and we call this \(\lambda\) an eigenvalue of \(A\text{.}\)
Activity5.3.5.
Finding the eigenvalues \(\lambda\) that satisfy
\begin{equation*}
A\vec x=\lambda\vec x=\lambda(I\vec x)=(\lambda I)\vec x
\end{equation*}
for some nontrivial eigenvector \(\vec x\) is equivalent to finding nonzero solutions for the matrix equation
\begin{equation*}
(A-\lambda I)\vec x =\vec 0\text{.}
\end{equation*}
Which of the following must be true for any eigenvalue?
The kernel of the transformation with standard matrix \(A-\lambda I\) must contain the zero vector, so \(A-\lambda I\) is invertible.
The kernel of the transformation with standard matrix \(A-\lambda I\) must contain a non-zero vector, so \(A-\lambda I\) is not invertible.
The image of the transformation with standard matrix \(A-\lambda I\) must contain the zero vector, so \(A-\lambda I\) is invertible.
The image of the transformation with standard matrix \(A-\lambda I\) must contain a non-zero vector, so \(A-\lambda I\) is not invertible.
Fact5.3.6.
The eigenvalues \(\lambda\) for a matrix \(A\) are the values that make \(A-\lambda I\) non-invertible.
Thus the eigenvalues \(\lambda\) for a matrix \(A\) are the solutions to the equation
What are the maximum and minimum number of eigenvalues associated with an \(n \times n\) matrix? Write small examples to convince yourself you are correct, and then prove this in generality.