# Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Download "Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively."

## Transcription

1 Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry I and possibly also used in other modules. After a short repetition of the basic facts we will arrive at our main result, a spectral theorem for symmetric matrices. 7. Definition and examples If A is a square n n matrix, we may regard it as a linear transformation from R n to R n. This transformation sends a vector x R n to the vector Ax. For certain vectors, this action can be very simple. Example 7.. Let Then A = ( ) 2, u = 4 ( ), w = ( ) ( ) ( ) 2 Au = = = u 4 ( ) ( ) ( ) Aw = = = 2w 4 2 ( ) 2. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by and 2, respectively. Definition 7.2. An eigenvector of an n n matrix A is a nonzero vector x such that Ax = λx, for some scalar λ. A scalar λ is called an eigenvalue of A if there is a non-trivial solution x to Ax = λx, in which case we say that x is an eigenvector corresponding to the eigenvalue λ. Remark 7.. Note that if x is an eigenvector of a matrix A with eigenvalue λ, then any nonzero multiple of x is also an eigenvector corresponding to λ, since A(αx) = αax = αλx = λ(αx). 67

2 68 CHAPTER 7. EIGENVALUES AND EIGENVECTORS We shall now investigate how to determine all the eigenvalues and eigenvectors of an n n matrix A. We start by observing that the defining equation Ax = λx can be written (A λi)x =. (7.) Thus λ is an eigenvalue of A if and only if (7.) has a non-trivial solution. The set of solutions of (7.) is N(A λi), that is, the nullspace of A λi, which is a subspace of R n.thus, λ is an eigenvalue of A if and only if N(A λi) {}, and any nonzero vector in N(A λi) is an eigenvector belonging to λ. Moreover, by the Invertible Matrix Theorem, (7.) has a non-trivial solution if and only if the matrix A λi is singular, or equivalently det(a λi) =. (7.2) Notice now that if the determinant in (7.2) is expanded we obtain a polynomial of degree n in the variable λ, p(λ) = det(a λi), called the characteristic polynomial of A, and equation (7.2) is called the characteristic equation of A. So, in other words, the roots of the characteristic polynomial of A are exactly the eigenvalues of A. The following theorem summarises our findings so far: Theorem 7.4. Let A be an n n matrix and λ a scalar. equivalent: The following statements are (a) λ is an eigenvalue of A; (b) (A λi)x = has a non-trivial solution; (c) N(A λi) {}; (d) A λi is singular; (e) det(a λi) =. In view of the above theorem the following concept arises naturally: Definition 7.5. If A is a square matrix and λ an eigenvalue of A, then N(A λi) is called the eigenspace corresponding to λ. Note that if λ is an eigenvalue of a matrix A, then every nonzero vector in the corresponding eigenspace N(A λi) is an eigenvector corresponding to λ, and conversely, the set of all eigenvectors corresponding to λ together with the zero vector forms the corresponding eigenspace N(A λi). We shall now see how to use (e) in the theorem above to determine the eigenvalues and eigenvectors of a given matrix. Example 7.6. Find all eigenvalues and eigenvectors of the matrix ( ) 7 6 A =. 9 8

3 7.. DEFINITION AND EXAMPLES 69 Proof. First we calculate the characteristic polynomial of A det(a λi) = 7 λ λ = ( 7 λ)(8 λ) ( 6) 9 Thus the characteristic equation is = λ 8λ + λ = λ 2 λ 2 = (λ + )(λ 2). (λ + )(λ 2) =, so the eigenvalues of the matrix are λ = and λ 2 = 2. In order to find the eigenvectors belonging to λ = we must determine the nullspace of A λ I = A + I. Or, put differently, we need to determine all solutions of the system (A + I)x =. This can be done using your favourite method, but, for reasons which will become clear in the next example, I strongly recommend Gaussian elimination, that is, we bring the augmented matrix (A + I ) to row echelon form: (A + I ) = ( ) = ( ) ( ) 9 9 ( ), so setting x 2 = α we find x = x 2 = α. Thus every vector in N(A + I) is of the form ( ) α = α α ( ), so the eigenspace corresponding to the eigenvalue is { α ( ) } α R, ( ) and any nonzero multiple of is an eigenvector corresponding to the eigenvalue. Similarly, in order to find the eigenvectors belonging to λ 2 = 2 we bring (A λ 2 I ) = (A 2I ) to row echelon form: (A 2I ) = ( ) = ( ) ( ) ( 2 so setting x 2 = α we find x = 2x 2 = 2 α. Thus every vector in N(A 2I) is of the form ( ) 2 α α = α ( ) 2, so the eigenspace corresponding to the eigenvalue 2 is and any nonzero multiple of { α ( ) } 2 α R, ( ) 2 is an eigenvector corresponding to the eigenvalue 2. ),

