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

Size: px
Start display at page:

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

Transcription

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

2 ii

3 Contents Table of Contents iii Matrix Algebra. Real Life Examples Matrix Addition and Scalar Multiplication Matrix Multiplication Special Matrices Partitioned Matrices Inverse of a Matrix Matrix Invertibility Solve Matrix Equations by Inverse Rank of a Matrix Matrix Algebra (True or False) 9 Matrix Algebra (Worked Examples) 3 Linear Equations 4. Systems of m Equations and n Unknowns Solve Systems of Linear Equations Geometrical Interpretation of Solutions Gaussian Elimination (Reduced) Row Echelon Form Elementary Matrices Existence and Uniqueness Homogeneous Systems Fundamental solutions Linear Equations (True or False) 65 Linear Equations (Examples done in Class) 7 3 Vector Spaces 5 3. Geometry of Euclidean vectors in R, R Vector Addition and Scalar Multiplication Linear Combination of Vectors Express Solution in Vector Form Find General Solution from RREF Free Variables and Rank iii

4 CONTENTS 3.7 Vector Spaces and Subspaces Column Space, Row Space and Null Space Span of Vectors Linear Independence Basis of Euclidean Spaces (R n ) Basis of Subspaces (Column Space, Row Space, Null Space) Vector Spaces (True or False) 5 3 Vector Spaces (Worked Examples) 57 4 Determinants and Eigenvalues Find Determinants by Cofactor Expansions Determinants and Inverses Definitions of Egenvalue and Eigenvector Characteristic Equation Diagonalization Diagonalizability Application of Diagonalization Determinants and Eigenvalues (True or False) 93 4 Determinants and Eigenvalues (Worked Examples) 97 5 Vector Geometry 9 5. Geometric Vectors Dot Product and Inner Product Line and Plane Orthogonal and Orthonormal Set Orthogonality and Linear Independence Orthogonal Matrix Orthogonal Projection Gram Schmidt Orthogonalization Projection and Approximation (Least Squares Applications Vector Geometry (True or False) 35 5 Vector Geometry (Worked Examples) 39 6 Miscellaneous Cross Product Linear Transformation Linear Operators and Similarity Fourier Transformation Answers to True or False Questions 6 iv

5 Chapter Matrix Algebra Our ability to analyse and solve linear equations will be greatly enhanced when we can perform algebraic operations with matrices. Furthermore, the definitions and theorems in this chapter provide some basic tools for handling the many applications of linear algebra that involve two or more matrices.. Real Life Examples Matrices are a very important tool in expressing and discussing problems which arise from real life examples. Example. (Electric network) In the following electric network, 5Ω P Ω V + Ω V + i i i Ω 3 Q Figure 5.: An electric network the currents i, i, i 3 satisfy the equations Node P : i +i i 3 =, Node Q : i i +i 3 =, Left loop : 5i +i =, Right loop : i +3i 3 =. The above system of equations is characterized by the following rectangular array of numbers [ ] A b = 5, 3 called the augmented matrix.

6 . Matrix Algebra Example. (Rotation in plane) Consider the rotation by an angle θ in the plane with respect to the origin. The rotation maps a point v = (x, y) to another point v = ( x, ȳ). v = ( x, ȳ) θ v = (x, y) Figure 5.: Rotation by angle θ v may be expressed in terms of v by the formula { x = xcos θ y sin θ, ȳ = xsin θ + y cos θ. The formula is characterized by the following rectangular array of numbers [ ] cos θ sin θ R θ =, sin θ cos θ called the transformation matrix of the rotation. Example.3 (Spring-mass system) In the following spring-mass system (where m, m are masses, and k, k, k 3 are spring constants), k = 7 m = k = 5 m = 8 k 3 = 4 Figure 5.3: Spring-mass system the displacement functions x (t) and x (t) of the two masses satisfy the following equations of motions { x = 7x 5(x x ), x = 6 5 x + x, 8x = 4x 5(x x ), or x = The differential system is characterized by the following array of numbers , 8 8 called the coefficient matrix. 5 8 x 9 8 x.

7 Chapter Linear Equations. Systems of m Equations and n Unknowns In this chapter we first review how systems of linear equations involving two variables are solved using the method of substitution learn in secondary school elementary algebra. (Basic properties of linear equations and lines should be reviewed.) Because the method of substitution is not suitable for linear systems involving large numbers of equations and variables, we then turn to a different method of solution involving the concept of an augmented matrix, which arises quite naturally when dealing with larger linear systems. We then study matrices and matrix basic operations in their own right as a new mathematical tool. With these new operations added to our mathematical toolbox, we return to systems of linear equations from a fresh point of view. A new technique, called the elementary row operations, will play an important role. Solution of systems of linear equations has its own importance in applications and they appear frequently in many practical problems. We briefly review several real life problems in this section. To establish basic concepts, we consider the first simple example. Example. (Systems with two variables) If adult tickets and child ticket cost $8, and if adult ticket and 3 child tickets cost $9, what is the price of each? Solution Let x be the price of adult ticket and y the price of child ticket. Then x + y = 8 and x + 3y = 9. We now have a system of two linear equations with two variables. It is easy to find ordered pairs (x, y) that satisfy one or the other of these equations. For example, the ordered pair (4, ) satisfies the first equation, but not the second, and the ordered pair (6, ) satisfies the second, but not the first. To solve this system, we must find all ordered pairs of real numbers that satisfy both equations at the same time. The set of all such ordered pairs is called the solution set. The method of substitution works nicely for systems involving two variables. By eliminating one variable from these two equations will immediately solve the problem. For example, if we choose to eliminate y, then we may substitute y = 8 x (follows from the first equation) into the second equation. That gives x + 3(8 x) = 9. After solving, we have the solution x = 3 and hence y =. In the following we give another example: The quantity of a product that people are willing to buy during some period of time depends on its price. Generally, the higher the price, the less the demand; the lower the price, the greater the demand. Similarly, the quantity of a product that a supplier is willing to sell 4

8 . Linear Equations during some period of time also depends on the price. Generally, a supplier will be willing to supply more of a product at higher prices and less of a product at lower prices. The simplest supply and demand model is a linear model where the graphs of a demand equation and a supply equation are straight lines. Example. (Supply and demand) Suppose that we are interested in analyzing the sale of cherries each day in Hong Kong. Using special analytical techniques (regression analysis) and data collected, an analysis arrives at the following pricedemand and price-supply models: p = q + 4, (Price-demand equation, consumer) p =.7q + 7.6, (Price-supply equation, supplier) where q represents the quantity of cherries in thousands of pounds and p represents the price in dollars. For example, we see that consumers will purchase thousand pounds (q = ) when the price is p = () + 4 = dollars per pound. On the other hand, suppliers will be willing to supply 7.74 thousand pounds of cherries at dollars per pound (solve =.7q + 7.6). Thus, at $ per pound the suppliers are willing to supply more cherries than consumers are willing to purchase. The supply exceeds the demand at that price and the price will come down. At what price will cherries stabilize for the day? That is, at what price will supply equal demand? This price, if it exists, is called the equilibrium price, and the quantity sold at that price is called the equilibrium quantity. The result could also be interpreted geometrically. The point where the two straight lines (two curves in general) for the price-demand equation and the price-supply equation intersect is called the equilibrium point. How do we find these quantities? Solution We solve the linear system p = q + 4, (Demand equation) p =.7q (Supply equation) by using the method of substitution (substituting p = q + 4 into the second equation) q + 4 =.7q + 7.6,.7q = 3.4, q = thousand pounds. (equilibrium quantity) Now substitute q = back into either of the original equations in the system and solve for p (we choose the first equation) p = () + 4 = 6. dollars per pound. (equilibrium price) If the price is above the equilibrium price of $6. per pound, the supply will exceed the demand and the price will come down. If the price is below the equilibrium price of $6. per pound, the demand will exceed the supply and the price will rise. Thus, the price will reach equilibrium at $6.. At this price, suppliers will supply thousand pounds of cherries and consumers will purchase thousand pounds. 4

9 . Solve Systems of Linear Equations. Solve Systems of Linear Equations The substitution method used in the previous examples is an algebraic method that is easy to use and provides exact solutions to a system of two equations with two variables, provided that solutions exist. We now define some terms that we can use to describe the different types of solutions to systems of equations that we will encounter. Solutions may exist or may not exist. See the following definition. Definition A system of linear equations is called consistent if it has one or more solutions and inconsistent if no solutions exist. Furthermore, a consistent system is said to be independent if it has exactly one solution (often referred to the unique solution) and dependent if it has more than one solution (referred to infinitely many solutions). Two systems of linear equations are equivalent if they have the same solution set. Referring to the system in Example., the system is a consistent and independent system with exactly one solution x = 3, y =. A natural question may arise: Can a consistent system have exactly two solutions? Exactly three solutions? The answer is simply NO. For example, by geometrically interpreting a system of two linear equations with two variables, we gain useful information about what to expect in the way of solutions to the system. In general, any two lines in a coordinate plane must intersect in exactly one point, be parallel, or coincide (have identical graphs). In fact there are only three possible types of solutions for systems of two linear equations in two variables. These ideas are illustrated geometrically in the following. Given a system of linear equations, we will have one of the three possibilities for the number of solutions.. Exactly one solution (i.e., a unique solution).. No solution. 3. Infinitely many solutions (i.e., non-unique solutions). Let us first review what are solutions to systems of two linear equations with two variables and its geometrical interpretation. 43

10 . Linear Equations.3 Geometrical Interpretation of Solutions The pair x =, x = 3 is a solution of the following system of linear equations { x x =, x + x = because if we replace the variables by the given values, then the two equalities hold. Another pair x =, x = is not a solution because the first equality does not hold. x (, 3) x + x = (, ) x x x = Figure.: Unique solution The two linear equations represent two straight lines on the (two-dimensional) plane. The solution (x, x ) = (, 3) of the system of the two equations is the intersection of the two lines. In particular, we can find exactly one solution. The following system of linear equations { x x =, 4x x = represents two different parallel lines. Since the two lines never meet, the system does not have any solution. x 4x x = x x x = Figure.: No solution The following system of linear equations { x x =, 4x x = 44

11 .3 Geometrical Interpretation of Solutions represents two identical lines. Any point on the line is a solution to the system. In particular, the system has infinitely many solutions. x x x = 4x x = x Figure.3: Infinite number of solutions The geometrical interpretation of the solution of linear equations can be extended to more variables and more equations. For example, one linear equation with three variables a x + a x + a 3x 3 = b is represented by a plane in the (three-dimensional) space. A system of two linear equations with three variables is represented by two planes. The following are the possible intersections (= solution to the system) of the two planes. line of solutions no solution plane of solutions Figure.4: Intersection of two planes In Figure.4, we observed that a system of linear equations with 3 variables cannot have a unique solution. In that case, if the system is consistent, it must have infinitely many solutions. In the following we also give some examples of linear systems of more than two variables. Just remark that no professional knowledge in chemistry nor physics is needed for this elementary course MATH 3, the following two examples are only used for illustrating the wide applicability of linear systems to real life examples. Example.3 (Electric network) In the following electric network, 5Ω P Ω V + Ω V + i i i Ω 3 Q Figure.5: An electric network 45

12 . Linear Equations the currents i, i, i 3 satisfy the equations Node P : i +i i 3 =, Node Q : i i +i 3 =, Left loop : 5i +i =, Right loop : i +3i 3 =. Example.4 (Linear equations in four variables) In order to balance the following chemical reaction x CH 4 + x O y CO + y H O, the number of molecules x, x, y, y must satisfy x y =, 4x y =, x y y =. Remind you that there is no geometrical meaning to the system of more than three variables. Referring to the systems in Examples.3.4, the first system (four equations with three variables) is a consistent and independent system with the unique solution: i = 78/3, i = 5/3, i 3 = 37/3. The second system (three equations with four variables) is a consistent and dependent system with an infinite number of solutions. Remark that for these two examples the method of substitution seems to be not as efficient as for the system of two equations with two variables. Students may try it out. Indeed we compute the solutions by a more general and efficient method called the Gaussian elimination. This method will be discussed in Section.4 (page 48). But before we go into the details of this new method we need to borrow some terminologies in matrices and express the problem in another point of view. Let us recall that a linear equation is a x + a x + + a nx n = b. We call a, a,, a n the coefficients of the equation, and x, x,, x n the variables of the equation. A system of linear equations is a list of linear equations. For example, a system of four equations with three variables (we say a four by three system ) is a x + a x + a 3x 3 = b, a x + a x + a 3x 3 = b, a 3x + a 3x + a 33x 3 = b 3, a 4x + a 4x + a 43x 3 = b 4. The system is completely characterized (besides the notations for the variables) by the following rectangular array of numbers called the coefficient matrix a a a 3 A = a a a 3 a 3 a 3 a 33 a 4 a 4 a 43 (.) 46

13 .3 Geometrical Interpretation of Solutions and the right side b b = b b 3. b 4 The system also corresponds to the augmented matrix a a a 3 b [ ] A b = a a a 3 b a 3 a 3 a 33 b 3. a 4 a 4 a 43 b 4 We emphasize the following correspondence columns of A variables, rows of [ A b ] equations. (.) Example.5 (Augmented matrix) The augmented matrices of the systems in Examples.3 and.4 are respectively 5 and 4. 3 In terms of matrices, the system (.) is equivalent to simply Ax = b, where x = (x, x, x 3). Next we review some basic operations of matrices which will be useful to our later discussion of solving general system Ax = b by Gaussian elimination. In Chapter we will confine our attention to the world of matrices. Now, we will focus on the techniques of solving systems of linear equations. 47

14 . Linear Equations.4 Gaussian Elimination The method of substitution may work well for systems involving two variables. However, it is not easily extended to larger systems. In fact, the most efficient and practical way for solving systems of linear equations is through an algorithm called Gaussian elimination. The idea is to simplify the system by creating as many zeros as in the coefficients. The solution may then be easily deduced from the simplified system. The Gaussian elimination is probably the most important method of solution. It readily generalizes to larger systems and forms the basis for computer-based solution methods. As a matter of fact, all the important computer packages nowadays for solving systems of linear equations are based on Gaussian elimination. If you have learned before to use the Cramer s rule to solve systems of linear equations, then you should forget this old method as soon as possible. Cramer s rule is a limited method because of the following:. The computation of determinants is much more complicated than elimination.. Cramer s rule cannot solve underdetermined (such as equations, 3 variables) or overdetermined (such as 3 equations, variables) systems. Gaussian elimination has no such limitations and indeed it works for any linear systems of m equations with n variables, where m < n, m = n, m > n are all permissible. Now, with some knowledge of matrix notations and operations (details can be found in Chapter ) we are going to introduce the method of Gaussian elimination formally. But, first of all, we would also like to give you the insight of how and why the method works. Let s read the very simple example. Example.6 (Equivalent equations) To solve an equation such as x 5 = 3, we perform permissible operations on the equation until we reach an equivalent equation whose solution is obvious. x 5 = 3, x = 3 + 5, x = 8, x = 8, x = 4. Recall that we added 5 to both sides in the second step and divided both sides by in the fourth step. These two operations simply convert the equation x 5 = 3 to an equivalent equation x = 4. The solution follows as we wish. The following theorem indicates that we can solve systems of linear equations in a similar manner. Theorem.4. (Three operations that produce equivalent systems) A system of linear equations is transformed into an equivalent system if (A) (B) (C) Two equations are interchanged. An equation is multiplied by a nonzero constant. A constant multiple of one equation is added to another equation. 48

15 .4 Gaussian Elimination Any one of the three operations in Theorem.4. can be used to produce an equivalent system. The basic principle here is to transform a given (complicated) system into an equivalent but simpler system through a series of operations. Based on this principle we have to eliminate as many variables as possible. A system Ax = b of linear equations is completely characterized by its augmented matrix [ A b ], as we mentioned in Section.3 (page 46). Gaussian elimination can then be considered as a manipulation on the augmented matrix. In the following examples, we indicate the relation by writing systems and augmented matrices side by side. Theorem.4. is used in the examples that rows of [ A b ] are equivalent to equations. Example.7 ( system with unique solution) Solve the system of linear equations { x x =, x +x =. Solution Let us solve the system { x x =, x +x =. [ ] We do the row operation R + R (add twice of second equation/row to the first equation/row) to obtain { x = 3, x +x =. [ ] 3 We may further do R R (exchange the first and the second equations/rows) so that the equations are listed from the most complicated to the simplest { x +x =, x = 3. [ ] 3 Substituting x = 3 into the first equation, we get x = x =. Example.8 (3 3 system with unique solution) Solve the system of linear equations x +x +x 3 =, x +3x +x 3 =, 3x +8x +x 3 =. Solution Let us solve the system x +x +x 3 =, x +3x +x 3 =, 3x +8x +x 3 =. We do R + R and 3R + R 3 to get x +x +x 3 =, x =, 5x x 3 =

16 . Linear Equations Then we do 5R + R 3 to get x +x +x 3 =, x =, x 3 = 4. 4 This corresponds to x = and x 3 = 4. Substituting them into the first equation, we have x = 6. Example.9 (3 3 system without solution) Solve the system of linear equations x +x +x 3 =, x +3x x 3 = 4, x x 3 =. Solution We simplify the augmented matrix as follows 3 4 R +R R R +R 3. Interpreted as a system of linear equations, we have x +x +x 3 =, x x 3 =, =. The last equation is a contradiction which implies that the system has no solution. Example. (3 3 system with non-unique solutions) Solve the system of linear equations x x +3x 3 = 3, 3x +x +x 3 = 5, x x 3 =. Solution We simplify the augmented matrix as follows R +R R 3 +R R R Interpreted as a system of linear equations, we have x x +3x 3 = 3, x x 3 =, =. 5

17 .4 Gaussian Elimination The last equation is redundant. From the second equation, we have x = x 3. Substituting this into the first equation, we have x = (x 3 ) 3x = x 3 +. The system has non-unique solutions (x, x, x 3) = ( r +, r, r), for any real number r. 5

18 . Linear Equations To summarize, the Gaussian elimination is done through the following three operations. Table.: Three (row) operations used in the Gaussian elimination. notation rr i + R j rr i R i R j description adding r times the i-th equation/row to the j-th equation/row multiplying r to the i-th equation/row exchanging the i-th equation/row with the j-th equation/row When applied to matrices, the three operations are also called row operations. The three operations do not change the solutions of the system of equations. By making use of the three operations, the system may eventually be simplified to the following upper triangular shape.... Then one may solve the system by backward substitution (i.e., solving the system from bottom up, and finding the values of more and more variables). Example. (4 3 system with unique solution) Solve the system of linear equations x x +x 3 =, x +x x 3 =, x +4x = 5, x +3x 3 =. Solution Let us solve the system. We simplify the augmented matrix as follows The last row is redundant while the third row implies that x 3 =. Substituting this value into the second row, we have x = 5/. Substituting the values of x and x 3 into the first row, we have x = /. Hence the system has the unique solution (x, x, x 3) = (, 5, ). 5

19 .4 Gaussian Elimination Having discussed how to simplify a system of linear equations, we may ask: how simple can a system be reduced to? The answer to the question can tell us a lot of information about the solutions of the system, particularly the existence and uniqueness of solutions. Row Echelon Form In Examples.7,.8,.9, and., the systems (or rather, the augmented matrices [ A b ] ) are reduced to the following shapes [ ],,,, (.3) where are nonzero numbers, and are any numbers. These are the simplest shapes you can get by the three row operations. These are called the row echelon forms of [ A b ]. Generally speaking, a matrix is called in row echelon form if the following two conditions hold (where a leading nonzero entry of a row of the matrix is the first nonzero element in the row counted from the left): () All zero rows, if any, are at the bottom of the matrix. () Each leading nonzero entry in a row is to the right of the leading nonzero entry in the preceding row. Example. (Row echelon form) The following are all the possible row echelon forms of matrices ( simplest shapes of linear equations with variable). [ ] [ ] [ ] [ ],,,. The following are all the possible row echelon forms of 3 3 matrices ( simplest shapes of 3 linear equations with variables).,,,,,,. In a row echelon form, the entry denoted by is located further and further to the right when one goes from the top to the bottom. We call these entries pivots of the matrix, and the columns containing the pivots the pivot columns of the matrix. Example.3 (Row echelon form) The following is the row echelon form for the augmented matrix in Example.9. The pivots are the (, )-, (, )-, and (3, 4)-entries. The pivot columns are the first, second, and the fourth columns. 53

20 . Linear Equations Example.4 (Row echelon form) The following is a more complicated row echelon form. The pivots are the (, )-, (, 4)-, (3, 5)-, and (4, 7)-entries. The pivot columns are the second, fourth, fifth, and the seventh columns. Example.5 (Non-row echelon form) The matrix is not in row echelon form because the for the second row is after the for the third row. If we exchange the second and the third rows (so that the matrix is further simplified), then we do get a row echelon form. Similarly, the matrix is not in row echelon form because the for the second row is not before the for the third row. Exchanging rows will never give us a row echelon form. We have to use row operations such as R 3 + R and R R 3 (or simply one operation R + R3) to further simplify the matrix in order to get a row echelon form. 54

21 .5 (Reduced) Row Echelon Form.5 (Reduced) Row Echelon Form Row echelon form is the simplest shape one can get by performing row operations. What is the ultimate simplest matrix one can get? Example.6 (Reduced row echelon form) The system in Example.8 (page 49) has been simplified to the following row echelon form. 4 We reduce the coefficient of (3, 3)-pivot to by doing R 3. 4 We cancel entries above the (, 3)-pivot by doing R 3 + R 5. 4 We cancel entries above the (, )-pivot by doing R + R 6. 4 Interpreted the above (reduced) row echelon form as a system of linear equations, we have x = 6, x =, x 3 = 4, which immediately gives the unique solution of the original system. Example.7 (Reduced row echelon form) The system in Example. has been simplified to the following row echelon form 3 3. We use the (, )-pivot to cancel entries above it by doing R + R. Interpreted the above (reduced) row echelon form as a system of linear equations, we have x +x 3 =, x x 3 =, =, which gives the non-unique solutions of the system x = r +, x = r, x 3 = r, with r arbitrary. 55

22 . Linear Equations In similar ways, we may further reduce the row echelon forms (.3) to the following [ ],,,, where are reduced to, the entries above are reduced to, and are again any numbers. These are the simplest matrices you can get by the three row operations, and we call them the reduced row echelon forms of [ A b ]. 56

23 .5 (Reduced) Row Echelon Form Generally speaking, a matrix is called in reduced row echelon form if it is in row echelon form, that is, if it satisfies the two conditions () and () (on page 53), and if it satisfies the following additional two conditions: (3) Each pivot (leading nonzero entry) is equal to. (4) Each pivot is the only nonzero entry in its column. By comparing Examples.6,.7 with Examples.8,., we observe that the advantage of reduced row echelon form is that we can write down the solutions directly, without any backward substitution. Reduced row echelon form of [ A b ] solution of Ax = b. This is called the method of reduction. Example.8 (Reduced row echelon form) The following are all the possible reduced row echelon forms of matrices. [ ] [ ] [ ] [ ],,,. The following are all the possible reduced row echelon forms of 3 3 matrices.,,,,,,. Example.9 (Reduced row echelon form) The following are the reduced row echelon forms of the matrices in Examples.3 and.4 (page 53), respectively.,. 57

24 . Linear Equations.6 Elementary Matrices.7 Existence and Uniqueness In solving a specific system Ax = b of linear equations, we have to first clarify Existence: Does the system have solutions? If the answer is no, then the system has no solution. If the answer is yes, then we may further clarify Uniqueness: Does the system have a single or more than one solutions? If the solution is single, then the system has a unique solution. If the solution is many, then the system has non-unique solutions. Thus a basic question about a system Ax = b is which of the three possibilities (no solution, unique solution, non-unique solutions) is the solution in. The answer to the question can be answered from the row echelon form of the augmented matrix [ A b ]. Furthermore, the solution (if any) of the system is immediately given by the reduced row echelon form of [ A b ]. Example. (Row echelon form vs. existence and uniqueness) Let us recall again the row echelon forms of the systems of three linear equations with three variables in Examples.8,.9 and. (page 49). They are respectively, 4, 3 3. The corresponding reduced row echelon forms are 6, 4,. (.4) The corresponding systems of linear equations and their solutions are x = 6, x =, x 3 = 4 x +x 3 =, x x 3 =, = x +x 3 =, x x 3 =, = = unique solution : x = 6, x =, x 3 = 4, = no solution ( = is a contradiction), = non-unique solutions : x = r +, x = r, x 3 = r. 58

25 .7 Existence and Uniqueness In general, given a system Ax = b of linear equations, we first find the row echelon form of the augmented matrix [ A b ] [ ], from which we can determine which columns of A b are pivot and which are not. Theorem.7. The existence and uniqueness of the solutions of Ax = b is determined by pivot columns of [ A b ] as follows. Pivot columns of [ A b ]. b pivot no solution. b not pivot, all A-columns pivot unique solution Existence and uniqueness for Ax = b 3. b not pivot, not all A-columns pivot non-unique solutions Let us explain in more details of Example. based on the above theorem. By (.4) we circle the pivots in the reduced row echelon forms of the corresponding augmented matrices: 6, 4,. For the first matrix of the above, since the last column (i.e., b-column) is not a pivot column, the corresponding system has solutions. Meanwhile, since the first, second, and third columns (i.e., all the A-columns) are pivot columns, the solution is unique. Therefore the system has a single solution. For the second matrix of the above, since the last column (i.e., b-column) is a pivot column, the system has no solution. For the third matrix of the above, since the last column (i.e., b-column) is not a pivot column and the third column is not a pivot column (i.e., not all A-columns are pivot columns), the system has non-unique solutions. Example. (Determine existence and uniqueness) For which b, b, b 3 that the following system of linear equations has solutions? x +4x = b, x +5x = b, 3x +6x = b 3. Solution We do the row operations, 4 b 5 b 3 6 b 3 R +R 3R +R 3 4 b 3 b b 6 b 3 3b R +R 3 4 b 3 b b. b b + b 3 Thus we conclude that the system has solutions the last column is not pivot b b + b 3 =. Example. (Determine existence and uniqueness) 59

26 . Linear Equations For which values of a that the following system of linear equations x +x x 3 =, x ax 3 =, x +ax = has no solution, unique solution, non-unique solutions? Solution We do the row operations, a R +R a a R +R 3 a (a ) R +R 3 a. a a a Thus we conclude that if. a a ( a, ), then we have a a. a a a a This shows that all except the last column are pivot and hence the system has a unique solution.. a =, then we have a. a This shows that the third and the last columns are not pivot and hence the system has non-unique solutions. 3. a =, then we have a. a This shows that the last column is pivot and hence the system has no solution. 6

27 .8 Homogeneous Systems.8 Homogeneous Systems A linear system is called homogeneous if all the constant terms are zero, like x + x x 3 =, x x + 5x 3 =, 3x + 3x x 3 =. Using matrix-vector notation, we can rewrite the above homogeneous linear system as x Ax =, where A = 5, x = x, =. 3 3 x 3 In general, when A is an m n coefficient matrix, then x will be a vector of size n, and will be a vector of size m (called the zero vector of size m). We will use the same notation for zero vectors of different sizes, as the actual size of the vector is usually quite clear from the context. A homogeneous system is always consistent, as one can easily find a solution for it, namely x = x = =. Such a solution x = (note that is now an n-vector) will be called the zero solution. Because it is trivial to find this solution, we sometimes call it the trivial solution (for the homogeneous system). Therefore, given a homogeneous system, we are interested in whether it has a non-trivial solution, i.e., a solution in which not all the variables are zeros. Recall that the solution set of a linear system has three possible cases: (i) No solution exists: This case will not happen for a homogeneous system. (ii) Has a unique solution: This case happens when all the variables are basic variables, and this unique solution must be the zero solution. (iii) Has infinitely many solution: This case happens when there are at least one free variable(s). So, non-trivial solutions exist only in case (iii). Recall that this will happen when the rank of the coefficient matrix A is smaller than the total number of variables. In particular, it is always the case in the following theorem. Theorem.8. If a homogeneous system Ax = has more unknowns than the equations, it has nontrivial solutions. Proof: Let the size of the coefficient matrix A be m n (m rows and n columns), where m < n. Recall the fact that we cannot have two pivot positions sitting in the same row, so A has at most m pivot positions, i.e., rank A m. Thus, So there will be non-trivial solutions. number of free variables = n rank A n m >. Remark. In case m n, no corresponding results available (may or may not have non-trivial solutions). One need to check directly the existence of free variables instead. 6

28 . Linear Equations.9 Fundamental solutions The augmented matrix of a homogeneous system is of the form [ A ]. Performing row operations to the augmented matrix thus will not change the constant terms, so the resulting new augmented matrix still represents a homogeneous system. In the RREF, we can solve the system by assigning free parameters to the free variables, and then express the basic variables in terms of the free parameters. Let us consider a concrete example. Example.3 (Homogeneous system) Consider the following homogeneous system: x +x x 3 +3x 4 +4x 5 =, x +x 3x 3 +8x 4 +5x 5 =, x +x x 3 +x 4 +x 5 =, 3x +x 5x 3 +x 4 +7x 5 =. Solution First we transform the augmented matrix to its RREF [ ] A = R +R, R +R 3 3 3R +R R +R 4 3 R 3 +R 4 3 R 3 5 R +R 3 9 5R 3 +R R 7 R 3 +R. Set x 3 = s, x 5 = t, then the solution of the system Ax = can be represented as x = s + 9t, x = s 7t, x 3 = s, x 4 = t, x 5 = t. We may also write the solution in vector form: x 9 x x = x 3 x 4 = s + t 7, where s, t R. x 5 The variables can be expressed by using s, t, only as the constant terms are all zeros. Here we observe two specific solutions: 9 7 x = (choose s =, t = ), x = (choose s =, t = ). 6

29 .9 Fundamental solutions We will call them fundamental solutions of the homogeneous system, as all the other solution of the system can be expressed in terms of them. The results of the above example can be generalized to the following theorem. Theorem.9. Let Ax = be a homogeneous system with k free variables. Set s, s,, s k the corresponding free parameters. Then any solution of Ax = can be expressed as to be x = s x + s x + + s k x k, where x i is the solution vector associated to the free parameter s i (i.e., set s i = and all other s j = ). 3 Definition The above solution vectors x, x,, x k are said to form a set of fundamental solutions of the linear system produced by row reduction algorithm. In case Ax = has no free variable, we say that the system has no fundamental solution (but still have the unique zero solution). 4 Definition An expression like s x + s x + + s k x k (where s, s,, s k are numbers) is called a linear combination of x, x,, x k. Example.4 (Fundamental solutions) Find the fundamental solutions, if any, of the homogeneous systems with the following coefficient matrices. [ ] (i), (ii) 5, (iii) 3. 3 Solution We first note that in Example.3 we have applied the row operations to the augmented matrix. If you read the computations carefully, you will see the right side zero vector indeed has no role in the analysis. So we will have the same conclusion if we perform the row operations to the coefficient matrix only. For this example (and from now on), since the constant terms of a homogeneous system are all zeros, we can work directly on the coefficient matrix instead of the augmented matrix (but keep in mind that the last column now corresponds to a variable). For (i), [ ] 3 [ 7 ] [ ]. Therefore, x, x 3 are basic variables, x is a free variable. Set x = s, then x s x = s = s, where s R. x 3 So, there is one fundamental solution of the homogeneous system, which is the vector (,, ). For (ii),

30 . Linear Equations We observe that all the variables of the system are basic variables. So there will be no fundamental solution. For (iii), the coefficient matrix is already in RREF. Therefore, x, x 3, x 5 are basic variables, and x, x 4, x 6 are free variables. Set x = s, x 4 = t, x 6 = u, then x x x 3 x 4 x 5 x 6 = s t s t t u = s + t + u, where s, t, u R. The above three vectors form a set of fundamental solutions of the homogeneous system. 64

31 Chapter Linear Equations (True or False). If A is a square matrix and A = I, then A = I or A = I.. If AB = O, then A = O or B = O..3 If A, B, C are square and ABC = O, then one of them is O..4 If AB = AC, then B = C..5 If A is nonzero and AB = AC, then B = C..6 The square of a nonzero square matrix must be a nonzero matrix..7 If AB = BA, then (A + B) 3 = A 3 + 3A B + 3AB + B 3..8 An invertible matrix must be a square matrix..9 A non-square matrix can never be invertible.. If A has a zero row or a zero column, then A is not invertible.. If A is a square matrix which has no zero rows, then A is invertible. 65

32 . Linear Equations (True or False). Let A, B be invertible matrices of same size. Then AB is also invertible..3 Let A, B be invertible matrices of same size. Then A + B is also invertible..4 If AB is equal to the identity matrix, then A must be an invertible matrix..5 A, B are square matrices. If AB = I, then BA = I. Hence, A is invertible..6 For square matrix A, AA t = I if and only if A t A = I..7 If AB is invertible, then BA is invertible..8 If A O, then A is invertible..9 If A is invertible, then A O.. If A is a square matrix and A + 7A I = O, then A is invertible.. A symmetric matrix must be a square matrix.. If A is symmetric, so are A (if exists) and A 3..3 If B = A t A, then B is symmetric..4 If A is symmetric, so is f(a), for any polynomial f(x)..5 det (A + B) = deta + detb..6 det (ka) = k deta, for any integer k. 66

33 .7 deta t = ( ) deta..8 Three elementary row operations do not change the determinant of a square matrix..9 A row replacement operation does not change the determinant of a matrix..3 If A is row equivalent to B, then deta = detb..3 If A is row equivalent to B, then deta and detb are either both zero or both nonzero..3 The determinant of a triangular matrix is the sum of the entries on the main diagonal..33 Let A be a square matrix without zero rows and columns. Then A must be row equivalent to the identity matrix of same size..34 If A, B are nonzero square matrices and A is row equivalent to B, then both A, B are invertible..35 If A is an invertible matrix and B is row equivalent to A, then B is also invertible..36 rank (ca) = rank A, for any scalar c..37 If A is m n matrix with m < n, then rank A = m..38 If A is m n matrix with m > n, then rank A = m..39 An n n matrix having rank n is invertible..4 If m < n, then the system A m nx = always has a nontrivial solution..4 If A is an m n matrix with m > n, then Ax = always has a nontrivial solution. 67

34 . Linear Equations (True or False).4 If rank A m n = m with m < n, then Ax = b has solutions for all b..43 If rank A m n = m with m < n, then Ax = has only trivial solution..44 If ranka 7 5 = 5, then the solution of Ax = is unique..45 If ranka 7 5 = 5, then Ax = b has solutions for all b..46 If A m nx = b, with m < n, has solutions for all b, then rank A = m..47 If A m nx = b, with m < n, has solutions for all b, then rank A = n..48 If A m nx = b, with m < n, has solutions for all b, then A t x = has only trivial solution..49 If A m nx = b has solutions for all b R m, then m n..5 If A m nx = has only trivial solution, then m n..5 If A m nx = b has solutions for all b R m, then the rank of A is m..5 If A m nx = b has solutions for all b R m, then the rank of A is n..53 If A m nx = has only zero solution, then the rank of A is m..54 If A 3 5x = b has solutions for all b R 3, then A t x = has only trivial solution..55 If A and B have the same rank, then after a finitely many elementary row or column operations we can turn A into B..56 Let A be an n n matrix without zero rows and columns. If the equation Ax = b has a solution for a nonzero vector b R n, then the solution is unique. 68

35 .57 Let A be an n n matrix. If the equation Ax = b has a unique solution for a given nonzero vector b, then deta..58 Let A be an m n matrix. If the equation Ax = b has a unique solution for a nonzero vector b R m, then the homogeneous equation Ax = has only trivial solution..59 Let A be an m n matrix. The equation Ax = has only trivial solution if A has a pivot position on each row..6 Let A be an m n matrix. If Ax = has only trivial solution, then the rank of A is n..6 Let A be an n n matrix. The equation Ax = has a nontrivial solution if and only if deta =..6 Let A be an n n matrix. If the equation Ax = has only trivial solution, then A is row equivalent to the n n identity matrix..63 Let A be an n n matrix. The equation Ax = has only trivial solution if and only if det A..64 Let A be an 3 5 matrix. If the general solution of Ax = has two free parameters, then the rank of A is..65 If A is an 7 matrix, and the general solution of Ax = has 8 free variables, then ranka = If Ax = b has solutions for all b, then the rank of A is the number of columns of A..67 If Ax = b has solutions for all b, then the rank of A is the number of rows of A..68 Suppose A is a non-square matrix and Ax = b has solutions for all b. Then, the number of rows of A must be larger than the number of columns of A..69 If rank [ A b ] > ranka, then Ax = b has no solution. 69

36 . Linear Equations (True or False).7 Let A be a 3 4 matrix. If the first, second, fifth columns of [ A b ] are pivot, then Ax = b has non-unique solutions..7 Let A be a square matrix. Then Ax = b has solutions for all b if Ax = has only trivial solution..7 The equation Ax = has only trivial solution if A is an m n matrix with m > n and does not contain a zero row..73 Let A be a square matrix. Then Ax = b has a unique solution if Ax = has only trivial solution..74 Let A be a 4 3 matrix. If [ A b ] is invertible, then Ax = b has no solution..75 Let A be a square matrix. If Ax = b has no solution for some b, then Ax = has a nontrivial solution..76 The equation Ax = b is consistent if the augmented matrix [ A b ] has a pivot position in every row..77 Let A be an m n matrix, B an n m matrix. Suppose n < m. One can always find A and B such that AB is invertible. 7

37 Chapter Linear Equations (Examples done in Class) Example. (Augmented matrix) Write down the augmented matrix for the system of linear equations. x x 3 = 5, x +x +x 4 =, x 3x 4 =. Suggested Solution 7

38 . Linear Equations (Examples done in Class) Example. (Augmented matrix) Suppose ax + by = represents a straight line which passes through the points (, ) and (3, 4). Write down the augmented matrix for the corresponding system of linear equations for a, b. Suggested Solution 7

39 Example.3 (Row echelon form) Which of the following matrices are in row echelon form? [ ] A =, B =, C = 3, P =, Q =, R =, [ ] [ ] X =, Y =, Z =. Suggested Solution 73

40 . Linear Equations (Examples done in Class) Example.4 (Gaussian elimination unique solution) Solve the system of linear equations x +x x 3 =, x +3x x 3 =, 3x x 3 = 4. Suggested Solution 74

41 Example.5 (Gaussian elimination unique solution) Solve the system of linear equations x +x = 7, x 3x = 7, 3x 5x =. Suggested Solution 75

42 . Linear Equations (Examples done in Class) Example.6 (Gaussian elimination no solution) Solve the system of linear equations { x +y 3z =, x 4y +6z =. Suggested Solution 76

43 Example.7 (Gaussian elimination no solution) Solve the system of linear equations x x =, 3x x +x 3 = 8, x +x +x 3 = 3, x 3x x 3 =. Suggested Solution 77

44 . Linear Equations (Examples done in Class) Example.8 (Gaussian elimination non-unique solutions) Solve the system of linear equations { x x +3x 3 =, x 4x +3x 3 =. Suggested Solution 78

45 Example.9 (Gaussian elimination non-unique solutions) Solve the system of linear equations x x +x 3 =, 3x 6x +7x 3 =, x 4x +3x 3 =. Suggested Solution 79

46 . Linear Equations (Examples done in Class) Example. (Reduced row echelon form) Determine whether the matrices are in reduced row echelon form [ ] 3 A =, B =, C =, D =. Suggested Solution 8

47 Example. (Reduced row echelon form) Find the reduced row echelon form of the matrix Suggested Solution 8

48 . Linear Equations (Examples done in Class) Example. (Reduced row echelon form) Find the reduced row echelon form of the matrix Remark In the following Examples.3., we shall use the method of reduction to solve systems of linear equations. We should emphasize that the method of reduction is just the Gaussian elimination plus some more row eliminations until the augmented matrix is in its reduced row echelon form. The advantage of reduced row echelon form is that we can write down the solutions directly with no backward substitution is needed. Suggested Solution 8

49 Example.3 (Method of reduction unique solution) Solve the system of linear equations x +x 3 =, x +x x 3 = 3, x +x +4x 3 =. Suggested Solution 83

50 . Linear Equations (Examples done in Class) Example.4 (Method of reduction unique solution) Solve the system of linear equations x x =, x +x =, x 3x = 3. Suggested Solution 84

51 Example.5 (Method of reduction unique solution) Solve the system of linear equations x +y z =, x 4z = 8, 3x +y +z =, x y z = 4. Suggested Solution 85

52 . Linear Equations (Examples done in Class) Example.6 (Method of reduction unique solutions) Solve the system of linear equations x +y +z = 4a, x +y +z = 4b, x +y +z = 4c. Suggested Solution 86

53 Example.7 (Method of reduction non-unique solutions) Solve the system of linear equations x x +x 3 =, x +x 3 =, x 3x +4x 3 =. Suggested Solution 87

54 . Linear Equations (Examples done in Class) Example.8 (Method of reduction non-unique solutions) Solve the system of linear equations x +x +3x 3 +4x 4 = 5, x +3x +4x 3 +5x 4 = 6, 3x +4x +5x 3 +6x 4 = 7. Suggested Solution 88

55 Example.9 (Method of reduction non-unique solutions) Solve the system of linear equations x +x +5x 4 =, x +x 3 +x 4 =, x 3x +4x 3 7x 4 =, x x 3 +3x 4 =. Suggested Solution 89

56 . Linear Equations (Examples done in Class) Example. (Method of reduction non-unique solutions) Solve the system of linear equations x +x 3 +x 4 +4x 5 =, x +x 3 3x 4 =, 4x 3x +5x 3 +3x 4 +6x 5 =, x +x +4x 3 5x 4 +4x 5 = 3. Suggested Solution 9

57 Example. (Existence and uniqueness) Find the value of t for which the following system has solution and solve the system for this value of t by the method of reduction x +y =, tx +y = t, ( + t) x +y = 3. Suggested Solution 9

58 . Linear Equations (Examples done in Class) Example. (Existence and uniqueness) Find the value of h for which the following system has solution and solve the system for this value of h by the method of reduction x +x +x 3 =, x +3x +x 3 = 5, x +x +(h 5) x 3 = h. Suggested Solution 9

59 Example.3 (Existence and uniqueness) For which values of a and b does the system has () no solution, () a unique solution, (3) infinitely many solutions? x y +3z = 4, x 3y +az = 5, 3x 4y +5z = b. Suggested Solution 93

60 . Linear Equations (Examples done in Class) Example.4 (Existence and uniqueness) For which values of a does the system has () no solution, () a unique solution, (3) infinitely many solutions? x +y 3z = 4, x +y z =, 4x +5y +(a ) z = a + 6. Suggested Solution 94

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

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations. POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems

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

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB

Glossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the

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

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0. Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the

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

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true? . Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in

More information

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2 Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. Review for Exam. Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions. x + y z = 2 x + 2y + z = 3 x + y + (a 2 5)z = a 2 The augmented matrix for

More information

MAT Linear Algebra Collection of sample exams

MAT Linear Algebra Collection of sample exams MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system

More information

Linear Algebra March 16, 2019

Linear Algebra March 16, 2019 Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented

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

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.] Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the

More information

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural

More information

Reduction to the associated homogeneous system via a particular solution

Reduction to the associated homogeneous system via a particular solution June PURDUE UNIVERSITY Study Guide for the Credit Exam in (MA 5) Linear Algebra This study guide describes briefly the course materials to be covered in MA 5. In order to be qualified for the credit, one

More information

ANSWERS (5 points) Let A be a 2 2 matrix such that A =. Compute A. 2

ANSWERS (5 points) Let A be a 2 2 matrix such that A =. Compute A. 2 MATH 7- Final Exam Sample Problems Spring 7 ANSWERS ) ) ). 5 points) Let A be a matrix such that A =. Compute A. ) A = A ) = ) = ). 5 points) State ) the definition of norm, ) the Cauchy-Schwartz inequality

