# Systems of Linear Equations

Size: px
Start display at page:

Transcription

1 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 b are constant real or complex numbers The constant a i is called the coefficient of x i ; and b is called the constant term of the equation A system of linear equations (or linear system) is a finite collection of linear equations in same variables For instance, a linear system of m equations in n variables x, x,, x n can be written as a x + a x + + a n x n = b a x + a x + + a n x n = b () a m x + a m x + + a mn x n = b m A solution of a linear system () is a tuple (s, s,, s n ) of numbers that makes each equation a true statement when the values s, s,, s n are substituted for x, x,, x n, respectively The set of all solutions of a linear system is called the solution set of the system Theorem Any system of linear equations has one of the following exclusive conclusions (a) No solution (b) Unique solution (c) Infinitely many solutions A linear system is said to be consistent if it has at least one solution; and is said to be inconsistent if it has no solution Geometric interpretation The following three linear systems x +x = 3 (a) x x = x x = 4 (b) x +x = 3 x x = 5 x x = 4 (c) x +x = 3 4x +x = 6 6x +3x = 9 have no solution, a unique solution, and infinitely many solutions, respectively See Figure Note: A linear equation of two variables represents a straight line in R A linear equation of three variables represents a plane in R 3 In general, a linear equation of n variables represents a hyperplane in the n-dimensional Euclidean space R n Matrices of a linear system

2 x x x o x o x o x Figure : No solution, unique solution, and infinitely many solutions Definition The augmented matrix of the general linear system () is the table a a a n b a a a n b a m a m a mn b m and the coefficient matrix of () is a a a n a a a n a m a m a mn () (3)

3 Systems of linear equations can be represented by matrices Operations on equations (for eliminating variables) can be represented by appropriate row operations on the corresponding matrices For example, x +x x 3 = x 3x +x 3 = x +x +4x 3 = [Eq ] [Eq ] [Eq 3] 3[Eq ] x +x x 3 = 5x +5x 3 = x +x 3 = 4 ( /5)[Eq ] ( /)[Eq 3] x +x x 3 = x x 3 = x 5x 3 = R R R 3 3R ( /5)R ( /)R 3 5 [Eq 3] [Eq ] R 3 R x +x x 3 = x x 3 = 4x 3 = ( /4)[Eq 3] ( /4)R 3 x +x x 3 = x x 3 = x 3 = [Eq ] + [Eq 3] [Eq ] + [Eq 3] x +x = 3 x = 3 x 3 = R + R 3 R + R [Eq ] [Eq ] R R x = x = 3 3 x 3 = Elementary row operations Definition 3 There are three kinds of elementary row operations on matrices: (a) Adding a multiple of one row to another row; (b) Multiplying all entries of one row by a nonzero constant; (c) Interchanging two rows Definition 4 Two linear systems in same variables are said to be equivalent if their solution sets are the same A matrix A is said to be row equivalent to a matrix B, written A B, if there is a sequence of elementary row operations that changes A to B 3

4 Theorem 5 If the augmented matrices of two linear systems are row equivalent, then the two systems have the same solution set In other words, elementary row operations do not change solution set Proof It is trivial for the row operations (b) and (c) in Definition 3 Consider the row operation (a) in Definition 3 Without loss of generality, we may assume that a multiple of the first row is added to the second row Let us only exhibit the first two rows as follows a a a n b a a a n b (4) a m a m a mn b m Do the row operation (Row ) + c(row ) We obtain a a a n b a + ca a + ca a n + ca n b + cb a 3 a 3 a 3n b 3 a m a m a mn b m (5) Let (s, s,, s n ) be a solution of (4), that is, In particular, Multiplying c to both sides of (7), we have Adding both sides of (8) and (9), we obtain a i s + a i s + + a in s n = b i, i m (6) a s + a x + + a n s n = b, (7) a s + a x + + a n s n = b (8) ca s + ca + + ca n s n = cb (9) (a + ca )s + (a + ca )s + + (a n + ca n )s n = b + cb () This means that (s, s,, s n ) is a solution of (5) Conversely, let (s, s,, s n ) be a solution of (5), ie, () is satisfied and the equations of (6) are satisfied except for i = Since a s + a x + + a n s n = b, multiplying c to both sides we have Note that () can be written as c(a s + a + + a n s n ) = cb () (a s + a s + + a n s n ) + c(a s + a s + + a n s n ) = b + cb () Subtracting () from (), we have This means that (s, s,, s n ) is a solution of (4) a s + a s + + a n s n = b 4

