LECTURE 7: LINEAR TRANSFORMATION (CHAPTER 4 IN THE BOOK)

Size: px
Start display at page:

Download "LECTURE 7: LINEAR TRANSFORMATION (CHAPTER 4 IN THE BOOK)"

Transcription

1 LECTURE 7: LINEAR TRANSFORMATION (CHAPTER 4 IN THE BOOK) Everything marked by is not required by the course syllabus In this lecture, F is a fixed field and all vector spcaes are over F. One can assume F = R or C Linear maps. 1. Definitions Definition 1.1. A mapping L from a vector space V into a vector space W is said to be a linear transformation (or linear map or linear homomorphism) if for all v 1, v 2 V and for all scalars α and β. Remark: L(αv 1 + βv 2 ) = αl(v 1 ) + βl(v 2 ) 1. A map L from V to W could be denoted by L V W. 2. Now from the definiotion, L is a linear map is equivalent to say (a) L(v 1 + v 2 ) = L(v 1 ) + L(v 2 ) and (b) L(αv) = α(v). 3. If L V W is a linear map, the we have (a) L(0 V ) = 0 W. (b) L(α 1 v 1 +α 2 v 2 + +α k v k ) = α 1 L(v 1 )+α 2 L(v 2 )+ +α k L(v k ) (the image of a linear combination of some vectors is a linear combination of the image of these vectors) (c) L( v) = L(v). 4. A linear map L V V (from V to V itself) is called a linear operator on V or a linear endomorphism of V Example 1.2. (1) The idenity map L V V defined by L(v) = v. (2) The map L V V defined by L(v) = 2v is a linear map/ linear operator on V (this a scaler multiplication). (3) The map L V V defined by L(v) = v + a is not a linear operation on V unless a is the zero vector 0. (4) Rotation let R θ R 2 R 2 be the map that send a vector in 2d plan to its rotation by degree θ counterclockwise. Then R θ ((x, y) T ) = (x cos θ y sin θ, x sin θ + y cos θ) = ( cos θ sin θ sin θ cos θ ) (x y ) 1

2 2 LECTURE 7: LINEAR TRANSFORMATION (5) In general, let A be an m n matrix. The map L A defined by L A F n F m x Ax is a linear map from F n to F m. The claim follows form the arthematics of matrices: L A (αx 1 + βx 2 ) =A(αx 1 + βx 2 ) = A(αx 1 ) + A(βx 2 ) =αax 1 + βax 2 = αl A (x 1 ) + βl A (x 2 ). (6) Recall that F [x] is the space of polynomials with coefficient in F. Let p = a n x n + a n 1 x n 1 + +a 1 x+a 0 be a polynomial in F [x]. The dirivative map D F [x] F [x] defined by D(p) = d dx p = na nx n 1 + (n 1)a n 1 x n a 1 is a linear map. Similarly, we have indefinite integration is a linear map I F [x] F [x] defined by 1 I(p) = p dx = n + 1 a nx n n a n 1x n a 1x 2 + a 0 x. The following examples are about function spaces, you can skip it as your wish. (7) Recall that C k ([a, b]) is the space of conitnouns differencaible functions of order k on the intervial [a, b]. Then D C n ([a, b]) C n 1 ([a, b]) defined by D(f) = d dxf is a linear map. (8) Now consider the integrations: L C[a, b] R defiend by L(f) = a b f(x)dx. is a linear transformation. (9) Fix a point x 0 [a, b] the evalutation map eval x0 C([a, b]) R given by eval x0 (f) = f(x 0 ) is a linear map. (10) Definite integration gives linear maps: L C([a, b]) R defined by L(f) = b a f(x)dx. I C([a, b]) C 1 ([a, b]) defined by (I(f))(t) = t a f(x) d dx Kernel and image. Definition 1.3. Let L V W be a linear map. The kernel of L, denoted ker(l), is defined by ker(l) = { v V L(v) = 0 W }. Definition 1.4. Let L V W be a linear map and let S be a subspace of V. The image of S, denoted L(S), is defined by L(S) = { w W w = L(v) for some v S } The image of the entire vector space, image(l) = L(V ), is called the range or image of L. Lemma 1.5. If L V W is a linear transformation and S is a subspace of V, then (i) ker(l) is a subspace of V. (ii) L(S) is a subspace of W.

