# ( ) which must be a vector

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 satisfied: (i) T(c u ) = (ii) It is equivalent to say that in R n. c T( u ), for all scalars c and all vectors T( u + v ) = T( u ) + T( v ), for all u, v in R n. T(c u + v ) = u in R n ; c T( u + v ) for all scalars c and all vectors In order to define such a transformation T, we must describe its action on a point ( x 1,..., x n ) in R n. That is, we must define T (x 1,..., x n ) in R m having m coordinates. u, ( ) which must be a vector v In order for T to be linear, each coordinate in R m must be a linear combination of x 1,..., x n. That is, T must have the functional form T ((x 1,..., x n )) = ( a 11 x 1 + a 12 x a 1n x n, a 21 x 1 + a 22 x a 2n x n,..., a m1 x 1 + a m2 x a mn x n ) Example 1. Let T : R 3 R 4 be defined by )) = (2 x 1 2 x x 3, x 1 + x 2 x 3, x x 2, 4 x 1 6 x x 3 ). Is T linear? What is T ((1, 2, 3) )? Each of the four coordinates in the range is a linear combination of the three variables x 1 from the domain; thus, T is a linear transformation. Also, ( ) = ( , , 1 + 8, ) = (7,, 9, 7). T (1, 2, 3) Example 2. Let T : R 3 R 2 be defined by )) = ( sin x 1 + cos x 2 + 4x 3, x 1 + x 2 + x ). Neither coordinate in the range is a linear combination of the domain variables x 1, x 2 ; thus, T is not a linear transformation (although T is still a function). Note: Throughout we shall let n be the zero vector in R n and let m be the zero vector in R m. Then T( n ) = T( n + n ) = T( n ) + T( n ) in R m. By subtracting T( n ) from both sides, we see that m = T( n ). So it is always the case that T( n ) = m with a linear transformation.

2 The Matrix Representation Every linear transformation T : R n R m can be represented by a unique m n matrix A. The m rows are the coefficients from the linear combinations of the function form coordinates in R m. That is, suppose T : R n R m is defined by T ((x 1,..., x n )) = ( a 11 x 1 + a 12 x a 1n x n, a 21 x 1 + a 22 x a 2n x n,..., a m1 x 1 + a m2 x a mn x n ), a 11 a a 1n a 21 a a 2n then A = a m1 a m2... a m n If we let x = ( can write X = x 1,..., x n ) R n, then we x 1 x 2.. as an n 1 matrix.. x n The function value T ((x 1,..., x n )) then can be computed by the matrix product A X which gives an m 1 matrix that is the function value point in R m. We therefore interchangeably write T( x ) = A X. Example 3. Let T : R 3 R 4 be defined by )) = (2 x 1 2 x x 3, x 1 + x 2 x 3, x x 2, 4 x 1 6 x x 3 ) The matrix representation is the 4 3 matrix A =. How do we evaluate T ((1, 2, 3) )? Let X = (7,, 9, 7) as coordinates in R 4., then T ( (1, 2, 3) ) = A X = = = What is the action of T on the standard basis in R 3?

3 We see that 1 4 = , and = 1, and Dr. Neal, WKU = Thus, the columns of A are simply the action of T on the standard basis elements (1,, ), (, 1, ), and (, 1). Therefore, each of the columns of A are actually elements in the range of T. A Matrix Defines a Linear Transformation Reversing the process, we see that any m n matrix A defines a linear transformation T A : R n R m by x 1 x 2. T A (x) = A X, where x = ( x 1,..., x n ) and X =... x n For example, given the 2 3 matrix A =, then T A : R 3 R 2 is defined by x )) = x x 3 3x 1 2x 2 + 8x 3 = 4x 1 + 6x 2 3x 3 = (3x 1 2x 2 + 8x 3, 4x 1 + 6x 2 3x 3 ). Defining T by Action on the Standard Basis A linear transformation T : R n R m can also be defined by its action on the standard basis. Let e 1 = (1,,..., ), e 2 = (, 1,..., ),..., e n = (,,..., 1). If we know what T does to each basis element, then we can evaluate T at any point. Because T is linear, we have T (x 1,..., x n ) ( ) = T x 1 e 1 + x 2 e x n e n ( ) = x 1 T( e 1 ) + x 2 T( e 2 ) x n T( e n ). Also, once we know the action on the standard basis, then we also know the columns of the matrix representation A ; thus, we can easily evaluate T at any point.