5 Row echelon forms Definition A matrix is said to be in row echelon form if it satisfies the following two conditions: (a) All zero rows are gathered near the bottom (b) The first nonzero entry of a row, called the leading entry of that row, is ahead of the first nonzero entry of the next row A matrix in row echelon form is said to be in reduced row echelon form if it satisfies two more conditions: (c) The leading entry of every nonzero row is (d) Each leading entry is the only nonzero entry in its column A matrix in (reduced) row echelon form is called a (reduced) row echelon matrix Note Sometimes we call row echelon forms just as echelon forms and row echelon matrices as echelon matrices without mentioning the word row Row echelon form pattern The following are two typical row echelon matrices, where the circled stars represent arbitrary nonzero numbers, and the stars represent arbitrary numbers, including zero The following are two typical reduced row echelon matrices, Definition If a matrix A is row equivalent to a row echelon matrix B, we say that A has the row echelon form B; if B is further a reduced row echelon matrix, then we say that A has the reduced row echelon form B Row reduction algorithm Definition 3 A pivot position of a matrix A is a location of entries of A that corresponds to a leading entry in a row echelon form of A A pivot column (pivot row) is a column (row) of A that contains a pivot position Algorithm (Row Reduction Algorithm) () Begin with the leftmost nonzero column, which is a pivot column; the top entry is a pivot position () If the entry of the pivot position is zero, select a nonzero entry in the pivot column, interchange the pivot row and the row containing this nonzero entry (3) If the pivot position is nonzero, use elementary row operations to reduce all entries below the pivot position to zero, (and the pivot position to and entries above the pivot position to zero for reduced row echelon form) (4) Cover the pivot row and the rows above it; repeat ()-(3) to the remaining submatrix 5

6 Theorem 4 Every matrix is row equivalent to one and only one reduced row echelon matrix In other words, every matrix has a unique reduced row echelon form Proof The Row Reduction Algorithm show the existence of reduced row echelon matrix for any matrix M We only need to show the uniqueness Suppose A and B are two reduced row echelon forms for a matrix M Then the systems Ax = and Bx = have the same solution set Write A = [a ij ] and B = [b ij ] We first show that A and B have the same pivot columns Let i,, i k be the pivot columns of A, and let j,, j l be the pivot columns of B Suppose i = j,, i r = j r, but i r j r Assume i r < j r Then the i r th row of A is [,,,, ar,ir+,, a r,jr, a r,jr+,, a r,n ] While the j r th row of B is [,,,, br,jr+,, b r,n ] Since i r = j r and i r < j r, we have j r < i r < j r So x ir is a free variable for Bx = Let u i = b,ir,, u ir = b r,ir, u ir =, and u i = for i > i r Then u is a solution of Bx =, but is not a solution of Ax = This is a contradiction Of course, k = l Next we show that for r k = l, we have a rj = b rj, j r + j j r+ Otherwise, we have a rj b rj such that r is smallest and then j is smallest Set u j =, u i = a,j,, u r = a rj, and u j = otherwise Then u is a solution of Ax =, but is not a solution of Bx = This is a contradiction Solving linear system Example Find all solutions for the linear system x +x x 3 = x +x +4x 3 = 3x +3x +4x 3 = Solution Perform the row operations: R R R 3 3R R + R 3 R + R ( /3)R R 3 R R R The system is equivalent to which means the system has a unique solution x = 7 x = 4 x 3 = 6