4 7 CHAPTER 7. EIGENVALUES AND EIGENVECTORS Before we continue with another example you might want to have another look at the above calculations of eigenspaces. Observe that since we need to solve a homogeneous linear system there is no need to write down the right-most column of the augmented matrix (since it consists only of zeros); we simply perform elementary row operations on the coefficient matrix, keeping in mind that the right-most column of the augmented matrix will remain the zero column. We shall use this short-cut in all the following calculations of eigenspaces. Example 7.7. Let 2 A = 2. 2 Find the eigenvalues and corresponding eigenspaces. Solution. A slightly tedious calculation using repeated cofactor expansions shows that the characteristic polynomial of A is 2 λ det(a λi) = 2 λ 2 λ = λ(λ )2, so the eigenvalues of A are λ = and λ 2 =. In order to find the eigenspace corresponding to λ we find the nullspace of A λ I = A using Gaussian elimination: 2 A = 2, 2 so setting x = α we find x 2 = ( )x = α and x = ( )x = α. Thus, every vector in N(A) is of the form α α = α, α so the eigenspace corresponding to the eigenvalue is α α R. In order to find the eigenspace corresponding to λ 2 we find the nullspace of A λ 2 I = A I, again using Gaussian elimination: 2 A I = 2 =, 2 so setting x 2 = α and x = β we find x = x 2 x = α β. Thus every vector in N(A I) is of the form α β α = α + β, β

5 7.. DEFINITION AND EXAMPLES 7 and so the eigenspace corresponding to the eigenvalue is α + β α, β R. Example 7.8. Find the eigenvalues of the matrix 2 A = Solution. Using the fact that the determinant of a triangular matrix is the product of the diagonal entries we find λ 2 det(a λi) = 4 λ 5 = ( λ)(4 λ)(6 λ), 6 λ so the eigenvalues of A are, 4, and 6. The above example and its method of solution are easily generalised: Theorem 7.9. The eigenvalues of a triangular matrix are precisely the diagonal entries of the matrix. The next theorem gives an important sufficient (but not necessary) condition for two matrices to have the same eigenvalues. It also serves as the foundation for many numerical procedures to approximate eigenvalues of matrices, some of which you will encounter if you take the module MTH5, Introduction to Numerical Computing. Theorem 7.. Let A and B be two n n matrices and suppose that A and B are similar, that is, there is an invertible matrix S R n n such that B = S AS. Then A and B have the same characteristic polynomial, and, consequently, have the same eigenvalues. Proof. If B = S AS, then B λi = S AS λi = S AS λs S = S (AS λs) = S (A λi)s. Thus, using the multiplicativity of determinants, det(b λi) = det(s ) det(a λi) det(s) = det(a λi), because det(s ) det(s) = det(s S) = det(i) =. We will revisit this theorem from a different perspective in the next section.

6 72 CHAPTER 7. EIGENVALUES AND EIGENVECTORS 7.2 Diagonalisation In many applications of Linear Algebra one is faced with the following problem: given a square matrix A, find the k-th power A k of A for large values of k. In general, this can be a very time-consuming task. For certain matrices, however, evaluating powers is spectacularly easy: Example 7.. Let D R 2 2 be given by D = ( ) 2. Then and In general, for k. D 2 = ( ) ( ) 2 2 = ( ) ( ) 2 2 D = DD 2 2 = 2 = D k = ( ) 2 k k, ( ) ( ) 2. After having had another look at the example above, you should convince yourself that if D is a diagonal n n matrix with diagonal entries d,..., d n, then D k is the diagonal matrix whose diagonal entries are d k,..., d k n. The moral of this is that calculating powers for diagonal matrices is easy. What if the matrix is not diagonal? The next best situation arises if the matrix is similar to a diagonal matrix. In this case, calculating powers is almost as easy as calculating powers of diagonal matrices, as we shall see shortly. We shall now single out matrices with this property and give them a special name: Definition 7.2. An n n matrix A is said to be diagonalisable if it is similar to a diagonal matrix, that is, if there is an invertible matrix P R n n such that P AP = D, where D is a diagonal matrix. In this case we say that P diagonalises A. Note that if A is a matrix which is diagonalised by P, that is, P AP = D with D diagonal, then and in general A = P DP, A 2 = P DP P DP = P D 2 P, A = AA 2 = P DP P D 2 P = P D P, A k = P D k P, for any k. Thus powers of A are easily computed, as claimed. In the following, we list (without proof) a few useful theorems relating eigenvalues, eigenvectors, and the linear independence property: Theorem 7.. If v,..., v r are eigenvectors that correspond to distinct eigenvalues λ,..., λ r of an n n matrix A, then the vectors v,..., v r are linearly independent.

