Weβve learned how to take a linear system, turn it into an augmented matrix, and use Gauss-Jordan elimination to put the matrix into reduced row echelon form. We used the reduced row echelon form to see what the solution was to the original linear system, and in all the examples weβve seen so far, there was exactly one solution.
In this section, we consider different possibilities for what the solutions to a linear system can be and see how we can identify those different possibilities from the reduced row echelon form that results after performing Gauss-Jordan elimination.
In ActivityΒ 1.1.3, ExampleΒ 1.1.7, ExampleΒ 1.1.8, ExampleΒ 1.3.5, and all of our other examples of linear systems, there was exactly one solution, that is, one possible assignment of values to the variables which made all of the equations in the system true at the same time. We now consider if that is always the case or not.
Each single equation with two variables can be viewed in this way, as a line in the plane. Letβs now consider systems of linear equations with two equations and two variables, so that there are two lines in the plane.
Since each equation can be viewed as a line and since the slopes of the lines are different, we know the lines will intersect somewhere, and that point of intersection is the only solution to the system.
While this system has two equations, the second is a multiple of the first. The thicker line is used to represent that weβve drawn the same line twice. In this case, we have an infinite solution set, just as if we only had the one equation \(x-y=0\text{.}\)
If the difference between \(x\) and \(y\) is \(0\text{,}\) it canβt also be \(2\text{.}\) This linear system has no solution. We observe that the two lines are parallel and never intersect.
It becomes harder to visualize when we add variables, but no matter how many equations and variables we have, solutions to linear equations always come in one of three forms: exactly one solution, infinite solutions, or no solution. This is a fact that we will not prove here, but it deserves to be stated.
How can we tell whether a given system of linear equations has \(0\text{,}\)\(1\text{,}\) or infinitely many solutions? The answer to this question lies with the reduced row echelon form of its corresponding augmented matrix.
When we are learning a new technique or procedure, itβs good to go through all the steps ourselves because understanding the process has benefits. Thatβs why we typically learn how to add numbers using manipulatives like blocks or fingers, with the goal of eventually being able to add faster without any aids; in fact, we eventually add numbers we never could have represented with physical manipulatives. The focus shifted from the ability to add for its own sake to solving a problem which required addition as a step.
In a similar way, once we are able to perform Gauss-Jordan elimination by hand for small systems, we move to using technology to quickly obtain the reduced row echelon form of a matrix. The focus is no longer on our ability to row reduce for its own sake but on answering a question which requires interpreting the result of row reducing a matrix.
There are many apps, websites, etc., which can produce the reduced row echelon form of a matrix very quickly. This book will use SageMath, a language which is built on Python and free. Hit the βEvaluate (Sage)β button below to see both the matrix and its reduced row echelon form.
The βQQβ in the Sage cell above is present for a technical reason, and the rest of syntax means that \(A\) is being defined as a \(2\times 3\) matrix, whose first row is \([1, 2, 3]\) and whose second row is \([4,5,6]\text{.}\)
Try modifying the contents of the above Sage cell to calculate the reduced row echelon form of a different matrix. Donβt worry about messing anything up beyond repair; refreshing the page will reset the Sage cell back to its initial state.
The key takeaway from ExampleΒ 1.5.5 is: if any row has a leading \(1\) in the last column after row reducing the augmented matrix of a linear system, the system is inconsistent. Otherwise, the system is consistent, which means it has at least 1 solution.
There is no row with a leading \(1\) in the last column. The first row says that \(x_1=-2\) and the second row says that \(x_2=1\text{.}\) If a linear system has a solution, it is consistent.
There is no row with a leading \(1\) in the last column. The first row says that \(x_1+x_2=-3\) and the second row says that \(0x_1+0x_2=0\text{,}\) which is true.
There is a row with a leading \(1\) in the last column. The third row says that \(0x_1+0x_2=1\text{,}\) which is not true for any possible values of \(x_1\) and \(x_2\text{.}\) A system with no solutions is inconsistent.
There is no common point of intersection. Each line is an equation, and there is no point which satisfies all three equations. The linear system pictured has no solution, which means itβs inconsistent.
Weβve now seen a system which has no solution and systems which have exactly one solution such as ExampleΒ 1.3.5, so letβs look next at a system which has infinitely many solutions.
These two equations tell us that the values of \(x_1\) and \(x_2\) depend on what \(x_3\) is. There is no restriction on what \(x_3\) must be; it is free to take on the value of any real number. Since we have infinite choices for the value of \(x_3\text{,}\) we have infinitely many solutions.
In the previous example we used the word βfreeβ to describe a certain variable. What exactly is a free variable? How do we recognize which variables are free and which are not?
DefinitionΒ 1.5.8 applies only to consistent systems. If a system is inconsistent, then itβs meaningless to talk about being free (or not) to pick values for the variables because there are no values which satisfy all the equations in the system.
DefinitionΒ 1.5.8 helps us understand when a consistent system of linear equations will have infinitely many solutions. If a consistent system has no free variables, then there is exactly one solution; inversely, if there are any free variables, then there are infinitely many solutions.
This system doesnβt have an \(x_5\text{.}\) The last column in an augmented matrix corresponds to the constants of the equations, so there are only 4 columns corresponding to variables.
This system doesnβt have an \(x_3\text{.}\) The last column in an augmented matrix corresponds to the constants of the equations, so there are only 2 columns corresponding to variables.
Systems with exactly one solution or no solution are the easiest to deal with; systems with infinite solutions are a bit harder, and we will often want to give one or two of the infinite possibilities.
The easiest way to find a particular solution is to pick specific values for the free variables which then determines the values of the dependent variables.
Answer: We can ignore the third row as it does not give us any information about the solution. The first and second rows can be rewritten as the following equations:
Notice how the variables \(x_1\) and \(x_3\) correspond to the leading \(1\)βs of the given matrix. Therefore \(x_1\) and \(x_3\) are dependent variables; all other variables, in this case \(x_2\) and \(x_4\text{,}\) are free variables.
We generally write our solution with the dependent variables on the left and independent variables and constants on the right. It is also a good practice to acknowledge the fact that our free variables are, in fact, free. So all the solutions to the system would look something like
The constants and coefficients of an augmented matrix work together to determine whether a given system of linear equations has one, infinite, or no solution. The coefficients determine whether a matrix will have exactly one solution or not. In the βor notβ case, the constants determine whether the system has infinite solutions or no solution.
Construct two different inconsistent linear systems with 3 variables. Use Sage or another tool to calculate the reduced row echelon form of the augmented matrix of your linear systems.
Construct a linear system with 5 variables that has infinitely many solutions. Use Sage or another tool to calculate the reduced row echelon form of the augmented matrix of your linear system.
Every linear system has either no solutions, one solution, or infinitely many solutions. We call a linear system which has at least one solution consistent, and we call a linear system with no solutions inconsistent.
To analyze how many solutions a given linear system has, we examine the reduced row echelon form of the systemβs augmented matrix. We look for number and location of leading \(1\)βs to see whether the system is inconsistent, or in the case that it is consistent, to see which variables are free or independent and which variables are basic or dependent.
If a linear system has infinitely many solutions, we can describe all the possible solutions by solving for the dependent variables in terms of the free variables, and we can also give particular solutions by choosing specific values for the free variables.
If there are infinitely many solutions, enter z in the answer blank for \(z\text{,}\) enter a formula for \(y\) in terms of \(z\) in the answer blank for \(y\) and enter a formula for \(x\) in terms of \(z\) in the answer blank for \(x\text{.}\)
\(x_1=-11+10x_3\text{;}\)\(x_2=-4+4x_3\text{;}\)\(x_3\) is free. Two possible particular solutions: \(x_1=-11\text{,}\)\(x_2 = -4\text{,}\)\(x_3=0\) or \(x_1 = -1\text{,}\)\(x_2 = 0\) and \(x_3 = 1\text{.}\)
\(x_1=3-x_3-2x_4\text{;}\)\(x_2=-3-5x_3-7x_4\text{;}\)\(x_3\) is free; \(x_4\) is free. Two possible solutions: \(x_1 =3\text{,}\)\(x_2 = -3\text{,}\)\(x_3=0\text{,}\)\(x_4=0\) or \(x_1 = 0\text{,}\)\(x_2 = -5\text{,}\)\(x_3 =-1\text{,}\)\(x_4=1\)
\(x_1=\frac13-\frac43x_3\text{;}\)\(x_2=\frac13-\frac13x_3\text{;}\)\(x_3\) is free. Two possible solutions: \(x_1 = \frac13\text{,}\)\(x_2=\frac13\text{,}\)\(x_3=0\) or \(x_1 = -1\text{,}\)\(x_2 = 0\text{,}\)\(x_3=1\)
\(x_1=1-2x_2-3x_3\text{;}\)\(x_2\) is free; \(x_3\) is free. Two possible solutions: \(x_1=1\text{,}\)\(x_2=0\text{,}\)\(x_3=0\) or \(x_1=8\text{,}\)\(x_2=1\text{,}\)\(x_3 = -3\)