7 Example Solve the linear system x x +x 3 x 4 = x x +x 3 +x 4 = 4x 4x +4x 3 = 4 x +x x 3 +x 4 = 3 Solution Do the row operations: R R R 3 4R R 4 + R R + R 4 4 () [ ] [] () (/)R R 3 R R 4 + (/)R The linear system is equivalent to { x = + x x 3 x 4 = We see that the variables x, x 3 can take arbitrary numbers; they are called free variables Let x = c, x 3 = c, where c, c R Then x = + c c, x 4 = All solutions of the system are given by x = + c c x = c x 3 = c x 4 = The general solutions may be written as x x = x x 3 = + c x 4 + c, where c, c R Set c = c =, ie, set x = x 3 =, we have a particular solution x = For the corresponding homogeneous linear system Ax =, ie, x x +x 3 x 4 = x x +x 3 +x 4 = 4x 4x +4x 3 = x +x x 3 +x 4 = we have () [ ] [] () 7

8 Set c =, c =, ie, x =, x 3 =, we obtain one basic solution x = for the homogeneous system Ax = Set c =, c =, ie, x =, x 3 =, we obtain another basic solution x = for the homogeneous system Ax = Example 3 The linear system with the augmented matrix has no solution because its augmented matrix has the row echelon form () ( 3) [7] The last row represents a contradictory equation = Theorem 5 A linear system is consistent if and only if the row echelon form of its augmented matrix contains no row of the form [,, b ], where b Example 4 Solve the linear system whose augmented matrix is A = Solution Interchanging Row and Row, we have R 3R R 4 R R R 3 R 4 + R 8

9 Then the system is equivalent to R R 3 R 3 R R 3 () [] () [ ] [] () x = x x 4 + x 5 x 3 = + x 4 x 5 x 6 = The unknowns x, x 4 and x 5 are free variables Set x = c, x 4 = c, x 5 = c 3, where c, c, c 3 are arbitrary The general solutions of the system are given by x = c c + c 3 x = c x 3 = + c c 3 x 4 = c x 5 = c 3 x 6 = The general solution may be written as x x x 3 x 4 = + c x 5 x 6 + c + c 3, c, c, c 3 R Definition 6 A variable in a consistent linear system is called free if its corresponding column in the coefficient matrix is not a pivot column Theorem 7 For any homogeneous system Ax =, 3 Vector Space R n #{variables} = #{pivot positions of A} + #{free variables} Vectors in R and R 3 Let R be the set of all ordered pairs (u, u ) of real numbers, called the -dimensional Euclidean space Each ordered pair (u, u ) is called a point in R For each point (u, u ) we associate a column [ u u ], called the vector associated to the point (u, u ) The set of all such vectors is still denoted by R So by a point in the Euclidean space R we mean an ordered pair (x, y) 9

10 and, by a vector in the vector space R we mean a column [ ] x y Similarly, we denote by R 3 the set of all tuples (u, u, u 3 ) of real numbers, called points in the Euclidean space R 3 We still denote by R 3 the set of all columns u u, u 3 called vectors in R 3 For example, (, 3, ), ( 3,, ), (,, ) are points in R 3, while 3 3,, are vectors in the vector space R 3 Definition 3 The addition, subtraction, and scalar multiplication for vectors in R are defined by [ ] [ ] [ ] u v u + v + =, u v u + v [ u ] [ ] v = u v [ ] u c = u [ ] u v, u v [ cu cu ] Similarly, the addition, subtraction, and scalar multiplication for vectors in R 3 are defined by u u u 3 + =, Vectors in R n u u u 3 c v v v 3 u u u 3 v v v 3 = = u + v u + v u 3 + v 3 cu cu cu 3 u v u v u 3 v 3 Definition 3 Let R n be the set of all tuples (u, u,, u n ) of real numbers, called points in the n- dimensional Euclidean space R n We still use R n to denote the set of all columns u u u n,

11 of real numbers, called vectors in the n-dimensional vector space R n The vector = is called the zero vector in R n The addition and the scalar multiplication in R n are defined by u v u v u n + c u u u n v n = = cu cu cu n u + v u + v u n + v n Proposition 33 For vectors u, v, w in R n and scalars c, d in R, () u + v = v + u, () (u + v) + w = u + (v + w), (3) u + = u, (4) u + ( u) =, (5) c(u + v) = cu + cv, (6) (c + d)u = cu + du (7) c(du) = (cd)u (8) u = u Subtraction can be defined in R n by Linear combinations u v = u + ( v) Definition 34 A vector v in R n is called a linear combination of vectors v, v,, v k in R n if there exist scalars c, c,, c k such that v = c v + c v + + c k v k The set of all linear combinations of v, v,, v k is called the span of v, v,, v k, denoted Span {v, v,, v k } Example 3 The span of a single nonzero vector in R 3 is a straight line through the origin For instance, Span 3 = t 3 : t R,

12 is a straight line through the origin, having the parametric form x = 3t x = t, t R x 3 = t Eliminating the parameter t, the parametric equations reduce to two equations about x, x, x 3, { x +3x = x +x 3 = Example 3 The span of two linearly independent vectors in R 3 is a plane through the origin instance, Span 3, = s + t 3 : s, t R is a plane through the origin, having the following parametric form x = s +3t x = s t x 3 = s +t Eliminating the parameters s and t, the plane can be described by a single equation Example 33 Given vectors in R 3, v =, v = 3x 5x 7x 3 =, v 3 =, v 4 = 4 3 For (a) Every vector b = [b, b, b 3 ] T in R 3 is a linear combination of v, v, v 3 (b) The vector v 4 can be expressed as a linear combination of v, v, v 3, and it can be expressed in one and only one way as a linear combination v = v v + 3v 3 (c) The span of {v, v, v 3 } is the whole vector space R 3 Solution (a) Let b = x v + x v + x 3 v 3 Then the vector equation has the following matrix form x b x = b x 3 b 3 Perform row operations: Thus b b b 3 b b b b b 3 + b b b b b b 3 b b 3 b + b + b 3 b b b 3 x = b b 3, x = b + b + b 3, x 3 = b b b 3 So b is a linear combination of v, v, v 3 (b) In particular, v 4 = v v + 3v 3 (c) Since b is arbitrary, we have Span {v, v, v 3 } = R 3

13 Example 34 Consider vectors in R 3, v =, v =, v 3 = 5 ; u = 7, v = (a) The vector u can be expressed as linear combinations of v, v, v 3 in more than one ways For instance, u = v + v + v 3 = 4v + 3v = v v + v 3 (b) The vector v can not be written as a linear combination of v, v, v 3 Geometric interpretation of vectors Multiplication of matrices Definition 35 Let A be an m n matrix and B an n p matrix, a a a n a a a n A = a m a m a mn, B = The product (or multiplication) of A and B is an m p matrix c c c p c c c p C = c m c m c mp whose (i, k)-entry c ik, where i m and k p, is given by c ik = b b b p b b b p b n a n b np n a ij b jk = a i b k + a i b k + + a in b nk j= Proposition 36 Let A be an m n matrix, whose column vectors are denoted by a, a,, a n Then for any vector v in R n, v v Av = [a, a,, a n ] = v a + v a + + v n a n v n Proof Write Then a = A = a a a m a a a n a a a n a m a m a mn, a = a a a m, v = v v v n,, a n = a n a n a mn 3

14 Thus Av = = = = v a a a n a a a n a m a m a mn v v v n a v + a v + + a n v n a v + a v + + a n v n a m v + a m v + + a mn v n a v a v a m v a a a m + + v a v a v a m v a a a m v n a n v n a n v n a mn v n a n a n a mn = v a + v a + + v n a n Theorem 37 Let A be an m n matrix Then for any vectors u, v in R n and scalar c, (a) A(u + v) = Au + Av, (b) A(cu) = cau 4 The four expressions of a linear system A general system of linear equations can be written as a x + a x + + a n x n = b a x + a x + + a n x n = b a m x + a m x + + a mn x n = b m (4) We introduce the column vectors: a = a a m,, a n = a n a mn ; x = x x n ; b = b b m ; and the coefficient matrix: A = a a a n a a a n = [ a, a,, a n ] a m a m a mn Then the linear system (4) can be expressed by 4

15 (a) The vector equation form: (b) The matrix equation form: x a + x a + + x n a n = b, Ax = b, (c) The augmented matrix form: [ a, a,, a n b ] Theorem 4 The system Ax = b has a solution if and only if b is a linear combination of the column vectors of A Theorem 4 Let A be an m n matrix The following statements are equivalent (a) For each b in R m, the system Ax = b has a solution (b) The column vectors of A span R m (c) The matrix A has a pivot position in every row Proof (a) (b) and (c) (a) are obvious (a) (c): Suppose A has no pivot position for at least one row; that is, A ρ ρ ρ k ρ k A Ak Ak, where ρ, ρ,, ρ k are elementary row operations, and A k is a row echelon matrix Let e m = [,,, ] T Clearly, the system [A e n ] is inconsistent Let ρ i denote the inverse row operation of ρ i, i k Then [A k e m ] ρ k [A k b ] ρ k ρ [A b k ] ρ [A b k ] Thus, for b = b k, the system [A b] has no solution, a contradiction Example 4 The following linear system has no solution for some vectors b in R 3 x +x 3 +3x 4 = b x +4x +6x 3 +7x 4 = b x +x +x 3 +x 4 = b 3 The row echelon matrix of the coefficient matrix for the system is given by R R R R R 3 R 3 Then the following systems have no solution 3 R 3 + R R 3 R R + R Thus the original system has no solution for b =, b = b 3 = 5

16 5 Solution structure of a linear System Homogeneous system A linear system is called homogeneous if it is in the form Ax =, where A is an m n matrix and is the zero vector in R m Note that x = is always a solution for a homogeneous system, called the zero solution (or trivial solution); solutions other than the zero solution are called nontrivial solutions Theorem 5 A homogeneous system Ax = has a nontrivial solution if and only if the system has at least one free variable Moreover, # { pivot positions } + # { free variables } = # { variables } Example 5 Find the solution set for the nonhomogeneous linear system x x +x 4 +x 5 = x +x x 3 4x 4 3x 5 = x x +x 3 +3x 4 +x 5 = x +x +x 3 +x 4 3x 5 = Solution Do row operations to reduce the coefficient matrix to the reduced row echelon form: R + R 4 3 R 3 R 3 3 R 4 + R () [ ] () [] [ ] Then the homogeneous system is equivalent to { x = x x 4 x 5 ( )R R 3 + R R 4 + R x 3 = x 4 +x 5 The variables x, x 4, x 5 are free variables Set x = c, x 4 = c, x 5 = c 3 We have x c c c 3 x x 3 x 4 = c c + c 3 c = c + c + c 3 x 5 c 3 Set x =, x 4 =, x 5 =, we obtain the basic solution v = 6

17 Set x =, x 4 =, x 5 =, we obtain the basic solution v = Set x =, x 4 =, x 5 =, we obtain the basic solution v 3 = The general solution of the system is given by In other words, the solution set is Span {v, v, v 3 } x = c v + c v + c 3 v 3, c, c, c 3, R Theorem 5 Let Ax = be a homogeneous system If u and v are solutions, then the addition and the scalar multiplication u + v, cu are also solutions solution Moreover, any linear combination of solutions for a homogeneous system is again a Theorem 53 Let Ax = be a homogeneous linear system, where A is an m n matrix with p pivot positions Then system has n p free variables and n p basic solutions The basic solutions can be obtained as follows: Setting one free variable equal to and all other free variables equal to Nonhomogeneous systems A linear system Ax = b is called nonhomogeneous if b The homogeneous linear system Ax = is called its corresponding homogeneous linear system Proposition 54 Let u and v be solutions of a nonhomogeneous system Ax = b Then the difference u v is a solution of the corresponding homogeneous system Ax = Theorem 55 (Structure of Solution Set) Let x nonh be a solution of a nonhomogeneous system Ax = b Let x hom be the general solutions of the corresponding homogeneous system Ax = Then are the general solutions of Ax = b x = x nonh + x hom Example 5 Find the solution set for the nonhomogeneous linear system x x +x 4 +x 5 = x +x x 3 4x 4 3x 5 = 3 x x +x 3 +3x 4 +x 5 = x +x +x 3 +x 4 3x 5 = 3 7

18 Solution Do row operations to reduce the augmented matrix to the reduced row echelon form: R + R ( )R R 3 R R 3 + R R 4 + R R 4 + R () [ ] () [] [ ] Then the nonhomogeneous system is equivalent to { x = +x x 4 x 5 x 3 = x 4 +x 5 The variables x, x 4, x 5 are free variables Set x = c, x 4 = c, x 5 = c 3 We obtain the general solutions x + c c c 3 x x 3 x 4 = c c + c 3 c = + c + c + c 3, x 5 c 3 or x = v + c v + c v + c 3 v 3, c, c, c 3 R, called the parametric form of the solution set In particular, setting x = x 4 = x 5 =, we obtain the particular solution v = The solution set of Ax = b is given by S = v + Span {v, v, v 3 } Example 53 The augmented matrix of the nonhomogeneous system x x +x 3 +3x 4 +3x 5 +4x 6 = x +x x 3 3x 4 4x 5 5x 6 = x +x x 5 4x 6 = 5 x +x +x 3 +3x 4 +x 5 x 6 = has the reduced row echelon form () [ ] 3 () [3] [] 3 () Then a particular solution x p for the system and the basic solutions of the corresponding homogeneous system are given by 3 x p = 3, v =, v = 3, v 3 = 8

19 The general solution of the system is given by x = x p + c v + c v + c 3 v 3 Example 54 For what values of a and b the linear system x +x +ax 3 = x +bx = 3x +x +x 3 = has nontrivial solutions Answer: 8a + (3a )(b 4) = 6 Linear dependence and independence Lecture 6 Definition 6 Vectors v, v,, v k in R n are said to be linearly independent provided that, whenever c v + c v + + c k v k = for some scalars c, c,, c k, then c = c = = c k = The vectors v, v,, v k are called linearly dependent if there exist constants c, c,, c k, not all zero, such that c v + c v + + c k v k = Example 6 The vectors v =, v = Solution Consider the linear system x + x 3, v 3 = + x = in R 3 are linearly independent The system has the only zero solution x = x = x 3 = Thus v, v, v 3 are linearly independent Example 6 The vector v =, v =, v 3 = 3 in R 3 are linearly dependent 5 Solution Consider the linear system x x + x = The system has one free variable There is nonzero solution Thus v, v, v 3 are linearly dependent Example 63 The vectors,,, 3 in R 3 are linearly dependent 3 9

20 Theorem 6 The basic solutions of any homogeneous linear system are linearly independent Proof Let v, v,, v k be basic solutions of a linear system Ax =, corresponding to free variables x j, x j,, x jk Consider the linear combination c v + c v + + c k v k = Note that the j i coordinate of c v + c v + + c k v k is c ji, i k It follows that c ji i k This means that v, v,, v k are linearly independent = for all Theorem 63 Any set of vectors containing the zero vector is linearly dependent Theorem 64 Let v, v,, v p be vectors in R n If p > n, then v, v,, v p are linearly dependent Proof Let A = [v, v,, v p ] Then A is an n p matrix, and the equation Ax = has n equations in p unknowns Recall that for the matrix A the number of pivot positions plus the number of free variables is equal to p, and the number of pivot positions is at most n Thus, if p > n, there must be some free variables Hence Ax = has nontrivial solutions This means that the column vectors of A are linearly dependent Theorem 65 Let S = {v, v,, v p } be a set of vectors in R n, (p ) Then S is linearly dependent if and only if one of vectors in S is a linear combination of the other vectors Moreover, if S is linearly dependent and v, then there is a vector v j with j such that v j is a linear combination of the preceding vectors v, v,, v j Note The condition v in the above theorem can not be deleted For example, the set { [ ] [ ]} v =, v = is linearly dependent But v is not a linear combination of v Theorem 66 The column vectors of a matrix A are linearly independent if and only if the linear system has the only zero solution Ax = Proof Let A = [a, a,, a n ] Then the linear system Ax = is the vector equation x a + x a + + x n a n = Then a, a,, a n are linear independent is equivalent to that the system has only the zero solution

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

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

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

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

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

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

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

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

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

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

### Methods for Finding Bases

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

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

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

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

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

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

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

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

### 160 CHAPTER 4. VECTOR SPACES

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

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

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

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

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

### Math 312 Homework 1 Solutions

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

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

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 1 Introduction to Matrices

1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

### Vector Spaces 4.4 Spanning and Independence

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

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### Section 1.7 22 Continued

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

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

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

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

### Linear Algebra Notes

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

### Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

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

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

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

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

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

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

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

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

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

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

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

### 1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0

Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 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

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

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

### University of Lille I PC first year list of exercises n 7. Review

University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients

### Lectures 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 real-valued matrix A is said to be an orthogonal

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

### Chapter 20. Vector Spaces and Bases

Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Lecture 14: Section 3.3

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### 5 Homogeneous systems

5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m

### Recall that two vectors in are perpendicular or orthogonal provided that their dot

Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal

### Factorization Theorems

Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

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

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

### Homogeneous equations, Linear independence

Homogeneous equations, Linear independence 1. Homogeneous equations: Ex 1: Consider system: B" #B# œ! B" #B3 œ! B B œ! # \$ Matrix equation: Ô " #! Ô B " Ô! "! # B # œ! œ 0Þ Ð3Ñ Õ! " " ØÕB Ø Õ! Ø \$ Homogeneous

### Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

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

### What is Linear Programming?

Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### MA106 Linear Algebra lecture notes

MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

### Homogeneous systems of algebraic equations. A homogeneous (ho-mo-geen -ius) system of linear algebraic equations is one in which

Homogeneous systems of algebraic equations A homogeneous (ho-mo-geen -ius) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x + + a n x n = a

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

### Vector Spaces. Chapter 2. 2.1 R 2 through R n

Chapter 2 Vector Spaces One of my favorite dictionaries (the one from Oxford) defines a vector as A quantity having direction as well as magnitude, denoted by a line drawn from its original to its final

### T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

### 8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

### Lecture 4: Partitioned Matrices and Determinants

Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying

### Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

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

### Linear Programming Problems

Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### II. Linear Systems of Equations

II. Linear Systems of Equations II. The Definition We are shortly going to develop a systematic procedure which is guaranteed to find every solution to every system of linear equations. The fact that such

### MAT 242 Test 2 SOLUTIONS, FORM T

MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these

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

### Inner product. Definition of inner product

Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product

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

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

### SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

### 7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

### Unified Lecture # 4 Vectors

Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,

### CS3220 Lecture Notes: QR factorization and orthogonal transformations

CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss

### Introduction to Matrix Algebra

Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

### PROJECTIVE GEOMETRY. b3 course 2003. Nigel Hitchin

PROJECTIVE GEOMETRY b3 course 2003 Nigel Hitchin hitchin@maths.ox.ac.uk 1 1 Introduction This is a course on projective geometry. Probably your idea of geometry in the past has been based on triangles

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