MAT 2038 LINEAR ALGEBRA II Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web:
|
|
- Aldous Stephens
- 7 years ago
- Views:
Transcription
1 MAT 2038 LINEAR ALGEBRA II Dokuz Eylül University, Faculty of Science, Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: SELF-ADJOINT(=HERMITIAN), UNITARY AND NORMAL MATRICES AND OPERATORS, AND THE SPECTRAL THEOREM See the lecture notes for the proofs of all of the below results given without proof. Remember that if we identify 1 1 complex matrices with complex numbers (that is, for all c C, we identify the 1 1 complex matrix [c] with the complex number c), then the standard inner product in the vector space C n over the field C of complex numbers is given for all vectors X = x 1 x 2. x n and Y = in C n by using the matrix product and adjoint (=conjugate transpose) of matrices by: < X, Y > = Y X = (the product of the 1 n matrix Y and n 1 matrix X) }{{} where Y = Y T = [ ] y 1 y 2 y n. This holds because < X, Y >= x1 y 1 + x 2 y x n y n and x 1 Y X = Y T X = [ ] x 2 y 1 y 2 y n. = y 1x 1 + y 2 x y n x n = x 1 y 1 + x 2 y x n y n. x n Remember that for an n n complex matrix A = [a ij ] n i,j=1, we define: (i) A = [a ij ] n i,j=1 = (the conjugate of A obtained by taking the conjugates of every entry of A), and (ii) A = A T = A T = (the adjoint of A) = (the conjugate transpose of A ) = [b ij ] n i,j=1 where b ij = a ji. The main property of the adjoint(=conjugate transpose) of matrices is its relation with the standard inner product in C n in the following way: for all vectors X, Y in the vector space C n over the field C, y 1 y 2. y n < AX, Y > = < X, A Y > }{{}}{{} Let A = [a ij ] n i,j=1 be an n n complex square matrix, that is, an n n matrix with complex number entries, (i) The matrix A is said to be a self-adjoint(=hermitian) matrix if A = A. If A is a self-adjoint(=hermitian) matrix, then by the above property of the adjoint(=conjugate transpose) of matrices we have for all vectors X, Y in the vector space C n over the field C, < AX, Y > = < X, AY > }{{}}{{} (ii) The matrix A is said to be a unitary matrix if equivalently, Observe that: A A = I, if A is a self-adjoint(=hermitian) matrix. where I is the n n identity matrix, A is an invertible matrix with its inverse A 1 = A. A is a unitary matrix the columns of A form an orthonormal basis for C n with its standard inner product. (iii) The matrix A is said to be a normal matrix if A and A commute, that is, if A A = AA. Firstly observe that self-adjoint(=hermitian) matrices and unitary matrices are normal matrices; explain why. Self-adjoint and unitary matrices generalize symmetric matrices and orthogonal matrices in the real case; observe that if A is an n n real square matrix, that is, if all entries of A are real numbers, then A = A and so A = A T, which then gives us that: (i) A is a self-adjoint matrix (ii) A is a unitary matrix when A is a real matrix AT = A, that is, A is a symmetric matrix. when A is a real matrix AT A = I, that is, A is an orthogonal matrix. 1
2 Let V be a finite-dimensional inner product space over C, that is, V is a finite-dimensional vector space over the field C of complex numbers with an inner product over C, that is, there exists a function <, >: V V C that assigns to each u, v V a complex number < u, v > such that the following properties hold for all u, v, w V and c C: (i) < v, u >= < u, v > (ii) < cu, v >= c < u, v > (and then by (i), we obtain that < u, cv >= c < u, v >). (iii) < u + v, w >=< u, w > + < v, w > (and then by (i), we obtain that < u, v + w >=< u, v > + < u, w >). (iv) < v, v > 0 for all v V (note that by (i), < v, v >= < v, v > and so < v, v > is a real number), and for each v V, < v, v >= 0 v = 0 = (the zero vector of V ). By the last property (iv), we can also define the norm of a vector v V to be v = < v, v > since < v, v > is a nonnegative real number. Thus property (iv) gives that v = 0 v = 0 = (the zero vector of V ). Question: Given a linear operator T : V V, that is, a linear transformation from the vector space V to itself, we ask under which conditions does the finite-dimensional inner product space V over C have an orthonormal basis consisting of eigenvectors for the linear operator T, that is, when does an orthonormal basis B for V exists such that [T ] B is a diagonal matrix? We shall firstly consider this problem concretely for matrices. What we know for the real case is: Theorem 1. Spectral Theorem for Symmetric Matrices over R. Let A be an n n matrix with real number entries. Then A is orthogonally diagonalizable (that is, there exists an orthogonal n n real matrix Q such that Q 1 AQ = Q T AQ = D is a diagonal matrix) if and only if A T = A, that is, A is a symmetric matrix. The analog of this theorem for complex matrices is not obtained by replacing symmetric matrices with selfadjoint(=hermitian matrices); as we shall see below for a complex square matrix A, being unitarily diagonalizable turns out to be equivalent with the matrix being normal. Let A and B be n n complex matrices. We say that B is unitarily equivalent to A if there exists an n n unitary matrix U such that B = U 1 AU = U AU. We say that A is unitarily diagonalizable if a diagonal matrix D is unitarily equaivalent to A, that is, if U 1 AU = U AU = D is a diagonal matrix for some n n unitary matrix U. To prove the Spectral Theorem for Normal Matrices, we shall use the following lemmas: Lemma 2. (i) Diagonal n n complex matrices are normal matrices. (ii) If A is an n n complex matrix that is unitarily diagonalizable, then A is a normal matrix, that is, A and A commute: A A = AA. Triangular normal matrices are just the diagonal matrices: Lemma 3. If A is an n n complex matrix that is upper triangular or lower triangular, then A is a normal matrix A is a diagonal matrix. Using Schur s Theorem, which we shall prove after we see the adjoint of linear operators, we obtain: Lemma 4. If A is an n n complex matrix, then there exists a unitary matrix U such that U 1 AU = U AU is an upper triangular matrix. The promised theorem for the characterization of normal matrices, the essence of this notion, is then given by: Theorem 5. The Spectral Theorem for Normal Matrices over C. For every n n complex matrix that A, we have: A is unitarily diagonalizable A is a normal matrix, that is, A A = AA. The above mentioned Schur s Theorem says the following; prove it following the steps given in the lectures. Theorem 6. Schur s Theorem. Let V be a finite-dimensional complex inner product space and let T : V V be a linear operator. Then there exists an orthonormal basis B for V such that the matrix [T ] B is upper triangular. For an n n matrix A, applying Schur s Theorem to the linear operator µ A : C n C n defined by µ A (x) = Ax for all x C n gives the above Lemma 4. Explain how using the Change-of-Basis Formula. 2
3 We shall now extend the concepts self-adjoint(=hermitian), unitary and normal from matrices to linear operators. Firstly, we shall see how to define the adjoint T : V V of a linear operator T : V V on a finite-dimensional inner product space V. The idea that we shall use is the main property of the adjoint(=conjugate transpose) of matrices: for all vectors X, Y in the vector space C n over the field C, < AX, Y > = < X, A Y > where <, > denotes the. To treat inner product spaces over R or over C, simultaneously, we shall say that let V be a finite-dimensional inner product space over the field F, where For each fixed y V, the function h y : V F the field F = R or F = C. defined by h y (v) =< v, y > for all v V is a linear transformation. Moreover, every linear transformation from V to F is necessarily of this form: Theorem 7. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. If g : V F is a linear transformation, then there exists a unique y V such that g(v) =< v, y > for all v V. Proof. If B = {v 1, v 2,..., v n } is an orthonormal basis for V, check that y = n i=1 g(v i)v i works by showing that for the linear operator h y : V F defined by h(v) =< v, y > for all v V, we have h y (v j ) = g(v j ) for j = 1, 2,..., n and so h y = g since they agree at every basis element in B. Complete the details of the proof. For the proof of the uniqueness part of this theorem, we use: Lemma 8. Let V be an inner product space over the field F, where F = R or F = C. Let y, z V. < x, y >=< x, z > for all x V = y = z. Using the above theorem, we shall be able to define the adjoint of a linear operator. Theorem 9. Definition of the adjoint T : V V of a linear operator T : V V on a finite-dimensional inner product space V. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Let T : V V be a linear operator on V. Then there exists a unique function, denoted by such that T : V V, < T (x), y >=< x, T (y) > for all x, y V. Furthermore, the function T : V V is a linear transformation, and it is called the adjoint of the linear operator T : V V. We also have < x, T (y) >=< T (x), y > for all x, y V. Proof. Define the function T : V V for each y V as follows. The function g : V F, defined for all x V by g(x) =< T (x), y >, is a linear transformation and so by the above theorem, there exists a unique vector y V such that g(x) =< x, y > for all x V. We define T (y) = y. Thus we obtain < T (x), y >=< x, T (y) > for every x V and y V. Uniqueness of such a function follows from the above lemma. Now show that T : V V is a linear transformation. Complete the details of the proof. Theorem 10. With the hypothesis as in the above theorem, if B = {v 1, v 2,..., v n } is an orthonormal basis for V, then [T ] B = [T ] B, that is, if A = [T ] B, then [T ] B = A = A T. Proof. If B = [b ij ] n i,j=1 = [T ] B and A = [a ij ] n i,j=1 = [T ] B, then show that for all i, j {1, 2,..., n}, and obtain This means B = A. Complete the details of the proof. a ij =< T (v j ), v i > and b ij =< T (v j ), v i > b ij =< T (v j ), v i >= < v i, T (v j ) > = < T (v i ), v j > = a ji. Proposition 11. If A is an n n matrix over the field F, where F = R or F = C, and if the linear transformations then µ A : F n F n and µ A : F n F n are defined by µ A (x) = Ax and µ A (x) = A x for all x F n, (µ A ) = µ A, that is, µ A : F n F n is the adjoint of the linear operator µ A : F n F n where we take the standard inner product in F n. Proof. In the standard orthonormal basis E = {e 1, e 2,..., e n } for F n, the above theorem gives that [(µ A ) ] E = [µ A ] E = A = [µ A ] E which implies that (µ A ) = µ A. 3
4 Theorem 12. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. For all linear operators T : V V and U : V V, and for all c F, we have: (i) (T + U) = T + U. (ii) (ct ) = c T. (iii) (T U) = U T, where T U = T U means the composition of the functions T and U, and similarly for U T ; remember this is the algebra structure of End F (V ) = Hom F (V, V ) which consists of all linear operators on V, it is both a vector space over F and a ring where multiplication of linear operators on V is just their composition, and these two structures are related by (ct )U = T (cu) = c(t U). (iv) (T ) = T. (v) I = I, where I : V V is the identity linear operator defined by I(v) = v for all v V. Proof. Prove all of these using Theorem 9 (which gives the defining property of the adjoint of a linear operator), and Lemma 8. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Say n = dim(v ). Let T : V V be a linear operator. Using now the notion of the adjoint T : V V of the linear operator T : V V, we define self-adjoint(=hermitian), unitary and normal operators like for matrices as follows: (i) The linear operator T : V V is said to be a self-adjoint(=hermitian) operator if Note then that: T = T. < T (x), y >=< x, T (y) > for all x, y V, if T : V V is a self-adjoint operator, that is, if T = T. (ii) The linear operator T : V V is said to be a unitary operator if T T = I, that is, the composition T T = I, where I : V V is the identity linear operator defined by I(v) = v for all v V. (iii) The linear operator T : V V is said to be a normal operator if T and T commute, that is, if T T = T T, which means the equality of the compositions T T = T T. Firstly observe that self-adjoint(=hermitian) operators and unitary operators are normal operators; explain why. In terms of matrix A = [T ] B representing the linear operator T : V V in any ORTHONORMAL BASIS B = {v 1, v 2,..., v n } for V, we have that: (i) T : V V is a self-adjoint(=hermitian) operator the matrix A = [T ] B is a self-adjoint(=hermitian) matrix. (ii) T : V V is a unitary operator the matrix A = [T ] B is a unitary matrix. (iii) T : V V is a normal operator the matrix A = [T ] B is a normal matrix. Be careful, for these equivalences, we need the basis B = {v 1, v 2,..., v n } to be an orthonormal basis for V. To prove these, use Theorem 10; for example, T : V V is a self-adjoint(=hermitian) operator T = T [T ] B = [T ] B [T ] B = [T ] B A = A A is a self-adjoint(=hermitian) matrix Using the above characterization in terms of matrices, now use the Spectral Theorem for Normal Matrices over C to prove: Theorem 13. The Spectral Theorem for Normal Operators over a finite-dimensional inner product space over C. Let T : V V be a linear operator where V is a finite-dimensional inner product space over the field C of complex numbers. Then T : V V is a normal operator if and only if there exists an orthonormal basis B for V that consists of eigenvectors of T, that is, if and only if, there exists an orthonormal basis B for V such that the matrix [T ] B is a diagonal matrix (whose diagonal entries are necessarily the eigenvalues of T counted with their algebraic multiplicities). 4
5 Similarly, using the Spectral Theorem for Symmetric Matrices over R, prove: Theorem 14. The Spectral Theorem for Self-adjoint Operators over a finite-dimensional inner product space over R. Let T : V V be a linear operator where V is a finite-dimensional inner product space over the field R of real numbers. Then T : V V is a self-adjoint(=hermitian) operator if and only if there exists an orthonormal basis B for V that consists of eigenvectors of T, that is, if and only if, there exists an orthonormal basis B for V such that the matrix [T ] B is a diagonal matrix (whose diagonal entries are necessarily the eigenvalues of T counted with their algebraic multiplicities). The below theorems give some main properties of self-adjoint(=hermitian) operators, unitary operators and normal operators whose proofs are left to you as Homework Problems. Theorem 15. Properties of Normal Operators. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Let T : V V be a NORMAL OPERATOR on V. Then we have: (i) T (v) = T (v) for every v V. (ii) T ci is also a normal operator for every c F, where I : V V is the identity linear operator defined by I(v) = v for all v V. (iii) If v V is an eigenvector of T with eigenvalue λ F, that is, if 0 v V and T (v) = λv, then v is also an eigenvector of T with eigenvalue λ, that is, T (v) = λv. (iv) If λ 1 and λ 2 in F are distinct eigenvalues of the linear operator T : V V, then the eigenspaces E(λ 1 ) = Ker(T λ 1 I) and E(λ 2 ) = Ker(T λ 2 I) are orthogonal subspaces, that is, if v 1 is an eigenvector of the linear operator T with eigenvalue λ 1 and v 2 is an eigenvector of T with eigenvalue λ 2, then < v 1, v 2 >= 0. Proposition 16. A characterization of normal operators. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Let T : V V be a linear operator on V. Then: T : V V is a normal operator T (v) = T (v) for every v V. Theorem 17. Eiegenvalues of self-adjoint operators are always real numbers. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Let T : V V be a SELF-ADJOINT(=HERMITIAN) OPERATOR on V. Then: (i) Every eigenvalue of T in F is a real number. (ii) The characteristic polynomial p(t) of T is of the form p(t) = ( 1) n (t λ 1 )(t λ 2 ) (t λ n ) for some real numbers λ 1, λ 2,..., λ n where λ 1, λ 2,..., λ n are not necessarily distinct. Theorem 18. Characterizations of unitary operators. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. The following are equivalent for a linear operator T : V V on V : (i) T : V V is a UNITARY OPERATOR, that is, T T = I, where I : V V is the identity linear operator defined by I(v) = v for all v V. (ii) T T = T T = I, where I : V V is the identity linear operator defined by I(v) = v for all v V. (iii) T : V V is an invertible linear operator with T 1 = T. (iv) T : V V preserves the inner product, that is, < T (x), T (y) >=< x, y > for all x, y V. (v) T : V V sends every orthonormal basis of V to an orthonormal basis, that is, T (B) = {T (v 1 ), T (v 2 ),..., T (v n )} is also an orthonormal basis for V for every orthonormal basis B = {v 1, v 2,..., v n } for V. (vi) There exists an orthonormal basis B = {v 1, v 2,..., v n } for V such that T (B) = {T (v 1 ), T (v 2 ),..., T (v n )} is also an orthonormal basis for V. (vii) T : V V preserves the norm, that is, T (x) = x for every x V. To prove (vii) (iv) in the above theorem, firstly prove the Polarization Identities that express the inner product in terms of norm in an inner product space: 5
6 (i) Polarization identity for REAL inner product spaces. If V is an inner product space over the field R of real numbers, then for every u, v V, < u, v >= 1 4 [ u + v 2 u v 2]. (ii) Polarization identity for COMPLEX inner product spaces. If V is an inner product space over the field C of complex numbers, then for every u, v V, < u, v >= i k u + i k v = 1 [ u + v 2 u v 2] + i [ u + iv 2 u iv 2]. 4 4 k=1 Proposition 19. A characterization of self-adjoint operators on complex inner product spaces. Let V be a finite-dimensional inner product space over the field C of complex numbers and let T : V V be a linear operator on V. Then T : V V is a self-adjoint(=hermitian) operator if and only if V < T (v), v > is a real number for every v V. Theorem 20. Let V be a finite-dimensional inner product space over the field C of complex numbers. The following are equivalent for a linear operator T : V V on V : (i) T = proj W : V V is an orthogonal projection onto a subspace W of V, that is, for each b V, (ii) T 2 = T = T. T (b) = p is the unique vector p W such that b p W. Remember the Spectral Theorem for Symmetric Matrices over R that has been formulated using projections; in terms of projections, we state the Spectral Theorem for normal operators over C and self-adjoint operators over R as follows: Theorem 21. THE SPECTRAL THEOREM. Let V be a finite-dimensional inner product space over the field F, where F = R or F = C. Say n = dim(v ). Let T : V V be a linear operator on V. Suppose that T : V V is a normal operator if F = C, and T : V V is a self-adjoint operator if F = R. Then the characteristic polynomial p(t) of T : V V is of the form p(t) = ( 1) n (t λ 1 ) m1 (t λ 2 ) m2 (t λ k ) m k for some k Z +, distinct eigenvalues λ 1, λ 2,..., λ k of T : V V in F with algebraic multiplicities m 1, m 2,..., m k Z +. For each i = 1, 2,..., k, let W i = Ker(T λ i I) be the eigenspace of T : V V corresponding to the eigenvalue λ i, and let T i = proj Wi : V V be the orthogonal projection map onto the subspace W i. Then we have the following: (i) V = W 1 W 2 W k is the direct sum of its subspaces W 1, W 2,..., W k. (ii) For each i = 1, 2,..., k, if W i = j i W j is the direct sum of the subspaces W j for j {1, 2,..., k} \ {i}, then we have W i = W i. (iii) For every i, j {1, 2,..., k}, T i T j = δ ij T i, where δ ij = { 0, if i j; 1, if i = j. (iv) I = T 1 + T T k, where I : V V is the identity linear operator defined by I(v) = v for all v V. (v) T = λ 1 T 1 + λ 2 T λ k T k. In the above theorem, (i) The set {λ 1, λ 2,..., λ k } of eigenvalues of T : V V is called the spectrum of T : V V. (ii) The sum I = T 1 + T T k is called the resolution of the identity operator induced by T : V V. (iii) T = λ 1 T 1 + λ 2 T λ k T k is called the spectral decomposition of T : V V. For further results about operators, and exercies, see Chapter 6 of the following Supplementary Textbook: Friedberg, S. H., Insel, A. J., and Spence, L. E. Linear Algebra. 4th edition. 6
Section 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 informationSimilarity 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 informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 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 informationLecture 1: Schur s Unitary Triangularization Theorem
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
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 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 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 550 Notes. Chapter 7. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010
Math 550 Notes Chapter 7 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 7 Fall 2010 1 / 34 Outline 1 Self-Adjoint and Normal Operators
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 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 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 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 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 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.2420-001, Fall 2010 September 30th, 2010 A. Donev (Courant Institute)
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 informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
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 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 informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 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 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 n-dimensional 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 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 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 self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
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 informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
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 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 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 informationSection 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj
Section 5. l j v j = [ u u j u m ] l jj = l jj u j + + l mj u m. l mj Section 5. 5.. Not orthogonal, the column vectors fail to be perpendicular to each other. 5..2 his matrix is orthogonal. Check that
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 y-axis We observe that
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 informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
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 informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
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 real-valued matrix A is said to be an orthogonal
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 informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
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 5-1 Orthonormal
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 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 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 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 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 non-empty
More informationLecture 18 - Clifford Algebras and Spin groups
Lecture 18 - Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
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 informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
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 informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional 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 information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
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 informationLecture 5: Singular Value Decomposition SVD (1)
EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationSALEM COMMUNITY COLLEGE Carneys Point, New Jersey 08069 COURSE SYLLABUS COVER SHEET. Action Taken (Please Check One) New Course Initiated
SALEM COMMUNITY COLLEGE Carneys Point, New Jersey 08069 COURSE SYLLABUS COVER SHEET Course Title Course Number Department Linear Algebra Mathematics MAT-240 Action Taken (Please Check One) New Course Initiated
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
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 informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 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 informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2015 Timo Koski Matematisk statistik 24.09.2015 1 / 1 Learning outcomes Random vectors, mean vector, covariance matrix,
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 informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
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 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 informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More informationEigenvalues, Eigenvectors, Matrix Factoring, and Principal Components
Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
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 three-space, we write a vector in terms
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationNotes on Linear Algebra. Peter J. Cameron
Notes on Linear Algebra Peter J. Cameron ii Preface Linear algebra has two aspects. Abstractly, it is the study of vector spaces over fields, and their linear maps and bilinear forms. Concretely, it is
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationOrthogonal Bases and the QR Algorithm
Orthogonal Bases and the QR Algorithm Orthogonal Bases by Peter J Olver University of Minnesota Throughout, we work in the Euclidean vector space V = R n, the space of column vectors with n real entries
More informationSF2940: Probability theory Lecture 8: Multivariate Normal Distribution
SF2940: Probability theory Lecture 8: Multivariate Normal Distribution Timo Koski 24.09.2014 Timo Koski () Mathematisk statistik 24.09.2014 1 / 75 Learning outcomes Random vectors, mean vector, covariance
More informationOctober 3rd, 2012. Linear Algebra & Properties of the Covariance Matrix
Linear Algebra & Properties of the Covariance Matrix October 3rd, 2012 Estimation of r and C Let rn 1, rn, t..., rn T be the historical return rates on the n th asset. rn 1 rṇ 2 r n =. r T n n = 1, 2,...,
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More information3 Orthogonal Vectors and Matrices
3 Orthogonal Vectors and Matrices The linear algebra portion of this course focuses on three matrix factorizations: QR factorization, singular valued decomposition (SVD), and LU factorization The first
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
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 well-known properties Volumes of parallelepipeds are
More informationMATH1231 Algebra, 2015 Chapter 7: Linear maps
MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationProblem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday.
Math 312, Fall 2012 Jerry L. Kazdan Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday. In addition to the problems below, you should also know how to solve
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 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More information4 MT210 Notebook 4 3. 4.1 Eigenvalues and Eigenvectors... 3. 4.1.1 Definitions; Graphical Illustrations... 3
MT Notebook Fall / prepared by Professor Jenny Baglivo c Copyright 9 by Jenny A. Baglivo. All Rights Reserved. Contents MT Notebook. Eigenvalues and Eigenvectors................................... Definitions;
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 informationLecture notes on linear algebra
Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
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 informationAbstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
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 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 information