4 Example 4. Evaluate T (( 2, 3, 8, 1) ) for T : R 4 R 3 defined by ( ) = ( 1, 2, 3) T ((, 1,, ) ) = (2, 1, 4) ( ) = (1, 2, 4) T ((,,, 1) ) = ( 2,, 6). T (1,,, ) T (,, 1, ) Solution. Because T is linear, we have T (( 2, 3, 8, 1) ) = 2 T ((1,,, ) ) + 3 T ((, 1,, ) ) + 8 T ((,, 1, ) ) 1 T ((,,, 1) ) Or we can write A = = 2 ( 1, 2, 3) + 3 (2, 1, 4) + 8 (1, 2, 4) 1 ( 2,, 6) = (36, 9, 1). the st. basis. Then T (( 2, 3, 8, 1) ) = , where the columns of A are the action on = 8 9 = (36, 9, 1) One-to-One Transformations Let T : R n R m be a linear transformation. Then T is one-to-one (or injective) if it is always the case that different values in the domain are assigned to different values in the range. That is, whenever u v then T( u ) T( v ). By the contrapositive, it is logically equivalent to say that whenever T( u ) = T( v ), then u = v. To prove that a function is one-to-one, we often assume that T( u ) = T( v ) and then argue that u must equal v. With a linear transformation T from R n to R m, we can use the following results to check if T is one-to-one: Theorem 2.1. Let T : R n R m be a linear transformation with matrix representation A. Then T is one-to-one if and only if T( z ) = m has only the trivial solution of z = n. Proof. We know that T( n ) = m for any linear transformation. Suppose first that T is one-to-one. If T( z ) = m also, then z = n because T is one-to-one. Now suppose that z = n is the only solution of T( z ) = m. To prove that T is oneto-one, assume that T( x ) = T( y ). Then m = T( x ) T( y ) = T( x y ) which means that x y = n. Hence, x = y and T is one-to-one. QED Note: Using matrix equations, Theorem 2.1 is equivalent to saying that T is one-to-one if and only if the homogeneous system A X = has only the trivial solution of X =.

5 Theorem 2.2. Let T : R n R m be a linear transformation with matrix representation A. If m < n, then T cannot be one-to-one. Proof. Note: Because R n is a larger set than R m when m < n, it should not be possible to map R n to R m in a one-to-one fashion. To prove the result, observe that the matrix representation A will be an m n matrix with fewer rows than columns. Thus the last (non-zero) row of the reduced row echelon form of the homogeneous system A will have independent (or free) variables. Hence A X = will have infinite solutions (not just the trivial solution). By Theorem 1, T cannot be one-to-one c n.. Theorem 2.3. Let T : R n R m be a linear transformation with matrix representation A. Assume m > n. Then T is one-to-one if and only if the reduced row echelon form of A reduces to the n n identity with additional rows that are all. Proof. To determine if T is one-to-one, we must see if the homogeneous system A X = has only the trivial solution. We consider the reduced row echelon form of the m n matrix A. Because there are more rows than columns, we have two cases: the n n identity with additional rows that are all 1... c c n free variables remain in the last non-zero row In the first case, A X = has only the trivial solution; thus, T is one-to-one. In the second case, A X = has infinite solutions; thus, T is not one-to-one. Theorem 2.4. Let T : R n R n be a linear transformation with matrix representation A. Then T is one-to-one if and only if det (A). Proof. Because A is now n n, we can say det (A) if and only if the homogeneous system A X = has only the trivial solution if and only if T is one-to-one.

