0% found this document useful (0 votes)
7 views

Module 1c Augmented Matrices 1

The document discusses augmented matrices and Gauss-Jordan elimination for solving systems of linear equations. It defines an augmented matrix as a matrix with each row representing the constants from one equation, with columns for each variable's coefficients. It describes three elementary row operations: 1) interchanging rows, 2) multiplying a row by a constant, and 3) adding a multiple of one row to another. It provides examples of using these operations to convert an augmented matrix into reduced row echelon form to solve systems with two or three equations.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views

Module 1c Augmented Matrices 1

The document discusses augmented matrices and Gauss-Jordan elimination for solving systems of linear equations. It defines an augmented matrix as a matrix with each row representing the constants from one equation, with columns for each variable's coefficients. It describes three elementary row operations: 1) interchanging rows, 2) multiplying a row by a constant, and 3) adding a multiple of one row to another. It provides examples of using these operations to convert an augmented matrix into reduced row echelon form to solve systems with two or three equations.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Module 3: Augmented Matrices

Linear Algebra

Augmented Matrices – In this section we will look at another method for solving systems. We
will introduce the concept of an augmented matrix. This will allow us to use the method of Gauss-
Jordan elimination to solve systems of equations. We will use the method with systems of two
equations and systems of three equations.

In this section we need to take a look at the third method for solving systems of equations. For
systems of two equations it is probably a little more complicated than the methods we looked at
in the first section. However, for systems with more equations it is probably easier than using
the method we saw in the previous section.

Learning Outcomes

After completing this module, you should be able to:


1. express systems of equation in augmented matrix
2. enumerate and apply the steps in elementary row operations and;
3. use Gauss-Jordan elimination to solve systems of equation

Learning Content

Before we get into the method we first need to get some definitions out of the way.

An augmented matrix for a system of equations is a matrix of numbers in which each row
represents the constants from one equation (both the coefficients and the constant on the other
side of the equal sign) and each column represents all the coefficients for a single variable.

Let’s take a look at an example. Here is the system of equations that we looked at in the
previous section.

𝑥 − 2𝑦 + 3𝑧 = 7
2𝑥 + 𝑦 + 𝑧 = 4
−3𝑥 + 2𝑦 − 2𝑧 = −10

Here is the augmented matrix for this system.

1 −2 3: 7
[2 1 1: 4 ]
−3 2 −2: 10

The first row consists of all the constants from the first equation with the coefficient of the x in
the first column, the coefficient of the y in the second column, the coefficient of the z in the third
column and the constant in the final column. The second row is the constants from the second
equation with the same placement and likewise for the third row. The dashed line represents
where the equal sign was in the original system of equations and is not always included. This is
mostly dependent on the instructor and/or textbook being used.

Next, we need to discuss elementary row operations. There are three of them and we will give
both the notation used for each one as well as an example using the augmented matrix given
above.

1. Interchange Two Rows. With this operation we will interchange all the entries in row i
and row j. The notation we’ll use here is 𝑅𝑖 ↔ 𝑅𝑗 Here is an example.

1 −2 3: 7 −3 2 −2: 10
[2 1 1: 4 ] 𝑅1 ↔ 𝑅3 [ 2 1 1: 4 ]
−3 2 −2: 10 1 −2 3: 7

So, we do exactly what the operation says. Every entry in the third row moves up to the first
row and every entry in the first row moves down to the third row. Make sure that you move
all the entries. One of the more common mistakes is to forget to move one or more entries.

2. Multiply a Row by a Constant. In this operation we will multiply row i by a constant c and
the notation will use here is 𝑐𝑅𝑖 . Note that we can also divide a row by a constant using the
1
notation 𝐶 𝑅𝑖 . Here is an example.

1 −2 3: 7 1 −2 3: 7
[2 1 1: 4 ] −4𝑅3 → [2 1 1: 4 ]
−3 2 −2: 10 12 −8 8: −40

So, when we say we will multiply a row by a constant this really means that we will multiply
every entry in that row by the constant. Watch out for signs in this operation and make sure
that you multiply every entry.

3. Add a Multiple of a Row to Another Row. In this operation we will replace row i with the
sum of row i and a constant, c, times row j. The notation we’ll use for this operation is
𝑅𝑖 + 𝑐𝑅𝑗 → 𝑅𝑖 . To perform this operation, we will take an entry from row i and add to it c
times the corresponding entry from row j and put the result back into row i. Here is an
example of this operation.

