3.3A

 

How do we find the matrix $A^{1}00$? The application for this is that sometimes we need to apply the same process a couple of times and see what it would become.

Example: Consider the evolution of the population of a species of birds. Because the number of males and females are nearly equal, we count only females. We assume that each female remains a juvenile for one year and then becomes an adult and that only adults have offspring. We make three assumptions about reproduction and survival rates:

1. The number of juvenile females hatched in any year is twice the number of adult females alive the year before (we say the reproduction rate is 2).

2. Half of the adult females in any year survive to the next year (the adult survival rate is 1/2)

3. One-quarter of the juvenile females in any year survive into adulthood
(the juvenile survival rate is 1/4.)

If there were 100 adult females and 40 juvenile females alive initially,
compute the population of females $k$ years later.

Definition: An eigenvector of an $n\times n$ matrix $A$ is a nonzero vector $\overrightarrow{x}$ such that for some scalar $\lambda$, $A\overrightarrow{x}=\lambda \overrightarrow{x}$. A scalar $\lambda$ is called an eigenvalue of $A$ if there is a nontrivial solution $\overrightarrow{x}$ of $A\overrightarrow{x}=\lambda \overrightarrow{x}$; such an $\overrightarrow{x}$ is called an eigenvector corresponding to $\lambda$.

 

Remark: $\lambda$ is an eigenvalue of an matrix $A$ if and only if the equation $(A-I\lambda )\overrightarrow{x}=0$ has a nontrivial solution

 

 

Example 1: Show that $-2$ is an eigenvalue of matrix $\left[\begin{array}{cc}-1& 2\\ 3& 4\end{array}\right]$, and find the corresponding eigenvectors.

 

 

Exercise 1: Show that $3$ is an eigenvalue of matrix $\left[\begin{array}{cc}2& 3\\ -2& 9\end{array}\right]$, and find the corresponding eigenvectors.

 

Example 2: Show that $-3$ is an eigenvalue of matrix $\left[\begin{array}{ccc}1& 1& 2\\ 3& 0& 6\\ -2& 2& 1\end{array}\right]$ and find eigenvectors corresponding to the eigenvalue $-3$.

 

 

Exercise 2: Show that $4$ is an eigenvalue of matrix $\left[\begin{array}{ccc}6& -4& 6\\ 1& 2& 3\\ -3& 6& -5\end{array}\right]$ and find eigenvectors corresponding to the eigenvalue $4$.

 

Question: How do we find the eigenvalues?

Theorem: The eigenvalues of a triangular matrix are the entries on its main diagonal.

Proof:

 

Remark: Unfortunately, we cannot reduce a non-triangular matrix to echelon or triangular matrix to find the eigenvalue of a matrix $A$. $-5$ is an eigenvalue of matrix $\left[\begin{array}{cc}-4& -3\\ 4& -17\end{array}\right]$ but its’ echelon form is $\left[\begin{array}{cc}-4& -3\\ 0& -20\end{array}\right]$ which has eigenvalues $-4$ and $-20$.

 

 

Example 3: Find an eigenvalue of matrix $A=\left[\begin{array}{ccc}3& 3& 4\\ 0& 2& 3\\ 0& 0& -1\end{array}\right]$, and find an eigenvector $\overrightarrow{x}$ corresponding to the eigenvalue you find. What is $A^{10}\overrightarrow{x}$?

 

 

Exercise 3: Find an eigenvalue of matrix $A=\left[\begin{array}{ccc}-2& 4& 3\\ 0& 1& 2\\ 0& 0& 1\end{array}\right]$, and find an eigenvector $\overrightarrow{x}$ corresponding to the eigenvalue you find. What is $A^{20}\overrightarrow{x}$?

 

Remark: $0$ is an eigenvalue of a matrix $A$ if and only if $A\overrightarrow{x}=0\overrightarrow{x}$ has nontrivial solutions if and only if $A$ is not invertible.

 

Theorem: Let $A$ be an $n\times n$ matrix. Then $A$ is invertible if and only if:

a. The number $0$ is not an eigenvalue of $A$.

b. The determinant of $A$ is not zero.

 

Theorem: Let $A$ and $B$ be an $n\times n$ matrix.

a. $A$ is invertible if and only if det $A\ne 0$.

b. det $AB=$ det $A$det $B$

c. det $A^T=$ det $A$

d. If $A$ is triangular, then det $A$ is the product of the entries on the main diagonal of $A$.