More information

MTH 2032 SemesterII

MTH 2032 SemesterII MTH 202 SemesterII 2010-11 Linear Algebra Worked Examples Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2011 ii Contents Table of Contents

More information

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Solving a system by back-substitution, checking consistency of a system (no rows of the form MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary

More information

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix

More information

1 9/5 Matrices, vectors, and their applications

1 9/5 Matrices, vectors, and their applications 1 9/5 Matrices, vectors, and their applications Algebra: study of objects and operations on them. Linear algebra: object: matrices and vectors. operations: addition, multiplication etc. Algorithms/Geometric

More information

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.

The value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N. Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class

More information

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system

More information

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge! Math 5- Computation Test September 6 th, 6 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge! Name: Answer Key: Making Math Great Again Be sure to show your work!. (8 points) Consider the following

More information

Introduction to Matrices

Introduction to Matrices POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder

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

Linear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway

Linear Algebra: Lecture Notes. Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway Linear Algebra: Lecture Notes Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics NUI Galway November 6, 23 Contents Systems of Linear Equations 2 Introduction 2 2 Elementary Row

More information

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, Chapter 1: Linear Equations and Matrices MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

More information

a s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula

a s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula Syllabus for Math 308, Paul Smith Book: Kolman-Hill Chapter 1. Linear Equations and Matrices 1.1 Systems of Linear Equations Definition of a linear equation and a solution to a linear equations. Meaning

More information

Chapter 7. Linear Algebra: Matrices, Vectors,

Chapter 7. Linear Algebra: Matrices, Vectors, Chapter 7. Linear Algebra: Matrices, Vectors, Determinants. Linear Systems Linear algebra includes the theory and application of linear systems of equations, linear transformations, and eigenvalue problems.

More information

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a). .(5pts) Let B = 5 5. Compute det(b). (a) (b) (c) 6 (d) (e) 6.(5pts) Determine which statement is not always true for n n matrices A and B. (a) If two rows of A are interchanged to produce B, then det(b)

