Skip to main content

Section1.2Row Reduction

Objectives
  1. Learn to replace a system of linear equations by an augmented matrix.
  2. Learn how the elimination method corresponds to performing row operations on an augmented matrix.
  3. Understand when a matrix is in (reduced) row echelon form.
  4. Learn which row reduced matrices come from inconsistent linear systems.
  5. Recipe: the row reduction algorithm.
  6. Vocabulary words: row operation, row equivalence, matrix, augmented matrix, pivot, (reduced) row echelon form.

In this section, we will present an algorithm for “solving” a system of linear equations.

Subsection1.2.1The Elimination Method

We will solve systems of linear equations algebraically using the elimination method. In other words, we will combine the equations in various ways to try to eliminate as many variables as possible from each equation. There are three valid operations we can perform on our system of equations:

  • Scaling: we can multiply both sides of an equation by a nonzero number.
    C x + 2 y + 3 z = 62 x − 3 y + 2 z = 143 x + y − z = − 2 multiply1stby − 3 −−−−−−−−−→ C − 3 x − 6 y − 9 z = − 182 x − 3 y + 2 z = 143 x + y − z = − 2
  • Replacement: we can add a multiple of one equation to another, replacing the second equation with the result.
    C x + 2 y + 3 z = 62 x − 3 y + 2 z = 143 x + y − z = − 2 2nd = 2nd − 2 × 1st −−−−−−−−−−→ C x + 2 y + 3 z = 6 − 7 y − 4 z = 23 x + y − z = − 2
  • Swap: we can swap two equations.
    C x + 2 y + 3 z = 62 x − 3 y + 2 z = 143 x + y − z = − 2 3rd ←→ 1st −−−−−−→ C 3 x + y − z = − 22 x − 3 y + 2 z = 14 x + 2 y + 3 z = 6
Example
Augmented Matrices and Row Operations

Solving equations by elimination requires writing the variables x , y , z and the equals sign = over and over again, merely as placeholders: all that is changing in the equations is the coefficient numbers. We can make our life easier by extracting only the numbers, and putting them in a box:

C x + 2 y + 3 z = 62 x − 3 y + 2 z = 143 x + y − z = − 2 becomes −−−−→ A 123 62 − 32 1431 − 1 − 2 B .

This is called an augmented matrix. The word “augmented” refers to the vertical line, which we draw to remind ourselves where the equals sign belongs; a matrix is a grid of numbers without the vertical line. In this notation, our three valid ways of manipulating our equations become row operations:

  • Scaling: multiply all entries in a row by a nonzero number.
    A 123 62 − 32 1431 − 1 − 2 B R 1 = R 1 ×− 3 −−−−−→ A − 3 − 6 − 9 − 182 − 32 1431 − 1 − 2 B
    Here the notation R 1 simply means “the first row”, and likewise for R 2 , R 3 , etc.
  • Replacement: add a multiple of one row to another, replacing the second row with the result.
    A 123 62 − 32 1431 − 1 − 2 B R 2 = R 2 − 2 × R 1 −−−−−−−→ A 123 60 − 7 − 4 231 − 1 − 2 B
  • Swap: interchange two rows.
    A 123 62 − 32 1431 − 1 − 2 B R 1 ←→ R 3 −−−−→ A 31 − 1 − 22 − 32 14123 6 B
Remark
Example

The process of doing row operations to a matrix does not change the solution set of the corresponding linear equations!

Indeed, the whole point of doing these operations is to solve the equations using the elimination method.

Definition

Two matrices are called row equivalent if one can be obtained from the other by doing some number of row operations.

So the linear equations of row-equivalent matrices have the same solution set.

Example(An Inconsistent System)

Subsection1.2.2Echelon Forms

In the previous subsection we saw how to translate a system of linear equations into an augmented matrix. We want to find an algorithm for “solving” such an augmented matrix. First we must decide what it means for an augmented matrix to be “solved”.

Definition

A matrix is in row echelon form if:

  1. All zero rows are at the bottom.
  2. The first nonzero entry of a row is to the right of the first nonzero entry of the row above.
  3. Below the first nonzero entry of a row, all entries are zero.

Here is a picture of a matrix in row echelon form:

DHHF A AAAA 0 A AAA 000 A A 00000 EIIG A = anynumber A = anynonzeronumber
Definition

A pivot is the first nonzero entry of a row of a matrix in row echelon form.

A matrix in row-echelon form is generally easy to solve using back-substitution. For example,

A 123 6012 40010 30 B becomes −−−−→ C x + 2 y + 3 z = 6 y + 2 z = 410 z = 30.

We immediately see that z = 3, which implies y = 4 − 2 · 3 = − 2 and x = 6 − 2 ( − 2 ) − 3 · 3 = 1. See this example.

Definition

A matrix is in reduced row echelon form if it is in row echelon form, and in addition:

  1. Each pivot is equal to 1.
  2. Each pivot is the only nonzero entry in its column.

Here is a picture of a matrix in reduced row echelon form:

DHF 10 A 0 A 01 A 0 A 0001 A 00000 EIG A = anynumber1 = pivot

A matrix in reduced row echelon form is in some sense completely solved. For example,

A 100 1010 − 2001 3 B becomes −−−−→ N x = 1 y = − 2 z = 3.
Example

When deciding if an augmented matrix is in (reduced) row echelon form, there is nothing special about the augmented column(s). Just ignore the vertical line.

If an augmented matrix is in reduced row echelon form, the corresponding linear system is viewed as solved. We will see below why this is the case, and we will show that any matrix can be put into reduced row echelon form using only row operations.

Remark(Why the word “pivot”?)

Subsection1.2.3The Row Reduction Algorithm

We will give an algorithm, called row reduction or Gaussian elimination, which demonstrates that every matrix is row equivalent to at least one matrix in reduced row echelon form.

The uniqueness statement is interesting—it means that, no matter how you row reduce, you always get the same matrix in reduced row echelon form.

This assumes, of course, that you only do the three legal row operations, and you don’t make any arithmetic errors.

We will not prove uniqueness, but maybe you can!

Example

Here is the row reduction algorithm, summarized in pictures.

A A A A A A A A A A A A A A A A DHF EIG 1 A A A A A A A A A A A A A A A DHF EIG 1 A A A 0 1 A A 0 A A A 0 A A A DHF EIG 1 A A A 0 1 A A 0 A A A 0 A A A DHF EIG 1 A A A 0 1 A A 0 0 0 A 0 0 0 A DHF EIG 1 A A A 0 1 A A 0 0 0 A 0 0 0 A DHF EIG 1 A A A 0 1 A A 0 0 0 1 0 0 0 A DHF EIG 1 A A A 0 1 A A 0 0 0 1 0 0 0 0 DHF EIG 1 A A A 0 1 A A 0 0 0 1 0 0 0 0 DHF EIG 1 A A 0 0 1 A 0 0 0 0 1 0 0 0 0 DHF EIG 1 0 A 0 0 1 A 0 0 0 0 1 0 0 0 0 DHF EIG Geta1here Cleardown Geta1here Cleardown (maybethesearealreadyzero) Geta1here Cleardown MatrixisinREF Clearup Clearup MatrixisinRREF

It will be very important to know where are the pivots of a matrix after row reducing; this is the reason for the following piece of terminology.

Definition

A pivot position of a matrix is an entry that is a pivot of a row echelon form of that matrix.

A pivot column of a matrix is a column that contains a pivot position.

Example(Pivot Positions)
Example(An Inconsistent System)

In the above example, we saw how to recognize the reduced row echelon form of an inconsistent system.

In other words, the row reduced matrix of an inconsistent system looks like this:

A 10 AA 001 AA 00000 1 B

We have discussed two classes of matrices so far:

  1. When the reduced row echelon form of a matrix has a pivot in every non-augmented column, then it corresponds to a system with a unique solution:
    A 100 1010 − 2001 3 B translatesto −−−−−−→ N x = 1 y = − 2 z = 3.
  2. When the reduced row echelon form of a matrix has a pivot in the last (augmented) column, then it corresponds to a system with a no solutions:
    K 15 000 1 L translatesto −−−−−−→ J x + 5 y = 00 = 1.

What happens when one of the non-augmented columns lacks a pivot? This is the subject of Section 1.3.

Example(A System with Many Solutions)