Dr. Marques Sophie Linear algebra II SpringSemester 2016 Problem Set # 11
|
|
- Rafe Booker
- 7 years ago
- Views:
Transcription
1 Dr. Marques Sophie Linear algebra II SpringSemester 2016 Office 519 Problem Set # 11 Justify all your answers completely (Or with a proof or with a counter example) unless mentioned differently. No step should be a mystery or bring a question. The grader cannot be expected to work his way through a sprawling mess of identities presented without a coherent narrative through line. If he can t make sense of it in finite time you could lose serious points. Coherent, readable exposition of your work is half the job in mathematics. You will loose serious points if your exposition is messy, incomplete, uses mathematical symbols not adapted... Exercise 1: Find the Jordan canonical form of the following matrices over C and deduce the corresponding canonical form for those matrices over R and give for both the base change matrices that permit to get those forms: 1. A = 2. B = 3. C = Solution: The characteristic polynomial is 4 x 1 1 det(a xi) = 2 x x = x3 + 6x 2 16x + 16 = (x 2)(x 2 4x + 8). Hence, the eigenvalues are λ 1 = 2, λ 2 = 2 2i, λ 3 = 2 + 2i. 1
2 Denote the corresponding eigenvectors v 1, v 2, v 3. Since the eigenvalues are distinct, the Jordan canonical form is simply given by the diagonal matrix [A] X = 0 2 2i i where X = {v 1, v 2, v 3 } is an ordered basis of eigenvectors. Solving for ker(a λ i I) for i = 1, 2, 3, we have We can now assign ker(a λ 1 I) = Span{(1, 1, 1)} ker(a λ 2 I) = Span{((3 i), (3 + 4i), 5)} ker(a λ 3 I) = Span{((3 + i), (3 4i), 5)}. v 1 = (1, 1, 1), v 2 = ((3 i), (3 + 4i), 5), v 3 = ((3 + i), (3 4i), 5). Since the matrix is diagonalizable, the dimension of each eigenspace is 1. Let f = x + iy E λ2 (T C ). Using the notation from class where J is the conjugate operator, it follows that J(f) E λ3 (T C ). If W = Cf CJ(f), we have shown in class that E λ1 E λ2 = W and the set Y = {x, y} is a basis for the T -invariant subspace (W ) R (T := L A ). Using polar coordinates for λ 2 = 2 2i gives λ 2 = re iθ = 8e i/4 so ( ) cos θ sin θ [T (W )R ] Y = r sin θ cos θ = ( cos( 8 4 ) sin( 4 ) sin( 4 ) cos( 4 ) where Y = {x, y}. Since v 3 = J(v 2 ), let f = v 2 so Y = {(3, 3, 5), ( 1, 4, 0)}. Notice that Z = {v 1 } Y forms an ordered basis for R 3. The corresponding canonical form for A over R is then [T ] Z = 0 8 cos( ) sin( ) sin( ) = cos( with change of basis matrix so A = S[T ] Z S 1. 4 ) S = ).
3 2. The characteristic polynomial is 2 x det(b xi) = 1 4 x x x = (2 x)(4 x)(x ) + (x ) = (x i)(x + i)(x 3) 2. The eigenvalues (including multiplicity) given by the roots are λ 1 = 3, λ 2 = 3, λ 3 = i, λ 4 = i. Solving for x in (B λ i I)x = 0 for i = 1, 3, 4 and (B λ 1 I) 2 x = 0 gives ker(b λ 1 I) = {(1, 1, 1, 1)} ker(b λ 1 I) 2 = {(1, 0, 0, 0), (0, 1, 1, 1)} ker(b λ 3 I) = {(0, 0, 1, 1 i)} ker(b λ 4 I) = {(0, 0, 1, 1 + i)}. Define vectors that are in each of the above kernels v 1 = (1, 1, 1, 1), v 2 = ( 1, 0, 0, 0), v 3 = (0, 0, 1, 1 i), v 4 = (0, 0, 1, 1 + i), respectively. Hence, X = {v 1, v 2, v 3, v 4 } is an ordered basis for the vector space that puts B in Jordan canonical form J = i i with change of basis matrix S that has ordered columns given by the vectors in X. To find the corresponding form over R, let f = v 3. If f = x + iy, then x = (0, 0, 1, 1) and y = (0, 0, 0, 1). Since λ 4 = λ 3, we have that Y = {x, y} is an ordered basis for M λ3,λ 4 = E λ3 E λ4. Writing λ 3 in polar coordinates gives us λ 3 = i = e i 2 = re iθ so r = 1 and θ =. Letting T = L 2 B, ( ) ( ) cos sin [T Eλ3,λ 4 ] Y = sin cos =
4 Let Z = {v 1, v 2, x, y} be an ordered basis for the vector space over R. The matrix with columns equal to the ordered vectors in Z gives us the desired change of basis matrix to get the corresponding canonical form over R. Denote this matrix P = The corresponding canonical form is then [T ] Z = = P 1 BP The characteristic polynomial is given by 3 x det(c xi) = 1 x x x = (3 x)( x 3 3x 2 3 3x) 2x x 2 + 4x x 2 + 2x + 6 = x 4 + 2x The roots of the polynomial gives us the eigenvalues (including multiplicity) λ 1 = i, λ 2 = i, λ 3 = i, λ 4 = i. Examining the kernels ker(c λ i I), we have generalized eigenvectors v 1 = ( 1 + i 2, 0, 1 + i 2, 1) ker(c λ 1I) v 2 = ( 2 i 2, 1 + i 2, 3 2i, 0) 2 ker(c λ 1 I) 2 ker(c λ 1 I) v 3 = ( 1 i 2, 0, 1 i 2, 1) ker(c λ 3I) v 4 = ( 2 + i 2, 1 i 2, 3 + 2i, 0) 2 ker(c λ 3 I) 2 ker(c λ 3 I) with (C λ 1 )(v 2 ) = v 1 and (C λ 3 )(v 4 ) = v 3. Hence, the Jordan canonical form is given by taking the basis X = {v 1, v 2, v 3, v 4 } for V to get i [T ] X = 0 i i i 4
5 where T = L C. For the form over R, first notice that λ 1 = λ 2 = λ 3 = λ 4. Putting this into polar coordinates gives λ 1 = i = re iθ = e i 2 so r = 1 and θ =. Let f 2 1 = x + iy = v 1 = Jv 3 and f 2 = u + iw = v 2 = Jv 4. Then Y = {x, y, u, w} gives us a basis for M λ1,λ 3. But V = M λ1 M λ3 so Y is a basis for the vector space. Hence, the corresponding canonical form is cos θ sin θ sin θ cos θ [T ] Y = 0 0 cos θ sin θ 0 0 sin θ cos θ = with base change matrix S = Exercise 2: Prove the following important property of the exponential map det(e A ) = e T r(a) for all A M(n, F) holds when F = C. Then explain how complexification can be used to show this result remains true when F = R. Solution: If F = R an R-basis {e i } for V gives a C-basis {ẽ j = e j + i0} in V C and it is trivial to check that 1. (e A ) C = e (A C) 2. det(a C ) = det(a). 3. T r(a C ) = T r(a). Thus it suffices to consider the case in which F = C, A = A C, V = V C. Then A can be put into Jordan canonical form. If sp(a) = {λ i }, V = i M λi. The generalized eigenspace decomposition, and p i = projection onto M λi. The generalized eigenspace decomposition, and p i =projection onto M λi. The operator D = r i=1 λ it i is diagonalized by any basis X that runs through M λ1, M λ2, in succession and if this basis is suitably chosen A D = N is upper triangular, with [D, N] = 0. Now T r(a) = T r(d + N) = T r 5 J J r = r m i λ i i=1
6 where J i = λ i 0 λ i with (m i = dim(m λi ) the algebraic multiplicity of λ i in p T (x)). Hence, E 1 0 e A = 0 E r where So that det(e A ) = E i = 0 e λ i e λ i r (e λ i ) m i = i=1 r e m iλ i = e i m iλ i = e T r(a) i=1 Exercise 3: Find A M(2, C) such that L A (x) = A x is diagonalizable, but not orthogonally diagonalizable with respect to the standard inner product on C 2. Solution: Let {e 1, e 2 } the standard ON basis in C 2 ; f 1 = e 1, f 2 = e 1 + e 2 and define linear operator T : C 2 C 2 such that T (f 1 ) = f 1, T (f 2 ) = 2f 2. Obviously, T is diagonalized ( ) over the bases {f 1, f 2 }. Its matrix with the standard basis X = {e 1, e 2 } is 1 1 A = since T (e ) = e 1, T (e 2 ) = e 1 + 2e 2. The eigenspaces E λ (T ), λ = 1 and λ = 2, are uniquely determined and are not orthogonal. Therefore no ON basis can diagonalize T. Exercise 4: Let V be an inner product space T : V V diagonalizable. Prove that T is orthogonally diagonalizable if and only if the eigenspace E λ (T ) in V = λ Sp(T ) E λ (T ) are orthogonal. Solution: The E λ (T ) are defined without reference to any inner product on V. If the E λ (T ) are orthogonal, we may take ON basis in each E λ (T ); combining then we get an ON basis for V consisting of T -eigenvectors (because T (e i ) = λe i, for any vector e i E λ (T ).) That proves ( ). On the other hand, if there is an ON basis {e i } such that T (e i ) = λe i, 1 i n, we 6
7 may lump together the e i associated with a single eigenvalue λ. If sp(t ) = {µ j : 1 j r} and we let I j = {i {1, n} : λ i = µ j }. Then [1, n] = r j=1i j (disjoint union) and V j = ( i Ij Ce i ) is included the eigenspace E µj (T ). Obviously, these eigenspaces are orthogonal (since e i e i, if i i in [1, n]) and V = r j=1e µj (T ) since T is diagonalizable by hypotheses. But V = r j=1v j (orthogonal direct sum ) and V j E µj (T ) then V j = E µj (T ) if V is finite dimensional. Since V i V j if j j, we must then have E µj (T ) E µ j (T ) for j = j and the eigenspace E µj (T ) are orthogonal, as claimed. Exercise 5: Decide whether A, B are unitarily equivalent. ( ) ( ) /2 1. A = and B = 1 0 1/ A = and B = Solution: 1. If B = UAU then in particular B is similar to A (conjugate by some 2 2 matrix with det(s) 0). But sp(a) = roots of λ 2 1 = { 1, 1}, sp(b) = roots of λ 2 1/4 = { 1/2, 1/2}. But sp(sas 1 ) = sp(a) for any matrix. 2. Now sp(a) = sp(b) = {1, 2, 3} (the diagonal entries of an upper triangular matrix are its eigenvalues). Solving (A λi)x = 0 for λ = 1, 2, 3, e compute the eigenspaces for A. E λ=1 = C = Ce 3, E λ=2 = C(e 1 + e 2 ), E λ=3 = C (e 1 + 2e 2 + e 3 ) Obviously, B is orthogonally diagonalizable, diagonalized by X = {e 1, e 2, e 3 } (ON basis). If B is unitarily equivalent to A, with A = UBU for some U U(2), then U AU = B then A is diagonalized by the ON basis Y = U(X ), vectors in Y are eigenvectors, but the eigenvectors are obviously not orthogonal. Hence B is not unitarily equivalent to A. Exercise 6: If T is a unitary operator on a finite dimensional inner product space. Prove that it has a unitary square root U (such that U 2 = T ). Solution: T being normal is orthogonally diagonalizable say with ON bases of eigenvectors. T (f i ) = λ i f i with each λ i sp(t ) (reapeats allowed). These eigenvalues must 7
8 have λ = 1. In fact if Uv = λv, (v 0) then v 2 = (v, v) = (Uv, Uv) = (λv, λv) = λ λ(v, v) = λ 2 v 2 hence λ 2 = 1, it has polar form λ = e iθ = cos(θ) + i(sin(θ)), for some real λ; then µ = e iθ/2 satisfies µ 2 = λ and µ = 1. Define U, so e iθ 1/2 0 [U] Y = 0 e iθn/2 when Y is the ON basis of eigenvectors for T. Obviously U U = I since e iθ 1/2 0 U = 0 e iθn/2 Exercise 7: Let U : V V be a linear operator on a finite dimensional inner product space. If U(x) = x, for all x V (U is an isometry), is U necessarily a unitary operator? Solution: If U is a bijection, the polarization identities imply that (Ux, Uy) V = (x, y) V, making U unitary. Since dim(v ) <, U is surjective if and only if it is one-to-one if and only if ker(u) = {x V : Ux = 0} is trivial. But Ux = 0 if and only Ux 2 = x 2 if and only if x = 0 in V. The answer is yes. 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 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 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 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 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. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
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 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 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 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 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 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 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 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 informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
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 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 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 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 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 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 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 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 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 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 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 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 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 information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
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 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 informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
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 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 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 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 informationx + y + z = 1 2x + 3y + 4z = 0 5x + 6y + 7z = 3
Math 24 FINAL EXAM (2/9/9 - SOLUTIONS ( Find the general solution to the system of equations 2 4 5 6 7 ( r 2 2r r 2 r 5r r x + y + z 2x + y + 4z 5x + 6y + 7z 2 2 2 2 So x z + y 2z 2 and z is free. ( r
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 informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
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 informationChapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
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 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 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 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 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 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 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 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 informationExamination paper for TMA4115 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99
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 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 informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
More informationAsymptotic Behaviour and Cyclic Properties of Tree-shift Operators
Asymptotic Behaviour and Cyclic Properties of Tree-shift Operators University of Szeged, Bolyai Institute 29th July 2013, Gothenburg Banach Algebras and Applications 1 Introduction, Motivation Directed
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 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 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 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 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 informationr (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + 1 = 1 1 θ(t) 1 9.4.4 Write the given system in matrix form x = Ax + f ( ) sin(t) x y 1 0 5 z = dy cos(t)
Solutions HW 9.4.2 Write the given system in matrix form x = Ax + f r (t) = 2r(t) + sin t θ (t) = r(t) θ(t) + We write this as ( ) r (t) θ (t) = ( ) ( ) 2 r(t) θ(t) + ( ) sin(t) 9.4.4 Write the given system
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 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 informationModélisation et résolutions numérique et symbolique
Modélisation et résolutions numérique et symbolique via les logiciels Maple et Matlab Jeremy Berthomieu Mohab Safey El Din Stef Graillat Mohab.Safey@lip6.fr Outline Previous course: partial review of what
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 Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression
The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every
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 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 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 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 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 informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
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 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 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 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 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 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 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 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 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 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 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 information2 Polynomials over a field
2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special
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 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 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 information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns 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 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 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 informationTensor product of vector spaces
Tensor product of vector spaces Construction Let V,W be vector spaces over K = R or C. Let F denote the vector space freely generated by the set V W and let N F denote the subspace spanned by the elements
More informationUnit 18 Determinants
Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of
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 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 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 informationLinear Algebra: Vectors
A Linear Algebra: Vectors A Appendix A: LINEAR ALGEBRA: VECTORS TABLE OF CONTENTS Page A Motivation A 3 A2 Vectors A 3 A2 Notational Conventions A 4 A22 Visualization A 5 A23 Special Vectors A 5 A3 Vector
More information