1 −2 3: 7 1 −2 3: 7
[2 1 1: 4 ] 𝑅3 − 4𝑅1 → 𝑅3 =[ 2 1 1: 4 ]
−3 2 −2: 10 −7 10 −14: −38

Let’s go through the individual computation to make sure you followed this.

−3 − 4(1) = −7
2 − 4(−2) = 10
−2 − 4(3) = −14
−10 − 4(7) = −38

Be very careful with signs here. We will be doing these computations in our head for the
most part and it is very easy to get signs mixed up and add one in that doesn’t belong or
lose one that should be there.

It is very important that you can do this operation as this operation is the one that we will
be using more than the other two combined.
Okay, so how do we use augmented matrices and row operations to solve systems? Let’s
start with a system of two equations and two unknowns.

𝑎𝑥 + 𝑏𝑦 = 𝑝
𝑐𝑥 + 𝑑𝑦 = 𝑞

We first write down the augmented matrix for this system,

𝑎 𝑏: 𝑝
[ ]
𝑐 𝑑: 𝑞

and use elementary row operations to convert it into the following augmented matrix.

1 0: ℎ
[ ]
0 1: 𝑘

Once we have the augmented matrix in this form we are done. The solution to the system
will be 𝑥 = ℎ and 𝑦 = 𝑘.

This method is called Gauss-Jordan Elimination.

Example 1 Solve each of the following systems of equations.

(a) 3𝑥 − 2𝑦 = 14
𝑥 + 3𝑦 = 11

(b) −2𝑥 + 𝑦 = −3
𝑥 − 4𝑦 = −2

(c) 3𝑥 − 6𝑦 = −9
−2𝑥 − 2𝑦 = 12

Solution
(a) 3𝑥 − 2𝑦 = 14
𝑥 + 3𝑦 = 11
The first step here is to write down the augmented matrix for this system.

3 −2: 14
[ ]
1 3: 11

To convert it into the final form we will start in the upper left corner and work in a counter-
clockwise direction until the first two columns appear as they should be.

So, the first step is to make the red three in the augmented matrix above into a 1. We can use
any of the row operations that we’d like to. We should always try to minimize the work as
much as possible however.

So, since there is a one in the first column already it just isn’t in the correct row let’s use the
first row operation and interchange the two rows.

3 −2: 14 1 3: 11
[ ] 𝑅 ↔ 𝑅2 = [ ]
1 3: 11 1 3 −2: 14

The next step is to get a zero below the 1 that we just got in the upper left hand corner. This
means that we need to change the red three into a zero. This will almost always require us
to use third row operation. If we add -3 times row 1 onto row 2 we can convert that 3 into a
0. Here is that operation.

1 3: 1 1 3: 1
[ ] 𝑅2 − 3𝑅1 → 𝑅2 =[ ]
3 −2: 14 0 −11: 11

Next, we need to get a 1 into the lower right corner of the first two columns. This means
changing the red -11 into a 1. This is usually accomplished with the second row operation.
If we divide the second row by -11 we will get the 1 in that spot that we need.

1 3: 1 1 1 3: 1
[ ] − 𝑅2 = [ ]
0 −11: 11 11 0 1: −1

Okay, we’re almost done. The final step is to turn the red three into a zero. Again, this almost
always requires the third row operation. Here is the operation for this final step.

1 3: 1 1 0: 4
[ ] 𝑅1 − 3𝑅2 → 𝑅1 =[ ]
0 1: −1 0 1: −1

We have the augmented matrix in the required form and so we’re done. The solution to
this system is 𝑥 = 4 𝑎𝑛𝑑 𝑦 = −1.

(b) −2𝑥 + 𝑦 = −3
𝑥 − 4𝑦 = −2
In this part we won’t put in as much explanation for each step. We will mark the next number
that we need to change in red as we did in the previous part.

We’ll first write down the augmented matrix and then get started with the row operations.

−2 1: −3 1 −4: −2 1 −4: −2
[ ] 𝑅 ↔ 𝑅2 = [ ] 𝑅 + 2𝑅1 → 𝑅2 = [ ]
1 −4: −2 1 −2 1: −3 2 0 −7: −7

