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


 Edgar Boone
 5 years ago
 Views:
Transcription
1 MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations Linear Equations and Linear Systems Solutions and Solution Sets Elementary Row Operations, Forward and Backward Pass Existence and Uniqueness Geometric Interpretations Row Reductions and Echelon Forms Echelon Form and Reduced Echelon Form Pivot Positions, Pivot Columns and Pivots Basic and Free Variables; Solutions to Linear Systems Vectors and Vector Equations Vectors in mdimensional Space Vector Sum, Scalar Product, and Linear Combinations of Vectors Linear Combinations and Spans Vector Equations, Spans and Solution Sets Matrix Equations and Solution Sets Coefficient Matrix and MatrixVector Product Matrix Equation, Span and Consistency Solution Sets and Homogeneous Systems Solution Sets and Nonhomogeneous Systems Linearly Independent and Linearly Dependent Sets Linear and Matrix Transformations
2 .6. Transformations, Images and PreImages OneToOne and Onto Transformations Linear Transformations Linear and Matrix Transformations
3 MATH0 Notebook This notebook is concerned with introductory linear algebra concepts. The notes correspond to material in Chapter of the Lay textbook.. Solving Systems of Linear Equations In linear algebra we study linear equations and systems of linear equations. Linear algebra methods are used to solve problems in areas as diverse as ecology (e.g. population projections), economics (e.g. inputoutput analysis), engineering (e.g. analysis of air flow), and computer graphics (e.g. perspective drawing). Further, linear methods are fundamental in statistical analysis of multivariate data... Linear Equations and Linear Systems A linear equation in the 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 b are constants. A system of linear equations in the variables x, x,..., x n is a collection of one or more linear equations in these variables. For example, x x + x 3 = 0 x 8x 3 = 8 4x +5x +9x 3 = 9 is a system of 3 linear equations in the 3 unknowns x, x, x 3 (a 3by3 system )... Solutions and Solution Sets A solution of a linear system is a list (s, s,..., s n ) of numbers that makes each equation in the system true when s i is substituted for x i for i =,,..., n. The list (9, 6, 3) is a solution to the system above. To check this, note that (9) (6) + (3) = 0 (6) 8(3) = 8 4(9) +5(6) +9(3) = 9 The solution set of a linear system is the collection of all possible solutions of the system. For the example above, (9, 6, 3) is the unique solution. Two linear systems are equivalent if each has the same solution set. 3
4 ..3 Elementary Row Operations, Forward and Backward Pass The strategy for solving a linear system is to replace the system with an equivalent one that is easier to solve. The equivalent system is obtained using elementary row operations:. (Replacement) Add to one row a multiple of another,. (Interchange) Interchange two rows, 3. (Scaling) Multiply all entries in a row by a nonzero constant, where each row corresponds to an equation in the system. Example. We work out the strategy using the 3by3 system given above, where a 3by4 augmented matrix of the coefficients and right hand side values follows our progress toward a solution. R : x x + x 3 = 0 0 () R : x 8x 3 = R 3 : 4x +5x +9x 3 = () (3) (4) (5) (6) R : R : R 3 + 4R : R : R : R 3 : R : R : R 3 + 3R : R R 3 : R + 4R 3 : R 3 : R + R : R : R 3 : x x + x 3 = 0 x 8x 3 = 8 3x +3x 3 = 9 x x + x 3 = 0 x 4x 3 = 4 3x +3x 3 = 9 x x + x 3 = 0 x 4x 3 = 4 x 3 = 3 x x = 3 x = 6 x 3 = 3 x = 9 x = 6 x 3 = 3 Thus, the solution is x = 9, x = 6, and x 3 = Forward and backward phases. In the forward phase of the row reduction process (systems () through (4)), R is used to eliminate x from R and R 3 ; then R is used to eliminate x from R 3. In the backward phase of the row reduction process (systems (5) and (6)), R 3 is used to eliminate x 3 from R and R ; then R is used to eliminate x from R. 4
5 ..4 Existence and Uniqueness Two fundamental questions about linear systems are:. Does a solution exist?. If a solution exists, is it unique? If a linear system has one or more solutions, then it is said to be consistent; otherwise, it is said to be inconsistent. A linear system can be inconsistent, or have a unique solution, or have infinitely many solutions. Note that in the example above, we knew that the system was consistent once we reached equivalent system (4); the remaining steps allowed us to find the unique solution. Example. The following 3by3 linear system has an infinite number of solutions: x +4x +x 3 = 6 3x +7x +x 3 = 9 4x x = 5 To demonstrate this, consider the sequence of equivalent augmented matrices: The last matrix corresponds to x + 3x 3 =, x x 3 = 5, and 0 = 0. Thus, ( 3x 3, 5 + x 3, x 3 ) is a solution for any value of x 3. Footnote on Example : The elementary row operations used in this example were R R R 3 5
6 Example 3. The following 3by3 linear system is inconsistent: 3x 6x 3 = 8 x x +3x 3 = 5x 7x +9x 3 = 0 To demonstrate this, consider the sequence of equivalent augmented matrices: The last matrix corresponds to x x + 3x 3 =, 3x 6x 3 = 8, and 0 = 3. Since 0 3, the system has no solution. Footnote on Example 3: The elementary row operations used in this example were R R R 3 Example 4. The following 3by4 system has an infinite number of solutions: x + x x 3 = 9 x +x 3x 3 4x 4 = 9 3x x x +x 3 3x 4 = 3 To demonstrate this, consider the sequence of equivalent augmented matrices: The last matrix corresponds to x + 3x 4 = 5, x x 4 = 8, and x 3 + x 4 = 4. Thus, (5 3x 4, 8 + x 4, 4 x 4, x 4 ) is a solution for any value of x 4. Footnote on Example 4: The elementary row operations used in this example were R R R 3 6
7 Example 5. The following 3by system is inconsistent: x +4x = 6 3x 5x = 44 3x x = 55 To demonstrate this, consider the sequence of equivalent augmented matrices: The last matrix corresponds to x + x = 3, x = 5, and 0 = 4. Since 0 4, the system has no solution. Footnote on Example 5: The elementary row operations used in this example were R R R 3..5 Geometric Interpretations Linear equations in two variables correspond to lines in the plane. Linear equations in three variables correspond to planes in 3space. Thus, solution sets for mby and mby3 systems have natural geometric interpretations. Example 6. Consider the following three by systems: () x + x = 5 x x = 0 () x +x = 3 x 4x = 8 (3) x + x = 3 x x = 6. System () has the unique solution (.5,.5), the point of intersection of the lines.. System () is inconsistent; the lines are unequal and parallel. 3. System (3) has an infinite number of solutions: (3 x, x ) for any value of x, since the two equations graph to the same line. 7
8 Example, revisited. Each pair of planes intersect in a line. The lines are quite close in 3space. In addition, the three planes have a single point of intersection, (9, 6, 3).. Row Reductions and Echelon Forms.. Echelon Form and Reduced Echelon Form A matrix is in (row) echelon form when. All nonzero rows are above any row of zeros.. Each leading entry (that is, leftmost nonzero entry) in a row is in a column to the right of the leading entries of the rows above it. 3. All entries in a column below a leading entry are zero. An echelon matrix is in reduced form when (in addition) 4. The leading entry in each nonzero row is. 5. Each leading is the only nonzero entry in its column. Example. The 6by matrix shown on the left below is in echelon form and the 6by matrix shown on the right is in reduced echelon form In the left matrix, the symbol represents a leading nonzero entry and the symbol represents any number (either zero or nonzero). In the right matrix, each leading entry has been converted to a, and each is the only nonzero entry in its column. 8
9 Starting with the augmented matrix of a system of linear equations, the forward phase of the row reduction process will produce a matrix in echelon form. Continuing the process through the backward phase, we get a reduced echelon form. The following theorem explains why reduced echelon form matrices are important. Theorem (Uniqueness Theorem). Each matrix is rowequivalent (that is, equivalent using elementary row operations) to one and only one reduced echelon form matrix. Further, we can read the solutions to the original system from the reduced echelon form of the augmented matrix... Pivot Positions, Pivot Columns and Pivots. A pivot position is a position of a leading entry in an echelon form matrix.. A column that contains a pivot position is called a pivot column. 3. A pivot is a nonzero number that either is used in a pivot position to create zeros or is changed into a leading, which in turn is used to create zeros. In general, there is no more than one pivot in any row and no more than one pivot in any column. Example, continued. In the left matrix in Example, each is located at a pivot position, and columns, 4, 5, 8, and 9 are pivot columns. Example. Consider the following 4by5 matrix We first interchange R and R 4 : Column is a pivot column, and the in the upper left corner is used to change values in rows and 3 to 0 (R + R replaces R ; R 3 + R replaces R 3 ):
10 Column is a pivot column. We could interchange any of the remaining three rows to identify a pivot, but will just use the in the current second row to change values in rows 3 and 4 to 0 (R 3 5 R replaces R 3 ; R R replaces R 4 ): Column 3 is not a pivot column. Column 4 is a pivot column, revealed after we we interchange R 3 and R 4 : The matrix is now in echelon form. Columns,, and 4 are pivot columns. Working with rows 3 and (in that order) to clear columns 4 and, we get the following reduced echelon form matrix: Note that if the original matrix was the augmented matrix of a 4by4 system of linear equations in x, x, x 3, x 4, then the last matrix corresponds to the equivalent linear system x 3x 3 = 5, x + x 3 = 3, x 4 = 0, 0 = 0. Thus, (5 + 3x 3, 3 x 3, x 3, 0) is a solution for any value of x 3. Footnote on Example : The last elementary row operations were: R R R 3 R 4 0
11 Example 3. Consider the following 3by6 matrix: We first interchange R and R 3 : Column is a pivot column and we use the 3 in the upper left corner to convert the 3 in row to 0 (R R replaces R ). In addition, R is replaced by 3 R for simplicity: Column is a pivot column. We could use the current row, or interchange the second and third rows and use the new row two for pivot. For simplicity, we use the in the second row to convert the 3 in the third row to a zero (R 3 3 R replaces R 3 ). In addition, R is replaced by R for simplicity: This matrix is in echelon form; columns,, and 5 are pivot columns. Working with rows 3 and (in that order) to clear columns 5 and, we get the following reduced echelon form matrix: Note that if the original matrix was the augmented matrix of a 3by5 system of linear equations in x, x, x 3, x 4, x 5, then the last matrix corresponds to the equivalent linear system x x 3 + 3x 4 = 4, x x 3 + x 4 = 7, x 5 = 4. Thus, ( 4 + x 3 3x 4, 7 + x 3 x 4, x 3, x 4, 4) is a solution for any values of x 3, x 4. Footnote on Example 3: The last elementary row operations were: R R R 3
12 ..3 Basic and Free Variables; Solutions to Linear Systems When solving linear systems,. A basic variable is any variable that corresponds to a pivot column in the augmented matrix of the system, and a free variable is any nonbasic variable.. From the equivalent system produced using the reduced echelon form, we solve each equation for the basic variable in terms of the free variables (if any) in the equation. 3. If there is at least one free variable, then the original linear system has an infinite number of solutions. 4. If an echelon form of the augmented matrix has a row of the form [ b ] where b 0, then the system is inconsistent. (There is no need to continue to find the reduced echelon form.) Example, continued. For the 4by4 system in Example, the basic variables are, and the free variables are. Example 3, continued. For the 4by5 system in Example 3, the basic variables are, and the free variables are..3 Vectors and Vector Equations.3. Vectors in mdimensional Space In linear algebra, we let R m be the set of m matrices of real numbers, Further, v R m v =. v m v : v v i R, and we let v =. Rm be a specific element. v m. v is known as a column vector or simply a vector.. The value v i is the i th component of v. 3. The zero vector, O, is the vector all of whose components equal zero.
13 .3. Vector Sum, Scalar Product, and Linear Combinations of Vectors Suppose v, w R m and c, d R.. The vector sum v + w is the vector obtained by componentwise addition. That is, v + w is the vector whose i th component is v i + w i for each i.. The scalar product cv is the vector obtained by multiplying each component by c. That is, cv is the vector whose i th component is cv i for each i. 3. The vector cv + dw is known as a linear combination of the vectors v and w. [ ] [ ] Example in space. Let v = and v = be vectors in R. These vectors can be represented as points in the plane or as directed line segments whose initial point is the origin. In the plot, Vector v is represented as the directed line segment from (0, 0) to (, ), and points on y = x represent scalar multiples of v : cv, where c R. Vector v is represented as the directed line segment from (0, 0) to (, ), and points on y = x represent scalar multiples of v : dv, where d R Linear combinations of the two vectors, cv +dv, are in onetoone correspondence with R. The plot shows a grid of linear combinations where either c or d is an integer. Problem. Write w = [ ] 7 as a linear combination of v 5 and v. 3
14 Example in 3space. Let v = and v = The thick lines represent scalar multiples of the two vectors: cv for c R, and dv for d R. The plane shown represents the linear combinations of the two vectors: cv + dv, for c, d R. The grid represents the linear combinations where either c or d is an integer. Problem. Using v and v from above: be vectors in R 3. x (a) Suppose that y = cv + dv for some c, d R. Find an equation relating x, y, z. z (b) Can w = 3 be written as a linear combination of v and v? Why? 0 4
15 .3.3 Linear Combinations and Spans If v, v,..., v n R m and c, c,..., c n R, then w = c v + c v + + c n v n is a linear combination of the vectors v, v,..., v n. The span of the set {v, v,..., v n } is the collection of all linear combinations of the vectors v, v,..., v n : Span{v, v,..., v n } = {c v + c v + + c n v n : c i R for each i} R m. The span of a set of vectors always contains the zero vector O (let each c i = 0). For example, {[. Span ]} = { [ c ] } : c R corresponds to the line y = x in R. {[. Span ] [, ]} = { [ c ] [ + d R can be written as a linear combination of ] } : c, d R = R. That is, every vector in [ ] [ ] and. {[ 3. Span ] [, ] [ 7, 5 ]} = { [ c ] [ + d ] [ 7 + e 5 ] } : c, d, e R = R. That is, every vector in R can be written as a linear combination of the three listed vectors. (In fact, the first two vectors were already sufficient to represent each v R.) 4. Span, = c + d : c, d R corresponds to the plane with equation in R Span,, 4 0 = Span in the list is a linear combination of the first two., since the third vector 5
16 Exercise. Let v =, v = and v 3 = 3. Demonstrate that 0 Span{v, v, v 3 } = {cv + dv + ev 3 : c, d, e R} = R 3. That is, demonstrate that every vector in R 3 can be written as a linear combination of the three vectors v, v, v 3. 6
17 .3.4 Vector Equations, Spans and Solution Sets Consider an mbyn system of equations in variables x, x,..., x n, where each equation is of the form a i x + a i x + + a in x n = b i for i =,,..., m. Let a j be the vector of coefficients of x j, and b be the vector of right hand side values. The mbyn system can be rewritten as a vector equation: x a + x a + + x n a n = b. The system is consistent if and only if b Span{a, a,..., a n }. For example, the linear system on the left below becomes the vector equation on the right: x +5x 3x 3 = 4 x 4x + x 3 = 3 x 7x = = x + x + x 3 =. Problem. Starting with the vector equation x a + x a + x 3 a 3 = b shown on the right above, (a) Determine if the system is consistent. That is, determine if b Span {a, a, a 3 }. x (b) Suppose that y z = ca + da + ea 3 for some c, d, e. Find an equation relating x, y, z. 7
18 (c) Find the reduced echelon form of the matrix whose columns are the a i s: A = [ a a a 3 ]. (d) What do we know about the set Span{a, a, a 3 }? Be as complete as possible. 8
19 .4 Matrix Equations and Solution Sets As above, an mbyn system of linear equations, a i x + a i x + + a in x n = b i for i =,,..., m, leads to a vector equation, x a + x a + + x n a n = b, where a j is the vector of coefficients of x j, and b is the vector of right hand side values. Further, the system is consistent if and only if b Span{a,..., a n }..4. Coefficient Matrix and MatrixVector Product. The coefficient matrix A of an mbyn system of linear equations is the m n matrix whose columns are the a j s: A = [ a a a n ].. If A is an m n matrix and v R n, then the matrixvector product of A with v is defined to be the the following linear combination of the columns of A: v Av = [ ] v a a a n. = v a + v a + + v n a n. v n For example, if A = Av = 3 and v = , then 3 0 =. Rowcolumn definition. The definition of the matrixvector product as a linear combination of column vectors is equivalent to the usual rowcolumn definition of the product of two matrices. For example, (3) + 5( ) 3() Av = 4 = (3) 4( ) + () =. 7 0 (3) 7( ) + 0() Linearity property. The matrixvector product of a linear combination of k vectors in R n is equal to that linear combination of matrixvector products: A (c v + c v + + c k v k ) = c Av + c Av + + c k Av k for all c i R, v i R n. That is, multiplication by A distributes over addition and we can factor out constants. 9
20 .4. Matrix Equation, Span and Consistency Let A = [ a a a n ] be the coefficient matrix of an mbyn system of linear equations, x R n be the vector of unknowns, and b R m be the vector of right hand side values. Then. The matrix equation of the system is the equation Ax = b.. If Ax = b is consistent for all b, then the matrix A is said to span R m. For example, the linear equation on the left becomes the matrix equation Ax = b on the right: x +5x 3x 3 = x 4 x 4x + x 3 = 3 = 4 x = 3. x 7x = 7 0 x 3 Further, since the system is inconsistent, A does not span R 3. The following theorem gives criteria for determining when A spans R m. Theorem (Consistency Theorem). Let A = [ a a a n ] be an m n coefficient matrix, and x R n be a vector of unknowns. The following statements are equivalent: (a) The equation Ax = b has a solution for all b R m. (b) Each b R m is a linear combination of the coefficient vectors a j. (c) The columns of the matrix A span R m. That is, Span{a, a,..., a n } = R m. (d) A has a pivot position in each row. Problem. Let A = () Determine if Ax = b is consistent for all b R 3. () If it is not consistent for all b, find an equation characterizing when Ax = b is consistent. 0
21 Problem. Let A = 4 0. () Determine if Ax = b is consistent for all b R 3. () If it is not consistent for all b, find an equation characterizing when Ax = b is consistent. Problem 3. A matrix can have at most pivot position in any row or any column. What, if anything, does this fact tell you about determining consistency for all b when m < n, m = n, m > n? Be as complete as possible in your explanation.
22 .4.3 Solution Sets and Homogeneous Systems Let Ax = b be the matrix equation of an mbyn system of linear equations.. The solution set of the system is {x : Ax = b} R n. A solution set can be empty, contain one element or contain an infinite number of elements.. If b = O (the zero vector), then the system is said to be homogeneous. Homogeneous systems satisfy the following properties:. Every homogeneous system is consistent.. If v, v,..., v k are solutions to the homogeneous system and c, c,..., c k are constants, then the linear combination is also a solution to the system. w = c v + c v + + c k v k 3. The solution set of Ax = O can be written as the span of a certain set of vectors. Problem 4. Demonstrate the first two properties of homogeneous systems.
23 Writing the solution set of Ax=O as a span. The technique for writing the solution set of Ax = O is illustrated using the following example: Consider the homogeneous system x +5x 3x 3 = x 0 x 4x + x 3 = 0 = 4 x = 0. x 7x = x 3 0 Since x = 7x 3 x = x 3 x 3 free, we can write the solutions to the homogeneous system as vectors satisfying x = 7x x 3 = x 3 where x 3 is free. Thus, Span = c x 3 is the solution set of the homogeneous system above. 7 : c R Problem 5. In each case, write the solution set of Ax = O as a span of a set of vectors. (a) Let A =. 8 (b) Let A = [ 8 4 ]. 3
24 (c) Let A = Writing the solution set of Ax=O in parametric vector form. If the solution set to Ax = O is Span{v, v,..., v k }, then the solutions can be written in parametric vector form as follows: x = c v + c v c k v k, where c, c,..., c k R, and the c i s are the parameters in the general equation for the solution. For example, the parametric vector form for the solutions in Problem 5(b) is x = c, for c R (only one parameter is needed); and the parametric vector form for the solutions in Problem 5(c) is x = c + c, for c, c R (two parameters are needed). 4
25 .4.4 Solution Sets and Nonhomogeneous Systems A linear system is nonhomogeneous if it is not homogeneous. That is, a linear system is nonhomogeneous if its matrix equation is of the form Ax = b, where b O. Theorem (Solution Sets). Suppose the equation Ax = b is consistent and let p be a particular solution. Then the solution set of Ax = b is the set of all vectors of the form x = p + v h, where v h is a solution to Ax = O. That is, each solution can be written as the vector sum of a particular solution to the nonhomogeneous system and a solution to the homogeneous system with the same coefficient matrix. For example, let [ [ A b ] = [ x = ] and b = ] 6 x x we can write x = p + v h, where p = [ 0 4 ]. Since [ = ] + x [ and v h = x We can visualize the solution sets to both systems as follows: Solid Line: The solution to the homogeneous system is the solid line c 0, for some c. Dashed Line: The solution to the original nonhomogeneous system is the dashed line c, for some c. 0 ], where x is free, 0 for some x. (The solutions are written in parametric vector form, using c as the parameter.) x = 6 x x is free x 3 = Each point on the dashed line is obtained by adding p to a point on the solid line. The lines are parallel and lie on the plane x + y 3z = 0. Shift of a span. Since the set of solutions to Ax = O is the span of a set of vectors, the set of solutions to Ax = b can be described as the shift of a span, where each solution of the homogeneous system is shifted by the particular solution p. 5
26 Problem 6. Let A = and b = 8 4 Write the solutions to Ax = b in parametric vector form. (That is, write the solutions in the form x = p + v h, where p is a particular solution to the nonhomogeneous system and v h is a general solution to the homogeneous system with the same coefficient matrix.). 6
27 .5 Linearly Independent and Linearly Dependent Sets The set {v, v,..., v n } R m is said to be linearly independent when c v + c v + + c n v n = O only when each c j = 0. Otherwise, the set is said to be linearly dependent. Note that if A = [ ] v v v n is the matrix whose columns are the vj s, then {v, v,..., v n } is linearly independent Ax = O has the trivial solution only. Problem. In each case, determine if the set {v, v,..., v n } is linearly independent or linearly dependent. If the set is linearly dependent, then find a linear dependence relationship among the vectors (that is, find constants c j not all equal to zero so that c v c n v n = O) (a) Let {v, v, v 3 } =,, R (b) Let {v, v, v 3 } = 4, 8, 3 9 R
28 (c) Let {v, v, v 3 } = {[ ] [ [ 0,, R ] 6]}. Property of linear independence. The following theorem gives an important property of linearly independent sets. Theorem (Uniqueness Theorem). If {v, v,..., v n } R m is a linearly independent set and w Span{v, v,..., v n }, then w can be written uniquely as a linear combination of the v i s. That is, we can write w = c v + c v + + c n v n for a unique ordered list of scalars c, c,..., c n. Problem. Demonstrate that the uniqueness theorem is true. 8
29 Facts about linearly independent and linearly dependent sets include the following. If v i = O for some i, then the set {v, v,..., v n } is linearly dependent.. Suppose that v and v are nonzero vectors. Then the set {v, v } is linearly independent if and only if v cv for some c. 3. If m < n, then the set {v, v,..., v n } is linearly dependent. 4. Suppose n and each v i O. Then, the set is linearly dependent if and only if one vector in the set can be written as a linear combination of the others. 5. Let A be the m n matrix whose columns are the v j s: A = [ v v v n ]. Then, the set is linearly independent if and only if the homogeneous system Ax = O has the trivial solution only. 6. Let A be the m n matrix whose columns are the v j s: A = [ v v v n ]. Then, the set is linearly independent if and only if A has a pivot in every column. Problem. Which, if any, of the following sets are linearly independent? Why? 3 0 (a) 0 0, 5 0, 6, (b) 7,, 6, (c) 6, 0, (d) 4. 9
30 .6 Linear and Matrix Transformations.6. Transformations, Images and PreImages. A transformation T : R n R m is a function (or rule) that assigns to each x R n a value T (x) = b R m. Thus, The domain of T is all of nspace: Domain(T ) = R n. The range of T is a subset of mspace: Range(T ) = {T (x) : x R n } R m.. The value T (x) for a given x is also called its image. 3. Each x R n whose image is b R m is said to be a preimage of b. Note that images are unique, but preimages may not be unique. Problem. In each case, find the range of the transformation. That is, find Range(T ). ([ ]) [ ] (a) T : R R x x x with rule T =. x x (b) T : R R with rule T ([ x x ]) [ ] x + 6x =. x 3x 30
31 x (c) T : R 4 R 3 with rule T x x 3 + x 4 x 3 = x + x 4. x x + x + x 3 + x 4 4 (d) T : R 3 R 3 with rule T x x = 3x 3x. x 3 3x 3.6. OneToOne and Onto Transformations. The transformation T : R n R m is said to be onetoone if each b Range(T ) is the image of at most one x R n.. The transformation T : R n R m is said to be onto if Range(T ) = R m. Problem (a), continued. Is T : R R with rule T onto? Explain. ([ x x ]) = [ ] x x x onetoone and/or 3
32 Problem (b), continued. and/or onto? Explain. ([ ]) Is T : R R x with rule T x = [ ] x + 6x x 3x onetoone x Problem (c), continued. Is T : R 4 R 3 with rule T x x 3 + x 4 x 3 = x + x 4 onetoone x x + x + x 3 + x 4 4 and/or onto? Explain. Problem (d), continued. Is T : R 3 R 3 with rule T onto? Explain. x x x 3 = 3x 3x onetoone and/or 3x 3 3
33 .6.3 Linear Transformations T : R n R m is said to be a linear transformation if the following two conditions are satisfied:. T (cv) = ct (v) for c R and v R n, and. T (v + w) = T (v) + T (w) for v, w R n. The conditions for linear transformations lead to the following facts: Fact : If T is a linear transformation and w is a linear combination of v,v,..., v k, then T (w) is a linear combination of T (v ),T (v ),..., T (v k ). In symbols, w = c v + c v + + c k v k = T (w) = c T (v ) + c T (v ) + + c k T (v k ). Fact : If T is a linear transformation, then T maps the span of a set of vectors to the span of the set of images of the vectors. In symbols, ( ) T Span{v, v,..., v k } = Span{T (v ), T (v ),..., T (v k )}. Fact 3: If T (x) = Ax, for some m n matrix A, then T is a linear transformation. Problem. Which, if any, transformations from Problem are linear transformations? Explain. 33
34 Problem 3. Let T : R R be a linear transformation, and suppose that ([ ]) [ ] ([ ]) [ ] 4 3 T = and T =. 4 ([ (a) Find T 6 ]). (b) Find a general formula for T ([ x x ]). 34
35 .6.4 Linear and Matrix Transformations The following theorem says that every linear transformation can be written as a matrix transformation. Formally, Theorem (Matrix Transformations). If T : R n R m is a linear transformation, then the rule for T can be written as T (x) = Ax for a unique m n matrix A. The matrix A, known as the standard matrix of T, has an interesting form. Standard basis vectors and the standard matrix. Let T : R n R m be a linear transformation, and let e j R n be the vector whose j th component is and whose remaining components are 0, for j =,,..., n. Then. Each x R n can be written uniquely as a linear combination of the e j s: 0 0 x x 0 0 x =. = x 0 + x x. n 0 = x. e + x e x n e n... x n 0 0. Since T is a linear transformation, T (x) = x T (e ) + x T (e ) x n T (e n ) [ ] x = T (e ) T (e ) T (e n ) = Ax.. 3. Thus, the rule for T corresponds to matrix multiplication, where A is the matrix whose columns are the images of the e j s: A = [ T (e ) T (e ) T (e n ) ]. x x n The vectors e, e,..., e n are known as the standard basis vectors of R n. If we know the images of the standard basis vectors under the linear transformation T, then we know the standard matrix of T (and the formula for T in terms of the standard matrix). For example, if T : R R 3 is a linear transformation, T (e ) = 3 and T (e ) =, then A =
36 Problem 4. Suppose that T : R R is a linear transformation, [ [ 4 T (e + e ) = and T (e 3] e ) =. 0] Find T (e ), T (e ) and the standard matrix of T. Images of lines in the plane. lines to either lines or points. If T : R R is a linear transformation, then T maps Problem 5. Let T : R R be the transformation with rule [ ] 3 T (x) = x. Find an equation for the image of y = x
37 Problem 6. Let T : R R be the transformation with rule [ ] T (x) = x. 4 Find an equation for the image of y = x (or x = y) Onetoone and onto transformations, revisited. Recall that T : R n R m is said to be onetoone if each b Range(T ) is the image of at most one x R n and that T : R n R m is said to be onto if Range(T ) = R m. The following theorem relates these definitions to properties of the standard matrix of a linear transformation. Theorem (Linear Transformations). Let T : R n R m be the linear transformation with rule T (x) = Ax, where A is an m n matrix. Then. T is onto if and only if the columns of A span all of R m.. T is onetoone if and only if the columns of A form a linearly independent set. Aside : T is onto iff A has a pivot. Aside : T is onetoone iff A has a pivot. 37
38 Problem 7. Which, if any, of the following transformations are onetoone? Which, if any, are onto? Why? ([ ]) x x (a) T : R R 3 x with rule T = 3x x x 3x x (b) T : R 4 R 3 with rule T x x x 3 x 4 x 4x + 8x 3 + x 4 = x 8x 3 + 3x 4 5x 4 (c) T : R 3 R 3 with rule T x x x x = x + 3x + x 3 x 3 3x x + 4x 3 38
39 Footnote: Rotations in space. Recall that positive angles are measured counterclockwise from the positive xaxis, and negative angles are measured clockwise from the positive xaxis. The transformation that rotates points in the plane at an angle θ is a linear transformation. For example, the plot on the right shows the images of the standard basis vectors under the rotation through the positive angle θ = π/ Problem 8. Let T : R R be the rotation about the origin through angle θ. Find the standard matrix of T. Your answer should be in terms of sin(θ) and cos(θ). 39
40 Footnote: Rotations about the zaxis. Assume that positive angles are measured counterclockwise from the positive xaxis, and negative angles are measured clockwise from the positive xaxis, when looking down from the positive zaxis. The transformation that rotates points in 3space at angle θ around the zaxis is a linear transformation. For example, the plot on the right shows the images of the standard basis vectors under the rotation through the positive angle θ = π/5. Problem 9. Let T : R 3 R 3 be the rotation about the zaxis through angle θ. Find the standard matrix of T. Your answer should be in terms of sin(θ) and cos(θ). 40
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
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional 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 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationRow 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 inclass presentation
More informationSolving 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
More information1.5 SOLUTION SETS OF LINEAR SYSTEMS
12 CHAPTER 1 Linear Equations in Linear Algebra 1.5 SOLUTION SETS OF LINEAR SYSTEMS Many of the concepts and computations in linear algebra involve sets of vectors which are visualized geometrically as
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationMATH 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 ndimensional column
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
More informationMAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationSection 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
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.5 SOLUTION SETS OF LINEAR SYSTEMS HOMOGENEOUS LINEAR SYSTEMS A system of linear equations is said to be homogeneous if it can be written in the form A 0, where A
More informationSolving 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
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationLecture 1: Systems of Linear Equations
MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
More informationMAT 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
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationArithmetic and Algebra of Matrices
Arithmetic and Algebra of Matrices Math 572: Algebra for Middle School Teachers The University of Montana 1 The Real Numbers 2 Classroom Connection: Systems of Linear Equations 3 Rational Numbers 4 Irrational
More informationChapter 6. Linear Transformation. 6.1 Intro. to Linear Transformation
Chapter 6 Linear Transformation 6 Intro to Linear Transformation Homework: Textbook, 6 Ex, 5, 9,, 5,, 7, 9,5, 55, 57, 6(a,b), 6; page 7 In this section, we discuss linear transformations 89 9 CHAPTER
More informationSection 9.5: Equations of Lines and Planes
Lines in 3D Space Section 9.5: Equations of Lines and Planes Practice HW from Stewart Textbook (not to hand in) p. 673 # 35 odd, 237 odd, 4, 47 Consider the line L through the point P = ( x, y, ) that
More informationThese 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
More informationEQUATIONS and INEQUALITIES
EQUATIONS and INEQUALITIES Linear Equations and Slope 1. Slope a. Calculate the slope of a line given two points b. Calculate the slope of a line parallel to a given line. c. Calculate the slope of a line
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Rowreduction 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,
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More informationx y The matrix form, the vector form, and the augmented matrix form, respectively, for the system of equations are
Solving Sstems of Linear Equations in Matri Form with rref Learning Goals Determine the solution of a sstem of equations from the augmented matri Determine the reduced row echelon form of the augmented
More informationLecture 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
More informationLinear 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
More informationTWODIMENSIONAL TRANSFORMATION
CHAPTER 2 TWODIMENSIONAL TRANSFORMATION 2.1 Introduction As stated earlier, Computer Aided Design consists of three components, namely, Design (Geometric Modeling), Analysis (FEA, etc), and Visualization
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationDot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product
Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationSystems of Linear Equations
Chapter 1 Systems of Linear Equations 1.1 Intro. to systems of linear equations Homework: [Textbook, Ex. 13, 15, 41, 47, 49, 51, 65, 73; page 11]. Main points in this section: 1. Definition of Linear
More informationLinear Equations ! 25 30 35$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development
MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets!
More information9 Multiplication of Vectors: The Scalar or Dot Product
Arkansas Tech University MATH 934: Calculus III Dr. Marcel B Finan 9 Multiplication of Vectors: The Scalar or Dot Product Up to this point we have defined what vectors are and discussed basic notation
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationLecture notes on linear algebra
Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems  Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationMATH 551  APPLIED MATRIX THEORY
MATH 55  APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationv 1 v 3 u v = (( 1)4 (3)2, [1(4) ( 2)2], 1(3) ( 2)( 1)) = ( 10, 8, 1) (d) u (v w) = (u w)v (u v)w (Relationship between dot and cross product)
0.1 Cross Product The dot product of two vectors is a scalar, a number in R. Next we will define the cross product of two vectors in 3space. This time the outcome will be a vector in 3space. Definition
More informationSubspaces 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
More informationGeometric description of the cross product of the vectors u and v. The cross product of two vectors is a vector! u x v is perpendicular to u and v
12.4 Cross Product Geometric description of the cross product of the vectors u and v The cross product of two vectors is a vector! u x v is perpendicular to u and v The length of u x v is uv u v sin The
More informationAbstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).
MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix
More informationLectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222  Linear Algebra II  Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n realvalued matrix A is said to be an orthogonal
More information5.5. Solving linear systems by the elimination method
55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve
More informationVector 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
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationUsing row reduction to calculate the inverse and the determinant of a square matrix
Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible
More informationCross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationVector Math Computer Graphics Scott D. Anderson
Vector Math Computer Graphics Scott D. Anderson 1 Dot Product The notation v w means the dot product or scalar product or inner product of two vectors, v and w. In abstract mathematics, we can talk about
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationHow To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
More information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
More informationOne advantage of this algebraic approach is that we can write down
. Vectors and the dot product A vector v in R 3 is an arrow. It has a direction and a length (aka the magnitude), but the position is not important. Given a coordinate axis, where the xaxis points out
More informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
More informationAlgebra 2 Chapter 1 Vocabulary. identity  A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity  A statement that equates two equivalent expressions. verbal model A word equation that represents a reallife problem. algebraic expression  An expression with variables.
More information5 Systems of Equations
Systems of Equations Concepts: Solutions to Systems of EquationsGraphically and Algebraically Solving Systems  Substitution Method Solving Systems  Elimination Method Using Dimensional Graphs to Approximate
More information4 MT210 Notebook 4 3. 4.1 Eigenvalues and Eigenvectors... 3. 4.1.1 Definitions; Graphical Illustrations... 3
MT Notebook Fall / prepared by Professor Jenny Baglivo c Copyright 9 by Jenny A. Baglivo. All Rights Reserved. Contents MT Notebook. Eigenvalues and Eigenvectors................................... Definitions;
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 51 Orthonormal
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in threespace, we write a vector in terms
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationEquations Involving Lines and Planes Standard equations for lines in space
Equations Involving Lines and Planes In this section we will collect various important formulas regarding equations of lines and planes in three dimensional space Reminder regarding notation: any quantity
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationMath 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
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationA vector is a directed line segment used to represent a vector quantity.
Chapters and 6 Introduction to Vectors A vector quantity has direction and magnitude. There are many examples of vector quantities in the natural world, such as force, velocity, and acceleration. A vector
More informationSection 1.4. Lines, Planes, and Hyperplanes. The Calculus of Functions of Several Variables
The Calculus of Functions of Several Variables Section 1.4 Lines, Planes, Hyperplanes In this section we will add to our basic geometric understing of R n by studying lines planes. If we do this carefully,
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationAdding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors
1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number
More information521493S Computer Graphics. Exercise 2 & course schedule change
521493S Computer Graphics Exercise 2 & course schedule change Course Schedule Change Lecture from Wednesday 31th of March is moved to Tuesday 30th of March at 1618 in TS128 Question 2.1 Given two nonparallel,
More information18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2106. Total: 175 points.
806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 206 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are righthandsides b for which A x = b has no solution (a) What
More informationLeastSquares Intersection of Lines
LeastSquares Intersection of Lines Johannes Traa  UIUC 2013 This writeup derives the leastsquares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More informationSection 1.1 Linear Equations: Slope and Equations of Lines
Section. Linear Equations: Slope and Equations of Lines Slope The measure of the steepness of a line is called the slope of the line. It is the amount of change in y, the rise, divided by the amount of
More informationLecture L3  Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3  Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationLinear Equations and Inequalities
Linear Equations and Inequalities Section 1.1 Prof. Wodarz Math 109  Fall 2008 Contents 1 Linear Equations 2 1.1 Standard Form of a Linear Equation................ 2 1.2 Solving Linear Equations......................
More information6. Vectors. 1 20092016 Scott Surgent (surgent@asu.edu)
6. Vectors For purposes of applications in calculus and physics, a vector has both a direction and a magnitude (length), and is usually represented as an arrow. The start of the arrow is the vector s foot,
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationJim Lambers MAT 169 Fall Semester 200910 Lecture 25 Notes
Jim Lambers MAT 169 Fall Semester 00910 Lecture 5 Notes These notes correspond to Section 10.5 in the text. Equations of Lines A line can be viewed, conceptually, as the set of all points in space that
More informationProblems. Universidad San Pablo  CEU. Mathematical Fundaments of Biomedical Engineering 1. Author: First Year Biomedical Engineering
Universidad San Pablo  CEU Mathematical Fundaments of Biomedical Engineering Problems Author: First Year Biomedical Engineering Supervisor: Carlos Oscar S. Sorzano June 9, 05 Chapter Lay,.. Solve the
More information