EIGENVALUES AND EIGENVECTORS
|
|
- Garry Craig
- 6 years ago
- Views:
Transcription
1 EIGENVALUES AND EIGENVECTORS Diagonalizable linear transformations and matrices Recall, a matrix, D, is diagonal if it is square and the only non-zero entries are on the diagonal This is equivalent to D e i = λ i e i where here e i are the standard vector and the λ i are the diagonal entries A linear transformation, T : R n R n, is diagonalizable if there is a basis B of R n so that [T ] B is diagonal This means [T ] is similar to the diagonal matrix [T ] B Similarly, a matrix A R n n is diagonalizable if it is similar to some diagonal matrix D To diagonalize a linear transformation is to find a basis B so that [T ] B is diagonal To diagonalize a square matrix is to find an invertible S so that S AS = D is diagonal Fix a matrix A R n n We say a vector v R n is an eigenvector if () v (2) A v = λ v for some scalar λ R The scalar λ is the eigenvalue associated to v or just an eigenvalue of A Geometrically, A v is parallel to v and the eigenvalue, λ counts the stretching factor Another way to think about this is that the line L := span( v) is left invariant by multiplication by A An eigenbasis of A is a basis, B = ( v,, v n ) of R n so that each v i is an eigenvector of A Theorem The matrix A is diagonalizable if and only if there is an eigenbasis of A Proof Indeed, if A has eigenbasis B = ( v,, v n ), then the matrix S = [ v v n ] satisfies λ S AS = λ 2 λ n where each λ i is the eigenvalue associated to v i Conversely, if A is diagonalized by S, then the columns of S form an eigenbasis of A EXAMPLE: The the standard vectors e i form an eigenbasis of I n Their eigenvalues are More generally, if D is diagonal, the standard vectors form an eigenbasis with associated eigenvalues the corresponding entries on the diagonal EXAMPLE: If v is an eigenvector of A with eigenvalue λ, then v is an eigenvector of A 3 with eigenvalue λ 3 EXAMPLE: is an eigenvalue of A if and only if A is not invertible Indeed, is an eigenvalue there is a non-zero v so A v = true v ker A so ker A is non-trivial A not invertible
2 2 EIGENVALUES AND EIGENVECTORS EXAMPLE: If v is an eigenvector of Q which is orthogonal, then the associated eigenvalue is ± Indeed, v = Q v = λ v = λ v as v dividing, gives λ = EXAMPLE: If A 2 = I n, then there are no eigenvectors of A To see this, suppose v was an eigenvector of A Then A v = λ v As such v = I n v = A 2 v = λ 2 v That is, λ 2 = There are no real numbers whose square is negative, so there is no such v This means A has no real eigenvalues (it does have have a comples eigenvalues see Section 75 of the textbook This is beyond scope of this course) 2 Characteristic Equaiton One of the hardest (computational) problems in linear algebra is to determine the eigenvalues of a matrix This is because, unlike everything else we have considered so far, it is a non-linear problem That being said, it is still a tractable problem (especially for small matrices) To understand the approach Observe that if λ is an eigenvalue of A, then there is a non-zero v so thata v = λ v That is, A v = (λi n ) v (A λi n ) v = v ker(a λi n ) From which we conclude that A λi n is not invertible and so det(a λi n ) = In summary, Theorem 2 λ is an eigenvalue of A if and only if det(a λi n ) = The equation det(a λi n ) = is called the characteristic equation of A EXAMPLE: Find the eigenvalues of 2 3 A = 3 2 The characteristic equation is 2 λ 3 det(a λi 2 ) = det = λ 2 4λ 5 = (λ + )(λ 5) 3 2 λ Hence, the eigenvalues are λ = and λ = 5 To find corresponding eigenvectors we seek non-trivial solutions to 2 ( ) 3 x 2 (5) 3 x = and = 3 2 ( ) x (5) x 2 By inspection the non-trivial solutions are and Hence, So we have diagonalized A = 5
3 EIGENVALUES AND EIGENVECTORS 3 So EXAMPLE: Find eigenvalues of 2 3 A = 2 3 λ 2 3 det(a λi 3 ) = det 2 λ = ( λ)(2 λ)(3 λ) 3 λ Hence, eigenvalues are, 2, 3 This example is a special case of a more general phenomena Theorem 22 If M is upper triangular, then the eigenvalues of M are the diagonal entries of M EXAMPLE: When n = 2, the eigenvalues of a b A = c d so the characteristic equation is a λ b det(a λi 2 ) = det = λ 2 (a + d)λ + (ad bc) = λ 2 traλ + det A c d λ Using the quadratic formula we have the following: () When tr(a) 2 4 det A >, then two distinct eigenvalues (2) When tr(a) 2 4 det A =, exactly one eigenvalue 2 tra (3) When tr(a) 2 4 det A <, then no (real) eigenvalues 3 Characteristic Polynomial As we say for a 2 2 matrix, the characteristic equation reduces to finding the roots of an associated quadratic polynomial More generally, for a n n matrix A, the characteristic equation det(a λi n ) = reduces to finding roots of a degree n polynomial o fthe form f A (λ) = ( ) n λ n + ( ) n (tra)λ n + + det A this is called the characteristic polynomial of A To see why this is true observe that if P is the diagonal pattern of A λi n, then prod(p ) = (a λ) (a nn λ) = ( ) n λ n + ( ) n (tra)λ n 2 + R P (λ) where R P (λ) is a polynomial of degree at most n 2 that depends on P (and of course also on A and λ) If P is some other pattern of A λi n, then at least two entries are not on the diagonal Hence, prod(p ) = R P (λ) for some R P (λ) that is a polynomial of degree at most n 2 that depends on P Hence, f A (λ) = det(a λi n ) = ( ) n λ n + ( ) n (tra)λ n + R(λ) where R(λ) has degree at most n 2 Finally, f A () = det(a) and so the constant term of f A is det A as claimed
4 4 EIGENVALUES AND EIGENVECTORS EXAMPLE: If n is odd, there is always at least one real eigenvalue Indeed, in this case lim f A(λ) = lim n ± n λ3 = That is for λ >>, f A (λ) < and for λ <<, f A (λ) > and so by the intermediate value theorem from calculus (and the fact that polynomials are continuous), f A (λ ) = for some λ This may fail when n is even An eigenvalue λ has algebraic multiplicity k if f A (λ) = (λ λ) k g(λ) where g is a polynomial of degree n k with g(λ ) Write almu(λ ) = k in this case EXAMPLE: If 2 A = 2 then f A (λ) = (2 λ) 2 ( λ)( λ) and so almu(2) = 2, while almu() = almu( ) = Strictly speaking, almu() =, as is not an eigenvalue of A and it is sometimes convenient to follow this convention We say an eigenvalue, λ, is repeated if almu(λ) 2 Algebraic fact, counting algebraic multiplicity, a n n matrix has at most n real eigenvalues If n is odd, then there is at least one real eigenvalue The fundamental theorem of algebra ensures that, counting multiplicity, such a matrix always has exactly n complex eigenvalues We conclude with a simple theorem Theorem 3 If A R n n has eigenvalues λ,, λ n (listed counting multiplicity): () det A = λ λ 2 λ n (2) tra = λ + λ λ n Proof If the eigenvalues are λ,, λ n, then we have the complete factorization of f A (λ) f A (λ) = (λ λ) (λ n λ) This means det(a) = f A () = λ λ n (λ λ) (λ n λ) = ( ) n λ n + ( ) n (λ + +λ n )λ n +R(λ) where R(λ) of degree at most n 2 Comparing the coefficient of the λ n 2 term gives the result 4 Eigenspaces Consider an eigenvalue λ of A R n n We define the eigenspace associated to λ to be E λ = ker(a λi n ) = { v R n : A v = λ v} R n Observe that dim E λ All non-zero elements of E λ are eigenvectors of A with eigenvalue λ EXAMPLE: A = has repeated eigenvalue Clearly, E = ker(a I 2 ) = ker( 2 2 ) = R 2
5 EIGENVALUES AND EIGENVECTORS 5 2 Similarly, the matrix B = has one repeated eigenvalue However, [ 2 ker(b I 2 ) = ker = span( ) ] Motivated by this example, define the geometric multiplicity of an eigenvalue λ of A R n n tobe gemu(λ) = null(a λi n ) = n rank(a λi n ) 5 Diagonalizable Matrices We are now ready to give a computable condition that will allow us to determine an answer to our central question in this part of the course: When is A R n n diagonalizable? Theorem 5 A matrix A R n n is diagonalizable if and only if the sum of the geometric multiplicities of all of the eigenvalues of A is n EXAMPLE: For which k is the following diagonalizable k? 2 As this is upper triangular, the eigenvalues are with almu() = 2 and 2 with almu(2) = It is not hard to see that gemu() = when k and gemu() = 2 when k = We always have gemu(2) = Hence, according to the theorem the matrix is diagonalizable only when it is already diagonal (that is k = ) and is otherwise not diagonalizable To prove this result we need the following auxiliary fact Theorem 52 Fix a matrix A R n n and let v,, v s be a set of vectors formed by concatenating a basis of each non-trivial eigenspace of A This set is linearly independent (and so s n) To explain what I mean by concatenating Suppose A R 5 5 has exactly three distinct eigenvalues λ = 2 and λ 2 = 3 and λ 3 = 4 If gemu(2) = 2 and while gemu(3) = gemu(4) = and E 2 = span( a, a 2 ) E 3 = span( b ) and E 4 = span( c ), then their concatenation is the set of vectors ( v, v 2, v 3, v 4 ) = ( a, a 2, b, c ) According to the auxiliary theorem this list is linearly independent As s = 4 < 5 = n, if this was the complete set of eigenvalues, A would not be diagonalizable by the main theorem It would be if we had omitted one eigenvalue from our list Let us now prove the auxiliary theorem
6 6 EIGENVALUES AND EIGENVECTORS Proof If the vectors v i are not linearly independent, then they at least one is redundant Let v m be the first redundant vector on the list That is for some m s we can write v m = m i= and cannot do this for any smaller m This means v,, v m are linearly independent Let λ m be the eigenvalue associated to v m Observe, there must be some k m so that λ k λ m and c k as otherwise we would have a non-trivial linear relation for of a set of linearly independent vectors in E λm (which is impossible) Clearly, = (A λ m I n ) v m = c i v i m i= c i (λ i λ m ) v i Hence, c i (λ i λ m ) = for each i This contradicts, λ k λ m and c k and proves the claim The main theorem follows easily form this Indeed, the hypotheses gives n lin indep vectors all which are eigenvectors of A That is, an eigenbasis of A 6 Strategy for diagonalizing A R n n We have the following strategy for diagonalizing a given matrix: () Find eigenvalues of A by solving f A (λ) = (this is a non-linear problem) (2) For each eigenvalue λ find a basis of the eigenspace E λ (this is a linear problem) (3) The A is diagonalizable if and only if the sum of the dimensions of the eigenspaces is n In this case, obtain an eigenbasis, v,, v n, by concatenation (4) As A v i = λ i v i, setting λ S = v v n, S AS = D = λ 2 λ n EXAMPLE: Diagonalize (if possible) 2 A = 2 We compute 2 λ f A (λ) = det(a λi 3 ) = det 2 λ 2 λ = ( λ) det 2 λ λ f A (λ) = ( λ)(λ 2 4λ + 3) = ( λ)(λ 3)(λ ) = ( λ) 2 (3 λ)
7 EIGENVALUES AND EIGENVECTORS 7 Hence, eigenvalues are λ = and λ = 3 Have almu() = 2 and almu(3) = We compute E = ker(a I 3 ) = ker = span(, ) Hence, gemu() = 2 Likewise, E 3 = ker(a 3I 3 ) = ker = span( ) 2 Hence, gemu(3) = As gemu()+gemu(3) = 2+ = 3 the matrix is diagonalizable Indeed, setting S = We have S AS = 3 7 Eigenvalues of linear transformations Fix a linear space V and consider a linear transformation T : V V A scalar λ is an eigenvalue of T, if T (f) = λf for some nonzero (nonneutral) element f V In general we refer to such f as a eigenvector If V is a space of functions, then it is customary to call f an eigenfunction, etc If B = (f,, f n ) is a basis of V and each f i is an eigenvector, then we say B is an eigenbasis of T If B is an eigenbasis of T, then T is diagonalizable as λ [T ] B = λ n EXAMPLE: If V = C, and D(f) = f, then D(e kx ) = d dx ekx = ke kx so each f k (x) = e kx is an eigenfunction and every scalar k R is an eigenvalue EXAMPLE: Consider the map T : P 2 P 2 given by T (p) = p(2x + ) Is T diagonalizable? As usual it is computationally more convenient to work in some basis To that end, let U = (, x, x 2 ) be the usual basis of P 2 As [T ()] U = [] U = [T (x)] U = [2x + ] U = 2
8 8 EIGENVALUES AND EIGENVECTORS [T (x 2 )] U = [4x 2 + 4x + ] U = 4, 4 the associated matrix is A = [T ] U = This matrix is upper triangular, with distinct eigenvalues, 2 and 4 This means T is also diagonalizable and has the same eigenvalues We compute (for A) E = ker(a I 3 ) = ker 4 = span( ) 3 E 2 = ker(a 2I 3 ) = 4 = span( ) 2 3 E 3 = ker(a 4I 3 ) = 2 4 = span 2 Hence, A can be diagonalized by S = 2 Going back to T we check T () = T ( + x) = + (2x + ) = 2(x + ) T ( + 2x + x 2 ) = + 2(2x + ) + (2x + ) 2 = 4( + 2x + x 2 ) In particular, B = (, + x, + 2x + x 2 ) is an eigenbasis and [T ] B = Eigenvalues and Similarity There is a close relationship between similar matrices and their eigenvalues This is clearest for diagonalizable matrices but holds more generally Theorem 8 If A is similar to B () f A (λ) = f B (λ) (2) rank(a) = rank(b) and null(a) = null(b) (3) A and B have the same eigenvalues with the same algebraic and geometric multiplicities (the eigenvectors are in general different) (4) tra = trb and det(a) = det(b) Proof Proof of claim (): A is similar to B means B = S AS for some invertible S Hence, f B (λ) = det(b λi n ) = det(s AS λi n ) = det(s (A λi n )S) = det(a λi n ) = f A (λ) Claim (2) was shown in a previous handout (the one on similar matrices)
9 EIGENVALUES AND EIGENVECTORS 9 Claim (3) can be shown as follows: By claim (), f A (λ) = f B (λ) and so A and B have the same eigenvalues with the same algebraic multiplicities Furthermore, if λ is an eigenvalue of both A and B, then A λi n is similar to B λi n Hence, by claim (2) gemu A (λ) = null(a λi n ) = null(b λi n ) = gemu B (λ) so the geometric multiplicities are the same as well Notice E λ (A) E λ (B) in general Finally, claim (4) Follows from claim () and the observation that the characteristic polynomial encodes the trace and determinant EXAMPLE: The matrix is not similar to as their traces are different Even if a matrix is not diagonalizable, it is still similar to one of a list of canonical matrices To do this is full generality is beyond the scope of this course To illustrate the idea we present the list for 2 2 matrices Theorem 82 Any A R 2 2 is similar to one of the following: λ () for λ λ, λ 2 R This occurs when A is diagonalizable 2 λ (2) This occurs when A has repeated eigenvalue λ with gemu(λ) = λ Such [ A is] sometimes called defective λ λ (3) 2 = cos θ sin θ λ λ 2 λ 2 + λ2 2 where λ sin θ cos θ 2 > and π > θ > This corresponds to an A with no real eigenvalues (in this case the complex eigenvalues of A are λ ± iλ 2 )
Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationEigenspaces. (c) Find the algebraic multiplicity and the geometric multiplicity for the eigenvaules of A.
Eigenspaces 1. (a) Find all eigenvalues and eigenvectors of A = (b) Find the corresponding eigenspaces. [ ] 1 1 1 Definition. If A is an n n matrix and λ is a scalar, the λ-eigenspace of A (usually denoted
More informationDiagonalisierung. Eigenwerte, Eigenvektoren, Mathematische Methoden der Physik I. Vorlesungsnotizen zu
Eigenwerte, Eigenvektoren, Diagonalisierung Vorlesungsnotizen zu Mathematische Methoden der Physik I J. Mark Heinzle Gravitational Physics, Faculty of Physics University of Vienna Version /6/29 2 version
More informationand let s calculate the image of some vectors under the transformation T.
Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =
More informationExamples True or false: 3. Let A be a 3 3 matrix. Then there is a pattern in A with precisely 4 inversions.
The exam will cover Sections 6.-6.2 and 7.-7.4: True/False 30% Definitions 0% Computational 60% Skip Minors and Laplace Expansion in Section 6.2 and p. 304 (trajectories and phase portraits) in Section
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationMATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization.
MATH 304 Linear Algebra Lecture 33: Bases of eigenvectors. Diagonalization. Eigenvalues and eigenvectors of an operator Definition. Let V be a vector space and L : V V be a linear operator. A number λ
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationMath 205, Summer I, Week 4b:
Math 205, Summer I, 2016 Week 4b: Chapter 5, Sections 6, 7 and 8 (5.5 is NOT on the syllabus) 5.6 Eigenvalues and Eigenvectors 5.7 Eigenspaces, nondefective matrices 5.8 Diagonalization [*** See next slide
More informationDiagonalisierung. Eigenwerte, Eigenvektoren, Mathematische Methoden der Physik I. Vorlesungsnotizen zu
Eigenwerte, Eigenvektoren, Diagonalisierung Vorlesungsnotizen zu Mathematische Methoden der Physik I J. Mark Heinzle Gravitational Physics, Faculty of Physics University of Vienna Version 5/5/2 2 version
More informationMath 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:
Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your
More information235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationCity Suburbs. : population distribution after m years
Section 5.3 Diagonalization of Matrices Definition Example: stochastic matrix To City Suburbs From City Suburbs.85.03 = A.15.97 City.15.85 Suburbs.97.03 probability matrix of a sample person s residence
More informationAfter we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that
7.3 FINDING THE EIGENVECTORS OF A MATRIX After we have found an eigenvalue λ of an n n matrix A, we have to find the vectors v in R n such that A v = λ v or (λi n A) v = 0 In other words, we have to find
More informationMath 110 Linear Algebra Midterm 2 Review October 28, 2017
Math 11 Linear Algebra Midterm Review October 8, 17 Material Material covered on the midterm includes: All lectures from Thursday, Sept. 1st to Tuesday, Oct. 4th Homeworks 9 to 17 Quizzes 5 to 9 Sections
More informationDM554 Linear and Integer Programming. Lecture 9. Diagonalization. Marco Chiarandini
DM554 Linear and Integer Programming Lecture 9 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. More on 2. 3. 2 Resume Linear transformations and
More informationComputationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:
Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More informationWarm-up. True or false? Baby proof. 2. The system of normal equations for A x = y has solutions iff A x = y has solutions
Warm-up True or false? 1. proj u proj v u = u 2. The system of normal equations for A x = y has solutions iff A x = y has solutions 3. The normal equations are always consistent Baby proof 1. Let A be
More information1. In this problem, if the statement is always true, circle T; otherwise, circle F.
Math 1553, Extra Practice for Midterm 3 (sections 45-65) Solutions 1 In this problem, if the statement is always true, circle T; otherwise, circle F a) T F If A is a square matrix and the homogeneous equation
More informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
More informationTBP MATH33A Review Sheet. November 24, 2018
TBP MATH33A Review Sheet November 24, 2018 General Transformation Matrices: Function Scaling by k Orthogonal projection onto line L Implementation If we want to scale I 2 by k, we use the following: [
More informationLinear Algebra. Rekha Santhanam. April 3, Johns Hopkins Univ. Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, / 7
Linear Algebra Rekha Santhanam Johns Hopkins Univ. April 3, 2009 Rekha Santhanam (Johns Hopkins Univ.) Linear Algebra April 3, 2009 1 / 7 Dynamical Systems Denote owl and wood rat populations at time k
More informationLINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS
LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts
More informationAnnouncements Wednesday, November 01
Announcements Wednesday, November 01 WeBWorK 3.1, 3.2 are due today at 11:59pm. The quiz on Friday covers 3.1, 3.2. My office is Skiles 244. Rabinoffice hours are Monday, 1 3pm and Tuesday, 9 11am. Section
More informationChapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015
Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 205. If A is a 3 3 triangular matrix, explain why det(a) is equal to the product of entries on the diagonal. If A is a lower triangular or diagonal
More informationEigenvectors. Prop-Defn
Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.
More informationPractice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5
Practice Exam. Solve the linear system using an augmented matrix. State whether the solution is unique, there are no solutions or whether there are infinitely many solutions. If the solution is unique,
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
More informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More information4. Linear transformations as a vector space 17
4 Linear transformations as a vector space 17 d) 1 2 0 0 1 2 0 0 1 0 0 0 1 2 3 4 32 Let a linear transformation in R 2 be the reflection in the line = x 2 Find its matrix 33 For each linear transformation
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More information(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More informationEigenvalues and Eigenvectors
5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS nn Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationMath 1553 Worksheet 5.3, 5.5
Math Worksheet, Answer yes / no / maybe In each case, A is a matrix whose entries are real a) If A is a matrix with characteristic polynomial λ(λ ), then the - eigenspace is -dimensional b) If A is an
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationSystems of Algebraic Equations and Systems of Differential Equations
Systems of Algebraic Equations and Systems of Differential Equations Topics: 2 by 2 systems of linear equations Matrix expression; Ax = b Solving 2 by 2 homogeneous systems Functions defined on matrices
More informationMath 21b Final Exam Thursday, May 15, 2003 Solutions
Math 2b Final Exam Thursday, May 5, 2003 Solutions. (20 points) True or False. No justification is necessary, simply circle T or F for each statement. T F (a) If W is a subspace of R n and x is not in
More information(V.C) Complex eigenvalues and other topics
V.C Complex eigenvalues and other topics matrix Let s take a closer look at the characteristic polynomial for a 2 2 namely A = a c f A λ = detλi A = λ aλ d bc b d = λ 2 a + dλ + ad bc = λ 2 traλ + det
More informationLecture 15, 16: Diagonalization
Lecture 15, 16: Diagonalization Motivation: Eigenvalues and Eigenvectors are easy to compute for diagonal matrices. Hence, we would like (if possible) to convert matrix A into a diagonal matrix. Suppose
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationEigenvalues and Eigenvectors
CHAPTER Eigenvalues and Eigenvectors CHAPTER CONTENTS. Eigenvalues and Eigenvectors 9. Diagonalization. Complex Vector Spaces.4 Differential Equations 6. Dynamical Systems and Markov Chains INTRODUCTION
More informationMATH 1553-C MIDTERM EXAMINATION 3
MATH 553-C MIDTERM EXAMINATION 3 Name GT Email @gatech.edu Please read all instructions carefully before beginning. Please leave your GT ID card on your desk until your TA scans your exam. Each problem
More informationGeneralized Eigenvectors and Jordan Form
Generalized Eigenvectors and Jordan Form We have seen that an n n matrix A is diagonalizable precisely when the dimensions of its eigenspaces sum to n. So if A is not diagonalizable, there is at least
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationFinal Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015
Final Review Written by Victoria Kala vtkala@mathucsbedu SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Summary This review contains notes on sections 44 47, 51 53, 61, 62, 65 For your final,
More informationAMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =
AMS1 HW Solutions All credit is given for effort. (- pts for any missing sections) Problem 1 ( pts) Consider the following matrix 1 1 9 a. Calculate the eigenvalues of A. Eigenvalues are 1 1.1, 9.81,.1
More information1. Linear systems of equations. Chapters 7-8: Linear Algebra. Solution(s) of a linear system of equations (continued)
1 A linear system of equations of the form Sections 75, 78 & 81 a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2 a m1 x 1 + a m2 x 2 + + a mn x n = b m can be written in matrix
More informationEigenvalues and Eigenvectors
Eigenvalues and Eigenvectors week -2 Fall 26 Eigenvalues and eigenvectors The most simple linear transformation from R n to R n may be the transformation of the form: T (x,,, x n ) (λ x, λ 2,, λ n x n
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationLU Factorization. A m x n matrix A admits an LU factorization if it can be written in the form of A = LU
LU Factorization A m n matri A admits an LU factorization if it can be written in the form of Where, A = LU L : is a m m lower triangular matri with s on the diagonal. The matri L is invertible and is
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationProperties of Linear Transformations from R n to R m
Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation
More informationEigenvalues, Eigenvectors, and Diagonalization
Math 240 TA: Shuyi Weng Winter 207 February 23, 207 Eigenvalues, Eigenvectors, and Diagonalization The concepts of eigenvalues, eigenvectors, and diagonalization are best studied with examples. We will
More informationMATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial.
MATH 423 Linear Algebra II Lecture 20: Geometry of linear transformations. Eigenvalues and eigenvectors. Characteristic polynomial. Geometric properties of determinants 2 2 determinants and plane geometry
More informationEigenvalues and Eigenvectors
Sec. 6.1 Eigenvalues and Eigenvectors Linear transformations L : V V that go from a vector space to itself are often called linear operators. Many linear operators can be understood geometrically by identifying
More informationMAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:
MAC Module Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to: Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationMATH 1553 PRACTICE MIDTERM 3 (VERSION B)
MATH 1553 PRACTICE MIDTERM 3 (VERSION B) Name Section 1 2 3 4 5 Total Please read all instructions carefully before beginning. Each problem is worth 10 points. The maximum score on this exam is 50 points.
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationChapter 5 Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Outline 5.1 Eigenvalues and Eigenvectors 5.2 Diagonalization 5.3 Complex Vector Spaces 2 5.1 Eigenvalues and Eigenvectors Eigenvalue and Eigenvector If A is a n n
More informationDiagonalization. Hung-yi Lee
Diagonalization Hung-yi Lee Review If Av = λv (v is a vector, λ is a scalar) v is an eigenvector of A excluding zero vector λ is an eigenvalue of A that corresponds to v Eigenvectors corresponding to λ
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More informationft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ft-uiowa-math255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More informationLinear Algebra
. Linear Algebra Final Solutions. (pts) Let A =. (a) Find an orthogonal matrix S a diagonal matrix D such that S AS = D. (b) Find a formula for the entries of A t,wheret is a positive integer. Also find
More informationCAAM 335 Matrix Analysis
CAAM 335 Matrix Analysis Solutions to Homework 8 Problem (5+5+5=5 points The partial fraction expansion of the resolvent for the matrix B = is given by (si B = s } {{ } =P + s + } {{ } =P + (s (5 points
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Eigenvalue Problems; Similarity Transformations Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Eigenvalue
More informationMATH 221, Spring Homework 10 Solutions
MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the
More informationEigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization
Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann The eigenvalues for a triangular matrix are
More informationLinear algebra II Tutorial solutions #1 A = x 1
Linear algebra II Tutorial solutions #. Find the eigenvalues and the eigenvectors of the matrix [ ] 5 2 A =. 4 3 Since tra = 8 and deta = 5 8 = 7, the characteristic polynomial is f(λ) = λ 2 (tra)λ+deta
More informationJordan Canonical Form Homework Solutions
Jordan Canonical Form Homework Solutions For each of the following, put the matrix in Jordan canonical form and find the matrix S such that S AS = J. [ ]. A = A λi = λ λ = ( λ) = λ λ = λ =, Since we have
More informationSolutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015
Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationMath 215 HW #9 Solutions
Math 5 HW #9 Solutions. Problem 4.4.. If A is a 5 by 5 matrix with all a ij, then det A. Volumes or the big formula or pivots should give some upper bound on the determinant. Answer: Let v i be the ith
More informationLecture 12: Diagonalization
Lecture : Diagonalization A square matrix D is called diagonal if all but diagonal entries are zero: a a D a n 5 n n. () Diagonal matrices are the simplest matrices that are basically equivalent to vectors
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationEigenspaces and Diagonalizable Transformations
Chapter 2 Eigenspaces and Diagonalizable Transformations As we explored how heat states evolve under the action of a diffusion transformation E, we found that some heat states will only change in amplitude.
More informationMathematical Methods for Engineers 1 (AMS10/10A)
Mathematical Methods for Engineers 1 (AMS10/10A) Quiz 5 - Friday May 27th (2016) 2:00-3:10 PM AMS 10 AMS 10A Name: Student ID: Multiple Choice Questions (3 points each; only one correct answer per question)
More information4. Determinants.
4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.
More informationMath 21b. Review for Final Exam
Math 21b. Review for Final Exam Thomas W. Judson Spring 2003 General Information The exam is on Thursday, May 15 from 2:15 am to 5:15 pm in Jefferson 250. Please check with the registrar if you have a
More informationExaminers: D. Burbulla, W. Cluett, S. Cohen, S. Liu, M. Pugh, S. Uppal, R. Zhu. Aids permitted: Casio FX-991 or Sharp EL-520 calculator.
University of Toronto Faculty of Applied Science and Engineering Solutions to Final Examination, December 7 Duration: and / hrs First Year - CHE, CIV, CPE, ELE, ENG, IND, LME, MEC, MMS MATHF - Linear Algebra
More informationMath 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that
Math 304 Fall 2018 Exam 3 Solutions 1. (18 Points, 3 Pts each part) Let A, B, C, D be square matrices of the same size such that det(a) = 2, det(b) = 2, det(c) = 1, det(d) = 4. 2 (a) Compute det(ad)+det((b
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationJORDAN NORMAL FORM NOTES
18.700 JORDAN NORMAL FORM NOTES These are some supplementary notes on how to find the Jordan normal form of a small matrix. First we recall some of the facts from lecture, next we give the general algorithm
More information