3 LECTURE 7: LINEAR TRANSFORMATION 3 Proof. (1) It is obvious that ker(l) is nonempty since 0 V ker(l). Now we show that ker(l) is closed under scalar multiplication and addition. Let v, v 1, v 2 ker(l) and let α F. Closure under scalar multiplication: Therefore, αv ker(l). For closure under addition: L(αv) = αl(v) = α0 W = 0 W. L(v 1 + v 2 ) = L(v 1 ) + L(v 2 ) = 0 W + 0 W = 0 W Therefore, v 1 + v 2 ker(l) and hence ker(l) is a subspace of V. (2) L(S) is nonempty, since 0 W = L(0 V ) L(S). For closure under scalar multiplication If w L(S), then w = L(v) for some v S. For any scalar α, αw = αl(v) = L(αv) Since αv S, it follows that αw L(S), and hence L(S) is closed under scalar multiplication. For closur under addition If w 1, w 2 L(S), then there exist v 1, v 2 S such that L(v 1 ) = w 1 and L(v 2 ) = w 2. Thus, w 1 + w 2 = L(v 1 ) + L(v 2 ) = L(v 1 + v 2 ). and hence L(S) is closed under addition. It follows that L(S) is a subspace of W. Remark: One can visualize the relationship between these spaces by following diagram which is called a short exact sequance. (Here 0 reprensents the zero verctor space.) 0 ker(l) V L(V ) 0. Example 1.6. (1) Let A be an m n and consider the map L A F n F m defined by L A (x) = Ax. Then kernel ker(l A ) of L A is the solution space of the equation Ax = 0. The image L A (V ) of L is the column space of A. (2) Recall that P n = { p F [x] p has degree less than or equal to n }. Recall dirivative operator D P n P n. We have ker(d) = P 0, i.e. the space of constant polynomials and D(P n ) = P n Quick Review about maps. Recall that a map between two sets, say f A B is called an injection or injective if for each element b B there is at most one a A such that f(a) = b. f is called a surjection or surjective if f(a) = B. If f is both injective and surjective, it is called a bijection or bijective. For a bijection f A B, each element in a A is corresponding to a unique element b B. Therefore, we can define the inverse map f 1 B A by f(a) a. The inverse map f 1 is characterised by the property that it is the unique map, say h, such that h f = id A where id A A A is the identity map given by a a. Two maps f A B and g B C could be compose to form a map g f A C by a g(f(a)) Linear isomorphism. Lemma 1.7. Let L V W be a linear map. If ker(l) = 0 if and only if L is a injection. Proof. ( ) Suppose ker(l) = 0. Suppose there is two elements v 1 v 2 V such that L(v 1 ) = L(v 2 ) = w for some w W. Hence L(v 1 v 2 ) = 0 W, i.e. 0 V v 1 v 2 ker(l). This is contradict to ker(l) = 0. ( ) Suppose that L is an injection, we claim that ker(l) is the zero space. We prove by contradiction, suppose ker(l) is not zero, then there is a nonzero vector v ker(l).

4 4 LECTURE 7: LINEAR TRANSFORMATION We have L(v) = 0 W v 0 V. = L(0 V ). This contradict to that L is an injection, since Definition 1.8. A linear map L V W is called a linear isomorphism if ker(l) = 0 and L(V ) = W. We could denote V L W or V W. Suppose L V W is a linear isomorphism then it is a bijection. Its inverse L 1 W V is well defined and also a linear isomorphism. Exercise (Spaces which are linear isomorphic to each other have the same dimnsion). Suppose L V W is a linear isomorphism, then dim V = dim W. (Hint: check that L sends any basis of V into linearly independent set of W, hence dim V dim W ; apply the same argument to L 1 W W, get dim W dim V ; down) Example 1.9 (an important example). Now let V be a finite dimensional vector space. Suppose V has dimension n and S = { v 1,, v n } is a basis of V. Then the map send each vector v in V to its coordinate [v] S with respect to the basis S is give a linear isomorphism form V to F n. Similarly, the inverse of the above map is also an isomorphism which is given by (x 1, x 2,, x n ) x 1 v 1 + x 2 v x n v n. In summary, the example says, V F n if V is has dimension n. Roughly speaking, if two vector spaces V and W are isomorphic, one could think them are the same in many cases. However isomorphisms are not unique. (For example, the isomorphism V F n are all different for different basis.) Notation. Let V be an n-dimensional vector space and S = { v 1, v 2,, v n }. Let ι S F n V denote the isomorphism from F n to V given by the basis S. More precisely, and ι S ((x 1,, x n )) = x 1 v 1 + +x 2 v x n v n ι 1 S (v) = [v] S for v V. for (x 1, x 2,, x n ) F n Example Consider the basis S = { 1, x, x 2,, x n } of P n. Then ι S ((a 0, a 1,, a n )) =a 0 + a 1 x + + a n x n P n ι 1 S (a 0 + a 1 x + + a n x n ) =(a 0, a 1,, a n ) F n+1 gives the isomorphism between F n+1 and P n. Example 1.11 (Change of basis: from standard basis). Consider the case V = F n and a basis S = { v 1, v 2,, v n } as column vectors. Define matrix (by abuse of notation) S = (v 1 v 2 v n ). Then, for x = (x 1,, x n ) F n and v V = F n, we have ι S (x) = Sx and [v] S = ι 1 S (v) = S 1 v. (Note that S is an invertible matrix since { v 1,, v n } is a basis!)

