Theorem 1 ( special version of MASCHKE s theorem ) Given L:V V, there is a basis B of V such that A A l
|
|
- Polly Conley
- 6 years ago
- Views:
Transcription
1 Mathematics 369 The Jordan Canonical Form A. Hulpke While SCHU Rs theorem permits us to transform a matrix into upper triangular form, we can in fact do even better, if we don t insist on an orthogonal transformation matrix. Our setup is that we have V = C n and a matrix A C n n that represents a linear transformation L:V V via the standard basis S of V : A = S [L] S. We first want to show that it is possible to modify the basis, such that we get a block diagonal matrix with blocks for each eigenvalue: Theorem 1 ( special version of MASCHKE s theorem ) Given L:V V, there is a basis B of V such that A B [L] B = 0 A A l is in block form with each A i in upper triangular form with the same value on the diagonal. Proof: Let us assume that by SCHUR s theorem we have a basis F = {f 1,...,f n } for L which is chosen in a way such that the diagonal entries have the eigenvalues clustered together. Suppose that f a,...,f b are the basis vectors that correspond to the diagonal entry λ and that f c (c > b) is a basis vector corresponding to a different diagonal eigenvalue µ. Suppose that L(f c ) = c d i f i with d c = µ. We are interested in the coefficients d i for a i b. Our aim is to change the basis such that d i = 0 for every a i b. If this is not already the case, there is a largest j, such that d j 0. We set v = f c and note that L(f j ) = λf j + Then j 1 L(v) = L(f c ) d j λ µ L(f j) = = = e i f i because F [L] F is upper triangular. j 1( d i d ) j λ µ e i j 1( d i d ) j λ µ e i c d i f i ( d j λ µ ) ( f i + d j d j λ µ λ }{{} = d jµ λ µ f i + c 1 i= j+1 λf j + f j + j 1 c 1 i= j+1 e i f i ) ( d i f i + µ f c d ) j λ µ f j }{{} = v d i f i + µf c d j λ µ f j Thus we can replace f c by v and obtain a new basis ˆF such that ˆF [L] ˆF is upper triangular but that in this basis L( fˆ c ) does not involve f j.
2 If we compare F [L] F and ˆF [L] ˆF, the only difference in the c-th column is that the entry in the j-th row has been set to 0. Furthermore (as the images of the basis vectors at positions < c do not involve f c, all prior columns of the matrix are not affected. We can repeat this process for all entries to clean out the whole column for entries at position i b and thus clean out the top of the c-th column. We then iterate to the next (c+1-th) column. We can clean out the to entries of this column without disturbing any previous columns. By processing over all columns in this way, we can build a basis B that achieves the claimed block structure for B [L] B. The Jordan Canonical form (CAMILLE JORDAN, , history/ Mathematicians/Jordan.html) Let us assume now that be have found (for example by following theorem 1) a basis B such that B [L] B is block diagonal such that every block is upper triangular with one eigenvalue λ i on the diagonal. If the block starts at position k and goes to position l, we say that the basis vectors b k up to b l belong to this block. Our next aim is to describe the subspace spanned by these basis vectors in terms of the transformation L: Because the characteristic polynomial of L is i (x λ i ) a λ i, we have that the block for an eigenvalue λ has exactly size l k + 1 = a λ. We now consider only one such eigenvalue which we denote simply by λ: Then note that b k must be an eigenvector of L for eigenvalue λ, thus b k ker(l λid). Similarly L(b k+1 ) = λb k+1 + a k,k+1 b k and thus b k+1 ker(l λid) 2. By the same argument b k+j ker(l λid) j 1. In particular Span(b k,...,b l ) = ker(l λid) a λ. Definition the generalized eigenspace of L for eigenvalue λ is ker(l λid) a λ. We thus could recover the space (and thus the block structure given by theorem 1) by calculating the kernel of (L λid) a λ. Furthermore this indicates the sequence of subspaces ker(l λid) ker(l λid) 2 ker(l λid) a λ is of interest. To simplify notation we set M = L λid and K i = ker(m i ). We note that K i is M-invariant and thus L-invariant. Our aim is to use this kernel sequence to find a nice bases for the generalized eigenspace K a λ. By concatenating the obtained nice bases for all generalized eigenspaces we will obtain a nice basis for V. As K i K i+1 we see that the dimensions of the K i cannot decrease. Because all dimensions are finite this sequence of dimensions has to become stationary (at a λ ) for some i. This situation is reached once dimk i = dimk i+1, because then K i = K i+1 and K i+2 = { v M i+2 (v) = 0 } = { v M(v) kerm i+1 = K i+1 = K i} = { v M i+1 (v) = 0 } = K i+1 = K i and so forth. The following lemma, which is the core of the argument, shows that we can choose bases for K i in a particular nice way.
3 Lemma Suppose that for j >= 1 a basis for K j 1 is extended by the vectors v 1,...,v k K j to form a basis of K j. Then: a) M j 1 (v 1 ),...,M j 1 (v k ) K 1 are linearly independent. b) The vectors are linearly independent. Proof: a) Suppose that 0 = k M j 1 (v 1 ),...,M j 1 (v k ), M j 2 (v 1 ),...,M j 2 (v k ),. M(v 1 ),...,M(v k ), v 1,...,v k c i M j 1 (v i ) = M j 1 ( k c i v i ). Then k c i v i kerm j 1 = K j 1. This would contradict that the v i extend a basis of K j 1 to a basis of K j, unless c i = 0 for all i. b) We assume the result of a) and use induction over j. If j = 1 we have that M j 1 = id and the statement is trivial. Thus assume now that j > 1. If ( ) 0 = c j 1,1 M j 1 (v 1 ) + + c j 1,k M j 1 (v k ) + c j 2,1 M j 2 (v 1 ) + + c j 2,k M j 2 (v k ) +. + c 1,1 M(v 1 ) + + c 1,k M(v k ) + c 0,1 v c 0,k v k with coefficients c i,i F, we apply M and obtain (using that M j (v i ) = 0 as v i K j ) that 0 = c j 2,1 M j 2 (M(v 1 )) + + c j 2,k M j 2 (M(v k )) +. + c 1,1 M(M(v 1 )) + + c 1,k M(M(v k )) + c 0,1 M(v 1 ) + + c 0,k M(v k ) We now apply induction to the vectors M(v 1 ),...,M(v k ) K j 1 and deduce that c i,i = 0 for i j 2. Thus ( ) simplifies to 0 = c j 1,1 M j 1 (v 1 ) + + c j 1,k M j 1 (v k ) and by the assumption of linear independence of these vectors we get that c i,i = 0 for all i,i which proves the claimed linear independence. Let v be one of the vectors v i from this lemma. Then the set C = {...,M 2 (v),m(v),v} (this is finite because M i (v) = 0 for large enough i) must be linearly independent. The subspace
4 W = Span(C) is clearly M-invariant (it is M-cyclic) and thus is L-invariant. We calculate that λ ] 0 λ 1 0. [L = C /W C λ λ We call a matrix of this form an Jordan block. We got W from one single vector v. If we consider all the vectors v i given in the preceeding lemma we get a series of subspaces, whose bases we can concatenate to obtain a larger linearly independent set. If we consider them in the sequence {...,M 2 (v 1 ),M(v 1 ),v 1,...,M 2 (v 2 ),M(v 1 ),v 2,...,M 2 (v k ),M(v k ),v k }, ] they span an L-invariant subspace U such that [L /U is block diagonal with Jordan blocks along the diagonal. The last remaining question is whether this subspace U is equal to K a λ. This is not necessarily the case, in fact we might have that K i U if dimk i dimk i 1 > k. In such a case we can extend the basis by picking further vectors in K i, which are not in K i 1. These vectors (and their images) again generate L-invariant subspaces, and yield further, smaller, Jordan blocks. If we continue this process to obtain a basis for K a λ for every eigenvalue λ we thus get the following statement: Theorem There exists a basis B such that B [L] B is block diagonal with Jordan blocks along the diagonal. The total number of occurrences of λ on the diagonal is equal to a λ. the number of Jordan blocks of size i is equal to dimk i dimk i 1. If L is given by a matrix A, the matrix (similar to A) described in this theorem is called the Jordan Canonical form of A. (See below for uniqueness.) Computing the Jordan Canonical Form Let us first look at the case of a concrete matrix A. We want to find such a basis B and the Jordan Canonical form of A. This process essentially involves finding suitable vectors in the kernels K i and arranging them in the right way. The only issue is bookkeeping of the vectors to decide whether new basis vectors are just obtained as images, or have to be chosen from a suitable kernel to start a new Jordan block. (1) Determine the Eigenvalues λ k of the matrix A (for example as roots of the characteristic polynomial). For each eigenvalue λ perform the following calculation (which gives a basis of the generalized eigenspace of λ, the whole basis will be obtained by concatenating the bases obtained for the different λ k ). Again we write K i = ker(a λ I) i.
5 (2) Calculate e i = dimk i until the sequence becomes stationary. (The largest e i is the dimension of the generalized eigenspace.) (3) Let f i = e i e i 1. Then e i gives the number of Jordan blocks that have size at least i. (As long as we only want to know the Jordan form, we thus could stop here.) We now build a basis in sequence of descending i. Let B = [ ] and i = max{i f i > 0}. (4) (Continue growing the existing Jordan blocks) For each vector list (s 1,...,s m ) in B, append the image (A λ I) s m of its last element to the list. (5) (Start new Jordan block of size i) If f i f i 1 = m > 0 (then the images of the vectors obtained so far do not span K i ) let W = Span(K i 1,s 1,...,s k ) where the s j run through the elements in all the lists obtained so far. Extend a basis of W to a basis of K i by adding m linearly independent vectors b 1,...b m in K i K i 1 to it. The probability is high (why?) that any m linear independent basis vectors of K i fulfill this property. To verify it, choose a basis for K i 1, append the s j and then append the b i. Then show that the resulting list is linearly independent. (The generic method would be to extend a basis of W to a basis of K i and take the vectors by which the basis got extended.) (6) For each such vector b i add a list [b i ] to B. (7) If the number of vectors in the lists in B is smaller than the maximal e i, then decrement i and go to step (4). (8) Concatenate the reverses of the lists in B. This is the part of the basis corresponding to eigenvalue λ. For example, let A := Its characteristic polynomial is (x 1) 4. We get the following nullspace dimensions and their differences: i e i = dimk i f i = e i+1 e i At this point we know already the shape of the Jordan Canonical form of A (2 blocks of size 1 or larger, 2 blocks of size 2 or larger, 1 block of size 3 or larger. I.e. One block of size 2 and one block of size 3), but let us compute the explicit base change: We start at i = 3 and set B = [ ]. We have that K 3 = R 5 and. K 2 = Span(4,1,0,0,0) T,( 15/2,0,1,0,0) T,(3,0,0,1,0) T,(0,0,0,0,1) T,
6 As f 3 = 1 we need to find only one basis vector and pick b 1 := (1,0,0,0,0) T as first basis vector (an almost random choice, we only have to make sure it is not contained in K 2, which is easy to verify) and add the list [b 1 ] to B. In step i = 2 we first compute the image b 2 := (A 1)b 1 = (58,16,6,13, 4) T and add it to the list. Furthermore, as f 2 > f 3, we have to get another basis vector in K 2, but not in the span of K 3 and b 2. We pick b 3 = (4,1,0,0,0) T from the spanning set of K 2, and verify that it indeed fulfills the conditions. We thus have B = [[b 1,b 2 ],[b 3 ]]. In step i = 1 we now compute images again b 4 := (A 1)b 2 = (48,12,4,10,0) T and (from the second list) b 5 := (A 1)b 3 = (8,2,0,0, 4) T. As f 1 = f 2 no new vectors are added. As a result we get B = [[b 1,b 2,b 4 ],[b 3,b 5 ]]. Finally we concatenate the reversed basis vector lists and get the new basis (b 4,b 2,b 1,b 5,b 3 ). We thus have the base change matrix S := Uniqueness and Similarity.It is easily verified thats 1 AS = If we arrange the bases of different M-cyclic subspaces in a different way, we rearrange the order of Jordan blocks. We therefore make the following convention for the sake of uniqueness: The eigenvalues are arranged in ascending order Within each eigenvalue, Jordan blocks are arranged in descending size. The resulting matrix is called the Jordan Canonical form of A and is denoted by J(A). Lemma: Let A,B F n n. Then A and B are similar if and only if J(A) = J(B). Proof: Since the Jordan Canonical form is obtained form a base change operation we know that A and J(A) are similar. We thus see that if A and B have the same Jordan canonical form, then A and B must be similar. Vice versa suppose that A and B represent the same linear transformation L with respect to different bases. The Jordan canonical form is determined uniquely by the dimensions dimker(l λ id) i (these numbers determine the numbers and sizes of the Jordan blocks). These dimensions are independent of the choice of base. The (a priori very hard) question on whether two matrices are similar can therefore be answered by computing the Jordan Canonical form.
MATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More informationJORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationThe Jordan Canonical Form
The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop
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 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 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 informationMATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.
MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:
More informationMATH Spring 2011 Sample problems for Test 2: Solutions
MATH 304 505 Spring 011 Sample problems for Test : Solutions Any problem may be altered or replaced by a different one! Problem 1 (15 pts) Let M, (R) denote the vector space of matrices with real entries
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationMATHEMATICS 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 information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationMATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION
MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether
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 informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationPractice Exam. 2x 1 + 4x 2 + 2x 3 = 4 x 1 + 2x 2 + 3x 3 = 1 2x 1 + 3x 2 + 4x 3 = 5
Practice Exam. Solve the linear system using an augmented matrix. State whether the solution is unique, there are no solutions or whether there are infinitely many solutions. If the solution is unique,
More 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 informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
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 informationLINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS
LINEAR ALGEBRA BOOT CAMP WEEK 2: LINEAR OPERATORS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts
More 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 information( 9x + 3y. y 3y = (λ 9)x 3x + y = λy 9x + 3y = 3λy 9x + (λ 9)x = λ(λ 9)x. (λ 2 10λ)x = 0
Math 46 (Lesieutre Practice final ( minutes December 9, 8 Problem Consider the matrix M ( 9 a Prove that there is a basis for R consisting of orthonormal eigenvectors for M This is just the spectral theorem:
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
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 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 informationHomework 6 Solutions. Solution. Note {e t, te t, t 2 e t, e 2t } is linearly independent. If β = {e t, te t, t 2 e t, e 2t }, then
Homework 6 Solutions 1 Let V be the real vector space spanned by the functions e t, te t, t 2 e t, e 2t Find a Jordan canonical basis and a Jordan canonical form of T on V dened by T (f) = f Solution Note
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 informationThe eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute
A. [ 3. Let A = 5 5 ]. Find all (complex) eigenvalues and eigenvectors of The eigenvalues are the roots of the characteristic polynomial, det(a λi). We can compute 3 λ A λi =, 5 5 λ from which det(a λi)
More informationJordan Canonical Form Homework Solutions
Jordan Canonical Form Homework Solutions For each of the following, put the matrix in Jordan canonical form and find the matrix S such that S AS = J. [ ]. A = A λi = λ λ = ( λ) = λ λ = λ =, Since we have
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationFall 2016 MATH*1160 Final Exam
Fall 2016 MATH*1160 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie Dec 16, 2016 INSTRUCTIONS: 1. The exam is 2 hours long. Do NOT start until instructed. You may use blank
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationDesigning Information Devices and Systems I Discussion 4B
Last Updated: 29-2-2 9:56 EECS 6A Spring 29 Designing Information Devices and Systems I Discussion 4B Reference Definitions: Matrices and Linear (In)Dependence We ve seen that the following statements
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More 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 informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationFinitely Generated Modules over a PID, I
Finitely Generated Modules over a PID, I A will throughout be a fixed PID. We will develop the structure theory for finitely generated A-modules. Lemma 1 Any submodule M F of a free A-module is itself
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 informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
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 informationSchur s Triangularization Theorem. Math 422
Schur s Triangularization Theorem Math 4 The characteristic polynomial p (t) of a square complex matrix A splits as a product of linear factors of the form (t λ) m Of course, finding these factors is a
More informationA NOTE ON THE JORDAN CANONICAL FORM
A NOTE ON THE JORDAN CANONICAL FORM H. Azad Department of Mathematics and Statistics King Fahd University of Petroleum & Minerals Dhahran, Saudi Arabia hassanaz@kfupm.edu.sa Abstract A proof of the Jordan
More informationLinear Algebra II. 2 Matrices. Notes 2 21st October Matrix algebra
MTH6140 Linear Algebra II Notes 2 21st October 2010 2 Matrices You have certainly seen matrices before; indeed, we met some in the first chapter of the notes Here we revise matrix algebra, consider row
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationMath Spring 2011 Final Exam
Math 471 - Spring 211 Final Exam Instructions The following exam consists of three problems, each with multiple parts. There are 15 points available on the exam. The highest possible score is 125. Your
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 informationLinear Algebra II Lecture 13
Linear Algebra II Lecture 13 Xi Chen 1 1 University of Alberta November 14, 2014 Outline 1 2 If v is an eigenvector of T : V V corresponding to λ, then v is an eigenvector of T m corresponding to λ m since
More informationThe Cyclic Decomposition of a Nilpotent Operator
The Cyclic Decomposition of a Nilpotent Operator 1 Introduction. J.H. Shapiro Suppose T is a linear transformation on a vector space V. Recall Exercise #3 of Chapter 8 of our text, which we restate here
More informationCS168: The Modern Algorithmic Toolbox Lecture #8: PCA and the Power Iteration Method
CS168: The Modern Algorithmic Toolbox Lecture #8: PCA and the Power Iteration Method Tim Roughgarden & Gregory Valiant April 15, 015 This lecture began with an extended recap of Lecture 7. Recall that
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More information642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004
642:550, Summer 2004, Supplement 6 The Perron-Frobenius Theorem. Summer 2004 Introduction Square matrices whose entries are all nonnegative have special properties. This was mentioned briefly in Section
More informationThen x 1,..., x n is a basis as desired. Indeed, it suffices to verify that it spans V, since n = dim(v ). We may write any v V as r
Practice final solutions. I did not include definitions which you can find in Axler or in the course notes. These solutions are on the terse side, but would be acceptable in the final. However, if you
More informationMath 102 Final Exam - Dec 14 - PCYNH pm Fall Name Student No. Section A0
Math 12 Final Exam - Dec 14 - PCYNH 122-6pm Fall 212 Name Student No. Section A No aids allowed. Answer all questions on test paper. Total Marks: 4 8 questions (plus a 9th bonus question), 5 points per
More informationUNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if
UNDERSTANDING THE DIAGONALIZATION PROBLEM Roy Skjelnes Abstract These notes are additional material to the course B107, given fall 200 The style may appear a bit coarse and consequently the student is
More informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationEigenvalues and Eigenvectors A =
Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector
More informationMath 396. Quotient spaces
Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition
More informationMath 4242 Fall 2016 (Darij Grinberg): homework set 8 due: Wed, 14 Dec b a. Here is the algorithm for diagonalizing a matrix we did in class:
Math 4242 Fall 206 homework page Math 4242 Fall 206 Darij Grinberg: homework set 8 due: Wed, 4 Dec 206 Exercise Recall that we defined the multiplication of complex numbers by the rule a, b a 2, b 2 =
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationChapter 5. Eigenvalues and Eigenvectors
Chapter 5 Eigenvalues and Eigenvectors Section 5. Eigenvectors and Eigenvalues Motivation: Difference equations A Biology Question How to predict a population of rabbits with given dynamics:. half of the
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
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 non-zero entries are on the diagonal This is equivalent to
More informationFinal Exam Practice Problems Answers Math 24 Winter 2012
Final Exam Practice Problems Answers Math 4 Winter 0 () The Jordan product of two n n matrices is defined as A B = (AB + BA), where the products inside the parentheses are standard matrix product. Is the
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 informationDEPARTMENT OF MATHEMATICS
DEPARTMENT OF MATHEMATICS Ma322 - Final Exam Spring 2011 May 3,4, 2011 DO NOT TURN THIS PAGE UNTIL YOU ARE INSTRUCTED TO DO SO. Be sure to show all work and justify your answers. There are 8 problems and
More informationLecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1)
Lecture 21: The decomposition theorem into generalized eigenspaces; multiplicity of eigenvalues and upper-triangular matrices (1) Travis Schedler Tue, Nov 29, 2011 (version: Tue, Nov 29, 1:00 PM) Goals
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMath 25a Practice Final #1 Solutions
Math 25a Practice Final #1 Solutions Problem 1. Suppose U and W are subspaces of V such that V = U W. Suppose also that u 1,..., u m is a basis of U and w 1,..., w n is a basis of W. Prove that is a basis
More informationLinear Algebra Final Exam Solutions, December 13, 2008
Linear Algebra Final Exam Solutions, December 13, 2008 Write clearly, with complete sentences, explaining your work. You will be graded on clarity, style, and brevity. If you add false statements to a
More informationLecture 11: Diagonalization
Lecture 11: Elif Tan Ankara University Elif Tan (Ankara University) Lecture 11 1 / 11 Definition The n n matrix A is diagonalizableif there exits nonsingular matrix P d 1 0 0. such that P 1 AP = D, where
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 informationCourse Notes: Week 1
Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues
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 informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationEigenvalues and Eigenvectors. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Eigenvalues and Eigenvectors Consider the equation A x = λ x, where A is an nxn matrix. We call x (must be non-zero) an eigenvector of A if this equation can be solved for some value of λ. We call λ an
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
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 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 informationFurther linear algebra. Chapter IV. Jordan normal form.
Further linear algebra. Chapter IV. Jordan normal form. Andrei Yafaev In what follows V is a vector space of dimension n and B is a basis of V. In this chapter we are concerned with linear maps T : V V.
More informationSUPPLEMENT TO CHAPTERS VII/VIII
SUPPLEMENT TO CHAPTERS VII/VIII The characteristic polynomial of an operator Let A M n,n (F ) be an n n-matrix Then the characteristic polynomial of A is defined by: C A (x) = det(xi A) where I denotes
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 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 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 informationft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST
me me ft-uiowa-math2550 Assignment NOTRequiredJustHWformatOfQuizReviewForExam3part2 due 12/31/2014 at 07:10pm CST 1. (1 pt) local/library/ui/eigentf.pg A is n n an matrices.. There are an infinite number
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationDetermining Unitary Equivalence to a 3 3 Complex Symmetric Matrix from the Upper Triangular Form. Jay Daigle Advised by Stephan Garcia
Determining Unitary Equivalence to a 3 3 Complex Symmetric Matrix from the Upper Triangular Form Jay Daigle Advised by Stephan Garcia April 4, 2008 2 Contents Introduction 5 2 Technical Background 9 3
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 SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationJordan Canonical Form
Jordan Canonical Form Massoud Malek Jordan normal form or Jordan canonical form (named in honor of Camille Jordan) shows that by changing the basis, a given square matrix M can be transformed into a certain
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 informationComputation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated.
Math 504, Homework 5 Computation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated 1 Find the eigenvalues and the associated eigenspaces
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationThe Eigenvalue Problem: Perturbation Theory
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 13 Notes These notes correspond to Sections 7.2 and 8.1 in the text. The Eigenvalue Problem: Perturbation Theory The Unsymmetric Eigenvalue Problem Just
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationMath 2030, Matrix Theory and Linear Algebra I, Fall 2011 Final Exam, December 13, 2011 FIRST NAME: LAST NAME: STUDENT ID:
Math 2030, Matrix Theory and Linear Algebra I, Fall 20 Final Exam, December 3, 20 FIRST NAME: LAST NAME: STUDENT ID: SIGNATURE: Part I: True or false questions Decide whether each statement is true or
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 information