MATH 110: LINEAR ALGEBRA PRACTICE FINAL SOLUTIONS
|
|
- Marion Dickerson
- 5 years ago
- Views:
Transcription
1 MATH 110: LINEAR ALGEBRA PRACTICE FINAL SOLUTIONS Question 1. (1) Write f(x) =a m x m + a m 1 x m a 0.ThenF = f(t )=a m T m + a m 1 T m 1 + +a 0 I.SinceTis upper triangular, (T k ) ii = Tii k for all positive k and i {1,...,n}. Hence F ii = a m Tii m + a m 1 T m 1 ii + + a 0 = f(t ii ). (2) TF = Tf(T )=T(a m T m +a m 1 T m 1 + +a 0 I)=a m T m+1 +a m 1 T m + +a 0 T = (a m T m + a m 1 T m a 0 I)T = f(t )T = FT. (3) Since T is upper triangular, so is each power of T, and hence so is F = f(t ). Therefore, T ij =0andF ij = 0whenever i>j. Hence and (FT) i,i+1 = (TF) i,i+1 = i+1 F ik T k,i+1 = F ik T k,i+1 = F ii T i,i+1 + F i,i+1 T i+1,i+1 k=1 k=i i+1 T ik F k,i+1 = T ik F k,i+1 = T ii F i,i+1 + T i,i+1 F i+1,i+1. k=1 k=i Then (FT) i,i+1 =(TF) i,i+1 implies that F i,i+1 (T ii T i+1,i+1 )=T i,i+1 F i+1,i+1 F ii T i,i+1. But, by hypothesis, T ii T i+1,i+1 0,so F i,i+1 =(T i,i+1 F i+1,i+1 F ii T i,i+1 )/(T ii T i+1,i+1 ). (4) As before, T ij =0andF ij = 0whenever i>j.sowehave and (FT) i,i+k = (TF) i,i+k = F ij T j,i+k = F ij T j,i+k = F i,i+k T i+k,i+k + j=1 T ij F j,i+k = T ij F j,i+k = T ii F i,i+k + j=1 Equating the two expressions, we obtain F i,i+k (T ii T i+k,i+k )= i+k 1 Again, by hypothesis, T ii T i+k,i+k 0,so i+k 1 F i,i+k =( F ij T j,i+k +1 1 F ij T j,i+k i+k 1 T ij F j,i+k. T ij F j,i+k )/(T ii T i+k,i+k ). F ij T j,i+k T ij F j,i+k.
2 2 MATH 110: PRACTICE FINAL SOLUTIONS (5) The above calculations work equally well for power series that converge at all eigenvalues of T, in place of polynomials. So, noting that cos(x) = ( 1) n x 2n n=0,wecan (2n)! apply the above considerations. Let us set ( ) π/4 7 T = 0 π/4 and F =cos(t ). By the above work, F 11 =cos(π/4) = 2/2, F 22 =cos( π/4) = 2/2, F21 =0,andF 12 =(T 12 F 22 F 11 T 12 )/(T 11 T 22 )= π =0. So 4 + π 4 ( ) 2/2 0 F =. 0 2/2 Question 2. The first two parts of this problem only ask you to show that AB and BA have (almost) the same eigenvalues, but don t actually demand you show their characteristic polynomials (almost) agree. Showing the latter condition is stronger than the former, and the hints given actually lead to this stronger result. However there is a simpler method to show the weaker condition, and that is included after the full solution. (1) Without loss of generality, we may assume that A is nonsingular and hence invertible. So A 1 (AB)A = BA. SinceAB and BA are similar, they have the same eigenvalues. (2) Let us compute the characteristic polynomials of AB and BA. We ll be working in the field F (x), consisting of fractions of polynomials in x with coefficients in F. ([ ][ ]) (xi n AB) 0 xi n AB A I n A xi n =1 A I n A xi n A xi n = x n x A xi n n x 0 I n A xi n 0 x 1 I n ([ ][ ][ ]) x x 0 I n A xi n 0 x 1 I n A I n x x 1 A I n A I n A I n ([ ][ ]) x xin BA B A I n A I n 0 I n (xi n BA). Hence AB and BA have the same characteristic polynomial. (3) Again, we ll be working over F (x). ([ ][ ]) (xi m AB) 0 xi m AB A I m A xi m =1 A I m A xi m A xi m
3 ]) 0 I m ([ ][ = x m n x 0 I m MATH 110: PRACTICE FINAL SOLUTIONS 3 ([ = x m n x n ([ = x m n x A xi m 0 x 1 I m ][ ]) A xi m 0 x 1 = x I m n x m A I m = x m n x 1=x A I m n x m A I m A I m ([ ][ ]) = x m n x = x A I m A I m n xin BA B m 0 I n A xi m ]) x m = x m n (xi n BA). Hence (xi m AB) =x m n (xi n BA). Here is a simpler method which just demonstrates that AB and BA have the same eigenvalues, except possibly for 0in the m n case. Suppose λ, v is an eigenpair for AB. ThenBA(Bv) = B(ABv) = Bλv = λbv. Aslongas Bv 0,wehavethatλ, Bv is an eigenpair for BA. But if λ 0,thenABv = λv 0,so Bv 0. This shows that without any restrictions on m and n, AB and BA have the same non-zero eigenvalues (the eigenvalues go back from BA to AB by symmetry). Now suppose m = n and 0is an eigenvalue for AB. Then either A or B is singular, so 0is also an eigenvalue for BA. Now suppose m>n. Then as B is n m, B has non-trivial nullspace, so 0must be an eigenvalue for AB. 0may or may not be an eigenvalue for BA. You may want to think of an example where it is not. Question 3. (1) Let a i denote the ith column of A and q i the ith column of Q. Using the algorithm for computing QR decompositions given in class, we obtain R 11 = a 1 =2and q 1 = a 1 /R 11 = 1/2 (1, 1, 1, 1) t. Also, R 12 = a 2,q 1 = 4, R 13 = a 3,q 1 = 6, R 22 = a 2 q 1 R 12 = (3, 3, 3, 3) t =6,andq 2 =(3, 3, 3, 3) t /R 22 =1/2 (1, 1, 1, 1) t. Continuing in this fashion, one obtains Q = and R = (2) By the computation done in class, x = R 1 Q t y =( 26, 23, 21) t. Question 4. (1) Multiplying X by P on the left interchanges rows i and n +1 i of X (for each i {1, 2,...,n}). So PX =(X n+1 i,j ). Multiplying PX by P on the right interchanges columns j and n+1 j of PX (for each j {1, 2,...,n}). So PXP =(X n+1 i,n+1 j ). (2) Let J be a Jordan block, with λ as its eigenvalue. For each i {1, 2,...,n}, J ii = λ, and hence λ = J n+1 i,n+1 i = (PXP) ii, by the above formula. Similarly, each J i,i+1 = 1, so 1 = J n+1 i,n+2 i = (PXP) i,i 1. Itisalsoeasytoseethatsince J ij = 0whenever j / {i, i +1}, (PXP) ij = 0whenever j / {i, i 1}. Hence, PJP 1 = PJP = J t..
4 4 MATH 110: PRACTICE FINAL SOLUTIONS Now consider a matrix in Jordan canonical form: J J J = , J k where the J i are Jordan blocks. Also, let P P P = , P k where for each i, P i has the same size as J i,andeachp i is of the form P of (1). Then P 1 J 1 P J t P P J P = 2 J 2 P = 0 J 2 t =(J ) t P k J k P k Jk t Finally, let A be an n by n complex matrix, and suppose that A = SJS 1 is its Jordan decomposition. Then A t =(S 1 ) t J t S t =(S t ) 1 J t S t. But, by the above, J t is similar to J, and hence A t is similar to J. By the uniqueness of the Jordan canonical form, J is the Jordan canonical form of A t. Question 5. Let D be a diagonal matrix such that D ii = R ii. Also, let L = R D 1 (D is invertible, since A, and hence R, is invertible), and let U = DR. ThenLU = R D 1 DR = R R = R (Q Q)R =(QR) (QR) =A A,sinceQ is unital. Question 6. First note that because {u 1,u 2,v 1,v 2,v 3 } is a basis for F 5, these vectors must be distinct and the sets {u 1,u 2 } and {v 1,v 2,v 3 } are independent. Now clearly u i E c for each i, so span(u 1,u 2 ) E c,andspan(u 1,u 2 ) is 2-dimensional. So dim(e c ) 2. Likewise, span(v 1,v 2,v 3 ) is a 3-dimensional subspace of E d.nowwehave 5=dim(F 5 ) dim(e c + E d )=dim(e c )+dim(e d ) dim(e c E d ). But as c d, E c E d = {0}, so the last term is 0. Thus dim(e c ) = 2 and dim(e d )=3,so span(u 1,u 2 )=E c and likewise for d. Alternatively, as A s characteristic polynomial has degree 5, and dim(e λ ) mult(λ), the multiplicity of λ, it is easy to see that the multiplicities of c and d are 2 and 3 respectively. Thus E c cannot have dimension > 2, so must coincide with span(u 1,u 2 ), and likewise for d. Question 7. In the following I ll also define u j = v j for j>r, for simplicity of notation. The given basis consists of eigenvectors for A, and is orthnormal. Therfore A is normal, so A A = AA.LetA = QDQ be the decomposition of A given by this basis (so the columns of Q are, in order, {u 1,...,u n } and D = Q AQ). Then D =diag(λ 1,...,λ n ), where λ i = c for i r and λ i = d for i>r.forq is the change of co-ordinates matrix from the given eigenbasis to the standard basis. Or just consider D ij = e t ide j = e i Q AQe j =(Qe i ) A(Qe j )= = u i Au j = u i λ j u j = λ j δ ij.
5 MATH 110: PRACTICE FINAL SOLUTIONS 5 Here I have used that the u i s form an orthnormal set. (7.1) Using A = QDQ, A u i = QD Q u i = QD e i = Qλ i e i = λ i Qe i = λ i u i. So A u i = c u i for i r and A u i = d u i for i>r. (7.2) As β = {u 1,...,u n } forms a basis, CS(A) =span(l A (β)) = span(au 1,...,Au n )=span(cu 1,...,cu r,du r+1,...,du n ). Likewise, CS(A )=span(l A (β)) = span(c u 1,...,c u r,d u r+1,...,d u n ). If c 0andd 0, it is clear that these spans coincide with span(u 1,...,u n )=C n. If c 0=d, then both spans coincide with span(u 1,...,u n ). Generalizing the result of problem 6, this is E c.ifc =0 d, wegete d instead. We can t have c = d as we assumed they were distinct. So we are done. Note that having only 2 distinct eigenvalues wasn t important here; the same arguments generalize to give similar results (such as CS(A) =CS(A )foranormal) for A having more eigenvalues. Question 8. (8.1) True. A is skew-symmetric (A = A t )andreal,soa A = A t A = A 2 = AA, so A is normal. This is equivalent to A being diagonalizable by a unitary matrix. (Note we are talking about complex matrices here, as the question was about unitary matrices. There actually isn t a factorization A = QDQ t with Q real orthogonal and D real diagonal.) (8.2) False. A being unitarily diagonalizable is also equivalent to the existence of an orthnormal basis of eigenvectors for A. ButA is upper triangular with eigenvalues 1, 2, 3. Each of the eigenspaces must have dimension 1, and computing them, one easily sees that if v 1 E 1 and v 2 E 2, both non-zero, then v 1 and v 2 are not orthogonal. (8.3) False. The matrices [ ], [ do not commute. Just try it. (8.4) True. Such matrices may be simultaneously diagonalized, so they commute, by a homework problem. To see this, let J = QDQ 1. Q s columns are eigenvectors for J, so must also be eigenvectors for K by assumption. Therefore K = QCQ 1 for some diagonal matrix C (with the corresponding eigenvalues on its diagonal). Therefore JK = QDQ 1 QCQ 1 = QDCQ 1 = QCDQ 1 = KJ. (8.5) False. This requires the first column of Q 1 to be an eigenvector for A. For in the Q 1 -basis β (given by Q 1 s columns), [L A ] β = T, and the first standard basis vector is an eigenvector for an upper triangular matrix. Alternatively, letting Q s first column be q, q 0andAQ 1 = TQ,so Aq = A(Q 1 e 1 )=Q 1 Te 1 = Q 1 T 11 e 1 = T 11 Q 1 e 1 = T 11 q. ]
6 6 MATH 110: PRACTICE FINAL SOLUTIONS So A must have a real eigenvector. But this is false for the 90 o rotation matrix [ ] (8.6) False. Let u =[11111] t.notethatu t M = u t because M is a probability matrix. Now suppose Mx = y. Then 8=u t y = u t Mx = u t x =7. Question 9. Suppose all of f s roots are distinct, and are λ 1,...,λ n.letλ=diag(λ 1,...,λ n ). I will show that any complex matrix whose characteristic poly is f is similar to Λ. This is sufficient, because if M and N are both similar to Λ, then they are similar to one another. So let M be a complex matrix whose characteristic poly is f. ThenM is diagonalizable as it has n distinct eigenvalues. Thus Q 1 MQ = Θ, where Θ = diag(θ 1,...,θ n ). But the θ i s are the roots of f, as are the λ i s. So Θ and Λ have the same diagonal entries, but in possibly different orders. Thus they are similar through a permutation matrix P, and M was similar to Θ, so M is similar to Λ also. If you re interested, I ll now explicitly construct P. I ll define a permutation matrix P such that P ΘP t =Λ. Foreachi, there is a unique j such that λ i = θ j,asm s eigenvalues are f s roots. Let π : {1,...,n} {1,...,n} be the permutation (bijective function) that sends i to j (so λ i = θ π(i) ). We want the i th row of P to extract λ i from Θ, which is in the π(i) th position in Θ, so set P i,j = δ π(i),j. Because π is a permutation, it is easy to check that P is a permutation matrix. Let P i be the i th row of P.AsPP t = I, P i P t j = δ ij. Wehave (P ΘP t ) ij = P i ΘP t j = θ π(i)p i P t j = θ π(i) δ ij = λ i δ ij =Λ ij. Therefore P ΘP t =Λasrequired. Now we do the other direction. Suppose f s roots, counted according to multiplicity, are λ 1,...,λ n. By reordering if needed, suppose that r > 1, and λ 1 = λ i iff i r (so the multiplicity of λ = λ 1 is r>1). Let D =diag(λ 1,...,λ n ), let J = J(λ 1,r)bether r Jordan block with eigenvalue λ 1 and let C =diag(j, λ r+1,...,λ n ). Then both D and C have characteristic poly f, but are not similar. This follows from the uniqueness of the Jordan canonical form: any two Jordan matrices are similar iff for each i and λ, they have the same number of i i Jordan blocks with eigenvalue λ (but they may appear in different orders). D and C do not satisfy this, so are not similar. We may also see it directly as follows. Writing C as a 2 2 block matrix with first block r r, [ ][ ] J(0,r) 0 v Eλ C v1 (C λi)v =0 =0. 0 C 22 λi v 2 This is equivalent to requiring J(0,r)v 1 =0and(C 22 λi)v 2 =0. ButC 22 has diagonal entries distinct from λ (by choice of r), so C 22 λi is upper triangular invertible. So we must have v 2 = 0. Clearly the rank of J(0,r)isr 1, and its nullity is 1, which means N(J(0,r)) and Eλ C have dimension 1. But we assumed 1 <r,sodim(eλ C ) < mult(λ), so that C is not diagonalizable. As D is in fact diagonal, they cannot be similar.
7 MATH 110: PRACTICE FINAL SOLUTIONS 7 Question 10. Note that if C is an n n matrix with columns c i, e t ice j = e t ic j = C ij,and e t i = e i (e i is the standard basis vector, which is real). So Be j,e i = e i Be j = e t ibe j = B ij, and e j,ae i =(Ae i ) e j = e i A e j = e t i A e j = A ij. Applying the assumption, B ij = A ij for each i, j, sob = A. Question 11. LetW = {v V x, v =0}. We show that W satisfies the three conditions required of a subspace. By one of the first theorems on inner products, 0 W. If u,v W, x, u + v = x, u + x, v =0+0=0,sou + v W. If u W and c F, x, cu = c x, u = c0 =0,socu W.
MATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
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 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 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 informationJordan Normal Form and Singular Decomposition
University of Debrecen Diagonalization and eigenvalues Diagonalization We have seen that if A is an n n square matrix, then A is diagonalizable if and only if for all λ eigenvalues of A we have dim(u λ
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 informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
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 informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
More informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
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 informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
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 informationHOMEWORK 9 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but
More informationLinear Algebra 2 Spectral Notes
Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex
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 informationUniversity of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm
University of Colorado at Denver Mathematics Department Applied Linear Algebra Preliminary Exam With Solutions 16 January 2009, 10:00 am 2:00 pm Name: The proctor will let you read the following conditions
More informationLinear Algebra Practice Final
. Let (a) First, Linear Algebra Practice Final Summer 3 3 A = 5 3 3 rref([a ) = 5 so if we let x 5 = t, then x 4 = t, x 3 =, x = t, and x = t, so that t t x = t = t t whence ker A = span(,,,, ) and a basis
More informationMATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018
Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry
More informationMath 215 HW #11 Solutions
Math 215 HW #11 Solutions 1 Problem 556 Find the lengths and the inner product of 2 x and y [ 2 + ] Answer: First, x 2 x H x [2 + ] 2 (4 + 16) + 16 36, so x 6 Likewise, so y 6 Finally, x, y x H y [2 +
More informationLinear Systems. Class 27. c 2008 Ron Buckmire. TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5.4
Linear Systems Math Spring 8 c 8 Ron Buckmire Fowler 9 MWF 9: am - :5 am http://faculty.oxy.edu/ron/math//8/ Class 7 TITLE Projection Matrices and Orthogonal Diagonalization CURRENT READING Poole 5. Summary
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
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 informationLinear Algebra in Actuarial Science: Slides to the lecture
Linear Algebra in Actuarial Science: Slides to the lecture Fall Semester 2010/2011 Linear Algebra is a Tool-Box Linear Equation Systems Discretization of differential equations: solving linear equations
More informationSolving a system by back-substitution, checking consistency of a system (no rows of the form
MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary
More informationMath 4A Notes. Written by Victoria Kala Last updated June 11, 2017
Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...
More informationMath 108b: Notes on the Spectral Theorem
Math 108b: Notes on the Spectral Theorem From section 6.3, we know that every linear operator T on a finite dimensional inner product space V has an adjoint. (T is defined as the unique linear operator
More informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationMTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationUniversity of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012
University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012 Name: Exam Rules: This is a closed book exam. Once the exam
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationMath Final December 2006 C. Robinson
Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the
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 informationMath 121 Practice Final Solutions
Math Practice Final Solutions December 9, 04 Email me at odorney@college.harvard.edu with any typos.. True or False. (a) If B is a 6 6 matrix with characteristic polynomial λ (λ ) (λ + ), then rank(b)
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 information2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.
Hints for Exercises 1.3. This diagram says that f α = β g. I will prove f injective g injective. You should show g injective f injective. Assume f is injective. Now suppose g(x) = g(y) for some x, y A.
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 informationMath 113 Final Exam: Solutions
Math 113 Final Exam: Solutions Thursday, June 11, 2013, 3.30-6.30pm. 1. (25 points total) Let P 2 (R) denote the real vector space of polynomials of degree 2. Consider the following inner product on P
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 informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
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 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
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 informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationMath 489AB Exercises for Chapter 2 Fall Section 2.3
Math 489AB Exercises for Chapter 2 Fall 2008 Section 2.3 2.3.3. Let A M n (R). Then the eigenvalues of A are the roots of the characteristic polynomial p A (t). Since A is real, p A (t) is a polynomial
More informationMath Homework 8 (selected problems)
Math 102 - Homework 8 (selected problems) David Lipshutz Problem 1. (Strang, 5.5: #14) In the list below, which classes of matrices contain A and which contain B? 1 1 1 1 A 0 0 1 0 0 0 0 1 and B 1 1 1
More informationEigenvalue and Eigenvector Problems
Eigenvalue and Eigenvector Problems An attempt to introduce eigenproblems Radu Trîmbiţaş Babeş-Bolyai University April 8, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) Eigenvalue and Eigenvector Problems
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 information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationMath 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith
Math 217: Eigenspaces and Characteristic Polynomials Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Definition: Let V T V be a linear transformation.
More informationEigenvalues and Eigenvectors
/88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix
More informationMTH50 Spring 07 HW Assignment 7 {From [FIS0]}: Sec 44 #4a h 6; Sec 5 #ad ac 4ae 4 7 The due date for this assignment is 04/05/7 Sec 44 #4a h Evaluate the erminant of the following matrices by any legitimate
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
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 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 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 informationVectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes.
Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes Matrices and linear equations A matrix is an m-by-n array of numbers A = a 11 a 12 a 13 a 1n a 21 a 22 a 23 a
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationEXAM. Exam 1. Math 5316, Fall December 2, 2012
EXAM Exam Math 536, Fall 22 December 2, 22 Write all of your answers on separate sheets of paper. You can keep the exam questions. This is a takehome exam, to be worked individually. You can use your notes.
More informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
More informationName: Final Exam MATH 3320
Name: Final Exam MATH 3320 Directions: Make sure to show all necessary work to receive full credit. If you need extra space please use the back of the sheet with appropriate labeling. (1) State the following
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationj=1 x j p, if 1 p <, x i ξ : x i < ξ} 0 as p.
LINEAR ALGEBRA Fall 203 The final exam Almost all of the problems solved Exercise Let (V, ) be a normed vector space. Prove x y x y for all x, y V. Everybody knows how to do this! Exercise 2 If V is a
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 informationTopic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,
More informationMath 554 Qualifying Exam. You may use any theorems from the textbook. Any other claims must be proved in details.
Math 554 Qualifying Exam January, 2019 You may use any theorems from the textbook. Any other claims must be proved in details. 1. Let F be a field and m and n be positive integers. Prove the following.
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationMATH 581D FINAL EXAM Autumn December 12, 2016
MATH 58D FINAL EXAM Autumn 206 December 2, 206 NAME: SIGNATURE: Instructions: there are 6 problems on the final. Aim for solving 4 problems, but do as much as you can. Partial credit will be given on all
More informationMath 314H Solutions to Homework # 3
Math 34H Solutions to Homework # 3 Complete the exercises from the second maple assignment which can be downloaded from my linear algebra course web page Attach printouts of your work on this problem to
More informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationMATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
More informationMATH 110: LINEAR ALGEBRA PRACTICE MIDTERM #2
MATH 0: LINEAR ALGEBRA PRACTICE MIDTERM #2 FARMER SCHLUTZENBERG Note The theorems in sections 5. and 5.2 each have two versions, one stated in terms of linear operators, one in terms of matrices. The book
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationAlgebra Workshops 10 and 11
Algebra Workshops 1 and 11 Suggestion: For Workshop 1 please do questions 2,3 and 14. For the other questions, it s best to wait till the material is covered in lectures. Bilinear and Quadratic Forms on
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 informationLINEAR ALGEBRA SUMMARY SHEET.
LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized
More informationI. Multiple Choice Questions (Answer any eight)
Name of the student : Roll No : CS65: Linear Algebra and Random Processes Exam - Course Instructor : Prashanth L.A. Date : Sep-24, 27 Duration : 5 minutes INSTRUCTIONS: The test will be evaluated ONLY
More information4.1 Eigenvalues, Eigenvectors, and The Characteristic Polynomial
Linear Algebra (part 4): Eigenvalues, Diagonalization, and the Jordan Form (by Evan Dummit, 27, v ) Contents 4 Eigenvalues, Diagonalization, and the Jordan Canonical Form 4 Eigenvalues, Eigenvectors, and
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 informationMath 4153 Exam 3 Review. The syllabus for Exam 3 is Chapter 6 (pages ), Chapter 7 through page 137, and Chapter 8 through page 182 in Axler.
Math 453 Exam 3 Review The syllabus for Exam 3 is Chapter 6 (pages -2), Chapter 7 through page 37, and Chapter 8 through page 82 in Axler.. You should be sure to know precise definition of the terms we
More informationLinear Algebra Review (Course Notes for Math 308H - Spring 2016)
Linear Algebra Review (Course Notes for Math 308H - Spring 2016) Dr. Michael S. Pilant February 12, 2016 1 Background: We begin with one of the most fundamental notions in R 2, distance. Letting (x 1,
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 information33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM
33AH, WINTER 2018: STUDY GUIDE FOR FINAL EXAM (UPDATED MARCH 17, 2018) The final exam will be cumulative, with a bit more weight on more recent material. This outline covers the what we ve done since the
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationLecture Note 12: The Eigenvalue Problem
MATH 5330: Computational Methods of Linear Algebra Lecture Note 12: The Eigenvalue Problem 1 Theoretical Background Xianyi Zeng Department of Mathematical Sciences, UTEP The eigenvalue problem is a classical
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 informationIntroduction to Linear Algebra, Second Edition, Serge Lange
Introduction to Linear Algebra, Second Edition, Serge Lange Chapter I: Vectors R n defined. Addition and scalar multiplication in R n. Two geometric interpretations for a vector: point and displacement.
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationIntroduction to Matrix Algebra
Introduction to Matrix Algebra August 18, 2010 1 Vectors 1.1 Notations A p-dimensional vector is p numbers put together. Written as x 1 x =. x p. When p = 1, this represents a point in the line. When p
More informationMath 24 Spring 2012 Sample Homework Solutions Week 8
Math 4 Spring Sample Homework Solutions Week 8 Section 5. (.) Test A M (R) for diagonalizability, and if possible find an invertible matrix Q and a diagonal matrix D such that Q AQ = D. ( ) 4 (c) A =.
More information