6 Example 5. Let T : R 3 R 4 be defined by )) = (2 x 1 2 x x 3, x 1 + x 2 x 3, x x 2, 4 x 1 6 x x 3 ). Is T one-to-one? Solution. We let A be the matrix representation and look at the reduced row echelon form of homogeneous system A : rref The only solution to A X = is X = ; thus, T is one-to-one. ( A reduces to the identity with an additional row of 's.) Example 6. Let T : R 4 R 5 be defined by Is T is one-to-one? ( ) = ( 1, 2, 3,, 1) T ((, 1,, ) ) = (2, 1, 4, 1, ) ( ) = (1, 2, 4,, 2) T ((,,, 1) ) = (2, 6, 3, 2, 5). T (1,,, ) T (,, 1, ) Solution. We look at the reduced row echelon form of homogeneous system A : rref We see that A X = has infinitely many solutions; thus, T is not one-to-one. (Matrix A does not reduce to the identity with additional rows of.) Example 7. Let T : R 2 R 2 be the reflection about the x -axis. Is T one-to-one? 1 Solution. We define T by T ((x, y) ) = (x, y). The matrix representation is A = 1 (which are the coefficients from the linear combinations of the function form coordinates). Because det (A) = 1, we see that T is one-to-one.

7 Onto Transformations Let T : R n R m be a linear transformation. Then T is onto (or surjective) if every vector b R m has a pre-image in R n. That is, for every b R m there is a vector v R n such that T( v ) = b. (The vector v is a pre-image of b.) That is, the equation T( x ) = b always has a solution for every b R m. We can use the following results to determine if a linear transformation is onto: Theorem 2.5. Let T : R n R m be a linear transformation with matrix representation A. Then T is onto if and only if the matrix equation A X = B always has a solution for every m 1 matrix B. Proof. Because the equation T( x ) = b is equivalent to the matrix equation A X = B, the theorem is simply a matrix form re-statement of the definition of onto. Theorem 2.6. Let T : R n R m be a linear transformation with matrix representation A. If m > n, then T cannot be onto. Proof. Note: Because R m is a larger set than R n when m > n, it should not be possible for every element in R m to have a pre-image by means of the function T. To prove the result, observe that the matrix representation A will be an m n matrix with more rows than columns. Thus the reduced row echelon form of any system A B will have the additional rows in A become all. These rows will lead to inconsistencies for certain m 1 matrices B. Thus A X = B will not always have a solution and T cannot be onto c 1 c 2.. c m Theorem 2.7. Let T : R n R m be a linear transformation with matrix representation A. Assume m < n. Then T is onto if and only if the reduced row echelon form of A does not contain a row of all 's. Proof. To determine if T is onto, we must see if every possible system A X = B has a solution. We consider the reduced row echelon form of the m n matrix A. Because there are fewer rows than columns, we have two cases:

8 no rows become all a row becomes all If no rows become all, then there will never be an inconsistency. So A X = B will always have a solution and T is onto. If a row becomes all, then there will be inconsistencies for some B when trying to solve A X = B. Thus at times A X = B will have no solution and T will not be onto. Theorem 2.8. Let T : R n R n be a linear transformation with matrix representation A. Then T is onto if and only if det (A). Proof. Because A is now n n, we can say det (A) if and only if any system A X = B always has a solution if and only if T is onto. Theorem 2.9. Let T : R n R n be a linear transformation. Then T is either both one-toone and onto (i.e., a bijection), or T is neither one-to-one nor onto. Proof. Let A be the matrix representation of T. By Theorems 4 and 8, T is one-to-one if and only if det (A) if and only if T is onto. Thus T is one-to-one if and only if T is onto. That is, T is either both one-to-one and onto, or T is neither one-to-one nor onto. Example 8. Let T A : R 4 R 3 be defined by the matrix representation A = where T A (x) = A X. Is T A one-to-one and/or onto? Is the point (4, 2, 6) in the range of T A? If so, find a pre-image. Solution. Because R 3 is a smaller set than R 4, T A cannot be one-to-one (Theorem 2). To determine if T A is onto, we consider the reduced row echelon form of A :

9 Because no rows became all, there will never be an inconsistency. So every system A X = B will have a solution; therefore, T A is onto. Now we can say that for any vector b R 3, there is a pre-image v R 4 such that T( v ) = b. (In fact we can see from rref( A ) that there will be infinite pre-images, which also verifies that T A is not one-to-one.) In particular, we can solve the equation T A ( x ) = (4, 2, 6): x 1 = t rref x 2 = t x 3 = t x 4 = t If t =, then ( 4.8, 3.6, 4.4, ) is one particular pre-image of (4, 2, 6). That is, T ( 4.8, 3.6, 4.4, ) ( ) = (4, 2, 6). Example 9. Let T : R 3 R 4 be the embedding map which places a point from R 3 into R 4 by adding a in the 4th coordinate. Is T one-to-one and/or onto? ( ) = (x, y, z, ). The matrix representation is Solution. Here we can define T by T (x, y, z) 1 1 the 4 3 matrix A =. We see that A is already in rref form and has a row of 1 all 's. By Theorem 7, T is not onto. (In particular, every element in R 4 with a non-zero 4th coordinate will cause an inconsistency; thus, these elements will not be in the range.) However, the homogeneous system A X = has only the trivial solution of X = ; thus, T is one-to-one. Inverses of Transformations from R n to R n When a linear transformation T : R n R n is both one-to-one and onto, then we can find the inverse transformation T 1 : R n R n such that if T (x 1,..., x n ) ( ) = ( (y 1, y 2,..., y n ), then T 1 (y 1, y 2,..., y n ) x 1,..., x n ). ( ) = If A is the matrix representation of the one-to-one and onto T, then we know that det (A). Therefore A 1 exists. Because T (x 1,..., x n ) ( ) = (y 1, y 2,..., y n ) is equivalent to A X = Y, we can apply the matrix inverse and say that X = A 1 Y. Thus, A 1 must ( ). be the matrix representation of T 1 because ( x 1,..., x n ) = T 1 (y 1, y 2,..., y n )

10 Example 1. Let T : R 3 R 3 be defined by Dr. Neal, WKU T ((1,, ) ) = (1,, 1) T ((, 1, ) ) = (2, 1, 2) T ((,, 1) ) = (1, 1, 4) Verify that T is a bijection. Find the function form of T Solution. The matrix representation of T is A = 1 1 and det (A) = 1 ; thus T is both one-to-one and onto (i.e., a bijection). The matrix representation of T 1 is A 1 = Thus, T 1 ((x, y, z) ) = (2x 6y + z, x + 5y z, x 4y + z). Note: T 1 ((1,, 1) ) = (1,, ), T 1 ((2, 1, 2) ) = (, 1, ), and T 1 ((1, 1, 4) ) = (,, 1). Example 11. Let T : R 2 R 2 be the reflection about the x -axis. Find T 1. Solution. Here T ((x, y) ) = (x, y) and A = 1. Then A 1 = 1 1 also. So 1 ( ) = (x, y) = T ((x, y) ). In other words, T is its own inverse. If you reflect T 1 (x, y) about the x -axis, then you undo the process by reflecting back about the x -axis. Null Space and Nullity Let T: R n R m be a linear transformation, with m n matrix representation A. The null space (or kernel of T ) is the set of all vectors x R n such that T( x ) = m. We know that T( n ) = m. If T is one-to-one, then no other vector gets mapped to the origin; so the null space is simply { n }. But if T is not one-to-one, then AX = will have infinitely many solutions as will T( x ) = m. The set of all solutions to AX = is called the null space. The nullity is the dimension of this null space and is given by the number of independent parameters (r, s, t, etc.) used in writing the form of all solutions to AX =. And if T is one-to-one, then the nullity is simply.

11 Range and Rank Dr. Neal, WKU The range of T is the set of all vectors y R m for which T( x ) = y for some x R n. All of the columns in the matrix representation A are actually elements in the range of T. The first column in A is the value T((1,,,..., )), the second column in A is the value T((, 1,,..., )), etc. But some of these columns may be linear combinations of the previous columns. The columns in A that are independent of each other create the dimensions in the range of T. The actual range of T will be the collection of all linear combinations of these independent vectors, and the rank of T is the dimension of this range. Example 12. Let T : R 5 R 5 be defined by its action on the standard basis as T( e 1 ) = (1, 1, 2,, 1) T( e 4 ) = (1, 1, 2,, ) T( e 2 ) = (, 1, 1, 1, 1) T( e 5 ) = (1,, 1, 1, 1) T( e 3 ) = (, 1, 1, 1, 1) (a) Give the matrix representation and functional form of T. (b) Is T one-to-one and/or onto? (c) Are b = (1, 2, 3, 4, 5) and c = (4, 2, 6, 2, 5) in range of T? If so, find pre-images. (d) Find the null space and nullity. Give a basis for the null space. (e) Find the range and rank. Solution. (a) The columns of the matrix representation are the action on the standard basis elements. Thus, A = , x 4, x 5 )) = ( x 1 + x 4 + x 5, x 1 x 2 + x 3 + x 4, 2 x 1 x 2 + x x 4 + x 5, x 2 + x 3 x 5, x 1 + x 2 x 3 + x 5 ) (b) det (A) = ; thus, A is neither one-to-one nor onto (c) A B = rref For b = (1, 2, 3, 4, 5), we see that AX = B has no solution, so (1, 2, 3, 4, 5) is not in the range of T. However, there are infinite solutions for c = (4, 2, 6, 2, 5). One such solution is (3, 2,, 1, ). That is, c = (4, 2, 6, 2, 5) is in range of T and T ((3, 2,, 1, )) = (4, 2, 6, 2, 5)