e. A row replacement operation on
$A$ does not change the determinant. A row interchange changes the sign of the determinant. A row scaling also scales the determinant by the same scalar factor.

 

 

Question: How do we find eigenvalues of a matrix when the matrix is not a
triangular matrix?

Definition: det $(A-xI)=0$ is called the characteristic equation of $A$. det $(A-xI)$ is a polynomial of degree $n$ over the real number. Hence we called det $(A-xI)$, characteristic polynomial of $A$.

 

Remark: $\lambda$ is an eigenvalue of an $n\times n$ matrix if and only if det $(A-I\lambda )=0$, i.e. $\lambda$ is a root of the det $(A-xI)=0$.

 

Definition: An eigenvalue $\lambda$ of a matrix $A$ is said to have multiplicity $s$ if $(\lambda -x{)}^s$ is a factor of det $(A-xI)$ but $(\lambda -x{)}^{s+1}$ is not a factor of det $(A-xI)$.

 

 

Example 4: The characteristic polynomial of a $6\times 6$ matrix is $x^6-4x^4-x^5+4x^3$. Find the eigenvalues and their multiplicities.

 

 

Exercise 4: The characteristic polynomial of a $4\times 4$ matrix is $x^4-4x^3+4x^2$. Find the eigenvalues and their multiplicities.

 

Example 5: Find the characteristic equation of $A=\left[\begin{array}{ccc}-4& 1& -3\\ 0& 1& 1\\ 3& 0& 3\end{array}\right]$, and find the eigenvalues of $A$ and their multiplicities.

 

 

Exercise 5: Find the characteristic equation of $A=\left[\begin{array}{ccc}0& 1& 0\\ 3& 0& 1\\ 2& 0& 0\end{array}\right]$, and find the eigenvalues of $A$ and their multiplicities.

 

GroupWork 1: True or False.

a. If $A\overrightarrow{x}=\lambda \overrightarrow{x}$ for some vector $\overrightarrow{x}$, then $\lambda$ is an eigenvalue.

 

b. A matrix $A$ is not invertible if and only if $0$ is an eigenvalue of $A$.

 

c. A number $c$ is an eigenvalue of $A$ if and only if $(A-cI)\overrightarrow{x}=0$ has a nontrivial solution.

 

d. Find an eigenvector of $A$ may be difficult but checking if a given vector is an eigenvector is easy.

 

e. To find the eigenvalues of $A$, reduce $A$ to echelon form.

 

GroupWork 2: Let $\lambda$ be an eigenvalue of an invertible matrix $A$. Show that ${\lambda }^{-1}$ is an eigenvalue of $A^{-1}$.

 

GroupWork 3: Show $\lambda$ is an eigenvalue of matrix $A$ if and only if $\lambda$ is an eigenvalue of $A^T$. This shows that $A$ and $A^T$ has the same characteristic polynomial.

 

GroupWork 4: True or False. Justify each answer:

a. The eigenvalues of a matrix are on its main diagonal.

 

b. The determinant of $A$ is the product of the main diagonal entries.

 

c. An elementary row operation on a matrix $A$ does not change the determinant of $A$.

 

d. det $A$ det $B$ = det $AB$.

 

e. det $A^T$ = −det $A$.

 

f. A row replacement operation on $A$ does not change the eigenvalues.

 

g. If $x+5$ is a factor of the characteristic polynomial of $A$ then $5$ is an eigenvalue.

 

GroupWork 5: Find $h$ in the matrix $A=\left[\begin{array}{cccc}1& 1& -2& 3\\ 0& 2& h& 0\\ 0& 0& 1& 5\\ 0& 0& 0& 2\end{array}\right]$ such that $\lambda =1$ has two basic eigenvectors $(A-I\lambda )$ has two free variables.

3.3B

 

Remember that we are trying to find a way to compute $A^k$ for a large number $k$.

 

Example 1: Find $A^k$ if $A=\left[\begin{array}{cc}1& -2\\ -5& 4\end{array}\right]$ and $A=PD{P}^{-1}$, where $P=\left[\begin{array}{cc}1& 2\\ 1& -5\end{array}\right]$ and $D=\left[\begin{array}{cc}-1& 0\\ 0& 6\end{array}\right]$.

 

 

Exercise 1: Find $A^k$ if $A=\left[\begin{array}{cc}-1& 2\\ 2& 2\end{array}\right]$ and $A=PD{P}^{-1}$, where $P=\left[\begin{array}{cc}1& 2\\ 2& -1\end{array}\right]$ and $D=\left[\begin{array}{cc}3& 0\\ 0& -2\end{array}\right]$.

 

