Linear Equation: a 1 x 1 + a 2 x a n x n = b. x 1, x 2,..., x n : variables or unknowns

Size: px
Start display at page:

Download "Linear Equation: a 1 x 1 + a 2 x a n x n = b. x 1, x 2,..., x n : variables or unknowns"

Transcription

1 Linear Equation: a x + a 2 x a n x n = b. x, x 2,..., x n : variables or unknowns a, a 2,..., a n : coefficients b: constant term Examples: x y + (2 5)z = is linear. x 2 + y + yz = 2 is not linear.

2 System of Linear Equations (linear system): ( ) x + 4y + 2z = 2x + 5y + z = 2 5x y + 2z = 3 i.e. a collection of linear equations. A solution of a system is a collection of values (x, y, z) which satisfies every equation in the system. The solution set (or general solution) of a system is the collection of all the solutions of the system. 2

3 Three possibilities:. No solution. The system is said to be inconsistent. 2. One, and only one, solution. The system is said to be consistent, and has a unique solution. 3. Many solutions. The system is again said to be consistent, and has many solutions (infinitely many). Has a solution: include both case 2 and case 3. 3

4 Solving a linear system: by elimination. ( ) x + 4y + 2z = 2x + 5y + z = 2 5x y + 2z = 3 First eliminate x from the 2nd and 3rd eq. of ( ): x + 4y + 2z = 3y + 5z = 0 2y 8z = 2 4

5 Then eliminate y from the new 3rd eq.: x + 4y + 2z = ( ) 3y + 5z = 0 3 z = 2 Immediate from 3rd eq.: z = 26. Substitute z into 2nd eq., get y = 0. Substitute z, y into st eq., get x = 3. (called backward substitution.) Obtain a unique solution: (x, y, z) = (3, 0, 26). 5

6 Another Example: Solve: x + 2y z = 3x y + 2z = 4 x 5y + 4z = 2 x + 2y z = 3x y + 2z = 4 x 5y + 4z = 2 x + 2y z = 7y + 5z = 7y + 5z = Has a redundant equation. Drop one of them. 6

7 Then: y = 7 ( 5z) = z x = 2y + z = z How about z? z can take on any value. Set z = s, called a free parameter. Then express each variable in terms of this s. solution in parametric form. 7

8 General Solution in Parametric Form: x = s y = s where s is free. z = s If we choose y = t to be a free parameter, we get: x = t y = t where t is free. z = t 8

9 Matrix Notations: x + 4y + 2z = 2x + 5y + z = 2 5x y + 2z = 3 x + 4y + 2z = 3y + 5z = 0 2y 8z = 2 x + 4y + 2z = 3y + 5z = 0 3 z =

10 Def: Given a linear system: x + 4y + 2z = 2x + 5y + z = 2 5x y + 2z = 3 (usual ordering: x, y, z) define: coefficient matrix augmented matrix m rows and n columns: called an m n matrix. 0

11 Example: Write down the coefficient/augmented matrices: coeff. matrix is aug. matrix is x + 2x 2 = 3 2x + 3x 2 = 4 3x + 4x 2 = ; this is a 3 2 matrix. ; this is a 3 3 matrix.

12 Example: Write down the augmented matrix: x + 2x 3 = x 2 + x 4 = 2 x 3 x 4 = 3 *** 2

13 In augmented matrix, eliminations appear as operations on rows: x + 4x 2 + 2x 3 = 2x + 5x 2 + x 3 = x x 2 + 2x 3 = x + 4x 2 + 2x 3 = 3x 2 + 5x 3 = 0 2x 2 8x 3 =

14 Elementary Row Operations (EROs). Row Replacement replace one row by the sum of itself and a multiple of another row. 2. Row Interchange interchange two rows. 3. Row Scaling multiply all the entries in a row by the same nonzero number. A general row operation is a combination of them. 4

15 Elementary Row Operations (EROs). Row replacement cr j + r i.. a i b i..... a j b j a i + ca j b i + cb j..... a j b j..... e.g. 5r 2 + r : [ 2 3 a b c ] [ 5a + 5b + 2 5c + 3 a b c ] 5

16 Elementary Row Operations (EROs) 2. Row interchange r i r j.. a i b i..... a j b j a j b j..... a i b i..... e.g. r r 2 : [ 2 3 a b c ] [ a b c 2 3 ]. 6

17 Elementary Row Operations (EROs) 3. Row scaling cr i e.g. 5r 2 : [ 2 3 a b c. a i b i.... ] [ 2 3 5a 5b 5c Never use = in row operations! Use or instead. 7. ca i cb i.... ].

18 Def: Two matrices are called row-equivalent if they differ by a sequence of EROs. Theorem: Linear systems corresponding to row-equivalent augmented matrices will have the same solution set. Exercise: Perform EROs to the matrix: A = EROs: (a) first 2r 2 + r, then r r 3. EROs: (b) first r r 3, then 2r 2 + r. *** 8

19 Aim: Apply suitable sequence of EROs to the augmented matrix, and obtain a row-equivalent system that is as simple as possible. Qn: What is meant by a simple system? Example: x + 4x 2 + 3x 3 x 4 = 2 5x 3 + x 4 = 2x 4 = 4 This system can be solved easily by backward substitution (at least one new variable for each equation). 9

20 Def: (Leading Entry) In a non-zero row, the leftmost nonzero entry is called the leading entry of the row. Example: Where are the leading entries?

21 Row Echelon Form (REF):. All non-zero rows are above any zero rows Leading entry moves to right by at least one column when going down a row All entries in a column below a leading entry are zeros. 2

22 Examples: In REF: , Examples: NOT in REF: , If the augmented matrix of a system is in row echelon form, the system can be solved easily by backward substitution. 22

23 The Row Reduction Algorithm: (Phase ) (also called gaussian elimination) The forward elimination:. Stop when all visible entries zeros, or no visible entry. 2. Locate leftmost non-zero column, select a non-zero entry, use (row interchange) to move the row to top. Location of this entry: a pivot position. 3. Use (row replacement) to make all entries below it Cover this row and repeat Step 3 for the submatrix below this row. 23

24 Exercise: Transform to REF: Example: Solve x 2 + x 3 + 2x 4 = 3 x + 2x 2 x 3 = 5 2x + x 2 5x 3 = 0 x 3x 3 + 8x 4 = 3 *** x + 2x 2 x 3 = 5 x 2 + x 3 + 2x 4 = 3 6x 4 = 0 = 0 24

25 Then x 4 = 6. Set x 3 = s (free parameter), then: x 2 = 3 x 3 2x 4 = 0 3 s, x = 5 2x 2 + x 3 = s General solution in parametric form: x = s x 2 = 0 3 s x 3 = s where s is free. x 4 = 6 25

26 Reduced Row Echelon Form (RREF) Further simplify a REF matrix: 4. The leading entry in each non-zero row is Each leading is the only non-zero entry in its column

27 The Row Reduction Algorithm: (Phase 2) The backward elimination: 5. Use (row scaling) to scale all the leading entries to. 6. Working from rightmost leading entries to left, use (row replacement) to make all entries above each of them 0. Exercise: Further transform to RREF: ***

28 Importance of RREF: uniqueness. Thm (P.3): Each matrix is row-equivalent to one and only one reduced row echelon matrix. Because of the above uniqueness property, the concept of pivot position is well defined: Def: A pivot position in a matrix A is a location in A that corresponds to a leading in the RREF of A. Def: A pivot column is a column of A that contains a pivot position. Note that we cannot have two pivot positions sitting in the same row or in the same column. 28