12 (d) rref (A ) = 1 1 Dr. Neal, WKU The null space is all vectors of the form (x 1, x 4, x 5 ) = (, s t, s, t, t ) where s and t are any real numbers. It is 2-dimensional (using two variables), so nullity = 2. Letting (s, t) be (1, ) then (, 1), we obtain the two vectors v 1 = (, 1, 1,, ) and v 2 = (, 1,, 1, 1) Then any vector in the null space has the form sv 1 + t v 2, which is a linear combination of { v 1, v 2 }. So { v 1, v 2 } is then a basis for the null space. (e) From rref (A), we see that the original first, second, and fourth columns create the 3 3 identity in the rref. Thus, the range of T will have three dimensions T. Thus, rankt = 3 and the range of T is the collections of all linear combinations of the three vectors T( e 1 ) = (1, 1, 2,, 1), T( e 2 ) = (, 1, 1, 1, 1), and T( e 4 ) = (1, 1, 2,, ), which are the first, second, and fourth columns in the origianl matrix. In other words, if we look at just the original first, second, and fourth columns as vectors in R 5, then any vector in the range of T can be written as a linear combination of just these three vectors after rref is performed. For c = (4, 2, 6, 2, 5) as in Part (c), we have c = 3 T( e 1 ) + 2T( e 2 ) + 1T( e 4 ). Note: Another way to label all linear combinations of a collection of vectors is to simply call it the span of these vectors. In the preceding example, the null space is span { v 1, v 2 } and the range is span{ T( e 1 ), T( e 2 ), T( e 4 )}. Here is a description of the preceding transformtation: Let Domain: R 5 (5 dimensions) span{ e 1, e 2, e 4 } e 1 = (1,,,, ), Two-dimensional Null Space span { v 1, v 2 } T : R 5 R 5 e 2 = (,1,,, ), T e 4 = (,,,1, ). Range: A Three Dimensional Subpace of R 5 span{ T is not onto: The range is 3-d; only three dimensions of R 5 have pre-images. T( e 1 ), T( e 2 ), {,,,, } T( e 4 )} T is not one-to-one: Two dimensions of R 5 all get mapped to {,,,, }.