7 7.2. DIAGONALISATION 7 Theorem 7.4 (Diagonalisation Theorem). An n n matrix A is diagonalisable if and only if A has n linearly independent eigenvectors. In fact, P AP = D, with D a diagonal matrix, if and only if the columns of P are n linearly independent eigenvectors of A. In this case, the diagonal entries of D are eigenvalues of A that correspond, respectively, to the eigenvectors in P. The proofs are not difficult, but rather than doing that here we want to concentrate onto some practical examples: Example 7.5. Diagonalise the following matrix, if possible: 7 A = Solution. A slightly tedious calculation shows that the characteristic polynomial is given by 7 λ p(λ) = det(a λi) = 9 5 λ 9 5 λ = λ + λ 2 4. The cubic p above can be factored by spotting that is a root. Polynomial division then yields p(λ) = (λ + )(λ 2 4λ + 4) = (λ + )(λ 2) 2, so the distinct eigenvalues of A are 2 and. The usual methods (see Examples 7.6 and 7.7) now produce a basis for each of the two eigenspaces and it turns out that N(A 2I) = Span (v, v 2 ), where v =, v 2 =, N(A + I) = Span (v ), where v =. You may now want to confirm, using your favourite method, that the three vectors v, v 2, v are linearly independent. As we shall see shortly, this is not really necessary: the union of basis vectors for eigenspaces always produces linearly independent vectors (see the proof of Corollary 7.7 below). Thus, A is diagonalisable, since it has linearly independent eigenvectors. In order to find the diagonalising matrix P we recall that defining P = ( ) v v 2 v = does the trick, that is, P AP = D, where D is the diagonal matrix whose entries are the eigenvalues of A and where the order of the eigenvalues matches the order chosen for the eigenvectors in P, that is, 2 D = 2.

8 74 CHAPTER 7. EIGENVALUES AND EIGENVECTORS It is good practice to check that P and D really do the job they are supposed to do: AP = 9 5 = 6, P D = 2 = 6, 6 so AP = P D, and hence P AP = D as required. Example 7.6. Diagonalise the following matrix, if possible: 6 2 A = Solution. The characteristic polynomial of A turns out to be exactly the same as in the previous example: det(a λi) = λ + λ 2 4 = (λ + )(λ 2) 2. Thus the eigenvalues of A are 2 and. However, in this case it turns out that both eigenspaces are -dimensional: N(A 2I) = Span (v ) where v = 2, N(A + I) = Span (v 2 ) where v 2 =. Since A has only 2 linearly independent eigenvectors, the Diagonalisation Theorem implies that A is not diagonalisable. Put differently, the Diagonalisation Theorem states that a matrix A R n n is diagonalisable if and only if A has enough eigenvectors to form a basis of R n. The following corollary makes this restatement even more precise: Corollary 7.7. Let A R n n and let λ,..., λ r be the (distinct) eigenvalues of A. Then A is diagonalisable if and only if dim N(A λ I) + + dim N(A λ r I) = n. A very useful special case of the Diagonalisation Theorem is the following: Theorem 7.8. An n n matrix with n distinct eigenvalues is diagonalisable. Proof. Let v,..., v n be eigenvectors corresponding to the n distinct eigenvalues of A. Then the n vectors v,..., v n are linearly independent by Theorem 7.. Hence A is diagonalisable by the Diagonalisation Theorem. Remark 7.9. Note that the above condition for diagonalisability is sufficient but not necessary: an n n matrix which does not have n distinct eigenvalues may or may not be diagonalisable (see Examples 7.5 and 7.6).

