12. Special Transformations 1
|
|
- Dylan Montgomery
- 5 years ago
- Views:
Transcription
1 12. Special Transformations 1 Projections Take V = R 3 and consider the subspace W = {(x, y,z) x y z = 0}. Then the map P:V V that projects every vector in R 3 orthogonally onto the plane W is a linear transformation (why is it linear?). See Fig for a picture of what such a map looks like. We want to produce a formula for P. If X is any vector in W, then certainly, P(X) = X. So this holds for the two vectors A = (1,1,0) and B = (1,0,1), both of which lie in W. Indeed, these vectors are a linearly independent set of vectors, and W is 2-dimensional, so they form a basis for W. Further, C = (1, 1, 1) is orthogonal to both A and B (its dot product with both is 0), so P(C) = 0. It is easy to see that {A, B, C} remains linearly independent, so these three vectors form a basis for V. Relative to this basis (used for both domain and codomain), the matrix for P is simply M =
2 12. Special Transformations 2 Must we compute the image of a typical vector, like X = (1,2,3), by first expressing it in terms of the basis {A, B, C}, applying the matrix representation M, then translating back into the standard basis representation? Essentially, yes. But the work is best done by expressing the standard basis vectors {E 1,E 2,E 3 } in terms of {A = (1,1,0), B = (1,0,1), C = (1, 1, 1)}: using the relations we see that 3E 1 = (3,0,0) = A + B +C 3E 2 = (0,3,0) = 2A B C 3E 3 = (0,0,3) = A + 2B C 3P(E 1 ) = P(A) + P(B) + P(C) = A + B = (2,1,1) 3P(E 2 ) = 2P(A) P(B) P(C) = 2A B = (1,2, 1) 3P(E 3 ) = P(A) + 2P(B) P(C) = A + 2B = (1, 1,2) so that the matrix for P relative to the standard basis is N = ; 1 1 2
3 12. Special Transformations 3 that is, P(X) = = Is it possible to extend the notion of a projection map to a general abstract vector space? The important feature of projection maps is that there is some subspace of the domain on which the map is the identity, and every other vector is mapped into this subspace; that is, any vector that is the projection of some vector is itself fixed by the projection. In symbol form: P(P(X)) = P(X) for every X. This leads to the following definition: an endomorphism P:V V is called a projection map if it satisfies the condition P 2 = P. While this definition does allow us to use the notion of a projection map on any type of vector space, the essential features of its behavior carry over from the geometric setting in R 3.
4 12. Special Transformations 4 Theorem Let P:V V be a projection map on the n-dimensional vector space V. Then there is some (ordered) basis {V 1,V 2,,V n } of V for which P is the linear extension of the assignments P(V i ) = V i i = 1,2,,r 0 i = r +1,,n where r = dim(im(p)). Consequently, the matrix of P relative to the basis {V 1,V 2,,V n } (in both domain and codomain) is the diagonal matrix 1 L 0 O M 1 M = 0. M O 0 L 0 Proof Let {X 1,X 2,, X r } be a basis for Im(P) and let {Y 1,Y 2,,Y k } be a basis for ker(p). We claim that {X 1,X 2,, X r,y 1,Y 2,, Y k } is a basis for V. To do this, we first show that these vectors are linearly independent: if the scalars a 1,a 2,,a r,b 1,b 2,,b k satisfy a 1 X 1 +L+ a r X r +b 1 Y 1 +L+b k Y k = 0, then applying P yields
5 12. Special Transformations 5 0 = P(a 1 X 1 +L+a r X r +b 1 Y 1 +L+b k Y k ) = a 1 P(X 1 ) +L+a r P(X r ) +b 1 P(Y 1 ) +L+b k P(Y k ) = a 1 P(X 1 ) +L+a r P(X r ) since the Y s are in the kernel of P. But each of the X s is in the image, so there are vectors W 1,W 2,, W r in V for which X i = P(W i ), i = 1,,r. Therefore, P(X i ) = P 2 (W i ) = P(W i ) = X i since P is a projection map. Substituting this above, we find that 0 = a 1 X 1 +L+a r X r. But {X 1,X 2,, X r } is a basis for Im(P), so the X s are linearly independent, whence all the a s must equal 0. This means that b 1 Y 1 +L+b k Y k = 0; but {Y 1,Y 2,,Y k } is a basis for ker(p), so the Y s are linearly independent, and the b s must all equal 0. This completes the proof that {X 1,X 2,, X r,y 1,Y 2,, Y k } is linearly independent in V. Then, since there are r +k = dim(im(p)) +dim(ker(p )) = dimv vectors in the set, they must form a basis for V. So if we put V 1 = X 1,, V r = X r,v r +1 = Y 1,,V n = Y k, we will have
6 12. Special Transformations 6 P(V i ) = P(X i) = X i = V i P(Y i r ) = 0 i = 1,2,,r i = r +1,,n exactly as we require. That the matrix of P in the basis {V 1,V 2,,V n } is M is clear. // (It is worth mentioning that not every projection map on R n is an orthogonal projection of vectors onto a smaller dimensional hyperplane. Smith describes (p. 188) a skew projection map on R 3 in which all vectors in space are projected onto a planar subspace in a direction different from the perpendicular to this plane.) Proposition Let P:V V be a linear transformation on the n-dimensional vector space V. Then P is a projection map if and only if it is represented (relative to the same basis for V) by an idempotent matrix M (one for which M 2 = M). //
7 12. Special Transformations 7 Nilpotent maps An endomorphism N:V V is called nilpotent of index k if the map N k is the zero map, but N k 1 is not the zero map, on V. The prototype of nilpotent maps is the differential operator D:P n (R) P n (R) (whose index n + 1 = dim(p n (R)) ). But a simpler example is offered by the shift operator S:R n R n, defined as S(x 1, x 2,, x n ) = (0, x 1, x 2,, x n 1 ). This shift operator has index n = dim(r n ). Not all nilpotent maps have index equal to the dimension of the underlying vector space (consider, for instance, the second derivative map on P n (R)). But when this property does hold, there is a particularly simple canonical form for representing the map by a matrix. Theorem Let N:V V be an endomorphism on the n-dimensional vector space V which is nilpotent of index n. Then there is a vector V V so that {V, N (V ), N 2 (V),, N n 1 (V)} is a basis for V. Relative to this basis, N has matrix
8 12. Special Transformations L L 0 M = L 0. O 0 L Proof Since N has index of nilpotency n, there must be some vector V V so that N n 1 (V) 0 (otherwise N n 1 is the zero map and N has index of nilpotency smaller than n). And as all the powers of N are also endomorphisms of V which would have to carry 0 to 0, none of the vectors V, N(V), N 2 (V),, N n 1 (V) is the zero vector. Indeed, these vectors are linearly independent, for if there were a linear relation of the form a 1 V + a 2 N (V)+ a 3 N 2 (V) +L+a n N n 1 (V) = 0, applying N repeatedly to both sides of the equation produces the relations
9 12. Special Transformations 9 a 1 N(V) +a 2 N 2 (V)+ a 3 N 3 (V) +L+a n 1 N n 1 (V) = 0 a 1 N 2 (V) +a 2 N 3 (V)+L+ a n 2 N n 1 (V) = 0 M a 1 N n 1 (V) = 0 The last of these equations forces a 1 = 0 since N n 1 (V) 0. Applying N to each of the remaining equations ultimately produces the equation a 2 N n 1 (V) = 0, from which we deduce a 2 = 0. Continuing in this fashion, we show that each of the a s is 0, whence {V, N (V ), N 2 (V),, N n 1 (V)} is a linearly independent set of vectors in V. Since V has dimension n and this set contains n vectors, it must be a basis for V. Finally, it is clear that with respect to this basis, N is represented by the matrix M above. //
10 12. Special Transformations 10 Cyclic transformations An endomorphism C:V V on a vector space is called cyclic if there exists a vector V V such that V and its successive image vectors C(V),C 2 (V), under C span all of V. That is, V = L(V,C(V),C 2 (V), ) The vector V is called a cyclic vector for C. Notice that any nilpotent endomorphism of index equal to the dimension of the underlying vector space is necessarily cyclic. It is also easy to identify the cyclic transformations on R 2 : Proposition The cyclic endomorphisms of the plane C:R 2 R 2 are precisely those which are not a multiple of the identity map. Proof If C is cyclic with cyclic vector V, then R 2 = L(V,C(V), ). So C(V) cannot be a scalar multiple of V, else all the successive image vectors C(V),C 2 (V), are multiples of V as well, whence R 2 = L(V,C(V), ) is one-dimensional. This implies that C is not a multiple of the identity map on R 2.
11 12. Special Transformations 11 Conversely, if C:R 2 R 2 is not cyclic, then it has no cyclic vector; that is, every vector V in R 2 fails to satisfy R 2 = L(V,C(V), ). This means that for every vector V, C(V) must be a scalar multiple of V. In particular, this holds for the three vectors (1,1), (1,0) and (0,1); that is, C(1,1) = a(1,1), C(1,0) = a 1 (0,1), C(0,1) = a 2 (0,1). But then (a,a) = C(1,1) = C(1,0) +C(0,1) = (a 1,a 2 ), so a = a 1 = a 2, whence in general, C(x, y) = xc(1,0)+ yc(0,1) = x(a,0) + y(0,a) = (ax,ay) = a(x, y). That is, C is a multiple of the identity map. // There is a general form for matrices that represent cyclic transformations.
12 12. Special Transformations 12 Theorem Let C:V V be a cyclic endomorphism on the n-dimensional vector space V. If V is a cyclic vector for C, then {V,C(V),C 2 (V),,C n 1 (V)} is a basis for V and the matrix of C relative to this basis has the form a a 1 M = O O M, 1 0 a n a n 1 where C n (V) = a 0 V +a 1 C(V) +L+a n 1 C n 1 (V). Proof Since V is n-dimensional and V is a cyclic vector for C, then {V,C(V),C 2 (V),,C n 1 (V)} is a spanning set of n vectors in V. Thus, it must also be linearly independent, hence a basis for V. That M is the matrix for C relative to this basis is clear. //
15B. Isometries and Functionals 1
5B. Isometries and Functionals Isometries If the important functions between vector spaces V and W are those that preserve linearity (i.e., linear transformations), then the important functions between
More informationChapter 6. Orthogonality
6.4 The Projection Matrix 1 Chapter 6. Orthogonality 6.4 The Projection Matrix Note. In Section 6.1 (Projections), we projected a vector b R n onto a subspace W of R n. We did so by finding a basis for
More informationAbstract Vector Spaces and Concrete Examples
LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.
More informationMath 110: Worksheet 3
Math 110: Worksheet 3 September 13 Thursday Sept. 7: 2.1 1. Fix A M n n (F ) and define T : M n n (F ) M n n (F ) by T (B) = AB BA. (a) Show that T is a linear transformation. Let B, C M n n (F ) and a
More informationDefinition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition
6 Vector Spaces with Inned Product Basis and Dimension Section Objective(s): Vector Spaces and Subspaces Linear (In)dependence Basis and Dimension Inner Product 6 Vector Spaces and Subspaces Definition
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationChapter SSM: Linear Algebra. 5. Find all x such that A x = , so that x 1 = x 2 = 0.
Chapter Find all x such that A x : Chapter, so that x x ker(a) { } Find all x such that A x ; note that all x in R satisfy the equation, so that ker(a) R span( e, e ) 5 Find all x such that A x 5 ; x x
More informationGEOMETRY OF MATRICES x 1
GEOMETRY OF MATRICES. SPACES OF VECTORS.. Definition of R n. The space R n consists of all column vectors with n components. The components are real numbers... Representation of Vectors in R n.... R. The
More informationAnswers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3
Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,
More informationLinear transformations
Linear transformations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Linear transformations
More information7 : APPENDIX. Vectors and Matrices
7 : APPENDIX Vectors and Matrices An n-tuple vector x is defined as an ordered set of n numbers. Usually we write these numbers x 1,...,x n in a column in the order indicated by their subscripts. The transpose
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More informationReview 1 Math 321: Linear Algebra Spring 2010
Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics
More informationP = A(A T A) 1 A T. A Om (m n)
Chapter 4: Orthogonality 4.. Projections Proposition. Let A be a matrix. Then N(A T A) N(A). Proof. If Ax, then of course A T Ax. Conversely, if A T Ax, then so Ax also. x (A T Ax) x T A T Ax (Ax) T Ax
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationSOLUTIONS TO EXERCISES FOR MATHEMATICS 133 Part 1. I. Topics from linear algebra
SOLUTIONS TO EXERCISES FOR MATHEMATICS 133 Part 1 Winter 2009 I. Topics from linear algebra I.0 : Background 1. Suppose that {x, y} is linearly dependent. Then there are scalars a, b which are not both
More informationSection 6.1. Inner Product, Length, and Orthogonality
Section 6. Inner Product, Length, and Orthogonality Orientation Almost solve the equation Ax = b Problem: In the real world, data is imperfect. x v u But due to measurement error, the measured x is not
More informationMATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:
MATH 2331 Linear Algebra Section 1.1 Systems of Linear Equations Finding the solution to a set of two equations in two variables: Example 1: Solve: x x = 3 1 2 2x + 4x = 12 1 2 Geometric meaning: Do these
More informationSection 1.8/1.9. Linear Transformations
Section 1.8/1.9 Linear Transformations Motivation Let A be a matrix, and consider the matrix equation b = Ax. If we vary x, we can think of this as a function of x. Many functions in real life the linear
More informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More informationDot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.
Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................
More informationChapter 6: Orthogonality
Chapter 6: Orthogonality (Last Updated: November 7, 7) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). A few theorems have been moved around.. Inner products
More informationFinal Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b
Final Examination -NYC-5 - Linear Algebra I December 8 th 7. (4 points) Let A = has: (a) a unique solution. a a (b) infinitely many solutions. (c) no solution. and b = 4. Find the value(s) of a for which
More informationLinear Algebra (Math-324) Lecture Notes
Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and
More informationThis lecture: basis and dimension 4.4. Linear Independence: Suppose that V is a vector space and. r 1 x 1 + r 2 x r k x k = 0
Linear Independence: Suppose that V is a vector space and that x, x 2,, x k belong to V {x, x 2,, x k } are linearly independent if r x + r 2 x 2 + + r k x k = only for r = r 2 = = r k = The vectors x,
More informationNotes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
More informationLinear Algebra I. Ronald van Luijk, 2015
Linear Algebra I Ronald van Luijk, 2015 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents Dependencies among sections 3 Chapter 1. Euclidean space: lines and hyperplanes 5 1.1. Definition
More informationDefinition Suppose S R n, V R m are subspaces. A map U : S V is linear if
.6. Restriction of Linear Maps In this section, we restrict linear maps to subspaces. We observe that the notion of linearity still makes sense for maps whose domain and codomain are subspaces of R n,
More information(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.
1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III
More informationSeptember 18, Notation: for linear transformations it is customary to denote simply T x rather than T (x). k=1. k=1
September 18, 2017 Contents 3. Linear Transformations 1 3.1. Definition and examples 1 3.2. The matrix of a linear transformation 2 3.3. Operations with linear transformations and with their associated
More informationLINES IN P 3. Date: December 12,
LINES IN P 3 Points in P 3 correspond to (projective equivalence classes) of nonzero vectors in R 4. That is, the point in P 3 with homogeneous coordinates [X : Y : Z : W ] is the line [v] spanned by the
More informationLinear Algebra Highlights
Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to
More informationChapter 3: Theory Review: Solutions Math 308 F Spring 2015
Chapter : Theory Review: Solutions Math 08 F Spring 05. What two properties must a function T : R m R n satisfy to be a linear transformation? (a) For all vectors u and v in R m, T (u + v) T (u) + T (v)
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationy 2 . = x 1y 1 + x 2 y x + + x n y n 2 7 = 1(2) + 3(7) 5(4) = 3. x x = x x x2 n.
6.. Length, Angle, and Orthogonality In this section, we discuss the defintion of length and angle for vectors and define what it means for two vectors to be orthogonal. Then, we see that linear systems
More informationFinal Exam Practice Problems Answers Math 24 Winter 2012
Final Exam Practice Problems Answers Math 4 Winter 0 () The Jordan product of two n n matrices is defined as A B = (AB + BA), where the products inside the parentheses are standard matrix product. Is the
More informationMatrix Calculations: Linear maps, bases, and matrices
Matrix Calculations: Linear maps, bases, and matrices A Kissinger Institute for Computing and Information Sciences Version: autumn 2017 A Kissinger Version: autumn 2017 Matrix Calculations 1 / 37 Outline
More informationLecture 13: Orthogonal projections and least squares (Section ) Thang Huynh, UC San Diego 2/9/2018
Lecture 13: Orthogonal projections and least squares (Section 3.2-3.3) Thang Huynh, UC San Diego 2/9/2018 Orthogonal projection onto subspaces Theorem. Let W be a subspace of R n. Then, each x in R n can
More informationFinite Dimensional Space Orthogonal Projection Operators
Finite Dimensional Space Orthogonal Projection Operators Robert M. Haralick Computer Science, Graduate Center City University of New York Spaces Spaces have points called vectors Spaces have sets of points
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More informationNotice that the set complement of A in U satisfies
Complements and Projection Maps In this section, we explore the notion of subspaces being complements Then, the unique decomposition of vectors in R n into two pieces associated to complements lets us
More informationLINEAR MMSE ESTIMATION
LINEAR MMSE ESTIMATION TERM PAPER FOR EE 602 STATISTICAL SIGNAL PROCESSING By, DHEERAJ KUMAR VARUN KHAITAN 1 Introduction Linear MMSE estimators are chosen in practice because they are simpler than the
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #2 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 3. M Test # Solutions. (8 pts) For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For this
More informationChapter 8. Rigid transformations
Chapter 8. Rigid transformations We are about to start drawing figures in 3D. There are no built-in routines for this purpose in PostScript, and we shall have to start more or less from scratch in extending
More informationThe 'linear algebra way' of talking about "angle" and "similarity" between two vectors is called "inner product". We'll define this next.
Orthogonality and QR The 'linear algebra way' of talking about "angle" and "similarity" between two vectors is called "inner product". We'll define this next. So, what is an inner product? An inner product
More informationChapter 6. Orthogonality and Least Squares
Chapter 6 Orthogonality and Least Squares Section 6.1 Inner Product, Length, and Orthogonality Orientation Recall: This course is about learning to: Solve the matrix equation Ax = b Solve the matrix equation
More informationInfinite-Dimensional Triangularization
Infinite-Dimensional Triangularization Zachary Mesyan March 11, 2018 Abstract The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector
More informationMath 416, Spring 2010 More on Algebraic and Geometric Properties January 21, 2010 MORE ON ALGEBRAIC AND GEOMETRIC PROPERTIES
Math 46, Spring 2 More on Algebraic and Geometric Properties January 2, 2 MORE ON ALGEBRAIC AND GEOMETRIC PROPERTIES Algebraic properties Algebraic properties of matrix/vector multiplication Last time
More informationSection 2.2: The Inverse of a Matrix
Section 22: The Inverse of a Matrix Recall that a linear equation ax b, where a and b are scalars and a 0, has the unique solution x a 1 b, where a 1 is the reciprocal of a From this result, it is natural
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationW2 ) = dim(w 1 )+ dim(w 2 ) for any two finite dimensional subspaces W 1, W 2 of V.
MA322 Sathaye Final Preparations Spring 2017 The final MA 322 exams will be given as described in the course web site (following the Registrar s listing. You should check and verify that you do not have
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationLecture 14: Orthogonality and general vector spaces. 2 Orthogonal vectors, spaces and matrices
Lecture 14: Orthogonality and general vector spaces 1 Symmetric matrices Recall the definition of transpose A T in Lecture note 9. Definition 1.1. If a square matrix S satisfies then we say S is a symmetric
More informationis Use at most six elementary row operations. (Partial
MATH 235 SPRING 2 EXAM SOLUTIONS () (6 points) a) Show that the reduced row echelon form of the augmented matrix of the system x + + 2x 4 + x 5 = 3 x x 3 + x 4 + x 5 = 2 2x + 2x 3 2x 4 x 5 = 3 is. Use
More informationMath 314/ Exam 2 Blue Exam Solutions December 4, 2008 Instructor: Dr. S. Cooper. Name:
Math 34/84 - Exam Blue Exam Solutions December 4, 8 Instructor: Dr. S. Cooper Name: Read each question carefully. Be sure to show all of your work and not just your final conclusion. You may not use your
More informationLinear Models Review
Linear Models Review Vectors in IR n will be written as ordered n-tuples which are understood to be column vectors, or n 1 matrices. A vector variable will be indicted with bold face, and the prime sign
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationMATH Linear Algebra
MATH 304 - Linear Algebra In the previous note we learned an important algorithm to produce orthogonal sequences of vectors called the Gramm-Schmidt orthogonalization process. Gramm-Schmidt orthogonalization
More informationInstructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.
Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.. Recall that P 3 denotes the vector space of polynomials of degree less
More informationDepartment of Aerospace Engineering AE602 Mathematics for Aerospace Engineers Assignment No. 4
Department of Aerospace Engineering AE6 Mathematics for Aerospace Engineers Assignment No.. Decide whether or not the following vectors are linearly independent, by solving c v + c v + c 3 v 3 + c v :
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationWe see that this is a linear system with 3 equations in 3 unknowns. equation is A x = b, where
Practice Problems Math 35 Spring 7: Solutions. Write the system of equations as a matrix equation and find all solutions using Gauss elimination: x + y + 4z =, x + 3y + z = 5, x + y + 5z = 3. We see that
More informationFinal Review Written by Victoria Kala SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015
Final Review Written by Victoria Kala vtkala@mathucsbedu SH 6432u Office Hours R 12:30 1:30pm Last Updated 11/30/2015 Summary This review contains notes on sections 44 47, 51 53, 61, 62, 65 For your final,
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationLinear Algebra 1 Exam 2 Solutions 7/14/3
Linear Algebra 1 Exam Solutions 7/14/3 Question 1 The line L has the symmetric equation: x 1 = y + 3 The line M has the parametric equation: = z 4. [x, y, z] = [ 4, 10, 5] + s[10, 7, ]. The line N is perpendicular
More informationDefinitions for Quizzes
Definitions for Quizzes Italicized text (or something close to it) will be given to you. Plain text is (an example of) what you should write as a definition. [Bracketed text will not be given, nor does
More information5.4 Basis And Dimension
5.4 Basis And Dimension 1 Nonrectangular Coordinate Systems We describe this by saying that the coordinate system establishes a one-to-one correspondence between points in the plane and ordered pairs of
More informationA Bridge between Algebra and Topology: Swan s Theorem
A Bridge between Algebra and Topology: Swan s Theorem Daniel Hudson Contents 1 Vector Bundles 1 2 Sections of Vector Bundles 3 3 Projective Modules 4 4 Swan s Theorem 5 Introduction Swan s Theorem is a
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 the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationExercises Chapter II.
Page 64 Exercises Chapter II. 5. Let A = (1, 2) and B = ( 2, 6). Sketch vectors of the form X = c 1 A + c 2 B for various values of c 1 and c 2. Which vectors in R 2 can be written in this manner? B y
More informationMATH2210 Notebook 3 Spring 2018
MATH2210 Notebook 3 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 3 MATH2210 Notebook 3 3 3.1 Vector Spaces and Subspaces.................................
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationThe geometry of least squares
The geometry of least squares We can think of a vector as a point in space, where the elements of the vector are the coordinates of the point. Consider for example, the following vector s: t = ( 4, 0),
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationChapter 2: Matrix Algebra
Chapter 2: Matrix Algebra (Last Updated: October 12, 2016) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). Write A = 1. Matrix operations [a 1 a n. Then entry
More informationMath Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT
Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear
More information4.6 Bases and Dimension
46 Bases and Dimension 281 40 (a) Show that {1,x,x 2,x 3 } is linearly independent on every interval (b) If f k (x) = x k for k = 0, 1,,n, show that {f 0,f 1,,f n } is linearly independent on every interval
More informationMatrices and Matrix Algebra.
Matrices and Matrix Algebra 3.1. Operations on Matrices Matrix Notation and Terminology Matrix: a rectangular array of numbers, called entries. A matrix with m rows and n columns m n A n n matrix : a square
More informationSpan & Linear Independence (Pop Quiz)
Span & Linear Independence (Pop Quiz). Consider the following vectors: v = 2, v 2 = 4 5, v 3 = 3 2, v 4 = Is the set of vectors S = {v, v 2, v 3, v 4 } linearly independent? Solution: Notice that the number
More informationLinear algebra and differential equations (Math 54): Lecture 10
Linear algebra and differential equations (Math 54): Lecture 10 Vivek Shende February 24, 2016 Hello and welcome to class! As you may have observed, your usual professor isn t here today. He ll be back
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationLINEAR ALGEBRA KNOWLEDGE SURVEY
LINEAR ALGEBRA KNOWLEDGE SURVEY Instructions: This is a Knowledge Survey. For this assignment, I am only interested in your level of confidence about your ability to do the tasks on the following pages.
More informationLinear Algebra. Grinshpan
Linear Algebra Grinshpan Saturday class, 2/23/9 This lecture involves topics from Sections 3-34 Subspaces associated to a matrix Given an n m matrix A, we have three subspaces associated to it The column
More information1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by
Seminar 1 1. Which ones of the usual symbols of addition, subtraction, multiplication and division define an operation (composition law) on the numerical sets N, Z, Q, R, C? 2. Let A = {a 1, a 2, a 3 }.
More informationcan only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4
.. Conditions for Injectivity and Surjectivity In this section, we discuss what we can say about linear maps T : R n R m given only m and n. We motivate this problem by looking at maps f : {,..., n} {,...,
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 5: Projectors and QR Factorization Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 14 Outline 1 Projectors 2 QR Factorization
More informationMathematical Economics: Lecture 6
Mathematical Economics: Lecture 6 Yu Ren WISE, Xiamen University October 10, 2012 Outline Chapter 11 Linear Independence 1 Chapter 11 Linear Independence New Section Chapter 11: Linear Independence Linear
More informationof A in U satisfies S 1 S 2 = { 0}, S 1 + S 2 = R n. Examples 1: (a.) S 1 = span . 1 (c.) S 1 = span, S , S 2 = span 0 (d.
. Complements and Projection Maps In this section, we explore the notion of subspaces being complements. Then, the unique decomposition of vectors in R n into two pieces associated to complements lets
More informationLinear Algebra MATH20F Midterm 1
University of California San Diego NAME TA: Linear Algebra Wednesday, October st, 9 :am - :5am No aids are allowed Be sure to write all row operations used Remember that you can often check your answers
More informationVector Spaces 4.5 Basis and Dimension
Vector Spaces 4.5 and Dimension Summer 2017 Vector Spaces 4.5 and Dimension Goals Discuss two related important concepts: Define of a Vectors Space V. Define Dimension dim(v ) of a Vectors Space V. Vector
More informationLinear Algebra (MATH ) Spring 2011 Final Exam Practice Problem Solutions
Linear Algebra (MATH 4) Spring 2 Final Exam Practice Problem Solutions Instructions: Try the following on your own, then use the book and notes where you need help. Afterwards, check your solutions with
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 information