More information

Vector Spaces, Orthogonality, and Linear Least Squares

Vector Spaces, Orthogonality, and Linear Least Squares Week Vector Spaces, Orthogonality, and Linear Least Squares. Opening Remarks.. Visualizing Planes, Lines, and Solutions Consider the following system of linear equations from the opener for Week 9: χ χ

More information

3 Matrix Algebra. 3.1 Operations on matrices

3 Matrix Algebra. 3.1 Operations on matrices 3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8

More information

All of my class notes can be found at

All of my class notes can be found at My name is Leon Hostetler I am currently a student at Florida State University majoring in physics as well as applied and computational mathematics Feel free to download, print, and use these class notes

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

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics. The Basics of Linear Algebra

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics. The Basics of Linear Algebra Lecture Notes in Mathematics Arkansas Tech University Department of Mathematics The Basics of Linear Algebra Marcel B. Finan c All Rights Reserved Last Updated November 30, 2015 2 Preface Linear algebra

More information

DM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini

DM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini DM559 Linear and Integer Programming Lecture Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Outline 1. 3 A Motivating Example You are organizing

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each

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

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

Conceptual Questions for Review

Conceptual Questions for Review Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.

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

1. Select the unique answer (choice) for each problem. Write only the answer.

1. Select the unique answer (choice) for each problem. Write only the answer. MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +

More information

and let s calculate the image of some vectors under the transformation T.

and let s calculate the image of some vectors under the transformation T. Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =

More information

ANSWERS. E k E 2 E 1 A = B

ANSWERS. E k E 2 E 1 A = B MATH 7- Final Exam Spring ANSWERS Essay Questions points Define an Elementary Matrix Display the fundamental matrix multiply equation which summarizes a sequence of swap, combination and multiply operations,

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 21b. Review for Final Exam

Math 21b. Review for Final Exam Math 21b. Review for Final Exam Thomas W. Judson Spring 2003 General Information The exam is on Thursday, May 15 from 2:15 am to 5:15 pm in Jefferson 250. Please check with the registrar if you have a

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) 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.......

More information

Elementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th.

Elementary Linear Algebra Review for Exam 2 Exam is Monday, November 16th. Elementary Linear Algebra Review for Exam Exam is Monday, November 6th. The exam will cover sections:.4,..4, 5. 5., 7., the class notes on Markov Models. You must be able to do each of the following. Section.4

More information

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each

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

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

1. In this problem, if the statement is always true, circle T; otherwise, circle F. Math 1553, Extra Practice for Midterm 3 (sections 45-65) Solutions 1 In this problem, if the statement is always true, circle T; otherwise, circle F a) T F If A is a square matrix and the homogeneous equation