13 MATH 37 Linear Transformations: Rn to Rn Exercises 1. Let T : R 3 R 3 be defined in functional form by )) = ( x 1 2 x x 3, 2 x 1 + x 2 + x 3, x 1 + x 2 ). (a) Write the matrix representation A. (b) Prove that T is both one-to-one and onto. (c) Evaluate T (( 4, 6, 1)). (d) Find a pre-image of the point ( 5, 3, 2); i.e., solve the equation )) = ( 5, 3, 2). (e) Give both the matrix representation and the functional form of T Let T : R 4 R 4 be defined by T ((1,,, )) = (1, 2, 3, 1) T ((, 1,, )) = (3, 6, 9, 3) T ((,, 1, )) = ( 2, 4, 1, 4) T ((,,, 1)) = (4, 8, 5, 8). (a) Write the matrix representation A. (b) Prove that T is neither one-to-one nor onto. (c) Evaluate T (( 4, 6, 1, 2)). (d) Determine if the points (5, 1, 8, 49) and (6, 4, 12, 2) are in the range of T, and if so find pre-images of these points. (e) Give the form of the null space and give the nullity of T. Also give a basis for the null space. (f) Describe the range of T and give the rank of T. (g) Explain how the domain is divided into subspaces and how these subspaces are mapped into R 4 via T.