9 7.. INTERLUDE: COMPLEX VECTOR SPACES AND MATRICES 75 Example 7.2. The matrix 5 A = 2 6 is diagonalisable, since it has three distinct eigenvalues, 2, and. 7. Interlude: complex vector spaces and matrices Consider the matrix A = ( ). What are the eigenvalues of A? Notice that det(a λi) = λ λ = λ2 +, so the characteristic polynomial does not have any real roots, and hence A does not have any real eigenvalues. However, since λ 2 + = λ 2 ( ) = λ i 2 = (λ i)(λ + i), the characteristic polynomial has two complex roots, namely i and i. Thus it makes sense to say that A has two complex eigenvalues i and i. What are the corresponding eigenvectors? Solving (A ii)x = leads to the system ix x 2 = x ix 2 = ( ) Both equations yield the condition x 2 = ix, so is an eigenvector corresponding to i the eigenvalue i. Indeed ( ) ( ) ( ) ( ) ( ) i i = = i i 2 = i. i Similarly, we see that ( ) is an eigenvector corresponding to the eigenvalue i. Indeed i ( ) ( ) i = ( ) i = ( ) i i 2 = i ( ). i The moral of this example is the following: on the one hand, we could just say that the matrix A has no real eigenvalues and stop the discussion right here. On the other hand, we just saw that it makes sense to say that A has two complex eigenvalues with corresponding complex eigenvectors. This leads to the idea of leaving our current real set-up, and enter a complex realm instead. As it turns out, this is an immensely powerful idea. However, as our time is limited, we shall only cover the bare necessities, allowing us to prove the main result of the next section.

10 76 CHAPTER 7. EIGENVALUES AND EIGENVECTORS Let C n denote the set of all n-vectors with complex entries, that is, z C n =. z,..., z n C. z n Just as in R n, we add vectors in C n by adding their entries, and we can multiply a vector in C n by a complex number, by multiplying each entry. Example 7.2. Let z, w C and α C, with + i 2 + i z = 2i, w = 2 + i, α = ( + 2i). Then ( + i) + ( 2 + i) + 4i z + w = 2i + = + 2i + (2 + i) 5 + i ( + 2i)( + i) + 2i + i + 2i 2 + i αz = ( + 2i)(2i) ( + 2i) = 2i + (2i) 2 + 6i = 4 + 2i + 6i If addition and scalar multiplication is defined in this way (now allowing scalars to be in C), then C n satisfies all the axioms of a vector space. Similarly, we can introduce the set of all m n matrices with complex entries, call it C m n, and define addition and scalar multiplication (again allowing complex scalars) entry-wise just as in R m n. Again, C m n satisfies all the axioms of a vector space. Fact All the results in Chapters 5, and all the results from the beginning of this chapter hold verbatim, if scalar is taken to mean complex number. Since scalars are now allowed to be complex numbers, C n and C m n are known as complex vector spaces. The reason for allowing this more general set-up is that, in a certain sense, complex numbers are much nicer than real numbers. More precisely, we have the following result: Theorem 7.2 (Fundamental Theorem of Algebra). If p is a complex polynomial of degree n, that is, p(z) = c n z n + + c z + c, where c, c,..., c n C, then p has at least one (possibly complex) root. Corollary Every matrix A C n n has at least one (possibly complex) eigenvalue and a corresponding eigenvector z C n. Proof. Since λ is an eigenvalue of A if and only if det(a λi) = and since p(λ) = det(a λi) is a polynomial with complex coefficients of degree n, the assertion follows from the Fundamental Theorem of Algebra. The corollary above is the main reason why complex vector spaces are considered. We are guaranteed that every matrix has at least one eigenvalue, and we may then use the powerful tools developed in the earlier parts of this chapter to analyse matrices through their eigenvalues and eigenvectors.