More information

Chapter Two Elements of Linear Algebra

Chapter Two Elements of Linear Algebra Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to

More information

What is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =

What is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A = STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row

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

LINEAR ALGEBRA SUMMARY SHEET.

LINEAR ALGEBRA SUMMARY SHEET. LINEAR ALGEBRA SUMMARY SHEET RADON ROSBOROUGH https://intuitiveexplanationscom/linear-algebra-summary-sheet/ This document is a concise collection of many of the important theorems of linear algebra, organized

More information

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION

MATH 1120 (LINEAR ALGEBRA 1), FINAL EXAM FALL 2011 SOLUTIONS TO PRACTICE VERSION MATH (LINEAR ALGEBRA ) FINAL EXAM FALL SOLUTIONS TO PRACTICE VERSION Problem (a) For each matrix below (i) find a basis for its column space (ii) find a basis for its row space (iii) determine whether

More information

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to: MAC 2 Module Determinants Learning Objectives Upon completing this module, you should be able to:. Determine the minor, cofactor, and adjoint of a matrix. 2. Evaluate the determinant of a matrix by cofactor

More information

Review problems for MA 54, Fall 2004.

Review problems for MA 54, Fall 2004. Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on

More information

Linear Algebra 1 Exam 1 Solutions 6/12/3

