Lecture 1: Schur s Unitary Triangularization Theorem


 Evan Pearson
 1 years ago
 Views:
Transcription
1 Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections 21, 22, and 24 of the textbook 1 Unitary matrices Definition 1 A matrix U M n is called unitary if UU I ( U U) If U is a real matrix (in which case U is just U ), then U is called an orthogonal matrix Observation: If U, V M n are unitary, then so are Ū, U, U ( U 1 ), UV Observation: If U is a unitary matrix, then det U 1 Examples: Matrices of reflection and of rotations are unitary (in fact, orthogonal) matrices For instance, in 3Dspace, 1 reflection along the zaxis: U 1, det U 1, 1 cos θ sin θ rotation along the zaxis: U sin θ cos θ, det U 1 1 That these matrices are unitary is best seen using one of the alternate characterizations listed below Theorem 2 Given U M n, the following statements are equivalent: (i) U is unitary, (ii) U preserves the Hermitian norm, ie, Ux x for all x C n (iii) the columns U 1,, U n of U form an orthonormal system, ie, { U i, U j δ i,j, in other words Uj 1 if i j, U i if i j 1
2 Proof (i) (ii) If U U I, then, for any x C n, Ux 2 2 Ux, Ux U Ux, x x, x x 2 2 (ii) (iii) Let (e 1, e 2,, e n ) denote the canonical basis of C n Assume that U preserves the Hermitian norm of every vector We obtain, for j {1,, n}, U j, U j U j 2 2 Ue j 2 2 e j Moreover, for i, j {1,, n} with i j, we have, for any complex number λ of modulus 1, R λu i, U j 1 ( λui + U j 2 2 U i 2 2 U j 2 1 ( 2 2) U(λei + e j ) 2 2 U(e i ) 2 2 U(e j ) 2 2 2) 1 ( λei + e j 2 2 e i 2 2 e j 2 ) 2 2 This does imply that U i, U j (argue for instance that λu i, U j R λu i, U j for a properly chosen λ C with λ 1) (iii) (i) Observe that the (i, j)th entry of U U is U i U j to realize that (iii) directly translates into U U I According to (iii), a unitary matrix can be interpreted as the matrix of an orthonormal basis in another orthonormal basis In terms of linear maps represented by matrices A, the change of orthonormal bases therefore corresponds to the transformation A UAU for some unitary matrix U This transformation defines the unitary equivalence Definition 3 Two matrices A, B M n are called unitary equivalent if there exists a unitary matrix U M n such that B UAU Observation: If A, B M n are unitary equivalent, then a i,j 2 b i,j 2 Indeed, recall form Lect1Ex3 that a i,j 2 tr (A A) and b i,j 2 tr (B B), and then write tr ( B B ) tr ( (UAU ) (UAU ) ) tr ( UA U UAU ) tr ( UA AU ) tr ( U UA A ) tr ( A A ) 2
3 2 Statement of Schur s theorem and some of its consequences Schur s unitary triangularization theorem says that every matrix is unitarily equivalent to a triangular matrix Precisely, it reads as follows Theorem 4 Given A M n with eigenvalues λ 1,, λ n, counting multiplicities, there exists a unitary matrix U M n such that λ 1 x x A U λ 2 x U λ n Note that such a decomposition is far from unique (see Example 232 p881) Let us now state a few consequences from Schur s theorem First, Cayley Hamilton theorem says that every square matrix annihilates its own characteristic polynomial Theorem 5 Given A M n, one has p A (A) The second consequence of Schur s theorem says that every matrix is similar to a blockdiagonal matrix where each block is upper triangular and has a constant diagonal This is an important step in a possible proof of Jordan canonical form Theorem 6 Given A M n with distinct eigenvalues λ 1,, λ k, there is an invertible matrix S M n such that T 1 λ i x x A S T 2 S 1, where T i has the form T i λ i x T k λ i The arguments for Theorems 5 and 6 (see next section) do not use the unitary equivalence stated in Schur s theorem, but merely the equivalence The unitary equivalence is nonetheless crucial for the final consequence of Schur s theorem, which says that there are diagonalizable matrices arbitrary close to any matrix (in other words, the set of diagonalizable matrices is dense in M n ) Theorem 7 Given A M n and ε >, there exists a diagonalizable matrix Ã M n such that a i,j ã i,j 2 < ε 3
4 3 Proofs Proof of Theorem 4 We proceed by induction on n 1 For n 1, there is nothing to do Suppose now the result true up to an integer n 1, n 2 Let A M n with eigenvalues λ 1,, λ n, counting multiplicities Consider an eigenvector v 1 associated to the eigenvalue λ 1 We may assume that v We use it to form an orthonormal basis (v 1, v 2,, v n ) The matrix A is equivalent to the matrix of the linear map x Ax relative to the basis (v 1, v 2,, v n ), ie, λ 1 x x (1) A V Ã V 1, ] where V [v 1 v n is the matrix of the system (v 1, v 2,, v n ) relative to the canonical basis Since this is a unitary matrix, the equivalence of (1) is in fact a unitary equivalence Note that p A (x) (λ 1 x)pã(x), so that the eigenvalues of Ã M n 1, counting multiplicities, are λ 2,, λ n We use the induction hypothesis to find a unitary matrix W M n 1 such that λ 2 x x λ 2 x x Ã W W, ie, W Ã W x x λ n λ n Now observe that 1 λ 1 x x 1 1 λ 1 x x W Ã W W Ã W λ 1 x x λ 1 x x W Ã W λ 2 x λ n 1 Since W : is a unitary matrix, this reads W λ 1 x x λ 1 x x (2) Ã W λ 2 x W λ n Putting the unitary equivalences (1) and (2) together shows the result of Theorem 4 (with U V W ) for the integer n This concludes the inductive proof 4
5 Now that Schur s theorem is established, we may prove the consequences stated in Section 2 Proof of Theorem 5 First attempt, valid when A is diagonalizable In this case, there is a basis (v 1,, v n ) of eigenvectors associated to (not necessarily distinct) eigenvalues λ 1,, λ n It is enough to show that the matrix p A (A) vanishes on each basis vector v i, 1 i n Note that p A (A) (λ 1 I A) (λ n I A) [(λ 1 I A) (λ i 1 I A)(λ i+1 I A) (λ n I A)](λ i I A), because (λ i I A) commutes with all (λ j I A) Then the expected results follows from p A (A)(v i ) [ ](λ i I A)(v i ) [ ]() Final proof Let λ 1,, λ n be the eigenvalues of A M n, counting multiplicities According to Schur s theorem, we can write λ 1 x x A ST S 1 λ, where T 2 x λ n Since P (A) SP (T )S 1 for any polynomial P, we have in particular p A (A) Sp A (T )S 1, so it is enough to show that p A (T ) We compute p A (T ) (λ 1 I T )(λ 2 I T ) (λ n I T ) x x x x x x x x x x x x x x X x x X X x x Using repeatedly the observation about multiplication of blocktriangular matrices that x x x x x x x x x x, x x x the zeroblock on the top left propagates until we obtain p A (T ) a rigorous proof of this propagation statement should proceed by induction To establish the next consequence of Schur s theorem, we will use the following result Lemma 8 If A M m and B M n are two matrices with no eigenvalue in common, then the matrices A M A and B B are equivalent for any choice of M M m n 5
6 Proof For X M m n, consider the matrices S and S 1 given by I X S and S 1 I X I I We compute S 1 A S B [ A ] AX XB B The result will follow as soon as we can find X M m n such that AX XB M for our given M M m n If we denote by F the linear map F : X M m n AX XB M m n, it is enough to show that F is surjective But since F is a linear map from M m n into itself, it is therefore enough to show that F is injective, ie, that (3) AX XB? X To see why this is true, let us consider X M m n such that AX XB, and observe that A 2 X A(AX) A(XB) (AX)B (XB)B XB 2, A 3 X A(A 2 X) A(XB 2 ) (AX)B 2 (XB)B 2 XB 3, etc, so that P (A)X XP (B) for any polynomial P If we choose P p A as the characteristic polynomial of A, Cayley Hamilton theorem implies (4) Xp A (B) Denoting by λ 1,, λ n the eigenvalues of A, we have p A (B) (λ 1 I B) (λ n I B) Note that each factor (λ i I B) is invertible, since none of the λ i is an eigenvalue of B, so that p A (B) is itself invertible We can now conclude from (4) that X This establishes (3), and finishes the proof We could have given a less conceptual proof of Lemma 8 in case both A and B are upper triangular (see exercises), which is actually what the proof presented below requires Proof of Theorem 6 For A M n, we sort its eigenvalues as λ 1,, λ 1 ;λ 2,, λ 2 ; ;λ k,, λ k, counting multiplicities Schur s theorem guarantees that A is similar to the matrix T 1 X X λ i x x T 2 where T i λ i X x T k λ i 6
7 We now use the Lemma 8 repeatedly in the chain of equivalences T 1 X X T 1 T 1 T 2 X X T 2 X X T 2 X A T 3 T 3 T 3 X X X T k T k T k T 1 T 1 T 1 T 2 T 2 X T 2 T 3 X T 3 T 3 X T k T k T k T 1 T 2 T k This is the announced result Proof of Theorem 7 Let us sort the eigenvalues of A as λ 1 λ n According to Schur s theorem, there exists a unitary matrix U M n such that λ 1 x x A U λ 2 x U λ n If λ i : λ i + iη and η > is small enough to guarantee that λ 1,, λ n are all distinct, we set λ 1 x x Ã U λ2 x U λn In this case, the eigenvalues of Ã (ie, λ 1,, λ n ) are all distinct, hence Ã is diagonalizable We now notice that ) a i,j ã i,j 2 tr ((A Ã) (A Ã) But since A Ã is unitarily equivalent of the diagonal matrix diag[λ 1 λ 1,, λ n λ n ], this quantity equals 1 i n λ i λ i 2 It follows that a i,j ã i,j 2 i 2 η 2 < ε, 1 i n provided η is chosen small enough to have η 2 < ε/ i i2 7
8 4 Exercises Ex1: Is the sum of unitary matrices also unitary? Ex2: Exercise 2 p 71 Ex3: When is a diagonal matrix unitary? Ex4: Exercise 12 p 72 Ex5: Given A M n with eigenvalues λ 1,, λ n, counting multiplicities, prove that there exists a unitary matrix U M n such that λ 1 A U x λ 2 U x x λ n Ex6: Prove that a matrix U M n is unitary iff it preserves the Hermitian inner product, ie, iff Ux, Uy x, y for all x, y C n Ex7: Given a matrix A M n with eigenvalues λ 1,, λ n, counting multiplicities, and given a polynomial P (x) c d x d + + c 1 x + c, prove that the eigenvalues of P (A) are P (λ 1 ),, P (λ n ), counting multiplicities (Note: this is not quite the same as Exercise 7 from Lecture 1) Ex8: Exercise 5 p 97 Ex9: For any matrix A M n, prove that det(exp(a)) exp(tr (A)) (The exponential of a matrix is defined as the convergent series exp(a) k 1 k! Ak ) Ex1: Given an invertible matrix A M n, show that its inverse A 1 can be expressed as a polynomial of degree n 1 in A Ex11: Without using CayleyHamilton theorem, prove that if T M m and T M n are two upper triangular matrices with no eigenvalue in common, then the matrices T M T and T T are equivalent for any choice of M M m n [Hint: Observe that you need to show T X X T X Start by considering the element in the lower left corner of the matrix T X X T to show that x m,1, then consider the diagonal i j m 2 (the one just above the lower left corner) of the matrix T X X T to show that x m 1,1 and x m,2, etc] 8
Similarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationSummary of week 8 (Lectures 22, 23 and 24)
WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationInner products on R n, and more
Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationNumerical Methods I Eigenvalue Problems
Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420001, Fall 2010 September 30th, 2010 A. Donev (Courant Institute)
More informationLinear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More information3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.
Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R
More informationApplied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
More informationLectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n realvalued matrix A is said to be an orthogonal
More informationThe Hadamard Product
The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 201112 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More informationAdvanced Techniques for Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Advanced Techniques for Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Vectors Arrays of numbers Vectors represent a point in a n dimensional
More informationRecall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.
ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the ndimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationAdditional Topics in Linear Algebra Supplementary Material for Math 540. Joseph H. Silverman
Additional Topics in Linear Algebra Supplementary Material for Math 540 Joseph H Silverman Email address: jhs@mathbrownedu Mathematics Department, Box 1917 Brown University, Providence, RI 02912 USA Contents
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 51 Orthonormal
More informationDiagonalisation. Chapter 3. Introduction. Eigenvalues and eigenvectors. Reading. Definitions
Chapter 3 Diagonalisation Eigenvalues and eigenvectors, diagonalisation of a matrix, orthogonal diagonalisation fo symmetric matrices Reading As in the previous chapter, there is no specific essential
More information1 Eigenvalues and Eigenvectors
Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x
More informationDiagonal, Symmetric and Triangular Matrices
Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by
More informationWe seek a factorization of a square matrix A into the product of two matrices which yields an
LU Decompositions We seek a factorization of a square matrix A into the product of two matrices which yields an efficient method for solving the system where A is the coefficient matrix, x is our variable
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationequations Karl Lundengård December 3, 2012 MAA704: Matrix functions and matrix equations Matrix functions Matrix equations Matrix equations, cont d
and and Karl Lundengård December 3, 2012 Solving General, Contents of todays lecture and (Kroenecker product) Solving General, Some useful from calculus and : f (x) = x n, x C, n Z + : f (x) = n x, x R,
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationSection 2.1. Section 2.2. Exercise 6: We have to compute the product AB in two ways, where , B =. 2 1 3 5 A =
Section 2.1 Exercise 6: We have to compute the product AB in two ways, where 4 2 A = 3 0 1 3, B =. 2 1 3 5 Solution 1. Let b 1 = (1, 2) and b 2 = (3, 1) be the columns of B. Then Ab 1 = (0, 3, 13) and
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationv w is orthogonal to both v and w. the three vectors v, w and v w form a righthanded set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationLinear Algebra: Determinants, Inverses, Rank
D Linear Algebra: Determinants, Inverses, Rank D 1 Appendix D: LINEAR ALGEBRA: DETERMINANTS, INVERSES, RANK TABLE OF CONTENTS Page D.1. Introduction D 3 D.2. Determinants D 3 D.2.1. Some Properties of
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationMATH 551  APPLIED MATRIX THEORY
MATH 55  APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationMATH36001 Background Material 2015
MATH3600 Background Material 205 Matrix Algebra Matrices and Vectors An ordered array of mn elements a ij (i =,, m; j =,, n) written in the form a a 2 a n A = a 2 a 22 a 2n a m a m2 a mn is said to be
More informationWHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE?
WHICH LINEARFRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE? JOEL H. SHAPIRO Abstract. These notes supplement the discussion of linear fractional mappings presented in a beginning graduate course
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationBASIC THEORY AND APPLICATIONS OF THE JORDAN CANONICAL FORM
BASIC THEORY AND APPLICATIONS OF THE JORDAN CANONICAL FORM JORDAN BELL Abstract. This paper gives a basic introduction to the Jordan canonical form and its applications. It looks at the Jordan canonical
More information(January 14, 2009) End k (V ) End k (V/W )
(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.
More informationLINEAR ALGEBRA AND MATRICES M3P9
LINEAR ALGEBRA AND MATRICES M3P9 December 11, 2000 PART ONE. LINEAR TRANSFORMATIONS Let k be a field. Usually, k will be the field of complex numbers C, but it can also be any other field, e.g., the field
More information0.1 Phase Estimation Technique
Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design
More informationSimilar matrices and Jordan form
Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive
More information(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.
Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product
More informationLinear algebra and the geometry of quadratic equations. Similarity transformations and orthogonal matrices
MATH 30 Differential Equations Spring 006 Linear algebra and the geometry of quadratic equations Similarity transformations and orthogonal matrices First, some things to recall from linear algebra Two
More informationLinear Least Squares
Linear Least Squares Suppose we are given a set of data points {(x i,f i )}, i = 1,...,n. These could be measurements from an experiment or obtained simply by evaluating a function at some points. One
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in threespace, we write a vector in terms
More informationDETERMINANTS. b 2. x 2
DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in
More information9.3 Advanced Topics in Linear Algebra
548 93 Advanced Topics in Linear Algebra Diagonalization and Jordan s Theorem A system of differential equations x = Ax can be transformed to an uncoupled system y = diag(λ,, λ n y by a change of variables
More information2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors
2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LUdecomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationMatrix Inverse and Determinants
DM554 Linear and Integer Programming Lecture 5 and Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1 2 3 4 and Cramer s rule 2 Outline 1 2 3 4 and
More informationIterative Methods for Computing Eigenvalues and Eigenvectors
The Waterloo Mathematics Review 9 Iterative Methods for Computing Eigenvalues and Eigenvectors Maysum Panju University of Waterloo mhpanju@math.uwaterloo.ca Abstract: We examine some numerical iterative
More information1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each)
Math 33 AH : Solution to the Final Exam Honors Linear Algebra and Applications 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each) (1) If A is an invertible
More informationFacts About Eigenvalues
Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More information17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
More informationPractice Math 110 Final. Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16.
Practice Math 110 Final Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16. 1. Let A = 3 1 1 3 3 2. 6 6 5 a. Use Gauss elimination to reduce A to an upper triangular
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationPresentation 3: Eigenvalues and Eigenvectors of a Matrix
Colleen Kirksey, Beth Van Schoyck, Dennis Bowers MATH 280: Problem Solving November 18, 2011 Presentation 3: Eigenvalues and Eigenvectors of a Matrix Order of Presentation: 1. Definitions of Eigenvalues
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its wellknown properties Volumes of parallelepipeds are
More informationLecture Notes 1: Matrix Algebra Part B: Determinants and Inverses
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 57 Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses Peter J. Hammond email: p.j.hammond@warwick.ac.uk Autumn 2012,
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationINTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL
SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics
More informationExamination paper for TMA4205 Numerical Linear Algebra
Department of Mathematical Sciences Examination paper for TMA4205 Numerical Linear Algebra Academic contact during examination: Markus Grasmair Phone: 97580435 Examination date: December 16, 2015 Examination
More information1 Determinants. Definition 1
Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described
More informationMatrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo
Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for
More informationSolution based on matrix technique Rewrite. ) = 8x 2 1 4x 1x 2 + 5x x1 2x 2 2x 1 + 5x 2
8.2 Quadratic Forms Example 1 Consider the function q(x 1, x 2 ) = 8x 2 1 4x 1x 2 + 5x 2 2 Determine whether q(0, 0) is the global minimum. Solution based on matrix technique Rewrite q( x1 x 2 = x1 ) =
More informationLecture 6: The Group Inverse
Lecture 6: The Group Inverse The matrix index Let A C n n, k positive integer. Then R(A k+1 ) R(A k ). The index of A, denoted IndA, is the smallest integer k such that R(A k ) = R(A k+1 ), or equivalently,
More informationEigenvalues and eigenvectors of a matrix
Eigenvalues and eigenvectors of a matrix Definition: If A is an n n matrix and there exists a real number λ and a nonzero column vector V such that AV = λv then λ is called an eigenvalue of A and V is
More informationLecture 11. Shuanglin Shao. October 2nd and 7th, 2013
Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous
More informationDeterminants LECTURE Calculating the Area of a Parallelogram. Definition Let A be a 2 2 matrix. A = The determinant of A is the number
LECTURE 13 Determinants 1. Calculating the Area of a Parallelogram Definition 13.1. Let A be a matrix. [ a c b d ] The determinant of A is the number det A) = ad bc Now consider the parallelogram formed
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More informationChapter 6. Linear Transformation. 6.1 Intro. to Linear Transformation
Chapter 6 Linear Transformation 6 Intro to Linear Transformation Homework: Textbook, 6 Ex, 5, 9,, 5,, 7, 9,5, 55, 57, 6(a,b), 6; page 7 In this section, we discuss linear transformations 89 9 CHAPTER
More informationMathematics Notes for Class 12 chapter 3. Matrices
1 P a g e Mathematics Notes for Class 12 chapter 3. Matrices A matrix is a rectangular arrangement of numbers (real or complex) which may be represented as matrix is enclosed by [ ] or ( ) or Compact form
More informationProblems for Advanced Linear Algebra Fall 2012
Problems for Advanced Linear Algebra Fall 2012 Class will be structured around students presenting complete solutions to the problems in this handout. Please only agree to come to the board when you are
More informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 03 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationR mp nq. (13.1) a m1 B a mn B
This electronic version is for personal use and may not be duplicated or distributed Chapter 13 Kronecker Products 131 Definition and Examples Definition 131 Let A R m n, B R p q Then the Kronecker product
More informationLecture 6. Inverse of Matrix
Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a nonempty
More informationPROVING STATEMENTS IN LINEAR ALGEBRA
Mathematics V2010y Linear Algebra Spring 2007 PROVING STATEMENTS IN LINEAR ALGEBRA Linear algebra is different from calculus: you cannot understand it properly without some simple proofs. Knowing statements
More information