29 Exercise: Determine the pivot positions and pivot columns *** Example: What happen if an augmented matrix has the last column as a pivot column? Like: [ ] Thm 2 (P.2): A linear system is consistent iff the last column of the augmented matrix is not a pivot column. 29

30 Exercise: Find conditions on b, b 2, b 3, b 4 for consistency: x + x 2 + 2x 3 = b 2x + 3x 2 + 2x 3 = b 2 x 2 2x 3 = b 3 3x + 5x 2 + 2x 3 = b 4 *** 30

31 Def: Basic variables: variables correspond to pivot columns. Free variables: variables correspond to non-pivot columns. Common practice: assign free parameters to free variables. Example: Basic variables: x, x 2, x 4. Free variable: x 3. 3

32 Rank of a matrix Def: rank A = no. of pivot positions in A. For a system to be consistent, the last column of its augmented matrix cannot be a pivot column, so: Theorem: A linear system [ A b ] is consistent iff rank A = rank [ A b ]. Theorem: Let [ A b ] represent a consistent system with n variables. Then: no. of free parameters = n rank A. 32

33 Vectors (Geometric): A geometric quantity to measure the difference in locations. Directed interval from point A to point B: A AB A quantity with both length and direction. Zero vector 0: length 0, no direction. B 33

34 Vectors (Geometric): Equality of vectors means same length and same direction will form a parallelogram. B D AB CD A can shift the starting point A. C 34

35 Position Vectors: start from the origin O. OP P (x 0, y 0 ) O Can identify the point P with position vector OP : P (x 0, y 0 ) OP = [ x0 y 0 ] 35

36 Vector Addition: by tip-to-tail method: A AB B BC AB + BC := AC. In coordinate form (position vectors): [ ] [ ] [ x x2 x + x + := 2 y y 2 y + y 2 C ]. 36

37 Scalar Multiplication: by scaling the vector In coordinate form: c [ x0 y 0 ] := [ cx0 cy 0 ]. This number c is usually called a scalar. 37

38 Vectors (Algebraic):. A vector is a collection of no. arranged in column form. u = [ ], v = 2 2 2, 0 = [ ] The size of a vector is the no. of entries in the vector. u is a 2-vector, v is a 3-vector, 0... depends. 3. Usually denoted by bold face letters like u, v, w. 38

39 Equality of Vectors: same size, same corr. entries [ ], and = only when a =, b = 2, c = a b c Notation: The collection of all (real) vectors of size n: R n = { a. a n } : a,..., a n R. 39

40 Operations: Vector addition and Scalar multiplication. Vectors of the same size can be added together: [ ] [ ] [ ] a p a + p + :=. b q b + q Vectors of different sizes cannot be added together. 2. Scalar multiplication of a vector by a number c: [ ] [ ] p cp c :=. q cq This number c is usually called a scalar. 40

41 Operation Rules: Similar to those for numbers For any u, v, w in R n and any numbers c and d (in R):. u + v = v + u 2. (u + v) + w = u + (v + w) 3. u + 0 = 0 + u = u 4. u + ( u) = ( u) + u = 0 5. c(u + v) = cu + cv 6. (c + d)u = cu + du 7. c(du) = (cd)u 8. u = u 4

42 Linear Combination and Span: Def: Let S = {v,..., v k } be a collection of vectors in R n and let c,..., c k be numbers. The following y is called a linear combination (l.c.) of vectors in S: y = c v c k v k. (or simply a l.c. of v,..., v k.) Examples: The followings are l.c. of v, v 2 : 3v + v 2, 2 v, 0. 42

43 [ Exercise: Let v = 2 [ ] [ ] 4 5 Is (i) (ii) 2 5 ], v 2 = [ ] 2. a l.c. of v, v 2? *** Example: Check if y = v = 2 2 3, v 2 = is a l.c. of the vectors: 2, v 3 = 2. 43

44 Sol: Do there exist x, x 2, x 3 such that: x 2 + x x 3 2 = 2 3? (it appears as a vector equation). Rewrite the LHS using vector addition and scalar multiplication: x + x 2 2x 3 = x + x 2 2x 3 x 2x 2 + x 3 2x + x 2 + x 3 = 2 3 x 2x 2 + x 3 = 2 2x + x 2 + x 3 = 3 44

45 The augmented matrix of the system: which is inconsistent. No such x, x 2, x 3 exist. So y can never be written as a l.c. of v, v 2, v 3. Observation: The augmented matrix is simply: [ v v 2 v 3 y ] 45

46 Exercise: Check if y = v = , v 2 = is a l.c. of the vectors: 2 4 ***, v 3 =

47 Fact (P.29): A vector equation x a + x 2 a x n a n = b has the same solution set as the linear system whose augmented matrix is [ a a 2... a n b ]. A solution (x,..., x n ) = (c,..., c n ) corresponds to a way to express b as a l.c. of a,..., a n : b = c a c n a n. 47

48 Def: Let S = {v,..., v k }. The collection of all possible l.c. of vectors in S is called the span of S: Then: Span S := {c v c k v k c,..., c k R}. Thm: Let S = {v,..., v k } be a set of vectors in R n. Then y Span S iff the following augmented matrix is consistent: [ v... v k y ]. 48

49 [ ] Example (i) Span S = {c same as R 2. y [ ] + c 2 c, c 2 R} c 2 (, ) (,) c (,) (, ) x 49

50 Example (ii) Span S = {c same as a plane in R 3. Span S z + c 2 c, c 2 R} (,,) y x (,, ) 50

51 Recall: a vector equation like: x x x 3 3 = is just another way to express the following system: 5x 2x 2 + x 3 = x x 2 + 3x 3 = 4 2x + 4x 2 5x 3 = 20 They have the same solution set in (x, x 2, x 3 ). 5

52 Matrix representation of the system: A = 5 2 3, x = x x x 3, b = By defining Ax to be: Ax := x x x Then the linear system can be written as Ax = b, called a matrix equation. 52

53 Let A be an m n matrix. Write: A = [ a a 2... a n ]. Def: Let x be a vector in R n. The matrix-vector product of A and x, denoted by Ax, is the l.c. of the columns of A using the corresponding entries in x as the weights, i.e. Ax = [ a a 2... a n ] x x 2.. x n := x a + x 2 a x n a n. 53

54 Remark: Ax is defined only when: no. of columns in A = no. of entries in x. Properties of matrix-vector product Ax: Thm 5 (P.39): Let A be an m n matrix, u, v R n, c R. Then: a. A(u + v) = Au + Av b. A(cu) = ca(u) Note: The above properties are called the linear properties of matrix-vector product (see.8). 54

55 Example: Compute Ax where A = Sol: To form [ ] Ax correctly, x must be a 2-vector. x Set: x =. Then x 2 Ax = = [ x x 2 ] x + 2 x 2 3 x + 5 x 2 x + x 2 = x 3 + x

56 Example: Rewrite the following into a matrix equation: [ ] 3 [ ] [ 5 ] 3 [ ] 2 Sol: LHS is a l.c. of the following 4 vectors: [ ], 3 [ ] 2, 2 [ 5 ], We form a matrix A using these vectors: A = [ 2 ] = [ ]. 2 [ 6 5 ]