14 MATH 37 Linear Transformations: Rn to Rm Exercises 1. Let T : R 6 R 4 be defined by, x 4, x 5, x 6 )) = ( x x x x 5 3 x 6, 3 x 1 7 x x 3 + x x 6, 2 x 1 5 x x x x 5 + x 6, 4 x 1 9 x x 3 4 x 4 4 x x 6 ) (a) Give the matrix representation of T. (b) Determine and explain whether or not T is onto. (c) Describe the range of T and give the rank of T. (d) Determine and explain whether or not T is one-to-one. (e) Give the form of the null space and give the nullity of T. Also give a basis for the null space. (f) Explain how the domain is divided into two subspaces and how these subspaces are mapped into R 4 via T. 2. Let T : R 5 R 3 defined by matrix representation A = (a) Give the function form of T. (b) Determine and explain whether or not T is onto. (c) Describe the range of T and give the rank of T. (d) Determine if (3, 2, 1) is in the range of T. If so, give a pre-image. (e) Determine and explain whether or not T is one-to-one. (f) Give the form of the null space and give the nullity of T. Also give a basis for the null space. 3. Let T : R 3 R 4 be defined by T ((1,, )) = (3, 1,, 1) T ((, 1, )) = (1, 2, 1, 1) T ((,, 1)) = ( 1,, 2, 1) (a) Give the matrix representation of T. (b) Evaluate T ((1, 2, 3) ). (c) Determine and explain whether or not T is onto. (d) Describe the range of T and give the rank of T. (e) Determine if (1,,, ) is in the range of T. If so, give a pre-image. (f) Determine and explain whether or not T is one-to-one. (g) Give the form of the null space and give the nullity of T. Also give a basis for the null space.

### Methods for Finding Bases

Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,

### NOTES 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

### MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

### MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

### Mathematics 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

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### Basic Terminology for Systems of Equations in a Nutshell. E. L. Lady. 3x 1 7x 2 +4x 3 =0 5x 1 +8x 2 12x 3 =0.