5 1.5. Composition of linear maps. LECTURE 7: LINEAR TRANSFORMATION 5 Definition Suppose L V W and T W U are two linear maps. Define the composition T L V U of L and T by T L(v) = L(T (v)). Exercise. Check that T L is a linear map. Notation (Commutative diagram ). Let Q V W be a linear map. Suppose Q = T L then we say the following diagram is commutative. V L U Q Example Let L A F n F m and L B F m F t be two maps represented by matrices A and B respectivly. Then L B L A = L BA. T W In fact, L B L A (x) = L B (L A (x)) = L B (Ax) = B(Ax) = (BA)x = L BA (x). 2. Matrix Representations of Linear Transformations The following theorem says, all linear maps from F n to F m is given by a matrix. Theorem 2.1. If L F n F m is a linear map from F n to F m, then there is an m n matrix A such that L(x) = Ax for each x F n. In fact, A = (a 1 a 2 a n ) where the j-th column a j is given by (e j s from the standard basis) a j = L(e j ). Proof. This is clear in fact. Write each vector x = (x 1,, x n ) T in F n interms of standard baisis: x = x 1 e 1 + x 2 e x n e n Now L(x) =x 1 L(e 1 ) + x 2 L(e 2 ) + + x n L(e n ) =x 1 a 1 + x 2 a x n a j x 1 x 2 = (a 1 a 2 a n ) =Ax Notation. We will identify an n m matrix with the corresponding linear map L A F n F m by abuse of notation. Theorem 2.2 (Matrix Representation Theorem). If S = { v 1, v 2,, v n } and T = { w 1, w 2, w m } are ordered bases for vector spaces V and W, respectively, then corresponding to each linear transformation L V W, there is an m n matrix A such that x n [L(v)] T = A[v] S for each v V.

6 6 LECTURE 7: LINEAR TRANSFORMATION Proof. Consider the diagram: V ι S L W ι T F n L A F m Similarly, let ι T F n W corresponding to T. Then ι 1 T by certain matrix A. Now [L(v)] T = ι 1 T (L(v)) = (ι 1 T L ι S )(ι 1 S (v)) = A[v] S. L ι S F n F m is represented Definition 2.3. Under the notation of above theorem. We will let [L] S,T matrix A representing L under the basises S and T. denote the 2.1. Changing of basis down right. Let V be a vector spaces of dimension n. S = { v 1,, v n } and T = { u 1,, u 2 }. The change of basis matrix is viewed via the below diagram: V ι S F n id [id] S,T V F n ι T Here [id] S,T is represented by the change of basis matrix. Clearly we have [id] T,S = ([id] S,T ) 1 When V = F n and v i, u j s as column vectors and matrices (abuse notation) S = (v 1 v 2 v n ) and T = (u 1 u 2 u n ) Then the change of basis matrix is For any vector v V, we have [id] S,T = ι 1 T ι S = T 1 S. [v] T = ι 1 T (v) =ι 1 T ι S (ι 1 S (v)) = ι 1 T ι S ([v] S ) = T 1 S [v] S Notation. Let E denote the standard basis { e 1, e 2,, e n }. Clearly, (e 1 e 2 e n ) = I n. By discussions in Example 1.11, [id] S,E = S and [id] E,S = S Matrix prsentation and changing of basis. Theorem 2.4. Let S and S be two basis of V. Let T and T be two basis of W. Let L V W be a linear map. Let [L] S,T be the matrix representing L under the basis S and T. Then [L] S,T = [id W ] T,T [L] S,T [id V ] S,S Proof. Clear from the following diagram V id V V L W id W W ι S ι S ι T ι T F n [id V ] S,S F n [L] S,T F m [id W ] T,T F m