57 and put the weights (,, 2, 3) of the l.c. into a column vector with the same ordering: x = 2 3 The RHS is [ 6 5 ]. So the matrix equation is: [ ] = 2 3 [ 6 5 ]. 57

58 [ ] 3 [ ] [ 5 ] 3 [ ] 2 = [ 6 5 ] If we change the ordering of vectors: [ ] A 2 = then we should also change the ordering of weights in x : x = 2 [ ] A x = [ ] 3 [ ] [ ]. 2 58

59 Thm 3 (P.36): If A is an m n matrix, b is in R m, the following equations will have the same solution set in (x,..., x n ):. Ax = b 2. x a x n a n = b 3. linear system with augmented matrix: [ a... a n b ] = [ A b ] Exercise: Let Ax = b and Ay = c be consistent systems with solutions x = x 0, y = y 0. Is Az = b + 2c also a consistent system? *** 59

60 Example: Consider A = 2 3 5, b 0 = 5 Q: Is Ax = b 0 consistent? Yes, it has a unique solution: x = 3, x 2 = 2. 60

61 Q2: Is Ax = b consistent for any b in R 3? 2 b 3 5 b 2 b 3 2 b 0 b 2 3b 0 3 b 3 + b 2 b 0 b 2 3b 0 0 b 3 + 3b 2 8b If b 3 + 3b 2 8b 0, the last column of augmented matrix becomes a pivot column and the system will be inconsistent. Problem: Not enough pivot positions in coefficient matrix. 6

62 Example: Consider A = , b = b b 2 b 3 Q2 : Is A x = b consistent for any b in R 3? 2 b b 2 3 b 3 2 b 0 b 2 3b 0 0 b 3 + 3b 2 8b which is consistent for every b, b 2, b 3. 62

63 Def: Let A = [ a... a n ] be an m n matrix. We say that the columns of A span/generate R m if Span {a,..., a n } = R m. i.e. every b R m can be written as a linear combination of the columns of A. And remember that: Ax = b consistent x a x n a n = b consistent b is a l.c. of a,..., a n b is contained in Span {a,..., a n } 63

64 Thm 4 (P.37): Let A be an m n matrix. The followings will be equivalent: a. Ax = b is consistent for each b in R m. b. Each b in R m is a l.c. of the columns of A. c. The columns of A span R m. d. A has a pivot position in every row. Note: A is the coefficient matrix of the system Ax = b. Exercise: Let A be a 5 4 matrix. Can the columns of A span R 5? *** 64

65 Homogeneous System: A linear system with all constant terms being zeros, e.g. x + 2x 2 x 3 = 0 2x 3x 2 5x 3 = 0 3x + x 2 + x 3 = 0 Using matrix-vector notation, we can write it as: where 0 is the zero m-vector. Ax = 0 (A: m n matrix x: n-vector; 0: m-vector) 65

66 Ax = 0 is always consistent as: x = x 2 =... = x n = 0 will be a solution. e.g. (0) + 2(0) (0) = 0 2(0) 3(0) 5(0) = 0 3(0) + (0) + (0) = 0 Such a solution x = 0 (this 0 is an n-vector) is called a zero solution, or a trivial solution. A non-zero solution (or a non-trivial solution) of Ax = 0 refers to a solution other than x = 0. 66

67 So, only two possibilities left. when will it have a unique solution? all variables are basic variables. when will it have infinitely many solutions? there is at least one free variable. Recall: In a coefficient matrix, basic variables pivot columns free variables non-pivot columns 67

68 e.g. coefficient matrix: all are basic variables, unique solution. Another coefficient matrix: i.e. x 3 is a free variable, has infinitely many solutions. 68

69 Further to RREF: General solution in parametric form: x = 5 s x 2 = 3 5 s where s is free. x 3 = s 69

70 We can rewrite the general solution as: x x 2 x 3 = 5 s 3 5 s = s s = sv, where s is free. called the parametric vector form of the solution. Note:. v itself is a solution. 2. every solution can be expressed (as a l.c.) in terms of v. so v is sometimes called a basic solution. 70

71 Example: Solve for general solution: x + x 2 2x 3 + 3x 4 + 4x 5 = 0 2x + x 2 3x 3 + 8x 4 + 5x 5 = 0 x + x 2 2x 3 + 2x 4 + 2x 5 = 0 3x + 2x 2 5x 3 + 0x 4 + 7x 5 = 0 Perform EROs on the coefficient matrix:

72 General solution: x = s + 9t x 2 = s 7t x 3 = s x 4 = 2t x 5 = t In parametric vector form: x 9 x 2 7 x 3 = s + t 0 x x 5 0 where s, t are free. where s, t are free. 72

73 We have a set of two basic solutions {x, x 2 }: x = 0 0, x 2 = such that every solution x can be written as a l.c. of x, x 2. Qn: Is the solution set the same as Span {x, x 2 }? Any missing solutions? (No.) Any false solutions? 73

74 Let v, v 2 be two solutions of Ax = 0. i.e. Av = 0, Av 2 = 0 is 5v a solution? (Yes.) is v + v 2 a solution? (Yes.) is any l.c. of v, v 2 a solution? (Yes.) If v, v 2,..., v n are solutions of Ax = 0, then any vector in Span {v,..., v n } will also be a solution of Ax = 0. So no false solution will be introduced. 74

75 Theorem: Let Ax = 0 have k free variables. general solution can be written as: Then the x = s x s k x k, where {x,..., x k } is a set of basic solutions for the system and s,..., s k are independent free parameters. In other words, the solution set of the homogeneous system is: Span {x,..., x k }. Remark: When Ax = 0 has unique trivial solution, there is no basic solution. And the solution set is just {0}. 75

76 Non-homogeneous system: Ax = b with b 0 (i.e. there are some non-zero entries in b.) e.g x = Let u, u 2 be two solutions of a non-homogeneous system. is 3u a solution? (No.) is u + u 2 a solution? (No.) is u u 2 a solution? (No.) 76

77 Def: Given a non-homogeneous system Ax = b, the system Ax = 0, obtained by replacing b with 0, is called the associated homogeneous system. Thus, if u, u 2 are solutions of Ax = b, then (u u 2 ) will be a solution of Ax = 0. Suppose: one solution u 0 of Ax = b is found. If u is any other solution of Ax = b, we know that A(u u 0 ) = 0. (u u 0 ) = w is a solution of Ax = 0. Then u = u 0 + w. 77

78 i.e. Any solution u of Ax = b will look like u = u 0 + w, where Aw = 0 We know how to determine the general form of w obtain the general solution of Ax = b! Thm 6 (P.46): Let Ax = b be a consistent system with a particular solution u 0. Then the solution set of Ax = b is the set of all vectors of the form u = u 0 + w, where w is the general solution of the associated homogeneous system Ax = 0. 78

79 Example: Solve for general solution: x + x 2 2x 3 + 3x 4 + 4x 5 = 2 2x + x 2 3x 3 + 8x 4 + 5x 5 = 2 x + x 2 2x 3 + 2x 4 + 2x 5 = 0 3x + 2x 2 5x 3 + 0x 4 + 7x 5 = 2 x x 2 x 3 x 4 x 5 = s t where s, t are free. 79

80 Linearly Independent Sets Def: An indexed set of vectors {v,..., v p } is called linearly independent (l.i.) if the vector equation: c v c p v p = 0 has the unique (zero) solution: c =... = c p = 0. Remark: The zero solution is always there. The key point is its uniqueness. 80

