12 System of Linear Equations Case Study 12.2 Solving Equations by Inverses of Matrices 12.3 Solving Equations by Cramer’s Rule 12.4 Solving Equations by Gaussian Elimination 12.5 Homogeneous Systems of Linear Equations Chapter Summary
Case Study In a Biology lesson, Since we know what chemicals are involved in the reaction, let us write down the balanced equation for this process. But we need to know the amount of each chemical first! In a Biology lesson, a group of students are doing experiments to study the process of photosynthesis. During the process, carbon dioxide (CO2) and water (H2O) would be converted into glucose (C6H12O6), and some oxygen (O2) is released: p CO2 q H2O r C6H12O6 s O2 where p, q, r and s are real numbers. In order to balance the equation, the numbers of atoms of carbon (C), oxygen (O) and hydrogen (H) should be the same on both sides of the equation. For example: Number of carbon atoms before the process p p 6r Number of carbon atoms after the process 6r
Case Study Chemical equation: p CO2 q H2O r C6H12O6 s O2 where p, q, r and s are real numbers. Number of C atoms before the process p p 6r Number of C atoms after the process 6r Number of O atoms before the process 2p + q 2p + q 6r + 2s Number of O atoms after the process 6r + 2s Number of H atoms before the process 2q 2q 12r Number of H atoms after the process 12r We can express the above details as a system of linear equations:
12.1 System of Linear Equations A system of m linear equations (or a linear system) in n unknowns x1, x2, x3, ¼, xn is a set of equations of the form The constants aij are called the coefficients of the system of linear equations. For example, is a system of two linear equations with three unknowns x, y and z.
12.1 System of Linear Equations In a system of linear equations, if there exists a set of numbers {N1, N2, …, Nn} satisfying all the equations, then the system is said to be solvable or consistent, and {N1, N2, …, Nn} is called a solution of the system of linear equations. Otherwise, the system is said to be non-solvable or inconsistent. The system of linear equations may be represented by the matrix equation Ax b, where , and . Here, A is called the coefficient matrix, x is called the unknown matrix and (N1, N2, …, Nn)t is called the solution matrix. For example, can be expressed as .
12.2 Solving Equations by Inverses of Matrices Suppose we have a system of linear equations of order 3: We can express the system in the matrix equation Ax b, where A is a 3 3 coefficient matrix. If A is non-singular, then the solution matrix x can be found by computing the inverse of A, and the solution is unique.
12.2 Solving Equations by Inverses of Matrices Theorem 12.1 Let A be a square matrix. If A is non-singular, then the system of linear equations Ax b has a unique solution given by x A1b. Proof: If A is a non-singular matrix, then A1 exists. Ax b (A1A)x A1b Ix A1b x A1b Therefore, the solution of Ax b exists. Now suppose Ax b has two solutions x1 and x2. Then Ax1 b and Ax2 b. x1 A1b and x2 A1b. \ x1 x2 Therefore, the solution of Ax b is unique.
Example 12.1T 12.2 Solving Equations by Inverses of Matrices Solution: Solve by the method of inverse matrix. Solution: Express the system of equations as , where . \ A1 exists and \ The unique solution of the system of linear equations is x 18, y 10.
Example 12.2T 12.2 Solving Equations by Inverses of Matrices Solution: Solve by the method of inverse matrix. Solution: Express the system of equations as where \ A1 exists and
12.2 Solving Equations by Inverses of Matrices We know that a square matrix A is non-singular if and only if |A| 0. Theorem 12.2 Let A be a square matrix. The system of linear equations Ax b has a unique solution if and only if |A| 0. This theorem can be used to test whether a system of linear equations has a unique solution. When |A| 0, A1 does not exist, so the method of inverse matrix cannot be applied. In this situation, either of the following cases will happen: 1. the system of equations does not have any solution, or 2. the system of equations has infinitely many solutions.
Example 12.3T 12.2 Solving Equations by Inverses of Matrices Solution: Determine the number of solutions to the following systems of linear equations. (a) (b) Solution: (a) Rewrite the system of equations as \ The system does not have a unique solution. Consider Since (2) and (3) are the same, we say that equation (2) is redundant and the linear system has only one equation –x + 2y 1. Therefore, the system of linear equation has infinitely many solutions.
Example 12.3T 12.2 Solving Equations by Inverses of Matrices Solution: Determine the number of solutions to the following systems of linear equations. (a) (b) Solution: (b) Rewrite the system of equations as \ The system does not have a unique solution. Consider (3) – (2): 0 5, which is impossible. Therefore, the system of linear equations has no solution.
12.3 Solving Equations by Cramer’s Rule Finding the inverse of the coefficient matrix is sometimes complicated, so in this section we will study how to use Cramer’s rule to solve a system of linear equations in a more convenient way. Theorem 12.3 Cramer’s Rule of Order 2 Given a system of linear equations If the determinant of the coefficient matrix A is non-zero, the unique solution of the system is given by and
12.3 Solving Equations by Cramer’s Rule Proof: From Theorem 12.1, if the determinant of the coefficient matrix A is non-zero, then x A1b, where x and b . For x A1b, we have . Definition of A1 If we express x1 and x2 in determinant form, we can obtain
Example 12.4T 12.3 Solving Equations by Cramer’s Rule Solution: Solve by Cramer’s rule. Solution: The determinant of the coefficient matrix \ The unique solution of the system of linear equations is
12.3 Solving Equations by Cramer’s Rule For systems of linear equations of order 3, Cramer’s rule is stated as follows: Theorem 12.4 Cramer’s Rule of Order 3 Given a linear system If the determinant of the coefficient matrix A is non-zero, the unique solution of the system is given by Comparing Theorems 12.3 and 12.4, we can see that in both cases, the solution xj can be expressed as a fraction with |A| as the denominator, and the numerator is the determinant that replaces the elements in the jth column of A by bi’s.
Example 12.5T 12.3 Solving Equations by Cramer’s Rule Solution: Solve by Cramer’s rule. Solution: The determinant of the coefficient matrix \ The unique solution of the system of linear equations is
12.3 Solving Equations by Cramer’s Rule Although Cramer’s rule can be used to find the solution quickly, the solution is undefined when D |A| 0. So it is only applicable when the coefficient matrix A is a non-singular matrix.
Example 12.6T 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct and a + b + c 0. Solution: (a) The determinant of the coefficient matrix ∆ R2 R1 R2 R3 R1 R3
Example 12.6T 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct and a + b + c 0. Solution: (a) ∵ The system of linear equations has a unique solution. \ D 0 i.e., abc(b – a)(c – a)(c – b)(a + b + c) 0 \ a, b, c are distinct and a + b + c 0. From the given equations, a 0, b 0 and c 0.
(b) Solve the system of linear equations if it has a unique solution. 12.3 Solving Equations by Cramer’s Rule Example 12.6T Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct and a + b + c 0. (b) Solve the system of linear equations if it has a unique solution. Solution: (b) R2 R1 R2 R3 R1 R3 Take out the common factors
(b) Solve the system of linear equations if it has a unique solution. 12.3 Solving Equations by Cramer’s Rule Example 12.6T Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct and a + b + c 0. (b) Solve the system of linear equations if it has a unique solution. Solution: (b)
(b) Solve the system of linear equations if it has a unique solution. 12.3 Solving Equations by Cramer’s Rule Example 12.6T Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct and a + b + c 0. (b) Solve the system of linear equations if it has a unique solution. Solution: (b) The unique solution of the system of linear equations is
12.4 Solving Equations by Gaussian Elimination In the last two sections, we learnt how to solve systems of linear equations of order 2 and 3. However, those methods can only be applied when the coefficient matrix is a non-singular square matrix. If the linear system has an infinite number of solutions, we cannot find the solutions using those methods. Therefore, in this section, we will learn a general method for solving systems of linear equations. Before introducing the method, we first define the row echelon form for a linear system:
12.4 Solving Equations by Gaussian Elimination Definition 12.1 Row Echelon Form A system of linear equations is said to be in row echelon form if it is in the form: The row echelon form of a system of linear equations has the following characteristics: 1. The system contains n unknowns x1, x2, x3, …, xn. 2. The first non-zero term of each row has a coefficient of 1. 3. In any two successive rows, for example, the ith and (i + 1)th rows, if the ith row does not consist entirely of zero terms, then the number of leading zeros in the (i + 1)th row must be greater than the number of leading zeros in the ith row.
12.4 Solving Equations by Gaussian Elimination For example, is in row echelon form, but and are not in row echelon form. If a system of equations is given, we can perform any of the following three elementary transformations to transform it into the row echelon form, without affecting the solution of the system: 1. interchanging the position of two equations, 2. multiplying both sides of an equation by a non-zero number, 3. adding an arbitrary multiple of any equation to another equation.
12.4 Solving Equations by Gaussian Elimination For example, transform the following system of linear equations into row echelon form: Step 1: Interchange (1) and (3), we have Step 2: Add (–2) the 1st equation to the 2nd equation, we have Step 3: Multiply the 2nd equation by , we have Step 4: Add (–2) the 2nd equation to the 3rd equation, we have Step 5: Multiply the 3rd equation by , we have
12.4 Solving Equations by Gaussian Elimination This process of transforming a system into row echelon form is called Gaussian elimination. As shown above, the value of z can be found directly from the third equation, i.e., z 3. By substituting the value of z into the second equation, we can find the value of y. Finally, x can be solved by substituting the values of y and z into the first equation. This process is called back-substitution.
Example 12.7T 12.4 Solving Equations by Gaussian Elimination Solution: Given the system of linear equations (E): (a) Reduce (E) in row echelon form. (b) Hence solve (E). Solution: (a) Interchange the 1st equation and the 2nd equation, we have Add (1) the 3rd equation to the 2nd equation, we have Multiply the 1st equation by –1, we have Add (5) the 1st equation to the 3rd equation, we have
Example 12.7T 12.4 Solving Equations by Gaussian Elimination Solution: Given the system of linear equations (E): (a) Reduce (E) in row echelon form. (b) Hence solve (E). Solution: (a) Add (2) the 2nd equation to the 3rd equation, we have Multiply the 3rd equation by , we have Multiply the 2nd equation by , we have which is the row echelon form of (E).
Example 12.7T 12.4 Solving Equations by Gaussian Elimination Solution: Given the system of linear equations (E): (a) Reduce (E) in row echelon form. (b) Hence solve (E). Solution: (b) From (3), we have z 5. Substituting z 5 into (2), we have y 1. Substituting y 1 and z 5 into (1), we have x 3. \ The unique solution of the system of linear equations is x 3, y 1, z 5.
12.4 Solving Equations by Gaussian Elimination In Gaussian elimination, since the elementary transformations involve the coefficients of the linear system only, we may use matrices to shorten the operations. First we need to define the augmented matrix: Definition 12.2 Augment Matrix Given a system of linear equations, the matrix formed by adding a column of constant terms to the right hand side of the coefficient matrix is called the augmented matrix of the system of linear equations. For example, the augmented matrix of the linear system is given by .
12.4 Solving Equations by Gaussian Elimination Similar to the system of equations, we can also define the row echelon form for a matrix: Definition 12.3 Row Echelon Form for Matrices A matrix is said to be in row echelon form if it satisfies the following conditions: 1. The first non-zero element in each row is 1. 2. For each row which contains non-zero elements, the number of leading zeros must be fewer than the number of leading zeros in the row directly below it. 3. The rows in which all elements are zero are placed below the rows that have non-zero elements. Given an augmented matrix, we can transform it into row echelon form using any of the following three elementary row operations: 1. interchanging the position of two rows, 2. multiplying a row by a non-zero number, 3. adding an arbitrary multiple of any row to another row.
Example 12.8T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of linear equations. (a) (b) Solution: (a) R3 R3 We have . R2 R1 R2 R3 3R1 R3 The unique solution of the system of linear equations is x 1, y 5, z 2. R3 5R2 R3
Example 12.8T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of linear equations. (a) (b) Solution: (b) R2 2R3 R2 R1 (1) R1 R1 R3 R2 R3 R2 2R1 R2 R3 2R1 R3
Example 12.8T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of linear equations. (a) (b) Solution: (b) \ We have . \ The unique solution of the system of linear equations is x 1, y 2, z 1.
12.4 Solving Equations by Gaussian Elimination In addition to solving linear systems with a unique solution, we can also use Gaussian elimination to determine whether the equations in the system are inconsistent or redundant, and thus determine the number of solutions.
Example 12.9T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of equations. (a) (b) Solution: (a) \ We have From equation (3), we have 0 2, which is impossible. Thus, the system of linear equations has no solution.
Example 12.9T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of equations. (a) (b) Solution: (b) \ We have Hence the last equation is redundant which means the system has infinitely many solutions.
Example 12.9T 12.4 Solving Equations by Gaussian Elimination Solution: Using Gaussian elimination, solve the following systems of equations. (a) (b) Solution: (b) Let z t, where t can be any real number. Substituting z t into (2), we have Substituting z t and y 2 + 3t into (1), we have \ The required solution is y 2 + 3t, z t, where t can be any real number.
12.4 Solving Equations by Gaussian Elimination Remarks: The solutions of the systems of linear equations that are expressed in terms of free variable(s) are known as general solutions of the systems. The form of general solutions may not be unique.
Example 12.10T 12.4 Solving Equations by Gaussian Elimination Given a system of linear equations (E): Find the values of a and b such that the system of linear equations (E) has (a) a unique solution, (b) infinitely many solutions, (c) no solution, and solve the system in cases where (E) has solution(s). Solution: Let .
Example 12.10T 12.4 Solving Equations by Gaussian Elimination (a) Find the values of a and b such that the system of linear equations (E) has a unique solution, and solve the system in cases where (E) has solution(s). Solution: (a) If the system of linear equations has a unique solution, then |A| 0. \ –a + 11 0 Hence the conditions for (E) to have a unique solution are a 11 and b can be any real number. By Cramer’s rule, \ The unique solution of the system is
Example 12.10T 12.4 Solving Equations by Gaussian Elimination (b) Find the values of a and b such that the system of linear equations (E) has infinitely many solutions, and solve the system in cases where (E) has solution(s). Solution: (b) If the system of linear equations does not have a unique solution, then |A| 0, i.e., a 11. Using Gaussian elimination, Also if the system has infinitely many solutions, we need b + 7 0. Hence the conditions for (E) to have infinitely many solutions are a 11 and b 7.
Example 12.10T 12.4 Solving Equations by Gaussian Elimination (b) Find the values of a and b such that the system of linear equations (E) has infinitely many solutions, and solve the system in cases where (E) has solution(s). Solution: (b) \ The system of equations can be expressed as Let z t, where t is any real number. Substituting z t into (2), we have y 2t + 4. Substituting z t and y 2t + 4 into (1), we have x 3t 1. \ The required solution is x –3t – 1, y 2t + 4, z t, where t is any real number.
Example 12.10T 12.4 Solving Equations by Gaussian Elimination (c) Find the values of a and b such that the system of linear equations (E) has no solution, and solve the system in cases where (E) has solution(s). Solution: (c) From (a) and (b), if the system of linear equations has no solution, then |A| 0 and b + 7 0. Hence the conditions for (E) to have no solution are a 11 and b 7.
12.5 Homogeneous Systems of Linear Equations For a system of linear equations Ax b, if the constants bi’s are all zero, then the system is said to be homogeneous. For example, is a homogeneous system of linear equations. In the previous sections, all the linear system of equations discussed are non-homogeneous. For solving a system of linear equations, we learnt that there are three possible situations: 1. it has a unique solution; 2. it has no solution; 3. it has infinitely many solutions.
12.5 Homogeneous Systems of Linear Equations However, for a homogeneous system of linear equations (E): it is obvious that x y z 0 is a solution of (E). Thus a homogeneous system always has a solution, and we call this solution a zero solution or a trivial solution. Thus there are only two possibilities for the solutions of homogeneous systems of linear equations: 1. the system has only a trivial solution; 2. a non-trivial solution (i.e., not all x, y and z are zeros) also exists. The nature of the solutions of a homogeneous system can be determined by the following theorem: Theorem 12.5 If the number of unknowns in a homogeneous system equals the number of equations, then it has a non-trivial solution if and only if the coefficient matrix is singular.
12.5 Homogeneous Systems of Linear Equations Proof: ‘If’ part: Consider the linear system Ax 0. If A is singular, then |A| 0. Thus, the system does not have a unique solution. ∴ The system either has no solution, or has infinitely many solutions. Since the linear system has a trivial solution, it is not possible for the system to have no solution. ∴ The system must have infinitely many solutions. ∴ The system must have non-trivial solutions. ‘Only if’ part: We try to prove this by contradiction. Assume A is non-singular and the system has non-trivial solutions. ∵ A is non-singular. ∴ A–1 exists. Then the system has a unique solution x A–10 0. ∴ The system has only trivial solution, which contradicts our assumption. ∴ A must be singular.
Example 12.11T 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following systems of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (a) The determinant of the coefficient matrix 0 By Theorem 12.5, the system has non-trivial solutions. Using Gaussian elimination, we have
Example 12.11T 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following systems of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (a) \ We have Let z t, where t can be any real number, then we have x t and y t. \ The required solution is x –t, y t, z t, where t can be any real number.
Example 12.11T 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following systems of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (b) The determinant of the coefficient matrix –2 0 By Theorem 12.5, the system has a unique trivial solution. \ x 0, y 0, z 0.
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (a) The system can be rewritten as ∵ The system of linear equations has non-trivial solutions.
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (a)
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (b) For k –2,
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: \ We have (b) \ z 0 Let y t, where t can be any real number, then we have x t. \ The required solution is x –t, y t, z 0, where t can be any real number.
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (b) For k 2,
Example 12.12T 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where k is a real constant. (a) Find the values of k such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: \ We have (b) Let z t, where t can be any real number, then we have y 2t, x 2t. \ The required solution is x –2t, y –2t, z t, where t can be any real number.
Example 12.13T 12.5 Homogeneous Systems of Linear Equations Solution: Consider the system of linear equations (*): Find the values of l such that (*) has non-trivial solutions. Solution: The linear system can be rewritten as . Consider the determinant of the coefficient matrix. C2 C3 C2 R2 R3 R2
Example 12.13T 12.5 Homogeneous Systems of Linear Equations Solution: Consider the system of linear equations (*): Find the values of l such that (*) has non-trivial solutions. Solution: If the system has non-trivial solutions, then the determinant D 0. \ 5 – l 0 or l2 + 38 0
Chapter Summary 12.1 System of Linear Equations A system of m linear equations (or a linear system) in n unknowns x1, x2, x3, …, xn is a set of equations of the form It can be represented by the equation Ax = b, where
Chapter Summary 12.2 Solving Equations by Inverses of Matrices Consider a system of linear equations Ax b. 1. It has a unique solution, which is given by x A1b, if and only is |A| 0. 2. It has either no solution or infinitely many solutions if |A| 0.
Chapter Summary 12.3 Solving Equations by Cramer’s Rule Given a system of linear equations If the determinant of the coefficient matrix A is non-zero, the unique solution of the system is given by
Chapter Summary 12.4 Solving Equations by Gaussian Elimination A system of linear equations is said to be in row echelon form if 1. the first non-zero term of each row has a coefficient of 1. 2. in any two successive rows, for example, the ith and (i + 1)th rows, if the ith row does not consist entirely of zero terms, then the number of leading zeros in the (i + 1)th row must be greater than the number of leading zeros in the ith row. A system of equations can be transformed into the row echelon form, without affecting its solution, by any of the following elementary transformations: 1. interchanging the position of two equations; 2. multiplying both sides of an equation by a non-zero number; 3. adding an arbitrary multiple of any equation to another equation.
Chapter Summary 12.5 Homogeneous Systems of Linear Equations For a homogeneous system of linear equations if the number of unknowns equals the number of equations, it has non-trivial solutions if and only if the coefficient matrix is singular. Otherwise the system only has a trivial solution.
Follow-up 12.1 12.2 Solving Equations by Inverses of Matrices Solve by the method of inverse matrix. Solution: Express the system of equations as , where . \ A1 exists and \ The unique solution of the system of linear equations is x 1, y –1.
Follow-up 12.2 12.2 Solving Equations by Inverses of Matrices Solve by the method of inverse matrix. Solution: Express the system of equations as , where . \ A1 exists and The unique solution of the system of linear equations is
Follow-up 12.3 12.2 Solving Equations by Inverses of Matrices Determine the number of solutions to the following systems of linear equations. (a) (b) Solution: (a) Express the system of equations as \ The system does not have a unique solution. Consider (1) 2 + (2): 0 1, which is impossible. Therefore, the system of linear equations has no solution.
Follow-up 12.3 12.2 Solving Equations by Inverses of Matrices Determine the number of solutions to the following systems of linear equations. (a) (b) Solution: (b) Rewrite the system of equations as . \ The system does not have a unique solution. Consider (1) 3: 9x + 3y 3…………(3) Since (2) and (3) are the same, we say that equation (2) is redundant and the linear system has only one equation 3x + y 1. Therefore, the system of linear equations has infinitely many solutions.
Follow-up 12.4 12.3 Solving Equations by Cramer’s Rule Solution: Solve by Cramer’s rule. Solution: The determinant of the coefficient matrix 7 \ The unique solution of the system of linear equations is
Follow-up 12.5 12.3 Solving Equations by Cramer’s Rule Solution: Solve by Cramer’s rule. Solution: The determinant of the coefficient matrix 5 \ The unique solution of the system of linear equations is
Follow-up 12.6 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct. Solution: (a) The determinant of the coefficient matrix ∆ ∵ The system of linear equations has a unique solution. R2 R1 R2 R3 R1 R3 D 0, i.e., (b a)(c a)(c b) 0 \ a, b and c must be distinct.
Follow-up 12.6 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct. (b) Solve the system of linear equations if it has a unique solution. Solution: (b) Take out the common factors C1 C2 ; C2 C3 By (a)
Follow-up 12.6 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct. (b) Solve the system of linear equations if it has a unique solution. Solution: (b) R2 R1 R2 R3 R1 R3
Follow-up 12.6 12.3 Solving Equations by Cramer’s Rule Solution: Suppose we have a system of linear equations where a, b and c are real numbers. (a) If the system of linear equations has a unique solution, show that a, b and c are distinct. (b) Solve the system of linear equations if it has a unique solution. Solution: (b) R2 R1 R2 R3 R1 R3
Follow-up 12.7 12.4 Solving Equations by Gaussian Elimination Consider the system of linear equations (E): (a) Reduce (E) in row echelon form. (b) Hence solve (E). Solution: Multiple the 1st equation by (a) Add the 3rd equation to the 2nd equation, Interchange the 1st equation and the 3rd equation, Add the 2nd equation to the 1st equation, which is the row echelon form of (E).
Follow-up 12.7 12.4 Solving Equations by Gaussian Elimination Consider the system of linear equations (E): (a) Reduce (E) in row echelon form. (b) Hence solve (E). Solution: (b) From (3), we have z 5. Substituting z 5 into (2), we have y 1. Substituting y 1 and z 5 into (1), we have x 3. \ The unique solution of the system of linear equations is x 3, y 1, z 5.
Follow-up 12.8 12.4 Solving Equations by Gaussian Elimination Using Gaussian elimination, solve the following systems of linear equations. (a) (b) Solution: (a) R3 R3 \ We have: R2 R1 R2 R3 3R1 R3 R2 R2 \ The unique solution of the system of linear equations is x 1, y 2, z 3. R3 7R2 R3
Follow-up 12.8 12.4 Solving Equations by Gaussian Elimination Using Gaussian elimination, solve the following systems of linear equations. (a) (b) Solution: (b) R1 R3 R1 R2 (1) R2 R1 (1) R1 We have: \ The unique solution of the system of linear equations is x 1, y 5, z 6. R3 2R1 R3
Follow-up 12.9 12.4 Solving Equations by Gaussian Elimination Use Gaussian elimination to solve the following systems of equations. (a) (b) Solution: (a) We have From equation (3), we have 0 12, which is impossible. Thus, the system of linear equations has no solution.
Follow-up 12.9 12.4 Solving Equations by Gaussian Elimination Use Gaussian elimination to solve the following systems of equations. (a) (b) Solution: (b) \ We have
Follow-up 12.9 12.4 Solving Equations by Gaussian Elimination Use Gaussian elimination to solve the following systems of equations. (a) (b) Solution: (b) Hence the last equation is redundant which means the system has infinitely many solutions. Let z t, where t can be any real number. Substituting z t into (2), we have Substituting z t and y –2t – 2 into (1), we have \ The unique solution is x 3t + 2, y 2t – 2, z t, where t can be any real number.
Follow-up 12.10 12.4 Solving Equations by Gaussian Elimination Given a system of linear equations (E): , where m, n are real numbers. Find the values of m and n so that the system of linear equations (E) has (a) a unique solution, (b) infinitely many solutions, (c) no solution, and solve the system in cases where (E) has solution(s). Solution: Let
Follow-up 12.10 12.4 Solving Equations by Gaussian Elimination (a) Find the values of m and n so that the system of linear equations (E) has a unique solution, and solve the system in cases where (E) has solution(s). Solution: (a) If the system of linear equations has a unique solution, then |A| 0. \ –m + 11 0 Hence the condition for (E) to have a unique solution are m 11 and n can be any real number. By Cramer’s rule, \ The unique solution of the system is
Follow-up 12.10 12.4 Solving Equations by Gaussian Elimination (b) Find the values of m and n so that the system of linear equations (E) has infinitely many solutions, and solve the system in cases where (E) has solution(s). Solution: (b) If the system of linear equations does not have a unique solution, |A| 0, i.e., m 11. Using Gaussian elimination, Also, if the system has infinitely many solutions, we need 6 – 3n 0. Hence the condition for (E) to have infinitely many solutions are m 11 and n 2.
Follow-up 12.10 12.4 Solving Equations by Gaussian Elimination (b) Find the values of m and n so that the system of linear equations (E) has infinitely many solutions, and solve the system in cases where (E) has solution(s). Solution: (b) \ The system of equations can be expressed as Let z t, where t is any real number. Substituting z t into (2), we have y 1 – 4t. Substituting z t and y 1 – 4t into (1), we have x 5t. \ The required solution is x 5t, y 1 4t, z t, where t is any real number.
Follow-up 12.10 12.4 Solving Equations by Gaussian Elimination (c) Find the values of m and n so that the system of linear equations (E) has no solution, and solve the system in cases where (E) has solution(s). Solution: (c) From (a) and (b), if the system of linear equations has no solution, then |A| 0 and –m + 11 0. Hence the conditions for (E) to have no solution are m 11 and n 2.
Follow-up 12.11 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following system of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (a) The determinant of the coefficient matrix 0 By Theorem 12.5, the system has non-trivial solutions. Using Gaussian elimination, we have
Follow-up 12.11 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following system of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (a) We have Let z t, where t can be any real number, then we have x 0 and y t. \ The required solution is x 0, y t, z t, where t can be any real number.
Follow-up 12.11 12.5 Homogeneous Systems of Linear Equations Solution: Solve the following system of linear equations and determine whether they have trivial or non-trivial solutions. (a) (b) Solution: (b) The determinant of the coefficient matrix 6 0 By Theorem 12.5, the system has a unique trivial solution. \ x 0, y 0, z 0.
Follow-up 12.12 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where m is a real constant. (a) Find the values of m such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (a) The system can be rewritten as The system of linear equations has non-trivial solutions.
Follow-up 12.12 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where m is a real constant. (a) Find the values of m such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (a)
Follow-up 12.12 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where m is a real constant. (a) Find the values of m such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (b) For m 1, \ We have Let z t, where t can be any real number, then we have y 0, x 2t. \ The required solution is x 2t, y 0, z t, where t can be any real number.
Follow-up 12.12 12.5 Homogeneous Systems of Linear Equations Solution: Given a system of linear equations (E): , where m is a real constant. (a) Find the values of m such that (E) has non-trivial solutions. (b) Hence solve the system of linear equations. Solution: (b) For m 2, \ We have Let z t, where t can be any real number, then we have y t, x t. \ The required solution is x t, y t, z t, where t can be any real number.
Follow-up 12.13 12.5 Homogeneous Systems of Linear Equations Solution: Consider the system of linear equations (*): Find the values of l such that (*) has non-trivial solutions. Solution: The linear system can be rewritten as Consider the determinant of the coefficient matrix. C2 C1 C2; C3 C1 C3 R1 R2 R3 R1
Follow-up 12.13 12.5 Homogeneous Systems of Linear Equations Solution: Consider the system of linear equations (*): Find the values of l such that (*) has non-trivial solutions. Solution: If the system has non-trivial solutions, then the determinant D 0.