7 LECTURE 7: LINEAR TRANSFORMATION 7 Lemma 2.5. Let S = { v 1,, v n } and T = { u 1,, u m } be ordered bases for F n and F m, respectively. If L F n F m is a linear transformation, then In particular, the j-the column of [L] S,T is where T = (u 1,, u m ). [L] S,T = T 1 (L(v 1 ) L(v 2 ) L(v n )). T 1 L(v j ). Proof. Let S = (v 1 v 2 v n ). Let A be the matrix representing L with respect to the standard basis. Now [L] S,T =[id W ] E,T A [id V ] S,E = T 1 AS =T 1 A (v 1 v 2 v n ) = (T 1 Av 1 T 1 Av 2 T 1 Av n ) = (T 1 L(v 1 ) T 1 L(v 2 ) T 1 L(v n )) The colloray below give a way to calculate [L] S,T by row operations. Corollary 2.6. Under the assumption of Lemma 2.5, the reduced row echelon form of (u 1 u m L(v 1 ) L(v n )) is (I m [L] S,T ). Proof. Follows from the fact that is row equivalent to (T L(v 1 ) L(v n )) T 1 (T L(v 1 ) L(v n )) = (I m T 1 L(v 1 ) T 1 L(v n )) = (I m [L] S,T ) Similarity. Theorem 2.7. Let T = { v 1,, v n } and T = { u 1,, u n } be two ordered bases for a vector space V, and let L be a linear operator on V. Let S be the transition matrix representing the change from T to T. If A is the matrix representing L with respect to S, and B is the matrix representing L with respect to T, then B = S 1 AS. Proof. By definition, S = [id] T,T, S 1 = [id] T,T, A = [L] T,T and B = [L] T,T. Now Theorem 2.4 implies B = [L] T,T = [id] T,T [L] T,T [id] T,T = S 1 AS. Definition 2.8. Let A and B be n n matrices. B is said to be similar to A if there exists a nonsingular matrix S such that B = S 1 AS.

8 8 LECTURE 7: LINEAR TRANSFORMATION Upshot, similar matrices could be think as the matrix representations of a linear map under different basises. A very important problem is to find a nonsignular matrix S such that S 1 AS is as simple as possible. Example 2.9. Following are some very important facts (we will not give a proof right now) (1) A 2 2 matrix over R is similar to one of the following matrices (with a 1 a 2 R, λ R, θ [0, 2π) ) ( a 1 0 ), ( λ 1 θ sin θ ), (cos 0 a 2 0 λ sin θ cos θ ) (2) Any matrix over C is similar to an upper triangler matrix. (In fact, one can say more). (3) Any symmatric matrix over R is similar to a diagonal matrix Nullity-Rank theorem (revisited). Let L V W be a linear map between finite dimensional spaces V and W. Definition (i) The nullity of L is defined as the dimension of ker(l). It is denoted by null(l) (ii) The rank of L is defined as the dimension of L(V ). It is denoted by rank(l). Theorem Let L V W be a linear map. We have null(l) + rank(l) = dim V. Proof. Suppose that dim V = n and dim W = m. Fix any basis S of V and T of W. Then [L] S,T is an n m matrix. Recall that N([L] S,T ) is the null space of the matrix [L] S,T. Let Col([L] S,T ) be the column space of [L] S,T. Now ι S (N([L] S,T )) = ker(l) and ι T (Col([L] S,T ) = L(V ). Therefore dim ker(l) = dim N([L] S,T ) and dim L(V ) = dim Col([L] S,T = dim Row([L] S,T ). Hence the theorem follows from the nullity-rank theorem for matrices.

Chapter 2 Linear Transformations

Chapter 2 Linear Transformations Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more

More information

Linear Transformations: Kernel, Range, 1-1, Onto

Linear Transformations: Kernel, Range, 1-1, Onto Linear Transformations: Kernel, Range, 1-1, Onto Linear Algebra Josh Engwer TTU 09 November 2015 Josh Engwer (TTU) Linear Transformations: Kernel, Range, 1-1, Onto 09 November 2015 1 / 13 Kernel of a Linear

More information

MTH 362: Advanced Engineering Mathematics

MTH 362: Advanced Engineering Mathematics MTH 362: Advanced Engineering Mathematics Lecture 5 Jonathan A. Chávez Casillas 1 1 University of Rhode Island Department of Mathematics September 26, 2017 1 Linear Independence and Dependence of Vectors

More information

Linear Maps and Matrices

Linear Maps and Matrices Linear Maps and Matrices Maps Suppose that V and W are sets A map F : V W is a function; that is, to every v V there is assigned a unique element w F v in W Two maps F : V W and G : V W are equal if F

More information

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018

MATH 315 Linear Algebra Homework #1 Assigned: August 20, 2018 Homework #1 Assigned: August 20, 2018 Review the following subjects involving systems of equations and matrices from Calculus II. Linear systems of equations Converting systems to matrix form Pivot entry

More information

5 Linear Transformations

5 Linear Transformations Lecture 13 5 Linear Transformations 5.1 Basic Definitions and Examples We have already come across with the notion of linear transformations on euclidean spaces. We shall now see that this notion readily

More information

2: LINEAR TRANSFORMATIONS AND MATRICES

2: LINEAR TRANSFORMATIONS AND MATRICES 2: LINEAR TRANSFORMATIONS AND MATRICES STEVEN HEILMAN Contents 1. Review 1 2. Linear Transformations 1 3. Null spaces, range, coordinate bases 2 4. Linear Transformations and Bases 4 5. Matrix Representation,

More information

1 Background and Review Material

1 Background and Review Material 1 Background and Review Material 1.1 Vector Spaces Let V be a nonempty set and consider the following two operations on elements of V : (x,y) x + y maps V V V (addition) (1.1) (α, x) αx maps F V V (scalar

More information

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.

More information

Vector Spaces and Linear Transformations

Vector Spaces and Linear Transformations Vector Spaces and Linear Transformations Wei Shi, Jinan University 2017.11.1 1 / 18 Definition (Field) A field F = {F, +, } is an algebraic structure formed by a set F, and closed under binary operations

More information

LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK)

LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK) LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK) In this lecture, F is a fixed field. One can assume F = R or C. 1. More about the spanning set 1.1. Let S = { v 1, v n } be n vectors in V, we have defined