Linear Algebra 1 Exam 1 Solutions 6/12/3 Linear Algebra 1 Exam 1 Solutions 6/12/3 Question 1 Consider the linear system in the variables (x, y, z, t, u), given by the following matrix, in echelon form: 1 2 1 3 1 2 0 1 1 3 1 4 0 0 0 1 2 3 Reduce

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

NOTES FOR LINEAR ALGEBRA 133

NOTES FOR LINEAR ALGEBRA 133 NOTES FOR LINEAR ALGEBRA 33 William J Anderson McGill University These are not official notes for Math 33 identical to the notes projected in class They are intended for Anderson s section 4, and are 2

More information

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

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

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

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

Digital Workbook for GRA 6035 Mathematics

Digital Workbook for GRA 6035 Mathematics Eivind Eriksen Digital Workbook for GRA 6035 Mathematics November 10, 2014 BI Norwegian Business School Contents Part I Lectures in GRA6035 Mathematics 1 Linear Systems and Gaussian Elimination........................

More information

This MUST hold matrix multiplication satisfies the distributive property.

This MUST hold matrix multiplication satisfies the distributive property. The columns of AB are combinations of the columns of A. The reason is that each column of AB equals A times the corresponding column of B. But that is a linear combination of the columns of A with coefficients

More information

