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

Size: px
Start display at page:

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

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 m-dimensional 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 Matrix-Vector 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 Pre-Images One-To-One 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. input-output 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 3-by-3 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 3-by-3 system given above, where a 3-by-4 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 3-by-3 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 3-by-3 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 3-by-4 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 3-by- 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 3-space. Thus, solution sets for m-by- and m-by-3 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 3-space. 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 6-by- matrix shown on the left below is in echelon form and the 6-by- 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 row-equivalent (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 4-by-5 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 4-by-4 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 3-by-6 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 3-by-5 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 non-basic 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 4-by-4 system in Example, the basic variables are, and the free variables are. Example 3, continued. For the 4-by-5 system in Example 3, the basic variables are, and the free variables are..3 Vectors and Vector Equations.3. Vectors in m-dimensional 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 one-to-one 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 3-space. 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 m-by-n 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 m-by-n 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 m-by-n 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 Matrix-Vector Product. The coefficient matrix A of an m-by-n 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 matrix-vector 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 =. Row-column definition. The definition of the matrix-vector product as a linear combination of column vectors is equivalent to the usual row-column definition of the product of two matrices. For example, (3) + 5( ) 3() Av = 4 = (3) 4( ) + () =. 7 0 (3) 7( ) + 0() Linearity property. The matrix-vector product of a linear combination of k vectors in R n is equal to that linear combination of matrix-vector 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 m-by-n 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 m-by-n 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 Pre-Images. 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 n-space: Domain(T ) = R n. The range of T is a subset of m-space: 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 pre-image of b. Note that images are unique, but pre-images 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. One-To-One and Onto Transformations. The transformation T : R n R m is said to be one-to-one 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 one-to-one and/or 3

32 Problem (b), continued. and/or onto? Explain. ([ ]) Is T : R R x with rule T x = [ ] x + 6x x 3x one-to-one x Problem (c), continued. Is T : R 4 R 3 with rule T x x 3 + x 4 x 3 = x + x 4 one-to-one 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 one-to-one 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) One-to-one and onto transformations, revisited. Recall that T : R n R m is said to be one-to-one 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 one-to-one 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 one-to-one iff A has a pivot. 37

38 Problem 7. Which, if any, of the following transformations are one-to-one? 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 x-axis, and negative angles are measured clockwise from the positive x-axis. 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 z-axis. Assume that positive angles are measured counterclockwise from the positive x-axis, and negative angles are measured clockwise from the positive x-axis, when looking down from the positive z-axis. The transformation that rotates points in 3-space at angle θ around the z-axis 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 z-axis through angle θ. Find the standard matrix of T. Your answer should be in terms of sin(θ) and cos(θ). 40

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

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

More information

SECTION 1.1: SYSTEMS OF LINEAR EQUATIONS

SECTION 1.1: SYSTEMS OF LINEAR EQUATIONS SECTION.: SYSTEMS OF LINEAR EQUATIONS THE BASICS What is a linear equation? What is a system of linear equations? What is a solution of a system? What is a solution set? When are two systems equivalent?

More information

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

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 information

Section 1.2: Row Reduction and Echelon Forms

Section 1.2: Row Reduction and Echelon Forms 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 information

Systems of Linear Equations

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

More information

Linear Equations in Linear Algebra

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

More information

Math 1313 Section 3.2. Section 3.2: Solving Systems of Linear Equations Using Matrices

Math 1313 Section 3.2. Section 3.2: Solving Systems of Linear Equations Using Matrices Math Section. Section.: Solving Systems of Linear Equations Using Matrices As you may recall from College Algebra or Section., you can solve a system of linear equations in two variables easily by applying

More information

2. Systems of Linear Equations.

2. Systems of Linear Equations. 2. Systems of Linear Equations 2.1. Introduction to Systems of Linear Equations Linear Systems In general, we define a linear equation in the n variables x 1, x 2,, x n to be one that can be expressed

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 1.4 The Matrix Equation Ax = b Math 2331 Linear Algebra 1.4 The Matrix Equation Ax = b Simon Stolarczyk Department of Mathematics, University of Houston spstolar@math.uh.edu math.uh.edu/~spstolar/math2331