More information

Linear Algebra. Session 8

Linear Algebra. Session 8 Linear Algebra. Session 8 Dr. Marco A Roque Sol 08/01/2017 Abstract Linear Algebra Range and kernel Let V, W be vector spaces and L : V W, be a linear mapping. Definition. The range (or image of L is the

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND

More information

Quadratic Forms. Marco Schlichting Notes by Florian Bouyer. January 16, 2012

Quadratic Forms. Marco Schlichting Notes by Florian Bouyer. January 16, 2012 Quadratic Forms Marco Schlichting Notes by Florian Bouyer January 16, 2012 In this course every ring is commutative with unit. Every module is a left module. Definition 1. Let R be a (commutative) ring

More information

Linear Vector Spaces

Linear Vector Spaces CHAPTER 1 Linear Vector Spaces Definition 1.0.1. A linear vector space over a field F is a triple (V, +, ), where V is a set, + : V V V and : F V V are maps with the properties : (i) ( x, y V ), x + y

More information

CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

More information

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction

NONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques

More information

Homework 5 M 373K Mark Lindberg and Travis Schedler

Homework 5 M 373K Mark Lindberg and Travis Schedler Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers

More information

Kernel and range. Definition: A homogeneous linear equation is an equation of the form A v = 0

Kernel and range. Definition: A homogeneous linear equation is an equation of the form A v = 0 Kernel and range Definition: The kernel (or null-space) of A is ker A { v V : A v = 0 ( U)}. Theorem 5.3. ker A is a subspace of V. (In particular, it always contains 0 V.) Definition: A is one-to-one

More information

Math 121 Homework 4: Notes on Selected Problems

Math 121 Homework 4: Notes on Selected Problems Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W

More information

4 Vector Spaces. 4.1 Basic Definition and Examples. Lecture 10

4 Vector Spaces. 4.1 Basic Definition and Examples. Lecture 10 Lecture 10 4 Vector Spaces 4.1 Basic Definition and Examples Throughout mathematics we come across many types objects which can be added and multiplied by scalars to arrive at similar types of objects.

More information

Linear Algebra Review

Linear Algebra Review Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite

More information

MATH PRACTICE EXAM 1 SOLUTIONS

MATH PRACTICE EXAM 1 SOLUTIONS MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is

More information

Linear Algebra Review

Linear Algebra Review Chapter 1 Linear Algebra Review It is assumed that you have had a beginning course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc I will review some of these terms here,

More information

Rank & nullity. Defn. Let T : V W be linear. We define the rank of T to be rank T = dim im T & the nullity of T to be nullt = dim ker T.

Rank & nullity. Defn. Let T : V W be linear. We define the rank of T to be rank T = dim im T & the nullity of T to be nullt = dim ker T. Rank & nullity Aim lecture: We further study vector space complements, which is a tool which allows us to decompose linear problems into smaller ones. We give an algorithm for finding complements & an

More information

0.1 Diagonalization and its Applications

0.1 Diagonalization and its Applications .. DIAGONALIZATION AND ITS APPLICATIONS. Diagonalization and its Applications Exercise.. Let A be a -matrix whose characteristic polynomial is A (t) = t t + t +. a) Express A in term of powers A, A, and

More information

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in

More information

Second Exam. Math , Spring March 2015

Second Exam. Math , Spring March 2015 Second Exam Math 34-54, Spring 25 3 March 25. This exam has 8 questions and 2 pages. Make sure you have all pages before you begin. The eighth question is bonus (and worth less than the others). 2. This