11 7.4. SPECTRAL THEOREM FOR SYMMETRIC MATRICES Spectral Theorem for Symmetric Matrices This last section of the last chapter is devoted to one of the gems of Linear Algebra: the Spectral Theorem. This result, which has many applications, a number of which you will see in other modules, is concerned with the diagonalisability of symmetric matrices. Recall that a matrix A R n n is said to be diagonalisable if there is an invertible matrix P R n n such that P AP is diagonal. We already know that A is diagonalisable if and only if A has n linearly independent eigenvectors. However, this condition is difficult to check in practice. It may thus come as a surprise that there is a sufficiently rich class of matrices that are always diagonalisable, and moreover, that the diagonalising matrix P is of a special form. This is the content of the Spectral Theorem for Symmetric Matrices, or Spectral Theorem for short: Theorem 7.25 (Spectral Theorem for Symmetric Matrices). Let A R n n be symmetric. Then there is an orthogonal matrix Q R n n such that Q T AQ = D, where D R n n is diagonal. Or put differently: every symmetric matrix can be diagonalised by an orthogonal matrix. Reminder: A is symmetric means A T = A. Q is orthogonal means Q T Q = I. The proof of the above Theorem is omitted here. Rather, we end this course on Linear Algebra with an important Corollary The eigenvalues of a symmetric matrix A are real, and eigenvectors corresponding to distinct eigenvalues are orthogonal. Example Consider the symmetric matrix 2 A = Find an orthogonal matrix Q that diagonalises A. Solution. The characteristic polynomial of A is det(a λi) = λ + λ 2 + 9λ + 5 = ( + λ) 2 (5 λ), so the eigenvalues of A are and 5. Computing N(A + I) in the usual way shows that {x, x } is a basis for N(A + I) where 2 x =, x 2 =. Similarly, we find that the eigenspace N(A 5I) corresponding to the eigenvalue 5 is - dimensional with basis x = 2. There are other, more general versions of the Spectral Theorem. In this course, we will only consider the symmetric case.

12 78 CHAPTER 7. EIGENVALUES AND EIGENVECTORS In order to construct the diagonalising orthogonal matrix for A it suffices to find orthonormal bases for each of the eigenspaces, since, by the previous corollary, eigenvectors corresponding to distinct eigenvalues are orthogonal. In order to find an orthonormal basis for N(A + I) we apply the Gram Schmidt process to the basis {x, x 2 } to produce the orthogonal set {v, v 2 }: v = x =, v 2 = x 2 x 2 v v v v =. Now {v, v 2, x } is an orthogonal basis of R consisting of eigenvectors of A, so normalising them to produce u = v v = / 2 /, u 2 = / v 2 2 v 2 = / /, u = x x = allows us to write down the orthogonal matrix Q = ( ) / 2 / / 6 u u 2 u = / 2/ 6 / 2 / / 6 / 6 2/ 6 /, 6 which diagonalises A, that is, Q T AQ =. 5

### Diagonalisation. Chapter 3. Introduction. Eigenvalues and eigenvectors. Reading. Definitions

Chapter 3 Diagonalisation Eigenvalues and eigenvectors, diagonalisation of a matrix, orthogonal diagonalisation fo symmetric matrices Reading As in the previous chapter, there is no specific essential

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

### Orthogonal Diagonalization of Symmetric Matrices

MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### Section 2.1. Section 2.2. Exercise 6: We have to compute the product AB in two ways, where , B =. 2 1 3 5 A =

Section 2.1 Exercise 6: We have to compute the product AB in two ways, where 4 2 A = 3 0 1 3, B =. 2 1 3 5 Solution 1. Let b 1 = (1, 2) and b 2 = (3, 1) be the columns of B. Then Ab 1 = (0, 3, 13) and

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### Chapter 6. Orthogonality

6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

### Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

### 1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

### Solution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.

Solutions to Math 30 Take-home prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)

### Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

### LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

### 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each)

Math 33 AH : Solution to the Final Exam Honors Linear Algebra and Applications 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each) (1) If A is an invertible

### MATH 551 - APPLIED MATRIX THEORY

MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### 4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Determinants. Dr. Doreen De Leon Math 152, Fall 2015

Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.

### INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL

SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics

### MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### MA 242 LINEAR ALGEBRA C1, Solutions to Second Midterm Exam

MA 4 LINEAR ALGEBRA C, Solutions to Second Midterm Exam Prof. Nikola Popovic, November 9, 6, 9:3am - :5am Problem (5 points). Let the matrix A be given by 5 6 5 4 5 (a) Find the inverse A of A, if it exists.

### University of Lille I PC first year list of exercises n 7. Review

University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients

### MAT 242 Test 2 SOLUTIONS, FORM T

MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these

### 1 Determinants. Definition 1

Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described

### Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that

0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c

### (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### NOTES on LINEAR ALGEBRA 1

School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura

### Eigenvalues and eigenvectors of a matrix

Eigenvalues and eigenvectors of a matrix Definition: If A is an n n matrix and there exists a real number λ and a non-zero column vector V such that AV = λv then λ is called an eigenvalue of A and V is

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Examination paper for TMA4115 Matematikk 3

Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99

### Methods for Finding Bases

Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

### (January 14, 2009) End k (V ) End k (V/W )