Before proceeding with the next step let’s notice that in the second matrix we had one’s in
both spots that we needed them. However, the only way to change the -2 into a zero that we
had to have as well was to also change the 1 in the lower right corner as well. This is okay.
Sometimes it will happen and trying to keep both ones will only cause problems.

Let’s finish the problem.

1 −4: −2 1 1 −4: −2 1 0: 2
[ ] − 𝑅2 = [ ] 𝑅1 + 4𝑅2 → 𝑅1 = [ ]
0 −7: −7 7 0 1: 1 0 1: 1

The solution to this system is then 𝑥 = 2 𝑎𝑛𝑑 𝑦 = 1.

(c) 3𝑥 − 6𝑦 = −9
−2𝑥 − 2𝑦 = 12

Let’s first write down the augmented matrix for this system.

3 −6: −9
[ ]
−2 −2: 12

Now, in this case there isn’t a 1 in the first column and so we can’t just interchange two rows
as the first step. However, notice that since all the entries in the first row have 3 as a factor
we can divide the first row by 3 which will get a 1 in that spot and we won’t put any fractions
into the problem.

Here is the work for this system

3 −6: −9 1 1 −2: −3 1 −2: −3


[ ] 𝑅 = [ ] 𝑅 + 2𝑅1 → 𝑅2 = [ ]
−2 −2: 12 3 1 −2 −2 12 2 0 −6: 6

1 −2: −3 1 1 −2: −3 1 0: −5
[ ] − 𝑅2 = [ ] 𝑅1 + 2𝑅2 → 𝑅1 = [ ]
0 −6: 6 6 0 1: −1 0 1: −1

The solution to this system is 𝑥 = −5 𝑎𝑛𝑑 𝑦 = −1.

It is important to note that the path we took to get the augmented matrices in this example
into the final form is not the only path that we could have used. There are many different
paths that we could have gone down. All the paths would have arrived at the same final
augmented matrix however so we should always choose the path that we feel is the easiest
path. Note as well that different people may well feel that different paths are easier and so
may well solve the systems differently. They will get the same solution however.

For two equations and two unknowns this process is probably a little more complicated than
just the straight forward solution process we used in the first section of this chapter. This
process does start becoming useful when we start looking at larger systems. So, let’s take a
look at a couple of systems with three equations in them.

In this case the process is basically identical except that there’s going to be more to do. As
with two equations we will first set up the augmented matrix and then use row operations
to put it into the form,

1 0 0: 𝑝
[0 1 0: 𝑞 ]
0 0 1: 𝑟

Once the augmented matrix is in this form the solution is 𝑥 = 𝑝, 𝑦 = 𝑞 𝑎𝑛𝑑 𝑧 = 𝑟 . As with
the two equations case there really isn’t any set path to take in getting the augmented matrix
into this form. The usual path is to get the 1’s in the correct places and 0’s below them. Once
this is done we then try to get zeroes above the 1’s.

Let’s work a couple of examples to see how this works.

Example 2. Solve each of the following systems of equations.

(a) 3𝑥 + 𝑦 − 2𝑧 = 2
𝑥 − 2𝑦 + 𝑧 = 3
2𝑥 − 𝑦 − 3𝑧 = 3

(b) 3𝑥 + 𝑦 − 2𝑧 = −7
2𝑥 + 2𝑦 + 𝑧 = 9
−𝑥 − 𝑦 + 3𝑧 = 6

Solution:

(a) 3𝑥 + 𝑦 − 2𝑧 = 2
𝑥 − 2𝑦 + 𝑧 = 3
2𝑥 − 𝑦 − 3𝑧 = 3

Let’s first write down the augmented matrix for this system.

3 1 −2: 2
[1 −2 1: 3 ]
2 −1 −3 3
As with the previous examples we will mark the number(s) that we want to change in a given
step in red. The first step here is to get a 1 in the upper left hand corner and again, we have
many ways to do this. In this case we’ll notice that if we interchange the first and second row
we can get a 1 in that spot with relatively little work.

3 1 −2: 2 1 −2 1: 3
[1 −2 1: 3 ] 𝑅1 ↔ 𝑅2 = [ 3 1 −2: 2 ]
2 −1 −3 3 −2 −1 −3: 3

The next step is to get the two numbers below this 1 to be 0’s. Note as well that this will
almost always require the third row operation to do. Also, we can do both of these in one
step as follows.