More information

Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps

Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps We start with the definition of a vector space; you can find this in Section A.8 of the text (over R, but it works

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

Chapter 3. Vector spaces

Chapter 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 information

Elementary linear algebra

Elementary linear algebra Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The

More information

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013 Math Exam Sample Problems Solution Guide October, Note that the following provides a guide to the solutions on the sample problems, but in some cases the complete solution would require more work or justification

More information

2 Determinants The Determinant of a Matrix Properties of Determinants Cramer s Rule Vector Spaces 17

2 Determinants The Determinant of a Matrix Properties of Determinants Cramer s Rule Vector Spaces 17 Contents 1 Matrices and Systems of Equations 2 11 Systems of Linear Equations 2 12 Row Echelon Form 3 13 Matrix Algebra 5 14 Elementary Matrices 8 15 Partitioned Matrices 10 2 Determinants 12 21 The Determinant

More information

A Little Beyond: Linear Algebra

A Little Beyond: Linear Algebra A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two

More information

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator

More information

1. General Vector Spaces

1. General Vector Spaces 1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

More information

Test 1 Review Problems Spring 2015

Test 1 Review Problems Spring 2015 Test Review Problems Spring 25 Let T HomV and let S be a subspace of V Define a map τ : V /S V /S by τv + S T v + S Is τ well-defined? If so when is it well-defined? If τ is well-defined is it a homomorphism?

More information

Chapter 2: Matrix Algebra

Chapter 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 information

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016

Linear Algebra Notes. Lecture Notes, University of Toronto, Fall 2016 Linear Algebra Notes Lecture Notes, University of Toronto, Fall 2016 (Ctd ) 11 Isomorphisms 1 Linear maps Definition 11 An invertible linear map T : V W is called a linear isomorphism from V to W Etymology:

More information

Linear Algebra Lecture Notes-I

Linear Algebra Lecture Notes-I Linear Algebra Lecture Notes-I Vikas Bist Department of Mathematics Panjab University, Chandigarh-6004 email: bistvikas@gmail.com Last revised on February 9, 208 This text is based on the lectures delivered

More information

Abstract Vector Spaces and Concrete Examples

Abstract 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 information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space

More information

Vector Spaces and Linear Maps

Vector Spaces and Linear Maps Vector Spaces and Linear Maps Garrett Thomas August 14, 2018 1 About This document is part of a series of notes about math and machine learning. You are free to distribute it as you wish. The latest version

More information

Math 3108: Linear Algebra

Math 3108: Linear Algebra Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118

More information

Section 4.5. Matrix Inverses

Section 4.5. Matrix Inverses Section 4.5 Matrix Inverses The Definition of Inverse Recall: The multiplicative inverse (or reciprocal) of a nonzero number a is the number b such that ab = 1. We define the inverse of a matrix in almost

More information

1. Select the unique answer (choice) for each problem. Write only the answer.

1. Select the unique answer (choice) for each problem. Write only the answer. MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +

More information

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 113 Winter 2013 Prof. Church Midterm Solutions Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis

More information

Math 113 Midterm Exam Solutions

Math 113 Midterm Exam Solutions Math 113 Midterm Exam Solutions Held Thursday, May 7, 2013, 7-9 pm. 1. (10 points) Let V be a vector space over F and T : V V be a linear operator. Suppose that there is a non-zero vector v V such that

More information

Notes for Functional Analysis

Notes for Functional Analysis Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) October 16, 2015 1 Lecture 11 1.1 The closed graph theorem Definition 1.1. Let f : X Y be any map between topological spaces. We define its

More information

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017 Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

More information

MATH 583A REVIEW SESSION #1

MATH 583A REVIEW SESSION #1 MATH 583A REVIEW SESSION #1 BOJAN DURICKOVIC 1. Vector Spaces Very quick review of the basic linear algebra concepts (see any linear algebra textbook): (finite dimensional) vector space (or linear space),

More information

GENERAL VECTOR SPACES AND SUBSPACES [4.1]

GENERAL VECTOR SPACES AND SUBSPACES [4.1] GENERAL VECTOR SPACES AND SUBSPACES [4.1] General vector spaces So far we have seen special spaces of vectors of n dimensions denoted by R n. It is possible to define more general vector spaces A vector

More information

3 - Vector Spaces Definition vector space linear space u, v,

3 - Vector Spaces Definition vector space linear space u, v, 3 - Vector Spaces Vectors in R and R 3 are essentially matrices. They can be vieed either as column vectors (matrices of size and 3, respectively) or ro vectors ( and 3 matrices). The addition and scalar

More information

The definition of a vector space (V, +, )