(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.

### Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

### Solution based on matrix technique Rewrite. ) = 8x 2 1 4x 1x 2 + 5x x1 2x 2 2x 1 + 5x 2

8.2 Quadratic Forms Example 1 Consider the function q(x 1, x 2 ) = 8x 2 1 4x 1x 2 + 5x 2 2 Determine whether q(0, 0) is the global minimum. Solution based on matrix technique Rewrite q( x1 x 2 = x1 ) =

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### 1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

### Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible:

Cramer s Rule and the Adjugate Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible: Theorem [Cramer s Rule] If A is an invertible

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

### Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.

ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?

### MATH10212 Linear Algebra B Homework 7

MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### [1] Diagonal factorization

8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:

### Lecture 11. Shuanglin Shao. October 2nd and 7th, 2013

Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous

### 4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows

### Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true

### Solutions to Math 51 First Exam January 29, 2015

Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

### 2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors

2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the

### Recall that two vectors in are perpendicular or orthogonal provided that their dot

Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal

### 8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### Presentation 3: Eigenvalues and Eigenvectors of a Matrix

Colleen Kirksey, Beth Van Schoyck, Dennis Bowers MATH 280: Problem Solving November 18, 2011 Presentation 3: Eigenvalues and Eigenvectors of a Matrix Order of Presentation: 1. Definitions of Eigenvalues

### 10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES

55 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 we saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c n n c n n...

### ( % . This matrix consists of \$ 4 5 " 5' the coefficients of the variables as they appear in the original system. The augmented 3 " 2 2 # 2 " 3 4&

Matrices define matrix We will use matrices to help us solve systems of equations. A matrix is a rectangular array of numbers enclosed in parentheses or brackets. In linear algebra, matrices are important

### Inverses. Stephen Boyd. EE103 Stanford University. October 27, 2015

Inverses Stephen Boyd EE103 Stanford University October 27, 2015 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### 2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

### Sergei Silvestrov, Christopher Engström, Karl Lundengård, Johan Richter, Jonas Österberg. November 13, 2014

Sergei Silvestrov,, Karl Lundengård, Johan Richter, Jonas Österberg November 13, 2014 Analysis Todays lecture: Course overview. Repetition of matrices elementary operations. Repetition of solvability of

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### CHARACTERISTIC ROOTS AND VECTORS

CHARACTERISTIC ROOTS AND VECTORS 1 DEFINITION OF CHARACTERISTIC ROOTS AND VECTORS 11 Statement of the characteristic root problem Find values of a scalar λ for which there exist vectors x 0 satisfying

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,

### WHICH LINEAR-FRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE?

WHICH LINEAR-FRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE? JOEL H. SHAPIRO Abstract. These notes supplement the discussion of linear fractional mappings presented in a beginning graduate course

### Iterative Methods for Computing Eigenvalues and Eigenvectors

The Waterloo Mathematics Review 9 Iterative Methods for Computing Eigenvalues and Eigenvectors Maysum Panju University of Waterloo mhpanju@math.uwaterloo.ca Abstract: We examine some numerical iterative

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### University of Ottawa

University of Ottawa Department of Mathematics and Statistics MAT 1302A: Mathematical Methods II Instructor: Alistair Savage Final Exam April 2013 Surname First Name Student # Seat # Instructions: (a)

### Sec 4.1 Vector Spaces and Subspaces

Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common

### Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

### Linear Least Squares

Linear Least Squares Suppose we are given a set of data points {(x i,f i )}, i = 1,...,n. These could be measurements from an experiment or obtained simply by evaluating a function at some points. One

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Inverses and powers: Rules of Matrix Arithmetic

Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3

### Eigenvalues and Eigenvectors

Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

### Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone

### These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### Unit 18 Determinants

Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of

### Solutions to Linear Algebra Practice Problems 1. form (because the leading 1 in the third row is not to the right of the

Solutions to Linear Algebra Practice Problems. Determine which of the following augmented matrices are in row echelon from, row reduced echelon form or neither. Also determine which variables are free

### NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

### A matrix over a field F is a rectangular array of elements from F. The symbol

Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted

### Lecture 4: Partitioned Matrices and Determinants

Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying

### 160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results

### Matrix Inverse and Determinants

DM554 Linear and Integer Programming Lecture 5 and Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1 2 3 4 and Cramer s rule 2 Outline 1 2 3 4 and

### 2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

### Problems for Advanced Linear Algebra Fall 2012

Problems for Advanced Linear Algebra Fall 2012 Class will be structured around students presenting complete solutions to the problems in this handout. Please only agree to come to the board when you are