Definition: A square matrix $A$ is said to be diagonalizable if $P^{-1}AP=D$, for some invertible matrix $P$ and some diagonal, matrix $D$ ( or $AP=PD$).

 

Theorem: An $n\times n$ matrix $A$ is diagonalizable if and only if $A$ has $n$ eigenvectors, $\overrightarrow{x_1},\cdots ,\overrightarrow{x_n}$ such that the matrix $P=\left[\begin{array}{c}\overrightarrow{x_1},\overrightarrow{x_2},\cdots ,\overrightarrow{x_n}\end{array}\right]$ is invertible.

 

Remark: If $A=PD{P}^{-1}$ with $D$ a diagonal matrix, the diagonal entries of $D$ are eigenvalues of $A$ that correspond, respectively, to the eigenvectors in $P$.

 

 

Example 2: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cc}3& -1\\ 2& 6\end{array}\right]$

 

 

Exercise 2: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cc}-2& 2\\ 7& 3\end{array}\right]$

 

Theorem: An $n\times n$ matrix with $n$ distinct eigenvalues is diagonalizable.

 

Remark: It is not necessary for an $n\times n$ matrix to have $n$ distinct eigenvalues in order to be diagonalizable. The above theorem provides a sufficient condition for a matrix to be diagonalizable. (see Example 3).

 

 

Example 3: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{ccc}1& 0& 0\\ 0& 2& 0\\ 3& 0& 2\end{array}\right]$.

 

 

Exercise 3: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{ccc}3& 0& -1\\ 0& 3& 0\\ 0& 0& 2\end{array}\right]$.

 

Theorem: A square matrix $A$ is diagonalizable if and only if every eigenvalue $\lambda$ of multiplicity $m$ yields exactly $m$ basic eigenvectors; that is, if and only if the general solution of the system $(A-I\lambda )\overrightarrow{x}=0$ has exactly $m$ parameters. (($A-I\lambda$) has $m$ free variables).

 

Example 4: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cccc}1& 1& 4& 5\\ 0& 1& 2& 6\\ 0& 0& -3& 1\\ 0& 0& 0& -3\end{array}\right]$.

 

 

Exercise 4: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cccc}2& 0& 0& 0\\ 1& 2& 0& 0\\ 1& 1& 3& 0\\ 0& 0& 2& -1\end{array}\right]$.

 

Example 5: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cccc}3& 0& 4& 5\\ 0& 3& 2& 6\\ 0& 0& -2& 0\\ 0& 0& 0& 4\end{array}\right]$.

 

 

Exercise 5: Diagonalize the following matrix, if possible. $A=\left[\begin{array}{cccc}2& 0& 0& 0\\ 0& 2& 0& 0\\ 1& 0& 3& 0\\ 0& 1& 2& -1\end{array}\right]$.

 

GroupWork 1: True or False. All matrices are $n\times n$.

a. $A$ is diagonalizable if $A=PD{P}^{-1}$ for some matrix $D$ and some invertible matrix $P$.

 

b. If ${\mathbb{R}}^n$ has $n$ eigenvectors of $A$ such that it forms an invertible matrix, then $A$ is diagonalizable.

 

c. $A$ is diagonalizable if and only if $A$ has $n$ eigenvalues, counting multiplicities.

 

d. If $A$ is invertible, then $A$ is diagonalizable.

 

e. $\lambda$ is an eigenvalue of $A$ then ${\lambda }^2$ is an eigenvalue of $A^2$.

 

GroupWork 2: Show that if $A$ is both diagonalizable and invertible, then so is $A^{-1}$.

 

GroupWork 3: Show that $A$ is diagonalizable if and only if $A^T$ is diagonalizable.

 

GroupWork 4: True or False. All matrices are $n\times n$. Justify each
answer.

a. $A$ is diagonalizable if $A$ has $n$ eigenvectors.

 

b. $A$ is diagonalizable if $A$ has $n$ distinct eigenvectors.

 

c. If $AP=DP$, with $D$ diagonal, then the nonzero columns of $P$ must be eigenvectors of $A$.

 

d. $A$ is diagonalizable, then $A$ is invertible.

 

e. Two diagonalizable matrices $A$ and $B$ then their sum $A+B$ is diagonalizable.

 

GroupWork 5: Construct a nonzero $2\times 2$ matrix that is diagonalizable but not invertible.

 

GroupWork 6: Construct a nonzero $2\times 2$ matrix that is invertible but not diagonalizable.