The 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 information

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Solving a system by back-substitution, checking consistency of a system (no rows of the form MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary

More information

(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

(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 information

Linear Algebra. Week 7

Linear Algebra. Week 7 Linear Algebra. Week 7 Dr. Marco A Roque Sol 10 / 09 / 2018 If {v 1, v 2,, v n } is a basis for a vector space V, then any vector v V, has a unique representation v = x 1 v 1 + x 2 v 2 + + x n v n where

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.

2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure. Hints for Exercises 1.3. This diagram says that f α = β g. I will prove f injective g injective. You should show g injective f injective. Assume f is injective. Now suppose g(x) = g(y) for some x, y A.

More information

Honors Algebra II MATH251 Course Notes by Dr. Eyal Goren McGill University Winter 2007

Honors Algebra II MATH251 Course Notes by Dr. Eyal Goren McGill University Winter 2007 Honors Algebra II MATH251 Course Notes by Dr Eyal Goren McGill University Winter 2007 Last updated: April 4, 2014 c All rights reserved to the author, Eyal Goren, Department of Mathematics and Statistics,

More information

MAT Linear Algebra Collection of sample exams

MAT Linear Algebra Collection of sample exams MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system

More information

2.3. VECTOR SPACES 25

2.3. VECTOR SPACES 25 2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous

More information

Math 353, Practice Midterm 1

Math 353, Practice Midterm 1 Math 353, Practice Midterm Name: This exam consists of 8 pages including this front page Ground Rules No calculator is allowed 2 Show your work for every problem unless otherwise stated Score 2 2 3 5 4

More information

Lecture Notes for Math 414: Linear Algebra II Fall 2015, Michigan State University

Lecture Notes for Math 414: Linear Algebra II Fall 2015, Michigan State University Lecture Notes for Fall 2015, Michigan State University Matthew Hirn December 11, 2015 Beginning of Lecture 1 1 Vector Spaces What is this course about? 1. Understanding the structural properties of a wide

More information

Math 321: Linear Algebra

Math 321: Linear Algebra Math 32: Linear Algebra T. Kapitula Department of Mathematics and Statistics University of New Mexico September 8, 24 Textbook: Linear Algebra,by J. Hefferon E-mail: kapitula@math.unm.edu Prof. Kapitula,

More information

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2

We could express the left side as a sum of vectors and obtain the Vector Form of a Linear System: a 12 a x n. a m2 Week 22 Equations, Matrices and Transformations Coefficient Matrix and Vector Forms of a Linear System Suppose we have a system of m linear equations in n unknowns a 11 x 1 + a 12 x 2 + + a 1n x n b 1

More information

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University Math 8530, Spring 2017

Linear maps. Matthew Macauley. Department of Mathematical Sciences Clemson University  Math 8530, Spring 2017 Linear maps Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Spring 2017 M. Macauley (Clemson) Linear maps Math 8530, Spring 2017

More information

Instructions 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. 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 information

Typical Problem: Compute.

Typical Problem: Compute. Math 2040 Chapter 6 Orhtogonality and Least Squares 6.1 and some of 6.7: Inner Product, Length and Orthogonality. Definition: If x, y R n, then x y = x 1 y 1 +... + x n y n is the dot product of x and

More information

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)

More information

6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication)

6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication) Definition: A subspace of a vector space V is a subset H of V which is itself a vector space with respect to the addition and scalar multiplication in V. As soon as one verifies a), b), c) below for H,

More information

MATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,

MATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3, MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1

More information

MAT 242 CHAPTER 4: SUBSPACES OF R n

MAT 242 CHAPTER 4: SUBSPACES OF R n MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)

More information

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7

x 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7 Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)

More information

1.8 Dual Spaces (non-examinable)

1.8 Dual Spaces (non-examinable) 2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,

More information

Part I True or False. (One point each. A wrong answer is subject to one point deduction.)

Part I True or False. (One point each. A wrong answer is subject to one point deduction.) FACULTY OF ENGINEERING CHULALONGKORN UNIVERSITY 21121 Computer Engineering Mathematics YEAR II, Second Semester, Final Examination, March 3, 214, 13: 16: Name ID 2 1 CR58 Instructions 1. There are 43 questions,

More information

Math 250B Midterm II Information Spring 2019 SOLUTIONS TO PRACTICE PROBLEMS

Math 250B Midterm II Information Spring 2019 SOLUTIONS TO PRACTICE PROBLEMS Math 50B Midterm II Information Spring 019 SOLUTIONS TO PRACTICE PROBLEMS Problem 1. Determine whether each set S below forms a subspace of the given vector space V. Show carefully that your answer is

More information

Section II.1. Free Abelian Groups

Section II.1. Free Abelian Groups II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof

More information

Section 6.2: THE KERNEL AND RANGE OF A LINEAR TRANSFORMATIONS

Section 6.2: THE KERNEL AND RANGE OF A LINEAR TRANSFORMATIONS Section 6.2: THE KERNEL AND RANGE OF A LINEAR TRANSFORMATIONS When you are done with your homework you should be able to Find the kernel of a linear transformation Find a basis for the range, the rank,