LINEAR ALGEBRA QUESTION BANK

LINEAR ALGEBRA QUESTION BANK LINEAR ALGEBRA QUESTION BANK () ( points total) Circle True or False: TRUE / FALSE: If A is any n n matrix, and I n is the n n identity matrix, then I n A = AI n = A. TRUE / FALSE: If A, B are n n matrices,

More information

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.

More information

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2

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

Quizzes for Math 304

Quizzes for Math 304 Quizzes for Math 304 QUIZ. A system of linear equations has augmented matrix 2 4 4 A = 2 0 2 4 3 5 2 a) Write down this system of equations; b) Find the reduced row-echelon form of A; c) What are the pivot

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

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

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero. Finite Mathematics Chapter 2 Section 2.1 Systems of Linear Equations: An Introduction Systems of Equations Recall that a system of two linear equations in two variables may be written in the general form

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

ft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST

ft-uiowa-math2550 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 12/31/2014 at 10:36pm CST me me ft-uiowa-math255 Assignment OptionalFinalExamReviewMultChoiceMEDIUMlengthForm due 2/3/2 at :3pm CST. ( pt) Library/TCNJ/TCNJ LinearSystems/problem3.pg Give a geometric description of the following

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

MATH10212 Linear Algebra B Homework 7

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

