Eigenvalues - Contd
-
Upload
prasanth-george -
Category
Education
-
view
218 -
download
0
Transcript of Eigenvalues - Contd
![Page 1: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/1.jpg)
Announcements
Ï Quiz 3 after lecture.
Ï Grades will be updated online (including quiz 3 grades) overthe weekend. Please let me know if you spot any mistakes.
Ï Exam 2 will be on Feb 25 Thurs in class. Details later.Make-up exams will be given only if there is an excusedabsence from the Dean of Students or a Doctor's note aboutsudden serious illness. No exceptions on this. Travelplans/broken alarm clock are unacceptable excuses.
![Page 2: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/2.jpg)
Last Class...
De�nitionAn eigenvector of an n×n matrix A is a NON-ZERO vector xsuch that Ax= λx for some scalar λ.
A scalar λ is called an eigenvalue of A if there is a nontrivial (ornonzero) solution x to Ax= λx; such an x is called an eigenvector
corresponding to λ.
![Page 3: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/3.jpg)
Triangular Matrices
TheoremThe eigenvalues of a triangular matrix are the entries on its main
diagonal.
![Page 4: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/4.jpg)
Triangular Matrices
Example
1. Let
A= 5 1 9
0 2 30 0 6
The eigenvalues of A are 5, 2 and 6.
2. Let
A= 4 1 9
0 0 30 0 6
The eigenvalues of A are 4, 0 and 6.
![Page 5: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/5.jpg)
Triangular Matrices
Example
1. Let
A= 5 1 9
0 2 30 0 6
The eigenvalues of A are 5, 2 and 6.
2. Let
A= 4 1 9
0 0 30 0 6
The eigenvalues of A are 4, 0 and 6.
![Page 6: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/6.jpg)
Zero Eigenvalue??
Zero eigenvalue means
1. The equation Ax= 0x has a nontrivial or nonzero solution
2. This means Ax= 0 has a nontrivial solution.
3. This means A is not invertible (or detA= 0) (by invertiblematrix theorem)
Zero is an eigenvalue of A if and only if A is not invertible
![Page 7: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/7.jpg)
Zero Eigenvalue??
Zero eigenvalue means
1. The equation Ax= 0x has a nontrivial or nonzero solution
2. This means Ax= 0 has a nontrivial solution.
3. This means A is not invertible (or detA= 0) (by invertiblematrix theorem)
Zero is an eigenvalue of A if and only if A is not invertible
![Page 8: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/8.jpg)
Zero Eigenvalue??
Zero eigenvalue means
1. The equation Ax= 0x has a nontrivial or nonzero solution
2. This means Ax= 0 has a nontrivial solution.
3. This means A is not invertible (or detA= 0) (by invertiblematrix theorem)
Zero is an eigenvalue of A if and only if A is not invertible
![Page 9: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/9.jpg)
Zero Eigenvalue??
Zero eigenvalue means
1. The equation Ax= 0x has a nontrivial or nonzero solution
2. This means Ax= 0 has a nontrivial solution.
3. This means A is not invertible (or detA= 0) (by invertiblematrix theorem)
Zero is an eigenvalue of A if and only if A is not invertible
![Page 10: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/10.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Multiply both sides by A. We get A2x=A(λx).This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x. This equation means that
λ2 is an eigenvalue of A2.
![Page 11: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/11.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.
Multiply both sides by A. We get A2x=A(λx).This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x. This equation means that
λ2 is an eigenvalue of A2.
![Page 12: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/12.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Multiply both sides by A. We get A2x=A(λx).
This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x. This equation means that
λ2 is an eigenvalue of A2.
![Page 13: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/13.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Multiply both sides by A. We get A2x=A(λx).This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x. This equation means that
λ2 is an eigenvalue of A2.
![Page 14: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/14.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Multiply both sides by A. We get A2x=A(λx).This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x.
This equation means that
λ2 is an eigenvalue of A2.
![Page 15: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/15.jpg)
Important
If λ is an eigenvalue of a square matrix A, prove that λ2 is aneigenvalue of A2.
For any problem of this type, start with the equation that de�neseigenvalue and take it from there.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Multiply both sides by A. We get A2x=A(λx).This is same as writing A2x= λ(Ax)︸ ︷︷ ︸ since λ is a scalar.
Again Ax= λx. So, A2x= λ(λx)︸︷︷︸= λ2x. This equation means that
λ2 is an eigenvalue of A2.
![Page 16: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/16.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 17: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/17.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.
Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 18: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/18.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)
=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 19: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/19.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 20: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/20.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.
Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 21: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/21.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.
Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 22: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/22.jpg)
Important, see prob 25 sec 5.1
If λ is an eigenvalue of an invertible matrix A, prove that λ−1 is aneigenvalue of A−1.
Solution: If λ is an eigenvalue of a square matrix A, we haveAx= λx.Since A is invertible, multiply both sides by A−1. We getA−1A︸ ︷︷ ︸
I
x=A−1(λx)=⇒A−1(λx)= x
This is same as writing λ(A−1x)= x since λ is a scalar.Since λ 6= 0 (Why?) we can divide both sides by λ and we getA−1x= 1
λx.Thus 1
λ or λ−1 is an eigenvalue of A−1.
![Page 23: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/23.jpg)
Example 20 section 5.1
Without calculation, �nd one eigenvalue and 2 linearly independent
eigenvectors of A= 5 5 5
5 5 55 5 5
. Justify your answer.
Solution: What is special about this matrix? Invertible/NotInvertible?
Clearly not invertible (same rows, columns).What is an eigenvalue of A?0!!To �nd eigenvectors for this eigenvalue, we look at A−0I and rowreduce. Or row reduce A.
![Page 24: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/24.jpg)
Example 20 section 5.1
Without calculation, �nd one eigenvalue and 2 linearly independent
eigenvectors of A= 5 5 5
5 5 55 5 5
. Justify your answer.
Solution: What is special about this matrix? Invertible/NotInvertible?Clearly not invertible (same rows, columns).What is an eigenvalue of A?
0!!To �nd eigenvectors for this eigenvalue, we look at A−0I and rowreduce. Or row reduce A.
![Page 25: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/25.jpg)
Example 20 section 5.1
Without calculation, �nd one eigenvalue and 2 linearly independent
eigenvectors of A= 5 5 5
5 5 55 5 5
. Justify your answer.
Solution: What is special about this matrix? Invertible/NotInvertible?Clearly not invertible (same rows, columns).What is an eigenvalue of A?0!!To �nd eigenvectors for this eigenvalue, we look at A−0I and rowreduce. Or row reduce A.
![Page 26: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/26.jpg)
Example 20 section 5.1We get (do the row reductions yourself) 1 1 1 0
0 0 0 00 0 0 0
.
Thus x1+x2+x3 = 0 where x2 and x3 are free. So x1 =−x2−x3.We have x1
x2x3
= −x2−x3
x2x3
= x2
−110
+x3
−101
Choose x2 = 1 and x3 = 1 (or anything nonzero) and two linearlyindependent eigenvectors are −1
10
,
−101
![Page 27: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/27.jpg)
Example 20 section 5.1We get (do the row reductions yourself) 1 1 1 0
0 0 0 00 0 0 0
. Thus x1+x2+x3 = 0 where x2 and x3 are free. So x1 =−x2−x3.
We have x1x2x3
= −x2−x3
x2x3
= x2
−110
+x3
−101
Choose x2 = 1 and x3 = 1 (or anything nonzero) and two linearlyindependent eigenvectors are −1
10
,
−101
![Page 28: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/28.jpg)
Example 20 section 5.1We get (do the row reductions yourself) 1 1 1 0
0 0 0 00 0 0 0
. Thus x1+x2+x3 = 0 where x2 and x3 are free. So x1 =−x2−x3.We have x1
x2x3
= −x2−x3
x2x3
= x2
−110
+x3
−101
Choose x2 = 1 and x3 = 1 (or anything nonzero) and two linearlyindependent eigenvectors are −1
10
,
−101
![Page 29: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/29.jpg)
Example 20 section 5.1We get (do the row reductions yourself) 1 1 1 0
0 0 0 00 0 0 0
. Thus x1+x2+x3 = 0 where x2 and x3 are free. So x1 =−x2−x3.We have x1
x2x3
= −x2−x3
x2x3
= x2
−110
+x3
−101
Choose x2 = 1 and x3 = 1 (or anything nonzero) and two linearlyindependent eigenvectors are −1
10
,
−101
![Page 30: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/30.jpg)
Observations
1. The eigenvalue λ= 0 has 2 linearly independent eigenvectors
2. We say that this eigenspace is a two-dimensional subspace ofR3.
3. Examples with 2 linearly independent eigenvectors are veryimportant for section 5.3 when we do diagonalization and indi�erential equations where eigenvalues repeat.
![Page 31: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/31.jpg)
Observations
1. The eigenvalue λ= 0 has 2 linearly independent eigenvectors
2. We say that this eigenspace is a two-dimensional subspace ofR3.
3. Examples with 2 linearly independent eigenvectors are veryimportant for section 5.3 when we do diagonalization and indi�erential equations where eigenvalues repeat.
![Page 32: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/32.jpg)
Observations
1. The eigenvalue λ= 0 has 2 linearly independent eigenvectors
2. We say that this eigenspace is a two-dimensional subspace ofR3.
3. Examples with 2 linearly independent eigenvectors are veryimportant for section 5.3 when we do diagonalization and indi�erential equations where eigenvalues repeat.
![Page 33: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/33.jpg)
Example 16 section 5.1
Let A=
3 0 2 01 3 1 00 1 1 00 0 0 4
. Find a basis for eigenspace corresponding
to λ= 4.
Solution: To �nd an eigenvector, start with A−4I and row reduce
A−4I =
3 0 2 01 3 1 00 1 1 00 0 0 4
−
4 0 0 00 4 0 00 0 4 00 0 0 4
=
−1 0 2 01 −1 1 00 1 −3 00 0 0 0
![Page 34: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/34.jpg)
−1 0 2 0 0
1 −1 1 0 0
0 1 −3 0 0
0 0 0 0 0
R2+R1
−1 0 2 0 0
0 −1 3 0 0
0 1 −3 0 0
0 0 0 0 0
R3+R2
![Page 35: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/35.jpg)
−1 0 2 0 0
1 −1 1 0 0
0 1 −3 0 0
0 0 0 0 0
R2+R1
−1 0 2 0 0
0 −1 3 0 0
0 1 −3 0 0
0 0 0 0 0
R3+R2
![Page 36: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/36.jpg)
−1 0 2 0 0
0 −1 3 0 0
0 0 0 0 0
0 0 0 0 0
Thus, x2 = 3x3 and x1 = 2x3 with x3 and x4 free.x1x2x3x4
=
2x33x3x3x4
= x3
2310
+x3
0001
.
A basis for eigenspace will be thus
2310
,
0001
.
![Page 37: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/37.jpg)
−1 0 2 0 0
0 −1 3 0 0
0 0 0 0 0
0 0 0 0 0
Thus, x2 = 3x3 and x1 = 2x3 with x3 and x4 free.
x1x2x3x4
=
2x33x3x3x4
= x3
2310
+x3
0001
.
A basis for eigenspace will be thus
2310
,
0001
.
![Page 38: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/38.jpg)
−1 0 2 0 0
0 −1 3 0 0
0 0 0 0 0
0 0 0 0 0
Thus, x2 = 3x3 and x1 = 2x3 with x3 and x4 free.
x1x2x3x4
=
2x33x3x3x4
= x3
2310
+x3
0001
.
A basis for eigenspace will be thus
2310
,
0001
.
![Page 39: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/39.jpg)
Theorem
TheoremEigenvectors corresponding to distinct eigenvalues of an n×n
matrix A are linearly independent.
![Page 40: Eigenvalues - Contd](https://reader033.fdocuments.us/reader033/viewer/2022052307/55628936d8b42a68128b4573/html5/thumbnails/40.jpg)
Next week...
1. How to �nd eigenvalues of a 2×2 and 3×3 matrix?
2. The process of diagonalization (uses eigenvalues andeigenvectors)
3. Finding "complex" eigenvalues
4. Quick look at eigenvalues and eigenvectors being used to learnlong-term behavior of a dynamical system.
5. Quiz 4 (last quiz) will be on thurs Feb 18 based on sections3.3, 5.1 and 5.2.