Basic Terminology for Systems of Equations in a Nutshell E L Lady A system of linear equations is something like the following: x 7x +4x =0 5x +8x x = Note that the number of equations is not required

### LINEAR 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,

### Solutions to Linear Algebra Practice Problems 1. form (because the leading 1 in the third row is not to the right of the

Solutions to Linear Algebra Practice Problems. Determine which of the following augmented matrices are in row echelon from, row reduced echelon form or neither. Also determine which variables are free

### 4.1 VECTOR SPACES AND SUBSPACES

4.1 VECTOR SPACES AND SUBSPACES What is a vector space? (pg 229) A vector space is a nonempty set, V, of vectors together with two operations; addition and scalar multiplication which satisfies the following

### MA 242 LINEAR ALGEBRA C1, Solutions to Second Midterm Exam

MA 4 LINEAR ALGEBRA C, Solutions to Second Midterm Exam Prof. Nikola Popovic, November 9, 6, 9:3am - :5am Problem (5 points). Let the matrix A be given by 5 6 5 4 5 (a) Find the inverse A of A, if it exists.

### Math 54. Selected Solutions for Week Is u in the plane in R 3 spanned by the columns

Math 5. Selected Solutions for Week 2 Section. (Page 2). Let u = and A = 5 2 6. Is u in the plane in R spanned by the columns of A? (See the figure omitted].) Why or why not? First of all, the plane in

### MATRIX 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

### MATRIX 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 +

### MATH1231 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

### 2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

### Solutions to Math 51 First Exam January 29, 2015

Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Name: 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

### 160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results

### MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

### T ( 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)

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

### Sec 4.1 Vector Spaces and Subspaces

Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common

### 4.6 Null Space, Column Space, Row Space

NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear

### Linearly 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

### APPLICATIONS OF MATRICES. Adj A is nothing but the transpose of the co-factor matrix [A ij ] of A.

APPLICATIONS OF MATRICES ADJOINT: Let A = [a ij ] be a square matrix of order n. Let Aij be the co-factor of a ij. Then the n th order matrix [A ij ] T is called the adjoint of A. It is denoted by adj

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### 1 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

### MAT 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

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### x + 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

### Row Echelon Form and Reduced Row Echelon Form

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

### B such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix

Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.

### MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

### Linear Equations in Linear Algebra

1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero

### 4 Solving Systems of Equations by Reducing Matrices

Math 15 Sec S0601/S060 4 Solving Systems of Equations by Reducing Matrices 4.1 Introduction One of the main applications of matrix methods is the solution of systems of linear equations. Consider for example

### Recall 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

### Solving Systems of Linear Equations; Row Reduction

Harvey Mudd College Math Tutorial: Solving Systems of Linear Equations; Row Reduction Systems of linear equations arise in all sorts of applications in many different fields of study The method reviewed

### Reduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:

Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in

### 1 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

### MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3

MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................

### Lecture Notes 2: Matrices as Systems of Linear Equations

2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### by 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

### Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true

### Orthogonal 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

### Math 215 HW #6 Solutions

Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T

### is in plane V. However, it may be more convenient to introduce a plane coordinate system in V.

.4 COORDINATES EXAMPLE Let V be the plane in R with equation x +2x 2 +x 0, a two-dimensional subspace of R. We can describe a vector in this plane by its spatial (D)coordinates; for example, vector x 5

### Lecture 23: The Inverse of a Matrix

Lecture 23: The Inverse of a Matrix Winfried Just, Ohio University March 9, 2016 The definition of the matrix inverse Let A be an n n square matrix. The inverse of A is an n n matrix A 1 such that A 1

### Elementary Row Operations and Matrix Multiplication