More information

MATH 310, REVIEW SHEET 1

MATH 310, REVIEW SHEET 1 MATH 310, REVIEW SHEET 1 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,

More information

Systems of Linear Equations Introduction

Systems of Linear Equations Introduction Systems of Linear Equations Introduction Linear Equation a x = b Solution: Case a 0, then x = b (one solution) a Case 2 a = 0, b 0, then x (no solutions) Case 3 a = 0, b = 0, then x R (infinitely many

More information

MATH 304 Linear Algebra Lecture 11: Basis and dimension.

MATH 304 Linear Algebra Lecture 11: Basis and dimension. MATH 304 Linear Algebra Lecture 11: Basis and dimension. Linear independence Definition. Let V be a vector space. Vectors v 1,v 2,...,v k V are called linearly dependent if they satisfy a relation r 1

More information

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

More information

Linear Algebra. Chapter 2: Systems of Linear Equations. University of Seoul School of Computer Science Minho Kim

Linear Algebra. Chapter 2: Systems of Linear Equations. University of Seoul School of Computer Science Minho Kim Linear Algebra Chapter 2: Systems of Linear Equations University of Seoul School of Computer Science Minho Kim Table of contents Introduction: Triviality Introduction to Systems of Linear Equations Direct

More information

2 Matrices and systems of linear equations

2 Matrices and systems of linear equations Matrices and systems of linear equations You have all seen systems of linear equations such as 3x + 4y = x y = 0. ( This system can be solved easily: Multiply the nd equation by 4, and add the two resulting

More information

Transition Maths and Algebra with Geometry

Transition Maths and Algebra with Geometry Transition Maths and Algebra with Geometry Tomasz Brengos Lecture Notes Electrical and Computer Engineering Tomasz Brengos Transition Maths and Algebra with Geometry 1/27 Contents 1 Systems of linear equations

More information

MATH10212 Linear Algebra B Homework Week 3. Be prepared to answer the following oral questions if asked in the supervision class

MATH10212 Linear Algebra B Homework Week 3. Be prepared to answer the following oral questions if asked in the supervision class MATH10212 Linear Algebra B Homework Week 3 Students are strongly advised to acquire a copy of the Textbook: D. C. Lay Linear Algebra its Applications. Pearson, 2006. ISBN 0-521-28713-4. Normally, homework

More information

Reinserting the variables in the last row of this augmented matrix gives

Reinserting the variables in the last row of this augmented matrix gives Math 313 Lecture #2 1.2: Row Echelon Form Not Reaching Strict Triangular Form. The algorithm that reduces the augmented matrix of an n n system to that of an equivalent strictly triangular system fails

More information

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

More information

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

More information

Row Echelon Form and Reduced Row Echelon Form

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

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Systems of Linear Equations. We consider the problem of solving linear systems of equations, such as x 1 2x 2 = 8 3x 1 + x 2 = 3 In general, we write a system of m equations

More information

2 Matrices and systems of linear equations

2 Matrices and systems of linear equations Matrices and systems of linear equations You have all seen systems of linear equations such as 3x + 4y = 5 x y = 0. () This system can easily be solved: just multiply the nd equation by 4, and add the

More information

4 Solving Systems of Equations by Reducing Matrices

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

More information

Solving Systems of Linear Equations

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

More information

Using the three elementary row operations we may rewrite A in an echelon form as

Using the three elementary row operations we may rewrite A in an echelon form as Rank, Row-Reduced Form, and Solutions to Example 1 Consider the matrix A given by Using the three elementary row operations we may rewrite A in an echelon form as or, continuing with additional row operations,

More information

Row Reduction and Echelon Forms

Row Reduction and Echelon Forms MA 2071 A 12 Bill Farr August 22, 2012 1 2 3 4 5 Definition of Pivot Postion An Algorithm for Putting a Matrix in RREF An Linear Systems and Matrices A linear system has two associated matrices, the coefficient

More information

Ordered Pairs. Graphing Lines and Linear Inequalities, Solving System of Linear Equations. Cartesian Coordinates System.

Ordered Pairs. Graphing Lines and Linear Inequalities, Solving System of Linear Equations. Cartesian Coordinates System. Ordered Pairs Graphing Lines and Linear Inequalities, Solving System of Linear Equations Peter Lo All equations in two variables, such as y = mx + c, is satisfied only if we find a value of x and a value

More information

Linear Independence and Linear Dependence

Linear Independence and Linear Dependence These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation

More information

Homework sheet 1: SYSTEMS OF LINEAR EQUATIONS (with solutions) Year

Homework sheet 1: SYSTEMS OF LINEAR EQUATIONS (with solutions) Year Bachelor in Statistics and Business Universidad Carlos III de Madrid Mathematical Methods II María Barbero Liñán Homework sheet 1: SYSTEMS OF LINEAR EQUATIONS (with solutions) Year 2011-2012 1. Express

More information

1 Systems Of Linear Equations and Matrices

1 Systems Of Linear Equations and Matrices 1 Systems Of Linear Equations and Matrices 1.1 Systems Of Linear Equations In this section you ll learn what Systems Of Linear Equations are and how to solve them. Remember that equations of the form a

More information

Math 54. Selected Solutions for Week 3

Math 54. Selected Solutions for Week 3 Math 54. Selected Solutions for Week 3 Section 2. (Page 2) 8. How many rows does B have if BC is a 5 4 matrix? The matrix C has to be a 4 p matrix, and then BC will be a 5 p matrix, so it will have 5 rows.

More information

5.1. Systems of Linear Equations. Linear Systems Substitution Method Elimination Method Special Systems

5.1. Systems of Linear Equations. Linear Systems Substitution Method Elimination Method Special Systems 5.1 Systems of Linear Equations Linear Systems Substitution Method Elimination Method Special Systems 5.1-1 Linear Systems The possible graphs of a linear system in two unknowns are as follows. 1. The

More information

De nitions of Linear Algebra Terms

De nitions of Linear Algebra Terms De nitions of Linear Algebra Terms In order to learn and understand mathematics, it is necessary to understand the meanings of the terms (vocabulary words) that are used This document contains de nitions

More information

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

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

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations 01 Definitions Recall that if A R m n and B R m p, then the augmented matrix [A B] R m n+p is the matrix [A B], that is the matrix whose first n columns are the columns of A,

More information

1 VECTOR SPACES AND SUBSPACES

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

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 1.4 The Matrix Equation Ax = b Math 2331 Linear Algebra 1.4 The Matrix Equation Ax = b Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math2331 Jiwen

More information

Systems of Linear Equations

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

More information

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

More information

Chapter 1 Matrices and Systems of Linear Equations

Chapter 1 Matrices and Systems of Linear Equations Chapter 1 Matrices and Systems of Linear Equations 1.1: Introduction to Matrices and Systems of Linear Equations 1.2: Echelon Form and Gauss-Jordan Elimination Lecture Linear Algebra - Math 2568M on Friday,

More information

1.5 SOLUTION SETS OF LINEAR SYSTEMS

1.5 SOLUTION SETS OF LINEAR SYSTEMS 1-2 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 information

Linearly Independent Sets and Linearly Dependent Sets

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

More information

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

More information

Linear Transformations

Linear Transformations Linear Transformations Systems of linear equations, with matrix form Ax = b, are often usefully analyzed by viewing the equation as the problem that asks for an unknown input x for a function that produces

More information

Lecture 11: Solving Systems of Linear Equations by Gaussian Elimination

Lecture 11: Solving Systems of Linear Equations by Gaussian Elimination Lecture 11: Solving Systems of Linear Equations by Gaussian Elimination Winfried Just, Ohio University February 3, 2016 Review: The coefficient matrix Consider a system of m linear equations in n variables.

More information

Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis

Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis Chapter 5 Polar Coordinates; Vectors 5.1 Polar coordinates 1. Pole and polar axis 2. Polar coordinates A point P in a polar coordinate system is represented by an ordered pair of numbers (r, θ). If r >

More information

MATH 304 Linear Algebra Lecture 4: Row echelon form. Gauss-Jordan reduction.

MATH 304 Linear Algebra Lecture 4: Row echelon form. Gauss-Jordan reduction. MATH 304 Linear Algebra Lecture 4: Row echelon form Gauss-Jordan reduction System of linear equations: 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 a m1 x 1 + a m2 x 2

More information

Math 2331 Linear Algebra

Math 2331 Linear Algebra 1.1 Linear System Math 2331 Linear Algebra 1.1 Systems of Linear Equations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math2331 Jiwen He, University

More information

Rank. Rank. Definition. The set of all linear combination of the row vectors of a matrix A is called the row space of A and is denoted by Row A

Rank. Rank. Definition. The set of all linear combination of the row vectors of a matrix A is called the row space of A and is denoted by Row A Rank Rank he rank of a matrix is the maximum number of independent rows (or the maximum number of independent columns) Definition he set of all linear combination of the row vectors of a matrix A is called

More information

1.4 THE MATRIX EQUATION Ax = b

1.4 THE MATRIX EQUATION Ax = b 1.4 The Matrix Equations Ax = b 1-15 1.4 THE MATRIX EQUATION Ax = b The ideas, boxed statements, and theorems in this section are absolutely fundamental for the rest of the text, so you should read the

More information

Matrix Inverses. Since the linear system. can be written as. where. ,, and,

Matrix Inverses. Since the linear system. can be written as. where. ,, and, Matrix Inverses Consider the ordinary algebraic equation and its solution shown below: Since the linear system can be written as where,, and, (A = coefficient matrix, x = variable vector, b = constant

More information

1 Gaussian Elimination

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

More information

MAT188H1S Lec0101 Burbulla

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

Lecture 1: Systems of Linear Equations

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

Unit 17 The Theory of Linear Systems

Unit 17 The Theory of Linear Systems Unit 17 The Theory of Linear Systems In this section, we look at characteristics of systems of linear equations and also of their solution sets. Theorem 17.1. For any system of linear equations A x = b,

More information

1 Review of two equations in two unknowns

1 Review of two equations in two unknowns Contents 1 Review of two equations in two unknowns 1.1 The "standard" method for finding the solution 1.2 The geometric method of finding the solution 2 Some equations for which the "standard" method doesn't

More information

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

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

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations S F Ellermeyer May, 9 These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (rd edition) These notes

More information

Chapters 2 & 3: Matrices, Systems of Linear Equations, and Determinants

Chapters 2 & 3: Matrices, Systems of Linear Equations, and Determinants Chapters 2 & 3: Matrices, Systems of Linear Equations, and Determinants Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapter 2 1 / 36 Matrices: Definitions, Notation,

More information

2.5 Gaussian Elimination

2.5 Gaussian Elimination page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n and b are constants, x

More information

Solutions to Math 51 First Exam January 29, 2015

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

More information

( ) which must be a vector

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

Cramer s Rule and Gauss Elimination

Cramer s Rule and Gauss Elimination Outlines September 28, 2004 Outlines Part I: Review of Previous Lecture Part II: Review of Previous Lecture Outlines Part I: Review of Previous Lecture Part II: Cramer s Rule Introduction Matrix Version

More information

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

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

More information

2 - Solving Linear Equations

2 - Solving Linear Equations 2 - Solving Linear Equations Linear algebra developed from studying methods for solving systems of linear equations. We say an equation in the variables x 1, x 2, x 3,..., x n is linear if it consists

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Math 108A: August 5, 2008 John Douglas Moore 1 Orthogonal complements and null spaces of linear maps Linear algebra is the theory behind solving systems of linear equations,

More information

Chapter 4 - Systems of Equations and Inequalities

Chapter 4 - Systems of Equations and Inequalities Math 233 - Spring 2009 Chapter 4 - Systems of Equations and Inequalities 4.1 Solving Systems of equations in Two Variables Definition 1. A system of linear equations is two or more linear equations to

More information

Homogeneous Linear Systems

Homogeneous Linear Systems These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation

More information

10.1 Systems of Linear Equations: Substitution and Elimination

10.1 Systems of Linear Equations: Substitution and Elimination 10.1 Systems of Linear Equations: Substitution and Elimination What does it mean to be a solution to a system of equations? - It is the set of all ordered pairs (x, y) that satisfy the two equations. You

More information

Linear Dependence Tests

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

More information

Math 220 Sections 1, 9 and 11. Review Sheet v.2

Math 220 Sections 1, 9 and 11. Review Sheet v.2 Math 220 Sections 1, 9 and 11. Review Sheet v.2 Tyrone Crisp Fall 2006 1.1 Systems of Linear Equations Key terms and ideas - you need to know what they mean, and how they fit together: Linear equation

More information

Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination

Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination Winfried Just, Ohio University September 23, 2015 Review: The coefficient matrix Consider a system of m linear equations in n variables.

More information

1.1 SOLUTIONS. Replace R2 by R2 + (2)R1 and obtain: 2. Scale R2 by 1/3: Replace R1 by R1 + ( 5)R2:

1.1 SOLUTIONS. Replace R2 by R2 + (2)R1 and obtain: 2. Scale R2 by 1/3: Replace R1 by R1 + ( 5)R2: SOLUIONS Notes: he key exercises are 7 (or or ), 9, and 5 For brevity, the symbols R, R,, stand for row (or equation ), row (or equation ), and so on Additional notes are at the end of the section x +

More information

Chapter 4: Systems of Equations and Ineq. Lecture notes Math 1010

Chapter 4: Systems of Equations and Ineq. Lecture notes Math 1010 Section 4.1: Systems of Equations Systems of equations A system of equations consists of two or more equations involving two or more variables { ax + by = c dx + ey = f A solution of such a system is an

More information

Name: Section Registered In:

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

More information

Solving Systems of Linear Equations Using Matrices

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

x 2 C 5x 3 D 4 x 1 C 4x 2 C 3x 3 D 2 2x 1 C 7x 2 C x 3 D x 1 5x 2 C 4x 3 D 3 2x 1 7x 2 C 3x 3 D 2 2x 1 C x 2 C 7x 3 D 1

x 2 C 5x 3 D 4 x 1 C 4x 2 C 3x 3 D 2 2x 1 C 7x 2 C x 3 D x 1 5x 2 C 4x 3 D 3 2x 1 7x 2 C 3x 3 D 2 2x 1 C x 2 C 7x 3 D 1 CHAPTER Linear Equations in Linear Algebra. EXERCISES Solve each system in Exercises by using elementary row operations on the equations or on the augmented matrix. Follow the systematic elimination procedure

More information

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION,, 1 n A linear equation in the variables equation that can be written in the form a a a b 1 1 2 2 n n a a, is an where

More information

Systems of Linear Equations in Two Variables

Systems of Linear Equations in Two Variables Name Period Date: Topic: 3-5 Systems of Linear Equations in Two Variables Essential Question: Economists often talk about supply and demand curves. Given two linear equations for supply and demand where

More information

Basic Linear Algebra. 2.1 Matrices and Vectors. Matrices. For example,, 1 2 3

Basic Linear Algebra. 2.1 Matrices and Vectors. Matrices. For example,, 1 2 3 Basic Linear Algebra In this chapter, we study the topics in linear algebra that will be needed in the rest of the book. We begin by discussing the building blocks of linear algebra: matrices and vectors.

More information

MATH 304 Linear Algebra Lecture 16: Basis and dimension.

MATH 304 Linear Algebra Lecture 16: Basis and dimension. MATH 304 Linear Algebra Lecture 16: Basis and dimension. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis. Equivalently, a subset S V is a basis for

More information

Figure 1. Addition of vectors: parallelogram rule

Figure 1. Addition of vectors: parallelogram rule 4. Geometry of the span; homogeneous linear equations It is interesting to think about the geometric meaning of linear combinations and the span. If you want to add two vectors u and v, move the starting

More information

Review: Vector space

Review: Vector space Math 2F Linear Algebra Lecture 13 1 Basis and dimensions Slide 1 Review: Subspace of a vector space. (Sec. 4.1) Linear combinations, l.d., l.i. vectors. (Sec. 4.3) Dimension and Base of a vector space.

More information

c 1 v 1 + c 2 v c k v k

c 1 v 1 + c 2 v c k v k Definition: A vector space V is a non-empty set of objects, called vectors, on which the operations addition and scalar multiplication have been defined. The operations are subject to ten axioms: For any

More information

Section 1.3 Systems of Linear Equations

Section 1.3 Systems of Linear Equations Section 1.3 Systems of Linear Equations A system of linear equations is a set of two or more linear equations. It is also called a linear system. In this section we will study 2 2 linear systems, which

More information

Math 54. Selected Solutions for Week 1

Math 54. Selected Solutions for Week 1 Math 54. Selected Solutions for Week Section. (Page 2) 7. The augmented matrix of a linear system has been reduced by row operations to the form 7 3 4 0 3. 0 0 0 0 0 Continue the appropriate row operations

More information

Unit 20 Linear Dependence and Independence

Unit 20 Linear Dependence and Independence Unit 20 Linear Dependence and Independence The idea of dimension is fairly intuitive. Consider any vector in R m, (a 1, a 2, a 3,..., a m ). Each of the m components is independent of the others. That

More information

Linear Transformations and the Rank-Nullity Theorem. T (u + v) = T (u) + T (v), T (cu) = ct (u),

Linear Transformations and the Rank-Nullity Theorem. T (u + v) = T (u) + T (v), T (cu) = ct (u), Math 4326 Fall 2016 Linear Transformations and the Rank-Nullity Theorem In these notes, I will present everything we know so far about linear transformations. This material comes from sections 1.7, 1.8,

More information

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

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

More information

Mathematics for Economists. Cramer s Rule = A j

Mathematics for Economists. Cramer s Rule = A j Mathematics for Economists Cramer s Rule Introduction When there is a system of equations and the number of unknown variables equals the number of equations the system has a solution. Let us consider a

More information

Chapter 2 Review. Solution of Linear Systems by the Echelon Method

Chapter 2 Review. Solution of Linear Systems by the Echelon Method Chapter 2 Review Solution of Linear Systems by the Echelon Method A first-degree equation in n unknowns is any equation of the form a 1 x 1 + a 2 x 2 + + a n x n = k, where a 1, a 2,..., a n and k are

More information

by the matrix A results in a vector which is a reflection of the given

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

More information

c 1 v 1 + c 2 v 2 + +c k v k, (4.4.1) DEFINITION 4.4.1

c 1 v 1 + c 2 v 2 + +c k v k, (4.4.1) DEFINITION 4.4.1 258 CHAPTER 4 Vector Spaces 23. Show that the set of all solutions to the nonhomogeneous differential equation y + a 1 y + a 2 y = F(x), where F(x) is nonzero on an interval I, is not a subspace of C 2

More information

1 Eigenvalues and Eigenvectors

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

More information

MAT Solving Linear Systems Using Matrices and Row Operations

MAT Solving Linear Systems Using Matrices and Row Operations MAT 171 8.5 Solving Linear Systems Using Matrices and Row Operations A. Introduction to Matrices Identifying the Size and Entries of a Matrix B. The Augmented Matrix of a System of Equations Forming Augmented

More information

Linear Algebra Test File Spring Test #1

Linear Algebra Test File Spring Test #1 Linear Algebra Test File Spring 2015 Test #1 For problems 1-3, consider the following system of equations. Do not use your calculator. x + y - 2z = 0 3x + 2y + 4z = 10 2x + y + 6z = 10 1.) Solve the system

More information

Solution Sets of Linear Systems

Solution Sets of Linear Systems Solution Sets of Linear Systems S. F. Ellermeyer June 5, 2009 These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (rd edition).

More information

Arithmetic and Algebra of Matrices

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