SUPPLEMENT TO CHAPTERS VII/VIII
|
|
- Phebe Powers
- 5 years ago
- Views:
Transcription
1 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 the n n-identity matrix If τ L(V ) is a linear operator of a finite dimensional vector space V, the characteristic polynomial of τ is defined as follows: Let B = (b 1,, b n ) be an ordered basis of V and let M = [τ] B = ([τ(b 1 )] B [τ(b n )] B ) denote the matrix which represents τ with respect to the ordered basis B Then the characteristic polynomial of τ is defined as: C τ (x) = det(xi M) This definition only makes sense if it is independent of the choice of the chosen ordered basis B Let B = (b 1,, b n) be another ordered basis of V The matrix of τ with respect to B : relates to [τ] B by: M = [τ] B = ([τ(b 1)] B [τ(b n)] B ) [τ] B = M B,B [τ] B M 1 B,B, that is, [τ] B and [τ] B are similar matrices The next proposition shows that similar matrices have the same characteristic polynomial Proposition A Similar matrices have the same characteristic polynomial Proof Let A, B, P M n,n (F ) with P invertible (nonsingular) so that: Then: B = P AP 1 C B (x) = det(xi B) = det(xi P AP 1 ) = det(p (xi)p 1 P AP 1 ) = det(p (xi A)P 1 ) = det(p )det(xi A)det(P ) 1 = det(xi A) = C A (x) 1 Typeset by AMS-TEX
2 2 SUPPLEMENT TO CHAPTERS VII/VIII The companion matrix Let V be a finite dimensional vector space and τ L(V ) a linear operator Suppose that decomposes as follows into a direct sum of cyclic F [x]-modules: This means that where U i are submodules with = F [x]/(f1 (x)) F [x]/(f r (x)) = U 1 U r U i = F [x]/(f i (x)) Case 1: First assume that is a cyclic F [x]-module, that is, = F [x]/(f(x)) where f(x) = x n + a n 1 x n 1 + a 1 x + a 0 is a monic polynomial Note that and F [x]/(f(x)) are isomorphic as F [x]-modules and as vector spaces over F Proposition B [1], [x],, [x n 1 ] is a basis of the F -vector space F [x]/(f(x)) Proof Let [g(x)] F [x]/(f(x)) We make use of the division algorithm in F [x] and write g(x) = q(x)f(x) + r(x) where r(x) = 0 or deg(r(x)) < deg(f(x)) Suppose that r(x) = b n 1 x n 1 + b 1 x+ b 0 Since g(x) r(x) mod f(x): [g(x)] = [r(x)] = b n 1 [x n 1 ] + + b 1 [x] + b 0 [1] This shows that [1], [x],, [x n 1 ] spans F [x]/(f(x)) In order to show that [1], [x],, [x n 1 ] are linearly independent, suppose that r 0 [1] + r 1 [x] + + r n 1 [x n 1 ] = [r 0 + r 1 x + + r n 1 x n 1 ] = [0] = 0 where r i F Then f(x) divides the polynomial r 0 + r 1 x + + r n 1 x n 1 and by degree reasons r i = 0 for all 0 i n 1 Since and F [x]/(f(x)) are isomorphic, there is an isomorphism of F [x]- modules: Γ : F [x]/(f(x)) Note that Γ is also an isomorphism of the F -vector spaces There is a vector v V with Γ(v) = [1] Since Γ is an isomorphism of the F [x]-modules we have that Similarly, for i N: Γ(τ(v)) = Γ(xv) = xγ(v) = x[1] = [x] Γ(τ i (v)) = Γ(x i v) = x i Γ(v) = x i [1] = [x i ] This proves that B = (v, τ(v),, τ n 1 (v)) is a basis of V, since B is mapped under the isomorphism Γ into a basis of the F -vector space F [x]/(f(x))
3 SUPPLEMENT TO CHAPTERS VII/VIII 3 We want to find the matrix of τ with respect to the basis B = (v, τ(v),, τ n 1 (v)) where v V is such that Γ(v) = [1] Set b i = τ i (v) Then τ(b i ) = b i+1 for all 0 i n 1 It remains to compute τ(b n ) Since x n a n 1 x n 1 a 1 x a 0 mod f(x) we have that Thus [x n ] = [ a n 1 x n 1 a 1 x a 0 ] = a n 1 [x n 1 ] a 1 [x]x a 0 [1] Γ(τ(τ n 1 (v))) = Γ(x(τ n 1 (v))) Since Γ is an isomorphism This shows that = xγ(τ n 1 (v)) = x[x n 1 ] = [x n ] = a n 1 [x n 1 ] a 1 [x] a 0 [1] = a n 1 Γ(τ n 1 (v)) a 1 Γ(τ(v)) a 0 Γ(v) = Γ( a n 1 τ n 1 a 1 τ(v) a 0 v) τ(b n ) = τ(τ n 1 (v)) = a n 1 τ n 1 (v) a 1 τ(v) a 0 v = a n 1 b n a 1 b 2 a 0 b a a a 2 [τ] B = a n 1 Proposition C If is a cyclic F [x]-module with = F [x]/(f(x)) then C τ (x) = f(x) Proof Using the basis B = (v, τ(v),, τ n 1 (v)) from above, we see that x a 0 1 x 0 0 a x 0 a 2 C τ (x) = det x + a n 1
4 4 SUPPLEMENT TO CHAPTERS VII/VIII The value of the determinant is not changed if we add the multiple of one row to another row Add to obtain: x 2nd row to the first row x 2 3d row to the first row x n 1 last row to the first row f(x) 1 x 0 0 a a 2 C τ (x) = det x + a n 1 By switching the first row with every other row the determinant is at each step multiplied by 1, and Thus 1 x 0 0 a x 0 a a C τ (x) = ( 1) n 1 3 det f(x) which proves the assertion Theorem D If then C τ (x) = ( 1) n 1 ( 1) n 1 f(x) = F [x]/(f1 (x)) F [x]/(f r (x)) C τ (x) = f 1 (x) f r (x) Proof Under the assumption decomposes into a direct sum of submodules: = U 1 U r where U i = F [x]/(fi (x)) Each U i is a τ-invariant subspace of V, thus τ i = τ Ui a linear operator of U i By the 1st case there is a vector v i U i so that is B i = (v i, τ(v i ),, τ s i 1 (v i )) is an ordered basis of U i where s i = dim(u i ) Then B = B 1 B r
5 SUPPLEMENT TO CHAPTERS VII/VIII 5 is a basis of V and ( ) [τ] B = [τ U1 ] B [τ U2 ] B2 0 that is, [τ] B is a block matrix Thus 0 0 [τ Ur ] Br xi 1 [τ U1 ] B1 xi 2 [τ U2] B2 0 xi [τ] B = 0 xir [τ Ur ]Br is again a block matrix and C τ (x) = det(xi [τ] B ) = det(xi i [τ Ui ] Bi ) = f i (x) Definition The matrix ( ) is called the companion matrix of τ Eigenvalues and eigenvectors Let V be a finite dimensional vector space over a field F and τ L(V ) a linear operator Suppose that M = [τ] B is the matrix representing τ with respect to the ordered basis B The characteristic polynomial of τ is given by: C τ (x) = det(xi M) A root λ F of C τ (x) is called an eigenvalue of τ In particular, if λ is an eigenvalue of τ, then det(λi M) = 0 and the matrix λi M has a nontrivial null space Every nonzero vector a null(λi M) satisfies that Ma = λa Since every nonzero a null(λi M) corresponds to a nonzero vector v ker(λι τ), for every eigenvalue λ of τ there is a nonzero vector v V with τ(v) = λv Such a nonzero vector v is called an eigenvector of τ belonging to λ More generally, we define the eigenspace belonging to λ by: E λ = ker(λι τ) = {v V τ(v) = λv} Note that E λ is the set of eigenvectors fo λ together with the zero vector Theorem E (Cayley-Hamilton) Let V be a finite dimensional vector space, τ L(V ), and C τ (x) the characteristic polynomial of τ Then C τ (τ) = 0 Proof The F [x]-module is isomorphic to: = F [x]/(p e 1 1 ) F [x]/(pe r )
6 6 SUPPLEMENT TO CHAPTERS VII/VIII where p e 1 1,, pe r r are the elementary divisors of V We have seen in the last section that C τ = Moreover, the minimal polynomial m τ (x) of τ is the least common multiple of p e 1 1,, pe r r This implies that m τ (x) divides C τ (x) and that C τ (τ) = 0 Theorem 84 Suppose that λ 1,, λ k are distinct eigenvalues of the linear operator τ L(V ) p e i i (1) If i j then E λi E λj = {0} (2) If v i E λi (0) for all 1 i k then v 1, v k are linearly independent Proof (1) Let v E λi E λj Then τ(v) = λ i v = λ j v Since λ i λ j and since every nonzero vector is linearly independent, it follows that v = 0 (2) The proof is by induction on k The case k = 1 is trivial For the induction step assume that v 1,, v k 1 are linearly independent and that v 1,, v k are linearly dependent Then there are scalars r i F, not all r i = 0, so that ( ) r 1 v 1 + r 2 v r k v k = 0 Note that since v 1,, v k 1 are linearly independent we have that r k 0 and that at least one r i 0 for some 1 i k 1 Applying τ to ( ) yields: Multiplying ( ) by λ k gives: Subtract (2) from (1): (1) r 1 λ 1 v 1 + r 2 λ 2 v r k λv k = 0 (2) r 1 λ k v 1 + r 2 λ k v r k λ k v k = 0 ( ) r 1 (λ 1 λ k )v 1 + r 2 (λ 2 λ k )v r k 1 (λ k 1 λ k )v k 1 = 0 By assumption λ i λ k 0 for all 1 i k 1 Moreover, r i 0 for at least one 1 i k 1 Thus ( ) is a nontrivial linear combination of the zero vector and v 1,, v k 1 are linearly dependent, contradiction Jordan forms Let V be a finite dimensional vector space and τ L(V ) a linear operator of V Throughout this section suppose that the characteristic polynomial splits completely into linear factors: C τ (x) = where λ i λ j if i j This implies that (x λ i ) l i = F [x]/((x µ1 ) e 1 ) F [x]/((x µ t ) e t )
7 SUPPLEMENT TO CHAPTERS VII/VIII 7 where (x µ 1 ) e 1,, (x µ t ) e t are the elementary divisors of Note that {µ 1,, µ t } = {λ 1,, λ r } and possibly µ i = µ j if i j As in the second section can be written as = U 1 U t where U i is a submodule of with U i = F [x]/((x µi ) e i Case 1: = F [x]/((x µ) e ) Let : F [x]/((x µ) e ) be an isomorphisms of F [x]-modules Note that is also an isomorphism of F -vector spaces The F -vector space F [x]/((x µ) e has basis [(x µ) e 1 ], [(x µ) e 2 ],, [x µ], [1] Let b 1,, b e V so that (b 1 ) = [(x µ) e 1 ], (b 2 ) = [(x µ) e 1 ],, (b e 1 ) = [x µ], (b e ) = [1] Since is also an isomorphism of the F -vector spaces, B = (b 1,, b e ) is an ordered basis of V We want to find τ(b i ) Note that ((τ µι)(b 1 )) = ((x µ)b 1 ) = (x µ) (b 1 ) = (x µ)[(x µ) e 1 ] = [(x µ) e ] = 0 Thus (τ µι)(b 1 ) = 0 and τ(b 1 ) = µb 1 Similarly, for 2 i n ((τ µι)b i ) = ((x µ)b i ) = (x µ) (b i ) = (x µ)[(x µ) e i ] = [(x µ) e (i 1) ] = (b i 1 ) Thus (τ µι)(b i ) = b i 1 and τ(b i ) = b i 1 + µb i This implies that the matrix of τ with respect to the basis B has the form µ µ µ 0 0 [τ] B = µ µ A matrix of the above form is called a Jordan block
8 8 SUPPLEMENT TO CHAPTERS VII/VIII General case: Suppose now that and that = F [x]/((x µ1 ) e 1 ) F [x]/((x µ t ) e t )) = U 1 U t where U i is a submodule of with U i = F [x]/((x µi ) e i ) Note that each U i is a τ-invariant subspace of V and τ Ui is an operator of U i By the first case for each 1 i t there is a basis B i of U i so that the matrix of τ Bi is a Jordan block: µ i µ i µ i 0 0 [τ Ui ] Bi = µ i µ i Then B = B 1 B t is an ordered basis of V and the matrix of τ with respect to B is a block matrix consisting of Jordan blocks ( ) [τ] B = [τ U1 ] B [τ U2 ] B [τ Ut ] Bt The matrix [τ] B is called a Jordan form of τ matrix Note that [τ] B is a triangular Theorem E Let A, B M n,n (F ) so that the characteristic polynomials of A and B split completely into linear factors Then A and B are similar if and only if A and B have the same Jordan form (up to order of the Jordan blocks) Remark (a) The Jordan form of a matrix A (a linear operator τ, respectively) only exists if the characteristic polynomial splits into linear factors For example, if F = C is the field of complex numbers, then every linear operator over a complex vector space has a Jordan form (b) Suppose that τ L(V )is a linear operator and B is an ordered basis of V so that [τ] B is a Jordan form Then one can read off the elementary divisors of from [τ] B Computation of the Jordan form Definition A matrix A M n,n is called nilpotent if A m = 0 for some m N Remark 1 Consider the n n-matrix A =
9 SUPPLEMENT TO CHAPTERS VII/VIII 9 A is a nilpotent matrix of rank n 1 In particular, rk(a i ) = n i for 1 i n, A n 1 0, and A n = 0 Remark 2 If A, B M n,n (F ) are similar matrices then so are the matrices λi A m and λi B m Proof Suppose that B = P AP 1 where P M n,n (F ) is an invertible matrix Then λi B m = λi (P AP 1 ) m = λi (P AP 1 )(P AP 1 ) (P AP 1 ) = λi P A m P 1 = P (λi A m )P 1 Let A M n,n (F ) be a matrix In order to find the Jordan form of A (if it exists), we start by computing the characteristic polynomial C A (x) of A Then we need to split the characteristic polynomial into linear factors If this is not possible, the Jordan form fails to exit Suppose now that C A (x) splits into linear factors: C A (x) = (x λ i ) t i where λ i λ j if i j Case: 1: C A (x) = (x λ) n In this case the Jordan form of A is: λ λ 1 0 λ J A = λ λ 0 1 λ We need to find the number and size of the Jordan blocks in J A J A is an n n- matrix of rank n if λ 0 and rank n s if λ = 0, where s is the number of Jordan blocks in J A Thus, if λ 0, then in λi J A the rank in each Jordan block is lowered by 1 and σ 1 = n rk(λi J A ) is the number of Jordan blocks in J A Hence: σ 1 = n rk(λi J A ) is the number of Jordan blocks in J A By taking (λi J A ) 2 the rank of each Jordan block of size 2 is lowered by 1 and σ 2 = rk(λi J A ) rk(λi J A ) 2 is the number of Jordan blocks of size 2 Continuing like this we see that σ k = rk(λi J A ) k 1 rk(λi J A ) k
10 10 SUPPLEMENT TO CHAPTERS VII/VIII is the number of Jordan blocks of size k From the σ i we can determine the number of Jordan blocks of size k General case: Suppose now that C A (x) = (x λ i ) t i where λ i λ j if i j Note that every eigenvalue λ i occurs exactly t i times on the diagonal of J A and that n = r t i In the matrix λ i I J A the rank of every Jordan block belonging to λ j for j i is maximal, while, if λ i 0, the rank of each Jordan block belonging to λ i is lowered by 1 Hence again σ (1) 1 = n rk(λ i I J A ) is the number of Jordan blocks belonging to λ i Similarly, σ (i) k = rk(λ ii J A ) k 1 rk(λ i I J A ) k is the number of Jordan blocks belonging to λ i of size k Of course, we want a formula to compute the Jordan form which should not involve the (unknown) Jordan form of A Notice that by Remark 2, rk(λi A) i = rk(λi J A ) i since (λi A) i and (λi J A ) i are similar matrices Thus, in order to compute the Jordan form of a given n n-matrix A, we follow the following steps: Step 1: Find the characteristic polynomial C A (x) of A Step 2: Find the roots of C A (x) and decide if C A (x) splits into linear factors If C A (x) fails to split into linear factors, the Jordan form of A does not exist So, suppose that C A (x) splits into linear factors: C A (x) = (x λ i ) t i where λ i λ j if i j Step 3: Let σ (i) k denote the number of Jordan blocks belonging to λ i of size k Then σ (i) 1 = n rk(λ i I A) and σ (i) k = rk(λ ii A) k 1 rk(λ i I A) k if k > 1 Then σ k i σk+1 i is the number of Jordan blocks belonging to λ i of size k Triangularization and diagonalization Definition An n n-matrix A is called triangularizable if A is similar to a triangular matrix Similarly, A is diagonalizable if A is similar to a diagonal matrix
11 SUPPLEMENT TO CHAPTERS VII/VIII 11 Theorem F Let A be an n n-matrix with characteristic polynomial C A (x) and minimal polynomial m A (x) (a) A is triangularizable if and only if C A (x) splits into linear factors (b) A is diagonalizable if and only if m A (x) splits into linear factors and has only simple roots Proof (a) If A is similar to a triangular matrix B, then A and B have the same characteristic polynomial Obviously, the characteristic polynomial of B is a product of linear factors Conversely, if C A (x) splits into linear factors, the Jordan form of A exists, which is a triangular matrix (b) Suppose that A is similar to a diagonal matrix B Similar matrices have the same minimal polynomial since their associated F [x]-modules are isomorphic Obviously, the minimal polynomial of a diagonal matrix splits into linear factors and only has simple roots Conversely, if m A (x) splits into linear factors and only has simple roots, then C A (x) splits into linear factors and A has a Jordan form Moreover, the elementary divisors of A are linear polynomials Thus all Jordan blocks of J A have size 1 and J A is a diagonal matrix
Linear 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 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 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 informationLinear Algebra II Lecture 22
Linear Algebra II Lecture 22 Xi Chen University of Alberta March 4, 24 Outline Characteristic Polynomial, Eigenvalue, Eigenvector and Eigenvalue, Eigenvector and Let T : V V be a linear endomorphism. We
More informationAnswer Keys For Math 225 Final Review Problem
Answer Keys For Math Final Review Problem () For each of the following maps T, Determine whether T is a linear transformation. If T is a linear transformation, determine whether T is -, onto and/or bijective.
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More 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 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 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 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 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 informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More 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 information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
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 informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationM.6. Rational canonical form
book 2005/3/26 16:06 page 383 #397 M.6. RATIONAL CANONICAL FORM 383 M.6. Rational canonical form In this section we apply the theory of finitely generated modules of a principal ideal domain to study the
More informationSolution. That ϕ W is a linear map W W follows from the definition of subspace. The map ϕ is ϕ(v + W ) = ϕ(v) + W, which is well-defined since
MAS 5312 Section 2779 Introduction to Algebra 2 Solutions to Selected Problems, Chapters 11 13 11.2.9 Given a linear ϕ : V V such that ϕ(w ) W, show ϕ induces linear ϕ W : W W and ϕ : V/W V/W : Solution.
More informationThe converse is clear, since
14. The minimal polynomial For an example of a matrix which cannot be diagonalised, consider the matrix ( ) 0 1 A =. 0 0 The characteristic polynomial is λ 2 = 0 so that the only eigenvalue is λ = 0. The
More informationSolutions for Math 225 Assignment #4 1
Solutions for Math 225 Assignment #4 () Let B {(3, 4), (4, 5)} and C {(, ), (0, )} be two ordered bases of R 2 (a) Find the change-of-basis matrices P C B and P B C (b) Find v] B if v] C ] (c) Find v]
More informationSolutions for Math 225 Assignment #5 1
Solutions for Math 225 Assignment #5 1 (1) Find a polynomial f(x) of degree at most 3 satisfying that f(0) = 2, f( 1) = 1, f(1) = 3 and f(3) = 1. Solution. By Lagrange Interpolation, ( ) (x + 1)(x 1)(x
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 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 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 non-zero vector u such that A u λ u. ()
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 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 informationEigenvalues and Eigenvectors
November 3, 2016 1 Definition () The (complex) number λ is called an eigenvalue of the n n matrix A provided there exists a nonzero (complex) vector v such that Av = λv, in which case the vector v is called
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 informationGroup Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G.
Group Theory Jan 2012 #6 Prove that if G is a nonabelian group, then G/Z(G) is not cyclic. Aug 2011 #9 (Jan 2010 #5) Prove that any group of order p 2 is an abelian group. Jan 2012 #7 G is nonabelian nite
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 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 informationEXERCISES AND SOLUTIONS IN LINEAR ALGEBRA
EXERCISES AND SOLUTIONS IN LINEAR ALGEBRA Mahmut Kuzucuoğlu Middle East Technical University matmah@metu.edu.tr Ankara, TURKEY March 14, 015 ii TABLE OF CONTENTS CHAPTERS 0. PREFACE..................................................
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 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 informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More information(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).
.(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)
More 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 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 informationTherefore, A and B have the same characteristic polynomial and hence, the same eigenvalues.
Similar Matrices and Diagonalization Page 1 Theorem If A and B are n n matrices, which are similar, then they have the same characteristic equation and hence the same eigenvalues. Proof Let A and B be
More 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 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 informationEigenvalues and Eigenvectors
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 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 Normal Form. Chapter Minimal Polynomials
Chapter 8 Jordan Normal Form 81 Minimal Polynomials Recall p A (x) =det(xi A) is called the characteristic polynomial of the matrix A Theorem 811 Let A M n Then there exists a unique monic polynomial q
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 informationLinear Algebra. Workbook
Linear Algebra Workbook Paul Yiu Department of Mathematics Florida Atlantic University Last Update: November 21 Student: Fall 2011 Checklist Name: A B C D E F F G H I J 1 2 3 4 5 6 7 8 9 10 xxx xxx xxx
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 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 informationDiagonalization. Hung-yi Lee
Diagonalization Hung-yi Lee Review If Av = λv (v is a vector, λ is a scalar) v is an eigenvector of A excluding zero vector λ is an eigenvalue of A that corresponds to v Eigenvectors corresponding to λ
More 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 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 informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
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 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 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 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 informationPOLYNOMIAL EQUATIONS OVER MATRICES. Robert Lee Wilson. Here are two well-known facts about polynomial equations over the complex numbers
POLYNOMIAL EQUATIONS OVER MATRICES Robert Lee Wilson Here are two well-known facts about polynomial equations over the complex numbers (C): (I) (Vieta Theorem) For any complex numbers x,..., x n (not necessarily
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 and Eigenvectors
CHAPTER Eigenvalues and Eigenvectors CHAPTER CONTENTS. Eigenvalues and Eigenvectors 9. Diagonalization. Complex Vector Spaces.4 Differential Equations 6. Dynamical Systems and Markov Chains INTRODUCTION
More informationThe Cyclic Decomposition Theorem
The Cyclic Decomposition Theorem Math 481/525, Fall 2009 Let V be a finite-dimensional F -vector space, and let T : V V be a linear transformation. In this note we prove that V is a direct sum of cyclic
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 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 informationMAC Module 12 Eigenvalues and Eigenvectors. Learning Objectives. Upon completing this module, you should be able to:
MAC Module Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to: Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationMAC Module 12 Eigenvalues and Eigenvectors
MAC 23 Module 2 Eigenvalues and Eigenvectors Learning Objectives Upon completing this module, you should be able to:. Solve the eigenvalue problem by finding the eigenvalues and the corresponding eigenvectors
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationLinear Algebra III Lecture 11
Linear Algebra III Lecture 11 Xi Chen 1 1 University of Alberta February 13, 2015 Outline Minimal Polynomial 1 Minimal Polynomial Minimal Polynomial The minimal polynomial f (x) of a square matrix A is
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More 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 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 informationAlgebra qual study guide James C. Hateley
Algebra qual study guide James C Hateley Linear Algebra Exercise It is known that real symmetric matrices are always diagonalizable You may assume this fact (a) What special properties do the eigenspaces
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 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 informationThe minimal polynomial
The minimal polynomial Michael H Mertens October 22, 2015 Introduction In these short notes we explain some of the important features of the minimal polynomial of a square matrix A and recall some basic
More informationEigenvalues and Eigenvectors 7.2 Diagonalization
Eigenvalues and Eigenvectors 7.2 Diagonalization November 8 Goals Suppose A is square matrix of order n. Provide necessary and sufficient condition when there is an invertible matrix P such that P 1 AP
More informationCANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES. D. Katz
CANONICAL FORMS FOR LINEAR TRANSFORMATIONS AND MATRICES D. Katz The purpose of this note is to present the rational canonical form and Jordan canonical form theorems for my M790 class. Throughout, we fix
More informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More information(f + g)(s) = f(s) + g(s) for f, g V, s S (cf)(s) = cf(s) for c F, f V, s S
1 Vector spaces 1.1 Definition (Vector space) Let V be a set with a binary operation +, F a field, and (c, v) cv be a mapping from F V into V. Then V is called a vector space over F (or a linear space
More informationAnnouncements Monday, October 29
Announcements Monday, October 29 WeBWorK on determinents due on Wednesday at :59pm. The quiz on Friday covers 5., 5.2, 5.3. My office is Skiles 244 and Rabinoffice hours are: Mondays, 2 pm; Wednesdays,
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 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 informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationSpring 2019 Exam 2 3/27/19 Time Limit: / Problem Points Score. Total: 280
Math 307 Spring 2019 Exam 2 3/27/19 Time Limit: / Name (Print): Problem Points Score 1 15 2 20 3 35 4 30 5 10 6 20 7 20 8 20 9 20 10 20 11 10 12 10 13 10 14 10 15 10 16 10 17 10 Total: 280 Math 307 Exam
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 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 informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 3. M Test # Solutions. (8 pts) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this
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 information(Can) Canonical Forms Math 683L (Summer 2003) M n (F) C((x λ) ) =
(Can) Canonical Forms Math 683L (Summer 2003) Following the brief interlude to study diagonalisable transformations and matrices, we must now get back to the serious business of the general case. In this
More informationEigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto
7.1 November 6 7.1 Eigenvalues and Eigenvecto Goals Suppose A is square matrix of order n. Eigenvalues of A will be defined. Eigenvectors of A, corresponding to each eigenvalue, will be defined. Eigenspaces
More informationBASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationTravis Schedler. Thurs, Oct 27, 2011 (version: Thurs, Oct 27, 1:00 PM)
Lecture 13: Proof of existence of upper-triangular matrices for complex linear transformations; invariant subspaces and block upper-triangular matrices for real linear transformations (1) Travis Schedler
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More 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 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 informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationFinal 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 informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More information