Contents 1 Elementary Row Operations and Matrix Multiplication 1.1 Theorem (Row Operations using Matrix Multiplication) 2 Inverses of Elementary Row Operation Matrices 2.1 Theorem (Inverses of Elementary

### α = 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

### Section 1.7 22 Continued

Section 1.5 23 A homogeneous equation is always consistent. TRUE - The trivial solution is always a solution. The equation Ax = 0 gives an explicit descriptions of its solution set. FALSE - The equation

### Vector Spaces II: Finite Dimensional Linear Algebra 1

John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition

### Determinants. Dr. Doreen De Leon Math 152, Fall 2015

Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.

DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms

### Section 8.2 Solving a System of Equations Using Matrices (Guassian Elimination)

Section 8. Solving a System of Equations Using Matrices (Guassian Elimination) x + y + z = x y + 4z = x 4y + z = System of Equations x 4 y = 4 z A System in matrix form x A x = b b 4 4 Augmented Matrix

### Math Practice Problems for Test 1

Math 290 - Practice Problems for Test 1 UNSUBSTANTIATED ANSWERS MAY NOT RECEIVE CREDIT. 3 4 5 1. Let c 1 and c 2 be the columns of A 5 2 and b 1. Show that b Span{c 1, c 2 } by 6 6 6 writing b as a linear

### Solution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.

Solutions to Math 30 Take-home prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)

### Inverses and powers: Rules of Matrix Arithmetic

Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3

### Lecture 21: The Inverse of a Matrix

Lecture 21: The Inverse of a Matrix Winfried Just, Ohio University October 16, 2015 Review: Our chemical reaction system Recall our chemical reaction system A + 2B 2C A + B D A + 2C 2D B + D 2C If we write

### MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

### Matrix 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

### Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that

0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c

### Subspaces of R n LECTURE 7. 1. Subspaces

LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r

### 4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows

### 1 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

### MATH10212 Linear Algebra B Homework 7

MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments

### Lecture 14: Section 3.3

Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in

### Lecture Note on Linear Algebra 15. Dimension and Rank

Lecture Note on Linear Algebra 15. Dimension and Rank Wei-Shi Zheng, wszheng@ieee.org, 211 November 1, 211 1 What Do You Learn from This Note We still observe the unit vectors we have introduced in Chapter

### MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An m-by-n matrix is a rectangular array of numbers that has m rows and n columns: a 11

### ISOMETRIES 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

### SYSTEMS OF EQUATIONS

SYSTEMS OF EQUATIONS 1. Examples of systems of equations Here are some examples of systems of equations. Each system has a number of equations and a number (not necessarily the same) of variables for which

### Systems of Linear Equations

A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Systems of Linear Equations Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC

### Math 333 - Practice Exam 2 with Some Solutions

Math 333 - Practice Exam 2 with Some Solutions (Note that the exam will NOT be this long) Definitions (0 points) Let T : V W be a transformation Let A be a square matrix (a) Define T is linear (b) Define

### Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232

Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232 In mathematics, there are many different fields of study, including calculus, geometry, algebra and others. Mathematics has been

### 8 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

### 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

### MATH 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

### Topic 1: Matrices and Systems of Linear Equations.

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

### Orthogonal Projections and Orthonormal Bases

CS 3, HANDOUT -A, 3 November 04 (adjusted on 7 November 04) Orthogonal Projections and Orthonormal Bases (continuation of Handout 07 of 6 September 04) Definition (Orthogonality, length, unit vectors).

### Math 240: Linear Systems and Rank of a Matrix

Math 240: Linear Systems and Rank of a Matrix Ryan Blair University of Pennsylvania Thursday January 20, 2011 Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011

### MATH 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

### Vector Spaces 4.4 Spanning and Independence

Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### BANACH 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

### 4: 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:

### 1 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

### Lecture 10: Invertible matrices. Finding the inverse of a matrix

Lecture 10: Invertible matrices. Finding the inverse of a matrix Danny W. Crytser April 11, 2014 Today s lecture Today we will Today s lecture Today we will 1 Single out a class of especially nice matrices

### Linear Algebra Notes

Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### University 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

### a 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

### Linear 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