1 −2 1: 3 1 −2 1: 3
[0 7 −5: −7] 𝑅2 − 3𝑅1 → 𝑅2 = [0 7 −5: −7]
0 3 −5: −3 0 3 −5: −3
𝑅3 − 2𝑅1 → 𝑅3

Next, we want to turn the 7 into a 1. We can do this by dividing the second row by 7.

1 −2 1: 3
1 −2 1: 3 1 5
[0 7 −5: −7] 𝑅2 = [0 1 − : −1]
7 7
0 3 −5: −3
0 3 −5: −3

So, we got a fraction showing up here. That will happen on occasion so don’t get all that
excited about it. The next step is to change the 3 below this new 1 into a 0. Note that we
aren’t going to bother with the -2 above it quite yet. Sometimes it is just as easy to turn this
into a 0 in the same step. In this case however, it’s probably just as easy to do it later as we’ll
see.

So, using the third row operation we get,

1 −2 1: 3
1 −2 1: 3 5
5 0 1 − : −1
[0 1 − : −1] 𝑅3 − 3𝑅2 → 𝑅3 = 7
7 20
0 3 −5 −3 0 0 − : 0
[ 7 ]

Next, we need to get the number in the bottom right corner into a 1. We can do that with the
second row operation.
1 −2 1: 3
5 1 −20 1: 3
0 1 − : −1 7 5
7 − 𝑅3 = [0 1 − : −1]
20 20 7
0 0 − : 0 0 0 1: 0
[ 7 ]

Now, we need zeroes above this new 1. So, using the third row operation twice as follows
will do what we need done.

1 −2 1: 3 1 −2 0: 3
5 5
[0 1 − 7 : −1] 𝑅2 + 𝑅3 → 𝑅2 = [0 1 0: −1]
7
0 0 1: 0 0 0 1: 0
𝑅1 − 𝑅3 → 𝑅1

Notice that in this case the final column didn’t change in this step. That was only because the
final entry in that column was zero. In general, this won’t happen.

The final step is then to make the -2 above the 1 in the second column into a zero. This can
easily be done with the third row operation.

1 −2 0: 3 1 0 0: 1
[0 1 0: −1] 𝑅1 + 2𝑅2 → 𝑅1 = [0 1 0: −1]
0 0 1: 0 0 0 1: 0

So, we have the augmented matrix in the final form and the solution will be,

𝑥 = 1, 𝑦 = −1 𝑎𝑛𝑑 𝑧 = 0

This can be verified by plugging these into all three equations and making sure that they are
all satisfied.

(b) 𝟑𝒙 + 𝒚 − 𝟐𝒛 = −𝟕
𝟐𝒙 + 𝟐𝒚 + 𝒛 = 𝟗
−𝒙 − 𝒚 + 𝟑𝒛 = 𝟔

Again, the first step is to write down the augmented matrix.

3 1 −2: −7
[2 2 1: 9 ]
−1 −1 3: 6

We can’t get a 1 in the upper left corner simply by interchanging rows this time. We could
interchange the first and last row, but that would also require another operation to turn the
-1 into a 1. While this isn’t difficult it’s two operations. Note that we could use the third row
operation to get a 1 in that spot as follows.
3 1 −2: −7 1 −2 −3: −16
[2 2 1: 9 ] 𝑅1 − 𝑅2 → 𝑅1 =[ 2 2 1: 9 ]
−1 −1 3: 6 −1 −1 3: 6

Now, we can use the third row operation to turn the two red numbers into zeroes.

1 −1 −3: −16 1 −1 −3: −16


[2 2 1: 9 ] 𝑅2 − 2𝑅1 → 𝑅2 = [0 4 7 41 ]
−1 −1 3: 6 0 −2 0 −10
𝑅3 + 𝑅1 → 𝑅3

The next step is to get a 1 in the spot occupied by the red 4. We could do that by dividing the
whole row by 4, but that would put in a couple of somewhat unpleasant fractions. So, instead
of doing that we are going to interchange the second and third row. The reason for this will
be apparent soon enough.

1 −1 −3: −16 1 −1 −3: −16


[0 4 7: 41 ] 𝑅2 ↔ 𝑅3 = [0 −2 0: −10 ]
0 −2 0: −10 0 4 7: 41

Now, if we divide the second row by -2 we get the 1 in that spot that we want.

1 −1 −3: −16 1 1 −1 −3: −16