81 Example: S = {[ ] [ ]}, is l.i. Sol: Solve the vector equation for x, x 2 : x [ ] + x 2 [ ] = [ ] 0 0 { x + x 2 = 0 x x 2 = 0 The system has a unique solution x = x 2 = 0. So: S = {[ ] [ ]}, is l.i. 8

82 Exercise: Is S a l.i. set? (i) S = { 3, 3, 3 }, (ii) S = {v}, v 0. Checking condition: Check the uniqueness of the zero solution for the equation: c v c p v p = 0 *** 82

83 A set of vectors is called linearly dependent if it is NOT linearly independent. Linearly Dependent Sets Def: A set of vectors {v,..., v p } is called linearly dependent (l.d.) if there are numbers c,..., c p, not all zeros, s.t. c v c p v p = 0. ( ) i.e. The vector eq. has a non-zero solution in c,..., c p. Remark: A non-trivial combination in ( ) is sometimes called a dependence relation among the vectors. 83

84 Exercise: Is S a l.d. set? [ ] [ ] [ ] (i) S = {,, } (ii) S = { 2 0 3, 2 3 4, }. Checking condition: Demonstrate the existence of non-zero solutions, i.e. non-unique solution for the equation: c v c p v p = 0 *** 84

85 Example: S = {u, 0, w} must be l.d. Sol: Of course we have: 0 u w = 0. So the vector equation c u + c c 3 w = 0 has a non-zero solution, and S will be l.d. Obvious generalization: Thm 9 (P.59): If a set S = {v,..., v p } contains the zero vector, then the set is l.d. 85

86 Example: Let (p, q) (, 4) or (2, 5). Show that S must be l.d. {[ ] [ ] [ ]} 2 p S =,,. 4 5 q Sol: We try to solve the vector equation [ ] [ ] [ ] 2 p x + x x 5 3 = q [ ] 0 0 The coefficient matrix is: [ ] 2 p 4 5 q [ ] 2 p. 0 3 q 5p 86

87 So x 3 is always a free variable, and the system will have non-zero solutions. Therefore S must be l.d. Note: From the above example, it is easy to see that if: no. of vectors > no. of entries, then the coefficient matrix will have more columns than rows. exist some non-pivot columns; there are some free variables. So there are always non-zero solutions for the vector equation, thus the vectors must be l.d. 87

88 Thm 8 (P.59) If a set contains more vectors (p) than there are entries in each vector (n), then the set is l.d. e.g. { [ ], 2 [ ] 3, 3 [ ] } 234 : n = 2, p = 3, must be l.d Note: No information in the case p n. The set can be l.i. or l.d. Need to solve the vector equation. Why the words independent, dependent? 88

89 Suppose that {v, v 2, v 3 } is l.d., i.e. there are some numbers c, c 2, c 3, not all zeros, such that: c v + c 2 v 2 + c 3 v 3 = 0. () When c 0, we have v = c (c 2 v 2 + c 3 v 3 ); (2) When c 2 0, we have v 2 = c 2 (c v + c 3 v 3 ); (3) When c 3 0, we have v 3 = c 3 (c v + c 2 v 2 ). i.e. at least one of them can be written as a l.c. of the others. So the word: dependent. 89

90 What if none of the vectors depends on the others? (i.e. they are essentially different vectors.) The equation: c v + c 2 v 2 + c 3 v 3 = 0 cannot have a solution with c 0 or c 2 0 or c 3 0, i.e. can only have the unique zero solution. So the word: independent. Thm 7 (P.58): Let v 0 and p 2: {v,..., v p } is l.d. some v j (j 2) is a l.c. of {v,..., v j }. 90

91 Example: Describe geometrically in R 2 when (i) S = {u, v} is l.d. (ii) S = {u, v} is l.i. y y (i) u v (ii) u x v x 9

92 Example: Describe geometrically in R 3 when (i) S = {u, v, w} is l.d. (ii) S = {u, v, w} is l.i. z z Span {u, v} (i) w u y Span {u, v} w (ii) u y x v x v 92

93 Matrix Transformations: Let A be an m n matrix. Consider a linear system Ax = b. Old viewpoint: equation solving viewpoint b is given, and find x that satisfies Ax = b. New viewpoint: transformation viewpoint study x Ax, see which x lands on b 93

94 Example: Suppose that the following solutions are known [ ] [ ] 0 Ax =, Ax 0 2 =. [ ] 3 How about the solution of Ax =? 2 [ ] [ ] [ ] 3 0 = = 3Ax 2Ax 2 = A(3x 2x 2 ) At least has a solution x = 3x 2x 2. 94

95 Notations and Terminologies: We will denote a matrix transformation by T : R n R m T : x Ax domain: R n, x: an object codomain: R m T (x): the image of x under T, i.e. Ax range: collection of all possible T (x) Note: Though T (x) = Ax for every x, T is NOT a matrix. What is the range of T? 95

96 Range of a matrix transformation: range of T collects all possible T (x). T (x) = Ax = x a x n a n is a l.c. of columns of A i.e. range of T collects all possible l.c. of columns of A Span {a,..., a n } collects all possible l.c. of {a,..., a n } So, we have: range of T = Span {a,..., a n } 96

97 Exercise: Let A = [ ] (i) Describe the matrix transformation T. (ii) What are those x whose images are 0? [ ] (iii) Is in the range of T? *** 97

98 Linear Transformations in general: A transformation T : R n R m is called linear if (a) T (u + v) = T (u) + T (v) (b) T (cu) = ct (u) for any choices of u, v in R n and any choice of number c. We can combine the two conditions together and check if T (k v + k 2 v 2 ) = k T (v ) + k 2 T (v 2 ) is true for any vectors v, v 2 R n and any numbers k, k 2. 98

99 As matrix-vector multiplication satisfies. A(u + v) = Au + Av 2. A(ku) = k(au) Each matrix transformation is also a linear transformation. The converse is also true. See next section. A linear transformation will automatically satisfy: T (0) = 0; T (c v c p v p ) = c T (v ) c p T (v p ). Can write T (u) as T u, if no confusion arises. 99

100 Examples: Linear transformations? [ ] [ ] x x. T = x 2 x 2 (No.) It does not satisfy conditions (a), (b). Counter example: Take [ ] x =, x = [ ] Then, by the defining formula: [ ] [ ] T ( x) = =, but T (x) = [ ] 00

101 Examples: Linear transformations? [ ] x 2. T = x x x 2 (No.) e.g. T (0 2 ) [ ] [ ] x 3x2 x 3. T = (Yes.) x 2 2x + x 2 Need to verify the conditions (a) and (b). *** 0

102 Examples: Linear transformations? [ ] [ ] x x x 4. T = 2 (No). x 2 2x 2 Counter example: Consider [ ] = Then but T [ ] 0 + T T [ ] [ ] 0 [ ] 0 = = + [ ] 0 [ ], 2 [ ] [ ] 0 2 = [ ] 0 2

103 Examples: Linear transformations? [ ] x 5. T = x x x (Yes.) 2 x 2 6. T x [ ] x 2 x = (Yes.) x x

104 Recall: A linear transformation T : R n R m satisfies: T (c u + c 2 v) = c T (u) + c 2 T (v), for any vectors u, v R n and any numbers c, c 2. Old example: Suppose that [ ] Ax =, Ax 0 2 = Then Ax = [ ] 3 2 [ ] 0. has a solution of x = 3x 2x 2 : A(3x 2x 2 ) = 3Ax 2Ax 2 = 3 [ ] 0 2 [ ] 0 = [ ]

105 More generally: When T u and T v are already known, then for any w in Span {u, v}: w is in Span {u, v} w is a l.c. of u, v As T is linear, so we get: there are weights c, c 2 such that w = c u + c 2 v. T w = T (c u + c 2 v) = c T u + c 2 T v Thus T w is already determined. 05

106 Observation: T w = c T u + c 2 T v can be rewritten as: [ ] c T w = [ T u T v ], which looks like a matrix transformation! If Span {u, v} = R 2, the above formula has already determined the action of T for every w in R 2. To avoid possibility of different representations like: c 2 w = c u + c 2 v = d x + d 2 y + d 3 z, we standardize on e, e 2,..., e n for representation. 06

107 Def: Let e, e 2,..., e n be the following vectors in R n : e = x = 0.. 0, e 2 = x.. x n 0.. 0,..., e n = x = x e x n e n. Note: We will be using the same e, etc. for different R n. 07

108 Thm 0 (P.7): Let T : R n R m be a linear transformation and set: A = [ T e... T e n ] Then T x = Ax for all x in R n. Proof: By straightforward generalization: Rewrite x = x e x n e n, then: T x = x T e x n T e n x = [ T e... T e n ]. = Ax. x n 08

109 Def: The matrix A that makes T x = Ax for every x in R n is called the standard matrix of T, given by the formula: A = [ T e... T e n ]. Exercise: Find the standard matrix of a linear transformation T that does: [ ] [ ] T = 2 and T =. 2 2 *** 3 09

110 Example: What is the standard matrix of the rotation R on R 2 by θ in anticlockwise direction? Sol: R is a linear transformation. (check!) Re = [ cos θ sin θ ], Re 2 = [ sin θ cos θ ]. θ θ 0

111 So, the standard matrix of R should be: [ ] cos θ sin θ. sin θ cos θ This gives the transformation formulas: { x = x cos θ y sin θ y = x sin θ + y cos θ Example: What is the standard matrix of the reflection Q on R 2 about a line l passing through O and making angle θ with the positive x-axis?

112 y l Q : v α α O θ x Q(v) Ans: Compute Qe and Qe 2. Then Q = [ Qe Qe 2 ]. [ ] [ ] cos 2θ sin 2θ Qe =, Qe sin 2θ 2 =. cos 2θ 2

113 One-to-One and Onto properties: One-to-one: If T x = b = T x 2, is it necessary that x = x 2? Let A be the standard matrix. Then we ask: If x, x 2 both satisfy Ax = b, must we have x = x 2? i.e. about uniqueness of solution. As T is linear, T x = T x 2 means: 0 = T x T x 2 = T (x x 2 ). If the homogeneous system Ax = 0 has only the zero solution, then x x 2 must be 0 and hence x = x 2. 3

114 Thm (P.76): Let T : R n R m be a linear transformation. Then T is one-to-one iff T x = 0 has only the trivial solution. When will Ax = 0 have only the trivial solution? all variables are basic; all columns of A are pivot columns; Note that Ax = 0 is in fact the following vector equation: x a x n a n = 0. It has only the trivial solution if and only if the vectors a,..., a n are linearly independent. 4

115 One-to-One and Onto properties: Onto: Given any b R m, is it always possible to find x R n such that T (x) = b? i.e. Ax = b is consistent for every b; or Range of T = R m. Note that the range of a matrix transformation is: Span {a,..., a n }. So T is onto if and only if the columns of A spans R m. 5

116 When will the columns of A span R m? Every b is a l.c. of columns of A; Ax = b is consistent for every b; every row of A has a pivot position. Thm 2 (P.77): Let A be the standard matrix of a linear transformation T : R n R m.. T is onto columns of A span R m ; 2. T is one-to-one columns of A are l.i. 6

117 Example: Are the following standard matrices representing one-to-one/onto linear transformations? [ ] 3. A = The columns of A are NOT l.i., e.g. 3 [ ] 0 + [ ] [ ] 2 = [ ] 0. 0 So the linear transf. T corr. to A is NOT one-to-one. Every row of A has a pivot position, so T is onto. 7

118 Exercise: Are the following standard matrices representing one-to-one/onto linear transformations? A = one-to-one. NOT onto. *** 8

119 Example: Are the following standard matrices representing one-to-one/onto linear transformations? [ ] a b 3. A =, b 0. c b 7 Three columns in R 2 must be l.d. (Thm 8). So T is NOT one-to-one. Since b 0, the last two columns of A: [ ] [ ] b b, 7 b 0 6b can span R 2 already. So, using all three columns of A of course can span R 2, i.e. T is onto. 9

120 Example: Are the following standard matrices representing one-to-one/onto linear transformations? 4. A = a b c d e f There are at most two non-zero rows, so at most 2 pivot positions. Must exists a non-pivot column T is NOT one-to-one. The last row contain no pivot position T is NOT onto. 20

121 Example: Are the following standard matrices representing one-to-one/onto linear transformations? 5. A = A There are pivot positions in every column; T is one-to-one. There are pivot positions in every row; T is onto. 2

Chapter 1: Linear Equations

Chapter 1: Linear Equations Chapter : Linear Equations (Last Updated: September, 7) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before

More information

Chapter 1: Linear Equations

Chapter 1: Linear Equations Chapter : Linear Equations (Last Updated: September, 6) The material for these notes is derived primarily from Linear Algebra and its applications by David Lay (4ed).. Systems of Linear Equations Before

More information

Chapter 1: Systems of Linear Equations

Chapter 1: Systems of Linear Equations Chapter : Systems of Linear Equations February, 9 Systems of linear equations Linear systems Lecture 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

More information

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve: MATH 2331 Linear Algebra Section 1.1 Systems of Linear Equations Finding the solution to a set of two equations in two variables: Example 1: Solve: x x = 3 1 2 2x + 4x = 12 1 2 Geometric meaning: Do these

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 x 1,, x n A linear equation in the variables equation that can be written in the form a 1 x 1 + a 2 x 2 + + a n x n

More information

MTH 464: Computational Linear Algebra

MTH 464: Computational Linear Algebra MTH 464: Computational Linear Algebra Lecture Outlines Exam 1 Material Dr. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University January 9, 2018 Linear Algebra (MTH 464)

More information

Notes on Row Reduction

Notes on Row Reduction Notes on Row Reduction Francis J. Narcowich Department of Mathematics Texas A&M University September The Row-Reduction Algorithm The row-reduced form of a matrix contains a great deal of information, both

More information

Row Reduction and Echelon Forms

Row Reduction and Echelon Forms Row Reduction and Echelon Forms 1 / 29 Key Concepts row echelon form, reduced row echelon form pivot position, pivot, pivot column basic variable, free variable general solution, parametric solution existence

More information

Section Gaussian Elimination

Section Gaussian Elimination Section. - Gaussian Elimination A matrix is said to be in row echelon form (REF) if it has the following properties:. The first nonzero entry in any row is a. We call this a leading one or pivot one..

More information

Review Solutions for Exam 1

Review Solutions for Exam 1 Definitions Basic Theorems. Finish the definition: Review Solutions for Exam (a) A linear combination of vectors {v,..., v n } is: any vector of the form c v + c v + + c n v n (b) A set of vectors {v,...,

More information

System of Linear Equations

System of Linear Equations Math 20F Linear Algebra Lecture 2 1 System of Linear Equations Slide 1 Definition 1 Fix a set of numbers a ij, b i, where i = 1,, m and j = 1,, n A system of m linear equations in n variables x j, is given

More information

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix Math 34H EXAM I Do all of the problems below. Point values for each of the problems are adjacent to the problem number. Calculators may be used to check your answer but not to arrive at your answer. That

More information

Study Guide for Linear Algebra Exam 2

Study Guide for Linear Algebra Exam 2 Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real

More information

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015 Midterm 1 Review Written by Victoria Kala vtkala@math.ucsb.edu SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015 Summary This Midterm Review contains notes on sections 1.1 1.5 and 1.7 in your

More information

Linear equations in linear algebra

Linear equations in linear algebra Linear equations in linear algebra Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra Pearson Collections Samy T. Linear

More information

Linear Algebra Exam 1 Spring 2007

Linear Algebra Exam 1 Spring 2007 Linear Algebra Exam 1 Spring 2007 March 15, 2007 Name: SOLUTION KEY (Total 55 points, plus 5 more for Pledged Assignment.) Honor Code Statement: Directions: Complete all problems. Justify all answers/solutions.

More information

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

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

More information

Span & Linear Independence (Pop Quiz)

Span & Linear Independence (Pop Quiz) Span & Linear Independence (Pop Quiz). Consider the following vectors: v = 2, v 2 = 4 5, v 3 = 3 2, v 4 = Is the set of vectors S = {v, v 2, v 3, v 4 } linearly independent? Solution: Notice that the number

More information

Math 54 HW 4 solutions

Math 54 HW 4 solutions Math 54 HW 4 solutions 2.2. Section 2.2 (a) False: Recall that performing a series of elementary row operations A is equivalent to multiplying A by a series of elementary matrices. Suppose that E,...,

More information

Span and Linear Independence

Span and Linear Independence Span and Linear Independence It is common to confuse span and linear independence, because although they are different concepts, they are related. To see their relationship, let s revisit the previous

More information

1300 Linear Algebra and Vector Geometry

1300 Linear Algebra and Vector Geometry 1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Introduction: linear equations Read 1.1 (in the text that is!) Go to course, class webpages.

More information

3.4 Elementary Matrices and Matrix Inverse

3.4 Elementary Matrices and Matrix Inverse Math 220: Summer 2015 3.4 Elementary Matrices and Matrix Inverse A n n elementary matrix is a matrix which is obtained from the n n identity matrix I n n by a single elementary row operation. Elementary

More information

MA 242 LINEAR ALGEBRA C1, Solutions to First Midterm Exam

MA 242 LINEAR ALGEBRA C1, Solutions to First Midterm Exam MA 242 LINEAR ALGEBRA C Solutions to First Midterm Exam Prof Nikola Popovic October 2 9:am - :am Problem ( points) Determine h and k such that the solution set of x + = k 4x + h = 8 (a) is empty (b) contains

More information

1.4 Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. A row echelon form

1.4 Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. A row echelon form 1. Gaussian Elimination Gaussian elimination: an algorithm for finding a (actually the ) reduced row echelon form of a matrix. Original augmented matrix A row echelon form 1 1 0 0 0 1!!!! The reduced row

More information

Solving Linear Systems Using Gaussian Elimination

Solving Linear Systems Using Gaussian Elimination Solving Linear Systems Using Gaussian Elimination 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

More information

MATH 152 Exam 1-Solutions 135 pts. Write your answers on separate paper. You do not need to copy the questions. Show your work!!!

MATH 152 Exam 1-Solutions 135 pts. Write your answers on separate paper. You do not need to copy the questions. Show your work!!! MATH Exam -Solutions pts Write your answers on separate paper. You do not need to copy the questions. Show your work!!!. ( pts) Find the reduced row echelon form of the matrix Solution : 4 4 6 4 4 R R

More information

DEPARTMENT OF MATHEMATICS

DEPARTMENT OF MATHEMATICS DEPARTMENT OF MATHEMATICS. Points: 4+7+4 Ma 322 Solved First Exam February 7, 207 With supplements You are given an augmented matrix of a linear system of equations. Here t is a parameter: 0 4 4 t 0 3

More information

Math113: Linear Algebra. Beifang Chen

Math113: Linear Algebra. Beifang Chen Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary

More information

DEF 1 Let V be a vector space and W be a nonempty subset of V. If W is a vector space w.r.t. the operations, in V, then W is called a subspace of V.

DEF 1 Let V be a vector space and W be a nonempty subset of V. If W is a vector space w.r.t. the operations, in V, then W is called a subspace of V. 6.2 SUBSPACES DEF 1 Let V be a vector space and W be a nonempty subset of V. If W is a vector space w.r.t. the operations, in V, then W is called a subspace of V. HMHsueh 1 EX 1 (Ex. 1) Every vector space

More information

Topic 14 Notes Jeremy Orloff

Topic 14 Notes Jeremy Orloff Topic 4 Notes Jeremy Orloff 4 Row reduction and subspaces 4. Goals. Be able to put a matrix into row reduced echelon form (RREF) using elementary row operations.. Know the definitions of null and column

More information

Column 3 is fine, so it remains to add Row 2 multiplied by 2 to Row 1. We obtain

Column 3 is fine, so it remains to add Row 2 multiplied by 2 to Row 1. We obtain Section Exercise : We are given the following augumented matrix 3 7 6 3 We have to bring it to the diagonal form The entries below the diagonal are already zero, so we work from bottom to top Adding the

More information

Solutions of Linear system, vector and matrix equation

Solutions of Linear system, vector and matrix equation Goals: Solutions of Linear system, vector and matrix equation Solutions of linear system. Vectors, vector equation. Matrix equation. Math 112, Week 2 Suggested Textbook Readings: Sections 1.3, 1.4, 1.5

More information

Review for Chapter 1. Selected Topics

Review for Chapter 1. Selected Topics Review for Chapter 1 Selected Topics Linear Equations We have four equivalent ways of writing linear systems: 1 As a system of equations: 2x 1 + 3x 2 = 7 x 1 x 2 = 5 2 As an augmented matrix: ( 2 3 ) 7

More information

Math 220 F11 Lecture Notes

Math 220 F11 Lecture Notes Math 22 F Lecture Notes William Chen November 4, 2. Lecture. Firstly, lets just get some notation out of the way. Notation. R, Q, C, Z, N,,,, {},, A B. Everyone in high school should have studied equations

More information

Sections 1.5, 1.7. Ma 322 Spring Ma 322. Jan 24-28

Sections 1.5, 1.7. Ma 322 Spring Ma 322. Jan 24-28 Sections 1.5, 1.7 Ma 322 Spring 217 Ma 322 Jan 24-28 Summary ˆ Text: Solution Sets of Linear Systems (1.5),Linear Independence (1.7) ˆ Solutions of homogeneous equations AX =. ˆ Using the rank. ˆ Parametric

More information

Contents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124

Contents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124 Matrices Math 220 Copyright 2016 Pinaki Das This document is freely redistributable under the terms of the GNU Free Documentation License For more information, visit http://wwwgnuorg/copyleft/fdlhtml Contents

More information

Linear Equations in Linear Algebra

Linear Equations in Linear Algebra 1 Linear Equations in Linear Algebra 1.3 VECTOR EQUATIONS VECTOR EQUATIONS Vectors in 2 A matrix with only one column is called a column vector, or simply a vector. An example of a vector with two entries

More information

Ma 322 Spring Ma 322. Jan 18, 20

Ma 322 Spring Ma 322. Jan 18, 20 Ma 322 Spring 2017 Ma 322 Jan 18, 20 Summary ˆ Review of the Standard Gauss Elimination Algorithm: REF+ Backsub ˆ The rank of a matrix. ˆ Vectors and Linear combinations. ˆ Span of a set of vectors. ˆ

More information

BASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C =

BASIC NOTIONS. x + y = 1 3, 3x 5y + z = A + 3B,C + 2D, DC are not defined. A + C = CHAPTER I BASIC NOTIONS (a) 8666 and 8833 (b) a =6,a =4 will work in the first case, but there are no possible such weightings to produce the second case, since Student and Student 3 have to end up with

More information

Matrices and RRE Form

Matrices and RRE Form Matrices and RRE Form Notation R is the real numbers, C is the complex numbers (we will only consider complex numbers towards the end of the course) is read as an element of For instance, x R means that

More information

Math 3C Lecture 20. John Douglas Moore

Math 3C Lecture 20. John Douglas Moore Math 3C Lecture 20 John Douglas Moore May 18, 2009 TENTATIVE FORMULA I Midterm I: 20% Midterm II: 20% Homework: 10% Quizzes: 10% Final: 40% TENTATIVE FORMULA II Higher of two midterms: 30% Homework: 10%

More information

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life

More information

Chapter 1. Vectors, Matrices, and Linear Spaces

Chapter 1. Vectors, Matrices, and Linear Spaces 1.4 Solving Systems of Linear Equations 1 Chapter 1. Vectors, Matrices, and Linear Spaces 1.4. Solving Systems of Linear Equations Note. We give an algorithm for solving a system of linear equations (called

More information

Sections 1.5, 1.7. Ma 322 Fall Ma 322. Sept

Sections 1.5, 1.7. Ma 322 Fall Ma 322. Sept Sections 1.5, 1.7 Ma 322 Fall 213 Ma 322 Sept. 9-13 Summary ˆ Solutions of homogeneous equations AX =. ˆ Using the rank. ˆ Parametric solution of AX = B. ˆ Linear dependence and independence of vectors

More information

1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3.

1. Determine by inspection which of the following sets of vectors is linearly independent. 3 3. 1. Determine by inspection which of the following sets of vectors is linearly independent. (a) (d) 1, 3 4, 1 { [ [,, 1 1] 3]} (b) 1, 4 5, (c) 3 6 (e) 1, 3, 4 4 3 1 4 Solution. The answer is (a): v 1 is

More information

1300 Linear Algebra and Vector Geometry Week 2: Jan , Gauss-Jordan, homogeneous matrices, intro matrix arithmetic

1300 Linear Algebra and Vector Geometry Week 2: Jan , Gauss-Jordan, homogeneous matrices, intro matrix arithmetic 1300 Linear Algebra and Vector Geometry Week 2: Jan 14 18 1.2, 1.3... Gauss-Jordan, homogeneous matrices, intro matrix arithmetic R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca Winter 2019 What

More information

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

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

More information

MATH10212 Linear Algebra B Homework Week 4

MATH10212 Linear Algebra B Homework Week 4 MATH22 Linear Algebra B Homework Week 4 Students are strongly advised to acquire a copy of the Textbook: D. C. Lay Linear Algebra and its Applications. Pearson, 26. ISBN -52-2873-4. Normally, homework

More information

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) 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 and b are

More information

Row Reduced Echelon Form

Row Reduced Echelon Form Math 40 Row Reduced Echelon Form Solving systems of linear equations lies at the heart of linear algebra. In high school we learn to solve systems in or variables using elimination and substitution of

More information

Linear transformations

Linear transformations Linear Algebra with Computer Science Application February 5, 208 Review. Review: linear combinations Given vectors v, v 2,..., v p in R n and scalars c, c 2,..., c p, the vector w defined by w = c v +

More information

Review Notes for Midterm #2

Review Notes for Midterm #2 Review Notes for Midterm #2 Joris Vankerschaver This version: Nov. 2, 200 Abstract This is a summary of the basic definitions and results that we discussed during class. Whenever a proof is provided, I

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

Lecture Notes in Linear Algebra

Lecture Notes in Linear Algebra Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) 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 and b are real numbers. 1

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) 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 and b are real numbers. 1

More information

Recall: Dot product on R 2 : u v = (u 1, u 2 ) (v 1, v 2 ) = u 1 v 1 + u 2 v 2, u u = u u 2 2 = u 2. Geometric Meaning:

Recall: Dot product on R 2 : u v = (u 1, u 2 ) (v 1, v 2 ) = u 1 v 1 + u 2 v 2, u u = u u 2 2 = u 2. Geometric Meaning: Recall: Dot product on R 2 : u v = (u 1, u 2 ) (v 1, v 2 ) = u 1 v 1 + u 2 v 2, u u = u 2 1 + u 2 2 = u 2. Geometric Meaning: u v = u v cos θ. u θ v 1 Reason: The opposite side is given by u v. u v 2 =

More information

Math 54 Homework 3 Solutions 9/

Math 54 Homework 3 Solutions 9/ Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of

More information

1 Last time: linear systems and row operations

1 Last time: linear systems and row operations 1 Last time: linear systems and row operations Here s what we did last time: a system of linear equations or linear system is a list of equations a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22

More information

Math Linear algebra, Spring Semester Dan Abramovich

Math Linear algebra, Spring Semester Dan Abramovich Math 52 - Linear algebra, Spring Semester 22-23 Dan Abramovich Review We saw: an algorithm - row reduction, bringing to reduced echelon form - answers the questions: - consistency (no pivot on right) -

More information

System of Linear Equations

System of Linear Equations Chapter 7 - S&B Gaussian and Gauss-Jordan Elimination We will study systems of linear equations by describing techniques for solving such systems. The preferred solution technique- Gaussian elimination-

More information

EBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal

EBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal EBG # 3 Using Gaussian Elimination (Echelon Form) Gaussian Elimination: 0s below the main diagonal [ x y Augmented matrix: 1 1 17 4 2 48 (Replacement) Replace a row by the sum of itself and a multiple

More information

Linear Algebra Handout

Linear Algebra Handout Linear Algebra Handout References Some material and suggested problems are taken from Fundamentals of Matrix Algebra by Gregory Hartman, which can be found here: http://www.vmi.edu/content.aspx?id=779979.

More information

Chapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.

Chapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer. Chapter 3 Directions: For questions 1-11 mark each statement True or False. Justify each answer. 1. (True False) Asking whether the linear system corresponding to an augmented matrix [ a 1 a 2 a 3 b ]

More information

Lecture 22: Section 4.7

Lecture 22: Section 4.7 Lecture 22: Section 47 Shuanglin Shao December 2, 213 Row Space, Column Space, and Null Space Definition For an m n, a 11 a 12 a 1n a 21 a 22 a 2n A = a m1 a m2 a mn, the vectors r 1 = [ a 11 a 12 a 1n

More information

1 - Systems of Linear Equations

1 - Systems of Linear Equations 1 - Systems of Linear Equations 1.1 Introduction to Systems of Linear Equations Almost every problem in linear algebra will involve solving a system of equations. ü LINEAR EQUATIONS IN n VARIABLES We are

More information

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT Math Camp II Basic Linear Algebra Yiqing Xu MIT Aug 26, 2014 1 Solving Systems of Linear Equations 2 Vectors and Vector Spaces 3 Matrices 4 Least Squares Systems of Linear Equations Definition A linear

More information

MTH 2032 Semester II

MTH 2032 Semester II MTH 232 Semester II 2-2 Linear Algebra Reference Notes Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2 ii Contents Table of Contents

More information

Example: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3

Example: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3 Math 0 Row Reduced Echelon Form Techniques for solving systems of linear equations lie at the heart of linear algebra. In high school we learn to solve systems with or variables using elimination and substitution

More information

Topics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij

Topics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij Topics Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij or a ij lives in row i and column j Definition of a matrix

More information

1 Last time: multiplying vectors matrices

1 Last time: multiplying vectors matrices MATH Linear algebra (Fall 7) Lecture Last time: multiplying vectors matrices Given a matrix A = a a a n a a a n and a vector v = a m a m a mn Av = v a a + v a a v v + + Rn we define a n a n a m a m a mn

More information

Linear Algebra Summary. Based on Linear Algebra and its applications by David C. Lay

Linear Algebra Summary. Based on Linear Algebra and its applications by David C. Lay Linear Algebra Summary Based on Linear Algebra and its applications by David C. Lay Preface The goal of this summary is to offer a complete overview of all theorems and definitions introduced in the chapters

More information

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) 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 and b are

More information

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible. MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:

More information

Math 4377/6308 Advanced Linear Algebra

Math 4377/6308 Advanced Linear Algebra 2. Linear Transformations Math 4377/638 Advanced Linear Algebra 2. Linear Transformations, Null Spaces and Ranges Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/

More information

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ Question No: 1 (Marks: 1) If for a linear transformation the equation T(x) =0 has only the trivial solution then T is One-to-one Onto Question

More information

1. TRUE or FALSE. 2. Find the complete solution set to the system:

1. TRUE or FALSE. 2. Find the complete solution set to the system: TRUE or FALSE (a A homogenous system with more variables than equations has a nonzero solution True (The number of pivots is going to be less than the number of columns and therefore there is a free variable

More information

(i) [7 points] Compute the determinant of the following matrix using cofactor expansion.

(i) [7 points] Compute the determinant of the following matrix using cofactor expansion. Question (i) 7 points] Compute the determinant of the following matrix using cofactor expansion 2 4 2 4 2 Solution: Expand down the second column, since it has the most zeros We get 2 4 determinant = +det

More information

1 Last time: inverses

1 Last time: inverses MATH Linear algebra (Fall 8) Lecture 8 Last time: inverses The following all mean the same thing for a function f : X Y : f is invertible f is one-to-one and onto 3 For each b Y there is exactly one a

More information

Review for Exam 2 Solutions

Review for Exam 2 Solutions Review for Exam 2 Solutions Note: All vector spaces are real vector spaces. Definition 4.4 will be provided on the exam as it appears in the textbook.. Determine if the following sets V together with operations

More information

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same. Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read

More information

Number of solutions of a system

Number of solutions of a system Roberto s Notes on Linear Algebra Chapter 3: Linear systems and matrices Section 7 Number of solutions of a system What you need to know already: How to solve a linear system by using Gauss- Jordan elimination.

More information

Math Linear Algebra Final Exam Review Sheet

Math Linear Algebra Final Exam Review Sheet Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of

More information

Solutions to Exam I MATH 304, section 6

Solutions to Exam I MATH 304, section 6 Solutions to Exam I MATH 304, section 6 YOU MUST SHOW ALL WORK TO GET CREDIT. Problem 1. Let A = 1 2 5 6 1 2 5 6 3 2 0 0 1 3 1 1 2 0 1 3, B =, C =, I = I 0 0 0 1 1 3 4 = 4 4 identity matrix. 3 1 2 6 0

More information

2. Every linear system with the same number of equations as unknowns has a unique solution.

2. Every linear system with the same number of equations as unknowns has a unique solution. 1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations

More information

(c)

(c) 1. Find the reduced echelon form of the matrix 1 1 5 1 8 5. 1 1 1 (a) 3 1 3 0 1 3 1 (b) 0 0 1 (c) 3 0 0 1 0 (d) 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 (e) 1 0 5 0 0 1 3 0 0 0 0 Solution. 1 1 1 1 1 1 1 1

More information

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix Pre-Calculus I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural

More information

Lecture 2 Systems of Linear Equations and Matrices, Continued

Lecture 2 Systems of Linear Equations and Matrices, Continued Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions

More information

Linear Algebra Highlights

Linear Algebra Highlights Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to

More information

web: HOMEWORK 1

web:   HOMEWORK 1 MAT 207 LINEAR ALGEBRA I 2009207 Dokuz Eylül University, Faculty of Science, Department of Mathematics Instructor: Engin Mermut web: http://kisideuedutr/enginmermut/ HOMEWORK VECTORS IN THE n-dimensional

More information

Matrices and systems of linear equations

Matrices and systems of linear equations Matrices and systems of linear equations Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T.

More information

The Gauss-Jordan Elimination Algorithm

The Gauss-Jordan Elimination Algorithm The Gauss-Jordan Elimination Algorithm Solving Systems of Real Linear Equations A. Havens Department of Mathematics University of Massachusetts, Amherst January 24, 2018 Outline 1 Definitions Echelon Forms

More information

Example: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3

Example: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3 Linear Algebra Row Reduced Echelon Form Techniques for solving systems of linear equations lie at the heart of linear algebra. In high school we learn to solve systems with or variables using elimination

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

Rank, Homogenous Systems, Linear Independence

Rank, Homogenous Systems, Linear Independence Sept 11,1 Rank, Homogenous Systems, Linear Independence If (A B) is a linear system represented as an augmented matrix then A is called the COEFFICIENT MATRIX and B is (usually) called the RIGHT HAND SIDE

More information

Linear Independence. Linear Algebra MATH Linear Algebra LI or LD Chapter 1, Section 7 1 / 1

Linear Independence. Linear Algebra MATH Linear Algebra LI or LD Chapter 1, Section 7 1 / 1 Linear Independence Linear Algebra MATH 76 Linear Algebra LI or LD Chapter, Section 7 / Linear Combinations and Span Suppose s, s,..., s p are scalars and v, v,..., v p are vectors (all in the same space

More information

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra Section 1.1 System of Linear Equations College of Science MATHS 211: Linear Algebra (University of Bahrain) Linear System 1 / 33 Goals:. 1 Define system of linear equations and their solutions. 2 To represent

More information

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors

More information

Chapter 4. Solving Systems of Equations. Chapter 4

Chapter 4. Solving Systems of Equations. Chapter 4 Solving Systems of Equations 3 Scenarios for Solutions There are three general situations we may find ourselves in when attempting to solve systems of equations: 1 The system could have one unique solution.

More information

Fact: Every matrix transformation is a linear transformation, and vice versa.

Fact: Every matrix transformation is a linear transformation, and vice versa. Linear Transformations Definition: A transformation (or mapping) T is linear if: (i) T (u + v) = T (u) + T (v) for all u, v in the domain of T ; (ii) T (cu) = ct (u) for all scalars c and all u in the

More information