More information

MATH 369 Linear Algebra

MATH 369 Linear Algebra Assignment # Problem # A father and his two sons are together 00 years old. The father is twice as old as his older son and 30 years older than his younger son. How old is each person? Problem # 2 Determine

More information

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and

A matrix is a rectangular array of. objects arranged in rows and columns. The objects are called the entries. is called the size of the matrix, and Section 5.5. Matrices and Vectors A matrix is a rectangular array of objects arranged in rows and columns. The objects are called the entries. A matrix with m rows and n columns is called an m n matrix.

More information

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University Systems of Linear Equations By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University Standard of Competency: Understanding the properties of systems of linear equations, matrices,

More information

Some Notes on Linear Algebra

Some Notes on Linear Algebra Some Notes on Linear Algebra prepared for a first course in differential equations Thomas L Scofield Department of Mathematics and Statistics Calvin College 1998 1 The purpose of these notes is to present

More information

MATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.

MATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. MATRICES After studying this chapter you will acquire the skills in knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns. List of

More information

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax = . (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)

More information

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL

MATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left

More information

Math 315: Linear Algebra Solutions to Assignment 7

Math 315: Linear Algebra Solutions to Assignment 7 Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are

More information

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show

Problem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,

More information

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013

Math 323 Exam 2 Sample Problems Solution Guide October 31, 2013 Math Exam Sample Problems Solution Guide October, Note that the following provides a guide to the solutions on the sample problems, but in some cases the complete solution would require more work or justification

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

SUMMARY OF MATH 1600

SUMMARY OF MATH 1600 SUMMARY OF MATH 1600 Note: The following list is intended as a study guide for the final exam. It is a continuation of the study guide for the midterm. It does not claim to be a comprehensive list. You

More information

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1) EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

More information

Linear Algebra: Sample Questions for Exam 2

Linear Algebra: Sample Questions for Exam 2 Linear Algebra: Sample Questions for Exam 2 Instructions: This is not a comprehensive review: there are concepts you need to know that are not included. Be sure you study all the sections of the book and

More information

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.

Remark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero. Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial

More information

is a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]

is a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ] Matrices: Definition: An m n matrix, A m n is a rectangular array of numbers with m rows and n columns: a, a, a,n a, a, a,n A m,n =...... a m, a m, a m,n Each a i,j is the entry at the i th row, j th column.

More information

Math 1553, Introduction to Linear Algebra

Math 1553, Introduction to Linear Algebra Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level

More information

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015

Solutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015 Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See

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

Math 320, spring 2011 before the first midterm

Math 320, spring 2011 before the first midterm Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,

More information