More information

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2.

MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. MATH 304 Linear Algebra Lecture 23: Diagonalization. Review for Test 2. Diagonalization Let L be a linear operator on a finite-dimensional vector space V. Then the following conditions are equivalent:

More information

Definition 3 A Hamel basis (often just called a basis) of a vector space X is a linearly independent set of vectors in X that spans X.

Definition 3 A Hamel basis (often just called a basis) of a vector space X is a linearly independent set of vectors in X that spans X. Economics 04 Summer/Fall 011 Lecture 8 Wednesday August 3, 011 Chapter 3. Linear Algebra Section 3.1. Bases Definition 1 Let X be a vector space over a field F. A linear combination of x 1,..., x n X is

More information

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1) EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

More information

Mathematics 1. Part II: Linear Algebra. Exercises and problems

Mathematics 1. Part II: Linear Algebra. Exercises and problems Bachelor Degree in Informatics Engineering Barcelona School of Informatics Mathematics Part II: Linear Algebra Eercises and problems February 5 Departament de Matemàtica Aplicada Universitat Politècnica

More information

Abstract Vector Spaces

Abstract Vector Spaces CHAPTER 1 Abstract Vector Spaces 1.1 Vector Spaces Let K be a field, i.e. a number system where you can add, subtract, multiply and divide. In this course we will take K to be R, C or Q. Definition 1.1.

More information

10. Smooth Varieties. 82 Andreas Gathmann

10. Smooth Varieties. 82 Andreas Gathmann 82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It

More information

Vector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture

Vector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture Week9 Vector Spaces 9. Opening Remarks 9.. Solvable or not solvable, that s the question Consider the picture (,) (,) p(χ) = γ + γ χ + γ χ (, ) depicting three points in R and a quadratic polynomial (polynomial

More information

ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK

ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK 1. Practice exam problems Problem A. Find α C such that Q(i, 3 2) = Q(α). Solution to A. Either one can use the proof of the primitive element

More information

Matrices and Linear transformations

Matrices and Linear transformations Matrices and Linear transformations We have been thinking of matrices in connection with solutions to linear systems of equations like Ax = b. It is time to broaden our horizons a bit and start thinking

More information

Math Linear algebra, Spring Semester Dan Abramovich

Math Linear algebra, Spring Semester Dan Abramovich Math 52 0 - Linear algebra, Spring Semester 2012-2013 Dan Abramovich Fields. We learned to work with fields of numbers in school: Q = fractions of integers R = all real numbers, represented by infinite

More information

DEPARTMENT OF MATHEMATICS

DEPARTMENT OF MATHEMATICS Name(Last/First): GUID: DEPARTMENT OF MATHEMATICS Ma322005(Sathaye) - Final Exam Spring 2017 May 3, 2017 DO NOT TURN THIS PAGE UNTIL YOU ARE INSTRUCTED TO DO SO. Be sure to show all work and justify your

More information

MATRIX THEORY (WEEK 2)

MATRIX THEORY (WEEK 2) MATRIX THEORY (WEEK 2) JAMES FULLWOOD Example 0.1. Let L : R 3 R 4 be the linear map given by L(a, b, c) = (a, b, 0, 0). Then which is the z-axis in R 3, and ker(l) = {(x, y, z) R 3 x = y = 0}, im(l) =

More information

1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by

1. 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 information

Solution to Homework 1

Solution 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 information

A = 1 6 (y 1 8y 2 5y 3 ) Therefore, a general solution to this system is given by

A = 1 6 (y 1 8y 2 5y 3 ) Therefore, a general solution to this system is given by Mid-Term Solutions 1. Let A = 3 1 2 2 1 1 1 3 0. For which triples (y 1, y 2, y 3 ) does AX = Y have a solution? Solution. The following sequence of elementary row operations: R 1 R 1 /3, R 1 2R 1 + R

More information

Linear Algebra Practice Problems

Linear Algebra Practice Problems Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,

More information

235 Final exam review questions

235 Final exam review questions 5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors Definition 0 Let A R n n be an n n real matrix A number λ R is a real eigenvalue of A if there exists a nonzero vector v R n such that A v = λ v The vector v is called an eigenvector

More information

A supplement to Treil

A supplement to Treil A supplement to Treil JIH Version of: 13 April 2016 Throughout we use Treil to identify our text notes: Sergei Treil, Linear Algebra Done Wrong (9/7/2015 version), https://www.math.brown.edu/ treil/papers/ladw/book.pdf

More information

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].

c i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4]. Lecture Notes: Rank of a Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Linear Independence Definition 1. Let r 1, r 2,..., r m

More information