Eigenvalues and Eigenvectors


 Conrad Sutton
 11 months ago
 Views:
Transcription
1 LECTURE 3 Eigenvalues and Eigenvectors Definition 3.. Let A be an n n matrix. The eigenvalueeigenvector problem for A is the problem of finding numbers λ and vectors v R 3 such that Av = λv. If λ, v are solutions of a eigenvectoreigenvalue problem then the vector v is called an eigenvector of A and λ is called an eigenvalue of A. Remark 3.2. Because eigenvectors and eigenvalues always come in pairs (λ, v) one often uses language like λ is the eigenvalue of the vector v or v is an eigenvector of A with eigenvalue λ. Note that the multiplication on the left hand side is matrix multiplication (complicated) while the multiplication on the right hand side is scalar multiplication (easy). Thus, one way of thinking about the eigenvectoreigenvalue problem is that, when a solution is found we can simplify matrix multiplication. I remark that so doing, we ll also get a better idea of what is actually going on in many problems.. Motivating Examples.. Rotations and Axes of Rotation. Suppose R is a 3 3 matrix with the property that its transpose equals its inverse: R t = R Such a matrix will define a linear transformation T R : R 3 R 3 that preserves the lengths of vectors. For, since x 2 = x t x = [ x x x 2 x 3 x 2 = (x ) 2 + (x 2 ) 2 + (x 3 ) 2 x 3 if we set we ll have T R (x) = Rx Rx 2 = (Rx) t (Rx) = x t R t Rx = x t R Rx = x t x We call such matrices rotation matrices, because these are exactly the 3 3 matrices that implement rotations on 3dimensional vectors. Now one property of rotations is that they always have an axis of rotation: meaning there is always one line in R 3 that is left undisturbed by the rotation. We note, for example, that in the case of the planet Earth, the line that that passes through the north and south poles is unaffected by its daily rotation. Given an arbitary rotation matrix R, one can thus ask: How to figure out its axis of rotation?. Well, the condition we d want is that Rx = () x That is, we d want to find an eigenvector x of R with eigenvalue. Once we find such a vector, then we ll have the corresponding axis of rotation.
2 . MOTIVATING EXAMPLES 2 Example 3.3. Consider the following linear transformation T : R 3 R 3 : The corresponding matrix is T ([x, y, z) = [x, y cos(θ) + z sin (θ), y sin(θ) + z cos(θ) A T = cos(θ) sin(θ) sin(θ) cos (θ) This transformation corresponds to a rotation about the xaxis by θ. Question 3.4. What vectors in R 3 are unaffected by this transformation? This question is equivalent to solving the linear system (3.) A T x = x or or (A T I) x = cos(θ) sin(θ) sin(θ) cos (θ) Rowreducing the matrix on the lefthand side yields sin(θ) cos(θ) 2 cos(θ) sin(θ)) x y z = x is arbitrary y = z = In other words, the transformation T leaves the points along the xaxis unaffected, and only those points remain unaffected by the transformation. Perhaps the preceding example is so simpleminded that the importance of the eigenvectoreigenvalue problem is obfuscated; surely a rotation about the zaxis will leave points along the zaxis fixed. However, consider the linear transformation T : R 3 R 3 that combines a rotation about zaxis with a rotation about the xaxis: x cos θ sin θ x T : y cos φ sin φ sin θ cos θ y z sin φ cos φ z = (cos θ) x + (sin θ) y (cos φ sin θ) x + (cos φ cos θ) y + (sin φ) z (sin φ sin θ) x (sin φ cos θ) y + (cos φ) z This is in fact another rotation; but which rotation? What is the axis of rotation? The answer to this question can be found by solving i.e, by solving an eigenvectoreigenvalue problem. T x = ()x Example 3.5. Let C (R) denote the vector space of smooth (infinitely differentiable) functions on the real line. Consider the transformation D : C (R) C (R) defined by D[f = df dx It is easy to see that this is a linear transformation (it preserves scalar multiplication and vector addition in C (R)). We can associate with D an infinite matrix (employing simple monomials in x, {, x, x 2, x 3,... }
3 2. COMPUTING EIGENVALUES 3 as a standard basis for C (R)): D [ = D [x = D [ x 2 = 2x D [ x 3 = 3x 2 Solution of a differential equation of the form. 2 A D = df dx = λf is then equivalent to a linear system of the form (3.2) A D f = λf Note the similarity of this equation with (3.). In terms of these new semantics, the first example shows that the vectors along the xaxis are eigenvectors of the linear transformation T with eigenvalues ; and the second example shows that the solution of a differential equation can be thought of as a problem of finding an eigenvector for a linear transformation on the vector space of smooth functions on R. 2. Computing Eigenvalues For a given n n matrix A, the eigenvalue problem is the problem of finding the eigenvalues and eigenvectors of A. Our abstract machinery now plays a crucial role. Before finding a solution v of (3.3) Av = λv, λ R we first ask, when do nontrivial solutions exist? First we rewrite (3.3) as or Av λv = (A λi) v = Now recall that demanding that the existence of nonzero solutions to linear system Bx = is equivalent to demanding that the null space of B is at least dimensional, which is equivalent to saying that when B is rowreduced to rowechelon form there is at least one row full of zeros, which implies det (B) =. Thus, we arrive at the following criteria for the existence of eigenvectors and eigenvalues.
4 2. COMPUTING EIGENVALUES 4 Assertion 3.. If nontrivial solutions of Av = λv exist then det (A λi) =. Example 3.6. Find the possible eigenvalues of the matrix [ 3 2 A = 2 If A is to have eigenvalues, then we must have [ 3 λ 2 = det (A λi) = det = (3 λ) ( λ) 4 = λ 2 3λ 4 = (λ 4) (λ + ) 2 λ Hence, the possible eigenvalues are 4 and. This simple example actually serves as the prototype for the general case: To find the eigenvalues of an n n matrix A : Fact 3.7. () Compute the determinant of the matrix H = A λi, regarding λ as a symbolic variable. (2) det (A λi) will be a polynomial P A (λ) of degree n in λ. We shall call this polynomial the characteristic polynomial of A. (3) Solve P A (λ) =. The roots of this equation will be the possible eigenvalues of A. At this point it is worthwhile to recall the Fundamental Theorem of Algebra. Theorem 3.8. Every polynomial p(λ) of degree n has a unique factorization in terms of linear polynomials: p(λ) = c (λ r ) m (λ r 2 ) m2 (λ r s ) ms where r r 2 r s, and s i= m i = n. The numbers r i are, in general, complex numbers and are called the roots of p(x); they coincide precisely with the solutions of p(λ) =. The integers m i are called the multiplicities of the corresponding roots. This theorem tells us that the eigenvalues of a matrix can be complex numbers (in fact, this is what one must expect in general), and that they may occur with some multiplicity. The multiplicity of an eigenvalue will be very relevant to the problem of diagonalizing matrices (which we will take up in the next lecture). Example 3.9. Find the possible eigenvalues of We have The characteristic polynomial is thus A = [ 2 2 [ λ 2 det (A λi) = det 2 λ Thus, the possible eigenvalues are λ = ±2i. = λ P A (λ) = λ = (λ + 2i) (λ 2i) Example 3.. Find the possible eigenvalues of A = 2 2
5 3. COMPUTATION OF EIGENVECTORS 5 We have det (A λi) = det = ( λ) det λ 2 λ 2 λ [ λ λ = λ ( λ) ( + λ) + (2)( λ) = 3λ λ 3 2 = (2 + λ) (λ ) 2 [ 2 () det 2 λ [ 2 λ + () det 2 We thus see that A has two possible eigenvalues, λ = 2 and λ =. The eigenvalue λ = occurs with multiplicity Computation of Eigenvectors In finding the eigenvalues of a matrix, all we have accomplished is figuring out for what values of λ (3.4) Av = λv can have a solution. I will now show you how to find the corresponding eigenvectors v. This is very straightforward given our recent discussion of homogeneous linear systems. For finding vectors v such that equation (3.4) is satisfied is equivalent to finding solutions of (A λi) x = Let s do a quick example. Example 3.. Find the eigenvectors of A = [ In the first example, we discovered that the possible eigenvalues for this matrix are λ = 4,. Let s consider first the solution of (3.5) (A 4I) x = (which should be an eigenvector of A corresponding to the eigenvalue λ = 4). We have [ [ A 4I = = This matrix row reduces to [ 2 And so the solutions of (3.5) coincide with solutions of x 2x 2 = = Thus, any vector of the form x = 2x 2 x = [ 2 v = r [ 2x2 x 2 = x 2 [ 2, r R, x 2 R will be an eigenvector of A with eigenvalue 4. Now let s look for eigenvectors corresponding to the eigenvalue. We thus look for solutions of (3.6) (A + I) x =
6 3. COMPUTATION OF EIGENVECTORS 6 We have which is rowequivalent to A + I = [ [ 2 = So the solutions of (3.6) coincide with the solutions of 2x + x 2 = = [ x = 2 x 2 x = x 2 [ 2 So the corresponding eigenvectors will be vectors of the form [ v = r 2 Example 3.2. Find the eigenvectors of A = 2 2 Recall from Example 5.9 that the characteristic polynomial for this matrix factorizes as P A (λ) = (2 + λ) (λ ) 2 and so we have two possible eigenvalues: λ = 2 with multiplicity, and λ = with multiplicity 2. Let s look first for eigenvectors corresponding to the eigenvalue λ = 2. We have 2 2 A ( 2)I = 2 3 row reduction and so the solutions x of (A + 2I) x = satisfy 2x + x 3 = 3x 2 + 2x 3 = = x = 2 x x 3 x 3 span So the eigenvectors of A corresponding to the eigenvalue 2 are scalar multiples of the vector [ 2, 2 3,. We ll now repeat the calculation for the double root λ =. We have A ()I = 2 row reduction 2 2 and so the solutions x of (A I) x = satisfy x = x 3 = = x = x 2 So the eigenvectors of A corresponding to the eigenvalue are scalar multiples of the vector [,,.
7 5. TWO KINDS OF EIGENVALUE MULTIPLICITIES 7 4. Eigenspaces Definition 3.3. Let A be an n n matrix and suppose r R is an eigenvalue of A. The reigenspace of A is the subset {v R n Av = rv} Lemma 3.4. Let A be an n n matrix and suppose r R is an eigenvalue of A. The reigenspace of A is a subspace of R n. Proof. This can be seen two ways. First of all, suppose r is an eigenvalue of A and v, v 2 lie in reigenspace of A. Then Av = rv and Av 2 = rv 2 and so A (v + v 2 ) = Av + Av 2 = rv + rv 2 = r (v + v 2 ) Thus, v + v 2 is also in the reigenspace of A. We also have A (cv ) = cav = crv = r (cv ) Since the reigenspace of A is closed under both vector addition and scalar multiplication, it is a subspace. Even more easily, v reigenspace of A Av = rv v is a solution of (A ri) x = So reigenspace of A = NullSp (A ri) = a subspace of R n 5. Two Kinds of Eigenvalue Multiplicities Here I want to introduce some nomenclature that will become important latter. Suppose r is an eigenvalue of an n n matrix A. This means that λ = r is a root of det (A λi) = We call the right hand side of this equation the characterist polynomial of A and we shall denote by p A (λ). Thus, p A (λ) det (A λi) Since r is a root of p A (λ) =, it follows from the Fundamental Theorem of Algebra that (λ r) is a factor of p A (λ). In fact, one has Lemma 3.5. If r is a eigenvalue of an n n matrix A, there is an integer m such that p A (λ) = (λ r) m Q (λ) with Q (λ) a polynomial of degree n m such that Q (r). We call the integer m in the lemma, the algebraic multiplicity of the eigenvalue r. Suppose again that r is an eigenvalue of an n n matrix A. The dimension of the reigenspace of A is the geometric multiplicity of the eigenvalue r.
8 5. TWO KINDS OF EIGENVALUE MULTIPLICITIES 8 Example 3.6. Consider the matrix A = find the eigenvalues of A and their algebraic and geometric multiplicities. Well first, let s find the eigenvalues of A. It s characteristic polynomial is 3 λ p A (λ) = det (A λi) = det 3 λ 2 λ Since the matrix A λi is already in Row Echelon Form, its determinant is just the product of its diagonal elements. Thus, p A (λ) = (3 λ) 2 (2 λ) From this we see that λ = 3 is an eigenvalue with algebraic multiplicity 2 and λ = 2 is an eigenvalue with algebraic multiplicity. To determine the geometric muliplicities we need to determine the dimension of the corresponding eigenspaces. λ = 3 eigenspace. The 3eigespace is the null space of A 3I = Rowreducing this matrix (pretty easily) we get 3eigenspace = N ullsp = solutions set of = span { x2 = x 3 = Since we have one basis vector the dimension of the 3eigenspace is. multiplicity of λ = 3 is. (Recall its algebraic multiplicity was 2.) λ = 2 eigenspace The 2eigenspace is the solution set of (A 2I) x =. We have (A 2I) = row reduces to and so the null space is corresponds to solutions of x = x = = x x 2 = 3 x 3 Since we have one basis vector, multiplicity of the eigenvalue λ = 2 is. span Thus, the geometric, the 2eigenspace is dimensional. Hence, the geometric Remark 3.7. Actually, to determine the geometric multiplicity of an eigenvalue r all we really had to do is rowreduce A ri to row echelong form and count the number of columns without pivots  that would give the dimension of NullSp (A ri) which is the same thing is the geometric multiplicity of the eigenvalue r.
Calculating 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 informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationSummer Session Practice Final Exam
Math 2F Summer Session 25 Practice Final Exam Time Limit: Hours Name (Print): Teaching Assistant This exam contains pages (including this cover page) and 9 problems. Check to see if any pages are missing.
More informationAbstract Vector Spaces and Concrete Examples
LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.
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 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 information(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.
1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III
More informationMAT 1302B Mathematical Methods II
MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture
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 informationLECTURES 14/15: LINEAR INDEPENDENCE AND BASES
LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors
More informationLecture Notes: Eigenvalues and Eigenvectors. 1 Definitions. 2 Finding All Eigenvalues
Lecture Notes: Eigenvalues and Eigenvectors Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Definitions Let A be an n n matrix. If there
More informationLinear Algebra Final Exam Review
Linear Algebra Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
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 informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
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 informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationMatrices and Linear transformations
Matrices and Linear transformations We have been thinking of matrices in connection with solutions to linear systems of equations like Ax = b. It is time to broaden our horizons a bit and start thinking
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(i) [7 points] Compute the determinant of the following matrix using cofactor expansion.
Question (i) 7 points] Compute the determinant of the following matrix using cofactor expansion 2 4 2 4 2 Solution: Expand down the second column, since it has the most zeros We get 2 4 determinant = +det
More informationLinear Algebra Final Exam Study Guide Solutions Fall 2012
. Let A = Given that v = 7 7 67 5 75 78 Linear Algebra Final Exam Study Guide Solutions Fall 5 explain why it is not possible to diagonalize A. is an eigenvector for A and λ = is an eigenvalue for A diagonalize
More informationDiagonalization of Matrices
LECTURE 4 Diagonalization of Matrices Recall that a diagonal matrix is a square n n matrix with nonzero entries only along the diagonal from the upper left to the lower right (the main diagonal) Diagonal
More informationSpan and Linear Independence
Span and Linear Independence It is common to confuse span and linear independence, because although they are different concepts, they are related. To see their relationship, let s revisit the previous
More informationMATH 310, REVIEW SHEET 2
MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,
More informationLinear vector spaces and subspaces.
Math 2051 W2008 Margo Kondratieva Week 1 Linear vector spaces and subspaces. Section 1.1 The notion of a linear vector space. For the purpose of these notes we regard (m 1)matrices as mdimensional vectors,
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
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 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 information1 Last time: leastsquares problems
MATH Linear algebra (Fall 07) Lecture Last time: leastsquares problems Definition. If A is an m n matrix and b R m, then a leastsquares solution to the linear system Ax = b is a vector x R n such that
More informationEigenvectors and Hermitian Operators
7 71 Eigenvalues and Eigenvectors Basic Definitions Let L be a linear operator on some given vector space V A scalar λ and a nonzero vector v are referred to, respectively, as an eigenvalue and corresponding
More informationMatrices related to linear transformations
Math 4326 Fall 207 Matrices related to linear transformations We have encountered several ways in which matrices relate to linear transformations. In this note, I summarize the important facts and formulas
More informationEigenvalues and Eigenvectors. Review: Invertibility. Eigenvalues and Eigenvectors. The Finite Dimensional Case. January 18, 2018
January 18, 2018 Contents 1 2 3 4 Review 1 We looked at general determinant functions proved that they are all multiples of a special one, called det f (A) = f (I n ) det A. Review 1 We looked at general
More information5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.
Linear Algebra  Test File  Spring Test # For problems  consider the following system of equations. x + y  z = x + y + 4z = x + y + 6z =.) Solve the system without using your calculator..) Find the
More informationTopic 14 Notes Jeremy Orloff
Topic 4 Notes Jeremy Orloff 4 Row reduction and subspaces 4. Goals. Be able to put a matrix into row reduced echelon form (RREF) using elementary row operations.. Know the definitions of null and column
More informationMath Linear Algebra Final Exam Review Sheet
Math 151 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a componentwise operation. Two vectors v and w may be added together as long as they contain the same number n of
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 information1 9/5 Matrices, vectors, and their applications
1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric
More informationLecture 11: Eigenvalues and Eigenvectors
Lecture : Eigenvalues and Eigenvectors De nition.. Let A be a square matrix (or linear transformation). A number λ is called an eigenvalue of A if there exists a nonzero vector u such that A u λ u. ()
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationChapter 8. Rigid transformations
Chapter 8. Rigid transformations We are about to start drawing figures in 3D. There are no builtin routines for this purpose in PostScript, and we shall have to start more or less from scratch in extending
More information1 Invariant subspaces
MATH 2040 Linear Algebra II Lecture Notes by Martin Li Lecture 8 Eigenvalues, eigenvectors and invariant subspaces 1 In previous lectures we have studied linear maps T : V W from a vector space V to another
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 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 informationSolving 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
More informationVolume in n Dimensions
Volume in n Dimensions MA 305 Kurt Bryan Introduction You ve seen that if we have two vectors v and w in two dimensions then the area spanned by these vectors can be computed as v w = v 1 w 2 v 2 w 1 (where
More informationInstructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.
Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.. Recall that P 3 denotes the vector space of polynomials of degree less
More informationProperties of Transformations
6.  6.4 Properties of Transformations P. Danziger Transformations from R n R m. General Transformations A general transformation maps vectors in R n to vectors in R m. We write T : R n R m to indicate
More informationMATH 304 Linear Algebra Lecture 20: The GramSchmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The GramSchmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationA matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and
Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.
More informationMatrices and Deformation
ES 111 Mathematical Methods in the Earth Sciences Matrices and Deformation Lecture Outline 13  Thurs 9th Nov 2017 Strain Ellipse and Eigenvectors One way of thinking about a matrix is that it operates
More informationMath 3013 Problem Set 4
(e) W = {x, 3x, 4x 3, 5x 4 x i R} in R 4 Math 33 Problem Set 4 Problems from.6 (pgs. 99 of text):,3,5,7,9,,7,9,,35,37,38. (Problems,3,4,7,9 in text). Determine whether the indicated subset is a subspace
More informationMAT 242 CHAPTER 4: SUBSPACES OF R n
MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationLecture 10: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11)
Lecture 1: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11) The eigenvalue problem, Ax= λ x, occurs in many, many contexts: classical mechanics, quantum mechanics, optics 22 Eigenvectors and
More informationDot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.
Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................
More informationEIGENVALUES AND EIGENVECTORS
EIGENVALUES AND EIGENVECTORS Diagonalizable linear transformations and matrices Recall, a matrix, D, is diagonal if it is square and the only nonzero entries are on the diagonal This is equivalent to
More information3  Vector Spaces Definition vector space linear space u, v,
3  Vector Spaces Vectors in R and R 3 are essentially matrices. They can be vieed either as column vectors (matrices of size and 3, respectively) or ro vectors ( and 3 matrices). The addition and scalar
More informationTotal Angular Momentum for Hydrogen
Physics 4 Lecture 7 Total Angular Momentum for Hydrogen Lecture 7 Physics 4 Quantum Mechanics I Friday, April th, 008 We have the Hydrogen Hamiltonian for central potential φ(r), we can write: H r = p
More informationFact: Every matrix transformation is a linear transformation, and vice versa.
Linear Transformations Definition: A transformation (or mapping) T is linear if: (i) T (u + v) = T (u) + T (v) for all u, v in the domain of T ; (ii) T (cu) = ct (u) for all scalars c and all u in the
More information1 Matrices and Systems of Linear Equations
March 3, 203 66. Systems of Linear Equations Matrices and Systems of Linear Equations An m n matrix is an array A = a ij of the form a a n a 2 a 2n... a m a mn where each a ij is a real or complex number.
More informationMATH 369 Linear Algebra
Assignment # Problem # A father and his two sons are together 00 years old. The father is twice as old as his older son and 30 years older than his younger son. How old is each person? Problem # 2 Determine
More informationElements of linear algebra
Elements of linear algebra Elements of linear algebra A vector space S is a set (numbers, vectors, functions) which has addition and scalar multiplication defined, so that the linear combination c 1 v
More informationGeneralized eigenvector  Wikipedia, the free encyclopedia
1 of 30 18/03/2013 20:00 Generalized eigenvector From Wikipedia, the free encyclopedia In linear algebra, for a matrix A, there may not always exist a full set of linearly independent eigenvectors that
More informationMath 20F Practice Final Solutions. Jorel Briones
Math 2F Practice Final Solutions Jorel Briones Jorel Briones / Math 2F Practice Problems for Final Page 2 of 6 NOTE: For the solutions to these problems, I skip all the row reduction calculations. Please
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 informationMAT1302F Mathematical Methods II Lecture 19
MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly
More informationLinear Algebra: Sample Questions for Exam 2
Linear Algebra: Sample Questions for Exam 2 Instructions: This is not a comprehensive review: there are concepts you need to know that are not included. Be sure you study all the sections of the book and
More informationftuiowamath2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST
me me ftuiowamath255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following
More informationMath 396. An application of GramSchmidt to prove connectedness
Math 396. An application of GramSchmidt to prove connectedness 1. Motivation and background Let V be an ndimensional vector space over R, and define GL(V ) to be the set of invertible linear maps V V
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
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 informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
More informationLECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]
LECTURE VII: THE JORDAN CANONICAL FORM MAT 204  FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue
More informationVector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.
Vector Spaces Definition: The usual addition and scalar multiplication of ntuples x = (x 1,..., x n ) R n (also called vectors) are the addition and scalar multiplication operations defined componentwise:
More informationVector Spaces and Subspaces
Vector Spaces and Subspaces Our investigation of solutions to systems of linear equations has illustrated the importance of the concept of a vector in a Euclidean space. We take time now to explore the
More information(c)
1. Find the reduced echelon form of the matrix 1 1 5 1 8 5. 1 1 1 (a) 3 1 3 0 1 3 1 (b) 0 0 1 (c) 3 0 0 1 0 (d) 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 (e) 1 0 5 0 0 1 3 0 0 0 0 Solution. 1 1 1 1 1 1 1 1
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 informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More information80 min. 65 points in total. The raw score will be normalized according to the course policy to count into the final score.
This is a closed book, closed notes exam You need to justify every one of your answers unless you are asked not to do so Completely correct answers given without justification will receive little credit
More informationOn the mathematical background of Google PageRank algorithm
Working Paper Series Department of Economics University of Verona On the mathematical background of Google PageRank algorithm Alberto Peretti, Alberto Roveda WP Number: 25 December 2014 ISSN: 20362919
More informationSUMMARY OF MATH 1600
SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You
More informationNotes on multivariable calculus
Notes on multivariable calculus Jonathan Wise February 2, 2010 1 Review of trigonometry Trigonometry is essentially the study of the relationship between polar coordinates and Cartesian coordinates in
More informationChoose three of: Choose three of: Choose three of:
MATH Final Exam (Version ) Solutions July 8, 8 S. F. Ellermeyer Name Instructions. Remember to include all important details of your work. You will not get full credit (or perhaps even any partial credit)
More informationContents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124
Matrices Math 220 Copyright 2016 Pinaki Das This document is freely redistributable under the terms of the GNU Free Documentation License For more information, visit http://wwwgnuorg/copyleft/fdlhtml Contents
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More informationLecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)
Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations
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 informationLinear Algebra Using MATLAB
Linear Algebra Using MATLAB MATH 5331 1 May 12, 2010 1 Selected material from the text Linear Algebra and Differential Equations Using MATLAB by Martin Golubitsky and Michael Dellnitz Contents 1 Preliminaries
More informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More informationChapter 7. Linear Algebra: Matrices, Vectors,
Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.
More informationLinear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016
Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.3 VECTOR EQUATIONS VECTOR EQUATIONS Vectors in 2 A matrix with only one column is called a column vector, or simply a vector. An example of a vector with two entries
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible 
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More informationNOTES ON VECTORS, PLANES, AND LINES
NOTES ON VECTORS, PLANES, AND LINES DAVID BEN MCREYNOLDS 1. Vectors I assume that the reader is familiar with the basic notion of a vector. The important feature of the vector is that it has a magnitude
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationInformation About Ellipses
Information About Ellipses David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationav 1 x 2 + 4y 2 + xy + 4z 2 = 16.
74 85 Eigenanalysis The subject of eigenanalysis seeks to find a coordinate system, in which the solution to an applied problem has a simple expression Therefore, eigenanalysis might be called the method
More informationRoberto s Notes on Linear Algebra Chapter 10: Eigenvalues and diagonalization Section 3. Diagonal matrices
Roberto s Notes on Linear Algebra Chapter 10: Eigenvalues and diagonalization Section 3 Diagonal matrices What you need to know already: Basic definition, properties and operations of matrix. What you
More information