LECTURE NOTES FOR 416, INNER PRODUCTS AND SPECTRAL THEOREMS
|
|
- Lizbeth Davidson
- 7 years ago
- Views:
Transcription
1 LECTURE NOTES FOR 416, INNER PRODUCTS AND SPECTRAL THEOREMS CHARLES REZK Real inner product. Let V be a vector space over R. A (real) inner product is a function, : V V R such that x, y = y, x for all x, y V, c 1 x 1 + c 2 x 2, y = c 1 x 1, y + c 2 x 2, y for all x 1, x 2, y V, c 1, c 2 R, x, x 0 with x, x = 0 iff x = 0. That is, the pairing is symmetric, linear in the first variable (and therefore bilinear, by symmetry), and positive definite. Example (Standard dot product). Given a column vector v R n 1, let v t R 1 n be the transpose. Then define x, y = y t x. Check that this is just the usual dot product, so that x, y = x i y i. Example. Let P R n n be an invertible matrix. Define x, y P = y t P t P x. This is an inner product, usually different from the dot product. Fact: every inner product on R n 1 is of this form for some P. (See discussion of isometries below.) Example. For f, g P, define f, g = 1 1 f(t)g(t) dt. (Exercise.) This is an inner product. Symmetry and bilinearity are clear. It is also clear that f, f = 1 1 f(t)2 dt 0; if the integral is equal to 0, then it must be the case that f(t) 2 = 0 for all 1 t 1, and therefore f(t) = 0 since it is a polynomial. Date: May 2,
2 2 CHARLES REZK Complex inner product. Let V be a vector space over C. A (complex, or Hermitian) inner product is a function, : V V C, satisfying the same axioms, except that the first axiom is replaced by skew-symmetry : x, y = y, x. Observe that this implies that although a complex inner product is C-linear in the first variable, it is conjugate linear in the second variable: x, c 1 y 1 + c 2 y 2 = c 1 x, y 1 + c 2 x, y 2. Note also that if we take x = y, then skew-symmetry gives x, x = x, x, and so x, x R for all x R, so the positive definite axiom still makes sense. Example (standard Hermitian inner product). Given A C m n, let A = A t, the conjugate transpose of A, also called the adjoint of A; if A = (a ij ), then the ij-entry of A is a ji. Define x, y = y x = x k y k. We can think of the real version of inner product as a kind of special case of the complex inner product; the formulas for C also apply in the real case. Below, when I speak of an inner product space, it could either be a real or a complex inner product space. Over either R or C, we can define x = x, x, called the length. In the case of V = R n 1, the standard inner product has a geometric interpretation familiar from vector calculus: the inner product knows about lengths and angles. (Note that x = x 2 i in this case.) This is added structure, coming from the inner product; vector spaces without an inner product don t know anything about lengths or angles. Exercise. If V is a complex inner product space, then the function x, y R def = Re x, y is a real inner product on V viewed as a real vector space. (We will not use this real inner product.) Subspaces of inner product spaces. Proposition. If V has inner product,, and W V is a subspace, then the restriction of, to W is an inner product on W. Proof. (Exercise.) Straightforward using the definitions. Orthogonality. Say that x, y V are orthogonal if x, y = 0. Given S V, the orthogonal complement of S is Proposition. S is a subspace of V. S = { v V v, s = 0 for all s S }. Proof. (Exercise.) If x 1, x 2 S, then c 1 x 1 + c 2 x 2, s = c 1 x 1, s + c 2 x 2, s, which is 0 for all s S by definition. A set S is orthonormal if for all x, y S, x, x = 1 and x, y = 0 if x y. Proposition. Any orthonormal subset S V is linearly independent.
3 LECTURE NOTES FOR 416, INNER PRODUCTS AND SPECTRAL THEOREMS 3 Proof. (Exercise.) If {x 1,..., x n } forms an orthonormal set, consider v = c 1 x c n x n for scalars c i. Compute v, x k = c k, since x k, x k = 1, and x i, x k = 0 if i k. Thus v = 0 implies c k = 0 for all k. If u 1,..., u n is an orthonormal basis of V, then Gram-Schmidt. x = x, u j u j. Proposition. Every finite dimensional inner product space has an orthonormal basis. The proof is the Gram-Schmidt algorithm, which takes a basis v 1,..., v n and inductively produces an orthonormal basis u 1,..., u n. The process is: u 1 = v 1 v 1, u 2 = v 2 v 2, u 1 u 1 v 2 v 2, u 1 u 1, u 3 = v 3 v 3, u 1 u 1 v 3, u 2 u 2 v 3 v 3, u 1 u 1 v 3, u 2 u 2... To prove that this works, we first have to show that this construction is well-defined, which amounts to showing that we never divide by zero in the above formulas. We prove this by induction on k, by showing (inductively) that Span(u 1,..., u k 1 ) = Span(v 1,..., v k 1 ). This implies that v k Span(u 1,..., u k 1 ), and therefore v k k 1 j=1 v k, u j u j. Now that we know that vectors u 1,..., u n are defined, it is clear that u k = 1, and it is straightforward to show (again by induction on k) that u i, u k = 0 for i < k, so they form an orthonormal basis. Later we will need the following: Proposition. If V is a finite dimensional inner product space, then v is complementary to Span(v). Proof. Assume v 0. Choose a basis v 1,..., v n of V with v 1 = v. Use Gram-Schmidt to replace with an orthonormal basis u 1,..., u n, with u 1 = v/ v. Verify that v Span(u 2,..., u n ), and therefore for dimension reasons v = Span(u 2,..., u n ). Thus, V is a direct sum of Span(v) = Span(u 1 ) and v = Span(u 2,..., u n ). Exercise. If W is a subspace of a finite dimensional inner product space V, then (W ) = W. Isometry. If V and W are inner product spaces, an isometry is an isomorphism T : V W of vector spaces such that T x, T y W = x, y V. Proposition. For any (real or complex) n-dimensional inner product space V, there exists an isometry between V and R n 1 (if real) or C n 1 (if complex) with the standard inner product. Proof. (Exercise.) Choose an orthonormal basis u 1,..., u n, and define T (x 1,..., x n ) = x k u k.
4 4 CHARLES REZK Spectral theorems. Recall that for A C m n, we define the adjoint A = A t C n m. Note that (AB) = B A, and that (A ) = A. Theorem. Let A C n n. (1) If AA = A A, there exists an orthonormal basis of eigenvectors of A, which is also an orthonormal basis of eigenvectors for A. (2) If A = A ( self-adjoint, or Hermitian ), then there exists an orthonormal basis of eigenvectors of A, and all the eigenvalues are real (i.e., λ k R). (3) If A = A, ( skew-adjoint, or skew-hermitian ), then there exists an orthonormal basis of eigenvectors of A, and all the eigenvalues are imaginary (i.e., λ k ir). (4) If A = A 1, ( unitary ), then there exists an orthonormal basis of eigenvectors of A, and all eigenvalues have norm one (i.e., λ k = λ k λ k = 1). Statements (2) (4) are special cases of (1), since in each case A commutes with A. To derive the statements about eigenvalues from (1), note in general that since (A w) = w A = w A, we have Av, w = w Av = (A w) v = v, A w. Suppose v is a common eigenvector of A and A, e.g., Av = λv and A v = µv, with v 0. Then Av, v = λv, v = λ v, v is equal to v, A v = v, µv = µ v, v, and so λ = µ. In case (2), this gives λ = λ. In case (3), this gives λ = λ. In case (4), this gives λ 1 = λ. Theorem. Let A R n n. (2) If A t = A ( self-adjoint or symmetric ), then there exists an orthonormal basis of eigenvectors of A in R n 1, and all the eigenvalues are real. (3) If A t = A ( skew-adjoint or skew-symmetric ), then all eigenvalues of A are imaginary (i.e., λ k ir), and come in conjugate pairs ±ai when they are not 0. There are no real eigenvectors (except those with eigenvalue 0); however, in C n 1, there is an orthonormal basis of eigenvectors. (4) If A t = A 1 ( orthogonal ), then all eigenvalues of A are complex of norm one (i.e., λ k = 1), and come in conjugate pairs λ, λ when they are not 1 or 1. The real forms are easily derived from the complex ones. Real (2) is a special case of complex (2), etc. When the eigenvalues are not real, we do not get real eigenvectors; however, the non-real eigenvalues must always come in conjugate pairs. [ ] 2 2 Examples. Symmetric. The real matrix A = has eigenvalues 2, 3, with corresponding 2 1 eigenvectors (1, 2) and (2, 1), which are orthogonal, and so can be normalized to an orthonormal basis of eigenvectors 5 1 (1, 2) and 5 1 (2, 1). Exercise. If A is a real symmetric n n-matrix, consider f : R n 1 R defined by f(x) = x t Ax. Show that the maximum and minimum values attained by f on the unit sphere { x R n 1 x = 1 } are exactly the maximal and minimal eigenvalues of A. (Hint: change to a coordinate system with axes parallel to the eigenvectors. A more fun proof is to use Lagrange multipliers; because
5 LECTURE NOTES FOR 416, INNER PRODUCTS AND SPECTRAL THEOREMS 5 A is symmetric, the Lagrange multiplier equations will exactly become the eigenvector equation (A λi)x = 0.) [ ] a b Skew-symmetric. If A = is a real skew-symmetric matrix, then a = d = 0 and b = c. c d Thus, the eigenvalues are λ = ±bi. [ ] cos θ sin θ Orthogonal. The real matrix R θ = is orthogonal, since R sin θ cos θ θ t = R θ. The spectral theorem for n n orthogonal matrices says implies that there is an orthonormal basis of R n 1, with respect to which A has block form consisting of 1 1 and 2 2-blocks on the diagonal. The 1 1-blocks have the form ±1, corresponding to real eigenvalues, and the 2 2-blocks have the form R θ, corresponding to eigenvalue pairs e ±iθ. [ For instance, ] any 3 3 orthogonal matrix has an orthonormal basis u 1, u 2, u 3 with block form ±1 0. If the real eigenvalue is 1, then it is a rotation around the axis u 0 R 1 ; if the real eigenvalue θ is 1, then it is a combination of a rotation with a reflection through the plane of rotation. Proof. We have sketched how to derive every form of the spectral theorem from complex case (1), so we only need this basic case. Recall the following facts Any operator T : V V on a (non-trivial) finite dimensional complex vector space has an eigenvalue. If operators S, T : V V commute (ST = T S), then each T -eigenspace E T (λ) is invariant under S. If V is a finite dimensional inner product space and v 0, then v and Span(v) are complementary subspaces. The hypothesis is that A, A C n n commute. Let λ be an eigenvalue of A. Since E A (λ) is invariant under A, the operator A E A (λ) must therefore have an eigenvector v, which will be a common eigenvector of A and A. Assuming Av = λv and A v = µv, compute λ v, v = Av, v = v, A v = v, µv = µ v, v, so λ = µ, i.e., µ = λ. Let v = { x C n 1 x, v = 0 }, the orthogonal complement of v in C n 1. Claim. v is invariant under both A and A. This is a verification. Assuming w v, show that Aw, A w v. For instance, so Aw v ; likewise, Aw, v = w, A v = w, λv = λ w, v = 0, A w, v = v, A w = Av, w = λv, w = λ w, v = 0, so A w v. I would like to inductively apply this to the restrictions of A and A to linear operators acting on v, which has dimension one less than C n 1. We need the following. Lemma. Let A, A C n n such that AA = A A, and let W C n 1 be a non-trivial subspace invariant under both A and A. Then there exists a common eigenvector v W of A and A in
6 6 CHARLES REZK W, the subspace W v = { w W w, v = 0 } is itself invariant under A and A, and W is a direct sum of Span(v) and W v. Proof. The argument is the same. If W is non-zero, then A W (the restriction of A to a map W W) has an eigenvalue λ. Since A commutes with A, the space E A (λ) is A invariant, and hence so is E A W (λ) = W E A (λ). Since A W has λ as an eigenvalue, the subspace E A W (λ) is non-zero; since it is A -invariant, it contains an A -eigenvector v. We have already seen that v must be invariant under both A and A. Therefore, W v is also invariant under both A and A. It remains to show that W is a direct sum of Span(v) and W v. Since W is itself a finite dimensional inner product space, W v is the orthogonal complement of v relative to W, so the claim follows. To prove (1), use the lemma inductively. Thus, use the lemma to find a common eigenvector v 1 W 0 = C n 1 of A and A, and set W 1 = v, which is guaranteed to be invariant under A and A. Then use the lemma to find a common eigenvector v 2 W 1 of A and A, and set W 2 = W 1 v1, etc. By construction, each new eigenvector is orthogonal to the previous ones, and we can normalize them to length one by setting u k = v k / v k. Orthogonal and unitary matrices. Let U C n n have columns u 1,..., u n. Then U is unitary (U U = U 1 U = I) if and only if u j u i = δ ij. That is, U is unitary if and only if its columns are an orthonormal basis of C n 1. The analogous statetment holds for U R n n, which is orthogonal (U t U = U 1 U = I) if and only if u t j u i = δ ij, i.e., U is orthogonal if and only if its columns are an orthonormal basis of R n 1. The spectral theorem implies, for A C n n, that A is Hermitian if and only if it can be written A = UDU for some unitary matrix U and diagonal matrix D with real entries; A is skew-hermitian if and only if it can be written A = UDU for some unitary matrix U and diagonal matrix D with imaginary entries; A is unitary if and only if it can be written A = UDU for some unitary matrix U and diagonal matrix D with diagonal entries in C of unit norm. The spectral theorem implies, for A R n n, that A is symmetric if and only if it can be written A = UDU t for some orthogonal matrix U and diagonal matrix D with real entries. Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL address: rezk@math.uiuc.edu
Inner 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
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 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 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 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 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 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 informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
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 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 informationInner Product Spaces. 7.1 Inner Products
7 Inner Product Spaces 71 Inner Products Recall that if z is a complex number, then z denotes the conjugate of z, Re(z) denotes the real part of z, and Im(z) denotes the imaginary part of z By definition,
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 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 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 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 informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
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 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 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 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 information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
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 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 informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
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 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 informationThe cover SU(2) SO(3) and related topics
The cover SU(2) SO(3) and related topics Iordan Ganev December 2011 Abstract The subgroup U of unit quaternions is isomorphic to SU(2) and is a double cover of SO(3). This allows a simple computation of
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 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 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 informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationThe Matrix Elements of a 3 3 Orthogonal Matrix Revisited
Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
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 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 informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More information1 Symmetries of regular polyhedra
1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
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 informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
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 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 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 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 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 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 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 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 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 informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
More informationQuantum Physics II (8.05) Fall 2013 Assignment 4
Quantum Physics II (8.05) Fall 2013 Assignment 4 Massachusetts Institute of Technology Physics Department Due October 4, 2013 September 27, 2013 3:00 pm Problem Set 4 1. Identitites for commutators (Based
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 informationMath 115A - Week 1 Textbook sections: 1.1-1.6 Topics covered: What is a vector? What is a vector space? Span, linear dependence, linear independence
Math 115A - Week 1 Textbook sections: 1.1-1.6 Topics covered: What is Linear algebra? Overview of course What is a vector? What is a vector space? Examples of vector spaces Vector subspaces Span, linear
More informationAdding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors
1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number
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 informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationFigure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
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 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 informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
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 informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
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 information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
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 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 informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationElementary Linear Algebra
Elementary Linear Algebra Kuttler January, Saylor URL: http://wwwsaylororg/courses/ma/ Saylor URL: http://wwwsaylororg/courses/ma/ Contents Some Prerequisite Topics Sets And Set Notation Functions Graphs
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 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 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 informationOrthogonal Projections and Orthonormal Bases
CS 3, HANDOUT -A, 3 November 04 (adjusted on 7 November 04) Orthogonal Projections and Orthonormal Bases (continuation of Handout 07 of 6 September 04) Definition (Orthogonality, length, unit vectors).
More information