[0 −2 0: −10 ] − 𝑅2 = [0 1 0: 5 ]
2
0 4 7: 41 0 4 7: 41

Before moving onto the next step let’s think notice a couple of things here. First, we managed
to avoid fractions, which is always a good thing, and second this row is now done. We would
have eventually needed a zero in that third spot and we’ve got it there for free. Not only that,
but it won’t change in any of the later operations. This doesn’t always happen, but if it does
that will make our life easier.

Now, let’s use the third row operation to change the red 4 into a zero.

1 −1 −3: −16 1 −1 −3: −16


[0 1 0: 5 ] 𝑅3 − 4𝑅2 → 𝑅3 = [0 1 0: 5 ]
0 4 7: 41 0 0 7: 21

We now can divide the third row by 7 to get that the number in the lower right corner into a
one.

1 −1 −3: −16 1 1 −1 −3: −16


[0 1 0: 5 ] 𝑅3 = [0 1 0: 5 ]
7
0 0 7: 21 0 0 1: 3

Next, we can use the third row operation to get the -3 changed into a zero.
1 −1 −3: −16 1 −1 0: −7
[0 1 0: 5 ] 𝑅1 + 3𝑅3 → 𝑅1 = [0 1 0: 5 ]
0 0 1: 3 0 0 1 3

The final step is to then make the -1 into a 0 using the third row operation again.

1 −1 0: −7 1 0 0: −2
[0 1 0: 5 ] 𝑅1 + 𝑅2 → 𝑅1 = [0 1 0: 5 ]
0 0 1: 3 0 0 1: 3

The solution to this system is then,

𝑥 = −2, 𝑦 = 5 𝑎𝑛𝑑 𝑧 = 3.

Using Gauss-Jordan elimination to solve a system of three equations can be a lot of work, but
it is often no more work than solving directly and is many cases less work. If we were to do
a system of four equations (which we aren’t going to do) at that point Gauss-Jordan
elimination would be less work in all likelihood that if we solved directly.

Also, as we saw in the final example worked in this section, there really is no one set path to
take through these problems. Each system is different and may require a different path and
set of operations to make. Also, the path that one person finds to be the easiest may not by
the path that another person finds to be the easiest. Regardless of the path however, the final
answer will be the same.

Teaching and Learning Activities

1. Write the augmented matrix of the linear systems and perform the indicated
elementary row operation.

(a) 4𝑥 − 𝑦 + 3𝑧 = 5
2𝑦 + 5𝑧 = 9
−6𝑥 + 𝑦 − 3𝑧 = 10

(i) 8𝑅1
(ii) 𝑅2 ↔ 𝑅3
(iii) 𝑅2 + 3𝑅1 → 𝑅2

(b) 𝑥 − 6𝑦 + 2𝑧 = 0
2𝑥 − 8𝑦 + 10𝑧 = 4
3 − 4𝑦 − 𝑧 = 2
1
(i) 𝑅2
2
(ii) 𝑅1 ↔ 𝑅2
(iii) 𝑅1 − 6𝑅3 → 𝑅1

2. Solve the linear system with the given augmented matrix.

1 1 1: 1
(a) [1 1 −2: 3]
2 1 1: 2

1 1 1: 0
(b) [1 1 0: 3]
0 1 1: 1

Learning Resources
The following resources on You Tube will help you enhance your understanding in solving
linear system with two variables.

a. #Systemofequations #Algebraically #brianmclogan


b. https://www.youtube.com/watch?v=eYSASx8_nyg

Flexible Teaching and Learning Modalities

Online (synchronous)
Google Meet/ Zoom/ SEDI

Remote
Module 3. Augmented Matrices

Assessment Tasks

Solve the following linear systems.

1. 𝑥 + 2𝑦 + 3𝑧 = 9
2𝑥 − 𝑦 + 𝑧 = 8
3𝑥 − 𝑧 = 3

2. 𝑥 + 2𝑦 + 3𝑧 + 4𝑤 = 5
𝑥 + 3𝑦 + 5𝑧 + 7𝑤 = 11
𝑥 − 𝑧 − 2𝑤 = −6

References:

Bernard Kolman & David R. Hill. Introductory Linear Algebra with Applications. 7th Edition
Steven J. Leon. Linear Algebra with Applications Eighth Edition
Jörg Liesen Volker Mehrmann. Linear Algebra

You might also like