26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Dashboard / My courses / MATH 125 (LEC A1 B1 D1 E1 F1 Fall 2022) / Block 2 / Solving Systems of Linear Equations

Started on Sunday, 25 September 2022, 10:28 PM

State Finished
Completed on Monday, 26 September 2022, 1:10 AM
Time taken 2 hours 41 mins
Grade 107.00 out of 107.00 (100%)


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 1/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 1

Correct

Mark 4.00 out of 4.00

Definition: Consider a linear system of the form

a 11 x1 + a 12 x2 + ⋯ + a 1n xn = b1

a 21 x1 + a 22 x2 + ⋯ + a 2n xn = b2

⋮ ⋮ ⋮ ⋮

a m1 x1 + a m2 x2 + ⋯ + a mn xn = bm

To this system are associated two important matrices: the coefficient matrix
a 11 a 12 ⋯ a 1n
⎡ ⎤

⎢ a 21 a 22 ⋯ a 2n ⎥
A = ⎢ ⎥
⎢ ⎥
⎢ ⋮ ⋮ ⋯ ⋮ ⎥

⎣ ⎦
a m1 a m2 ⋯ a mn

and the augmented matrix

a 11 a 12 ⋯ a 1n b1
⎡ ⎤

⎢ a 21 a 22 ⋯ a 2n b2 ⎥
[A|b] = ⎢
⎢
⎥
⎥
.
⎢ ⋮ ⋮ ⋯ ⋮ ⎥

⎣ ⎦
a m1 a m2 ⋯ a mn bm

Often, the augmented matrix of a linear system is written with a bar in front of the last column such as

⎡ a 11 a 12 ⋯ a 1n b1 ⎤

⎢ a 21 a 22 ⋯ a 2n b2 ⎥
⎢ ⎥
[A|b] = ⎢ ⎥ ,
⎢ ⎥
⎢ ⋮ ⋮ ⋯ ⋮ ⎥

⎣ a m1 a m2 ⋯ a mn bm ⎦

but this is not strictly necessary.

Example: The linear system

x1 − 2x2 + 3x3 = 4

−x1 + 2x2 − 9x3 = −3

3x1 + 6x2 + 8x3 = 11

has coefficient matrix

1 -2 3 .
-1 2 -9

3 6 8

Your last answer was interpreted as follows:

1 −2 3
⎡ ⎤

⎢ −1 2 −9 ⎥
⎣ ⎦
3 6 8

Correct answer, well done.

Marks for this submission: 2.00/2.00.

Note: When writing down a matrix associated to a system of linear equations, it is important to put each coefficient in the correct position. If one
of the variables of the system does not appear in a particular equation, it means the coefficient of that variable is 0 in that equation. We need to
make sure this 0 appears in the correct entry of the matrix.

The system

x1 − 2x2 = 0

−x1 + 25x3 = −3

https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 2/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review
has augmented matrix

1 -2 0 0 .
-1 0 25 -3

Your last answer was interpreted as follows:

1 −2 0 0
[ ]
−1 0 25 −3

Correct answer, well done.

Marks for this submission: 2.00/2.00.

In this section, we will learn how to use the reduced row echelon form of a linear system's augmented matrix to determine the solution set for
that system.

Correct answer, well done.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 3/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 2

Correct

Mark 8.00 out of 8.00

The matrix

2 1 3 4
[ ]
1 2 4 −2

is the augmented matrix for the linear system

 x1 +

 x2 +

 x3 =

 x1 +

 x2 +

 x3 =

-2

Correct
Marks for this submission: 8.00/8.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 4/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 3

Correct

Mark 4.00 out of 4.00

Recall: Matrices A and B are said to be row equivalent if there exists a sequence of elementary row operations that converts A into B.
The following theorem is a cornerstone of this course. It justifies the algorithm that will be presented for solving systems of linear equations.
Main Theorem: Linear systems with row equivalent augmented matrices have the same solution set.
Example: The solution set to the linear system

x1 − 3x2 = 0

2x2 = 4

is the single vector [

6

 ,
2

 ],
and

1 −3 0 1 −3 0
[ ] R2 − 3R1 [ ]
3 −7 4 −−−−−−→ 0 2 4

so the solution set of the linear system

x1 − 3x2 = 0

3x1 − 7x2 = 4

is also the single vector [

6

 ,
2

 ].

It is easiest to find the solution set of a linear system whose augmented matrix is in reduced row echelon form.

Correct
Marks for this submission: 4.00/4.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 5/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 4

Correct

Mark 4.00 out of 4.00

Solving a System of Linear Equations

The linear systems which are easiest to solve are those systems whose augmented matrix is in reduced row echelon form (RREF). Since
elementary row operations do not change the solution set of a system of linear equations, our strategy to solve a system of linear equations is to
row reduce its augmented matrix [ A | b ] to reduced row echelon form and then solve the resulting system.

We require the following definitions.

Definitions: For a linear system in the variables x1 , x2 , …, xn with augmented matrix [ A | b ]:

The variable xi is called a leading variable (or a basic variable) if the i th column of a row echelon form of [ A | b ] contains a leading entry.
The variable xi is called a free variable if it is not a leading variable, that is, if the i th column of a row echelon form of [ A | b ] doe not
contain a leading entry.

(Recall: In a row echelon form matrix, a leading entry is the left most non-zero entry of a non-zero row.)

Example: Suppose we have a linear system in the variables x1 , x2 , x3 , x4 , x5 with augmented matrix [ A | b ] and suppose that the matrix

⎡ 1 0 2 0 −3 4 ⎤

⎢ 0 3 0 1 7 9 ⎥
⎢ ⎥
⎣ 0 0 0 0 −4 0 ⎦

is a row echelon form of [ A | b ], that is, we have

The variables x1 , x2 , and x5 are leading variables  .

The variables x3 and x4 are free variables  .

Example: If the matrix below is the RREF of the augmented matrix for a linear system, then the leading variables of the system are c) 

a) x1 , x2 b) x2 , x3 c) x2 , x4 d) x3 , x4 e) x1 , x3

and the free variables are e) 

a) x1 , x2 b) x2 , x3 c) x2 , x4 d) x3 , x4 e) x1 , x3

⎡ 0 1 1 0 1 ⎤

⎢ 0 0 0 1 5 ⎥
⎢ ⎥
⎣ 0 0 0 0 0 ⎦


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 6/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Correct
Marks for this submission: 4.00/4.00.

Question 5

Correct

Mark 1.00 out of 1.00

There are three main steps to solve a system of linear equations:

1. Write the augmented matrix [ A | b ] of the system.
2. Use elementary row operations to find the reduced row echelon form of the augmented matrix [ A | b ].
3. If the resulting system is consistent, assign parameters to the free variables (if any). Solve for the leading variables in terms of those
parameters (if any).

This method is called Gauss-Jordan elimination. The solutions are usually written using column vectors for a reason that will become apparent
after matrix multiplication is introduced. From now on, column vectors will become a lot more prevalent than row vectors.

Recall: a consistent  system has either a unique solution or infinitely many solutions.

We will first present an example of solving a linear system that has a unique solution. We will then go through an example of solving a linear
system that has infinitely many solutions. Following that, we will discuss the case of inconsistent systems.

Correct
Marks for this submission: 1.00/1.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 7/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 6

Correct

Mark 9.00 out of 9.00

For a video with a similar example as the one presented below, see Solving systems of linear equations part 1 between 10:20 and 14:57.

Example: A consistent system with a unique solution.

Solve the following linear system:

− 5x2 − 6x3 = −4

3x1 + 3x2 + 5x3 = −8

x1 − x2 − x3 = −4

The augmented matrix of this system is

⎡ 0 −5 −6 −4 ⎤

[ A |b ] = ⎢ 3 3 5 −8 ⎥
⎢ ⎥
⎣ 1 −1 −1 −4 ⎦

The next step is to transform this augmented matrix into reduced row echelon form.

⎡ 0 −5 −6 −4 ⎤ ⎡ 1 −1 −1 −4 ⎤
−−−−−−−→
[ A |b ] = ⎢ 3 3 5 −8 ⎥ R1 ↔ R3
⎢ 3 3 5 −8 ⎥
⎢ ⎥ ⎢ ⎥
⎣ 1 −1 −1 −4 ⎦ ⎣ 0 −5 −6 −4 ⎦

⎡ 1 −1 −1 −4 ⎤ ⎡ 1 −1 −1 −4 ⎤
−−−−−−−−→ −−−−−−−→

R2 − 3 R1
⎢ 0 6 8 4 ⎥ R2 + R3
⎢ 0 1 2 0 ⎥
⎢ ⎥ ⎢ ⎥
⎣ 0 −5 −6 −4 ⎦ ⎣ 0 −5 −6 −4 ⎦

−−−−−−−−→ ⎡ 1 0 1 −4 ⎤ ⎡ 1 0 1 −4 ⎤
−−−−→
R1 + R2
⎢ 0 1 2 0 ⎥ 1
R3
⎢ 0 1 2 0 ⎥
⎢ ⎥ 4 ⎢ ⎥
R3 + 5 R2
⎣ 0 0 4 −4 ⎦ ⎣ 0 0 1 −1 ⎦

−−−−−−−→ ⎡ 1 0 0 −3 ⎤
R1 − R3
⎢ 0 1 0 2 ⎥
⎢ ⎥
R 2 − 2R 3
⎣ 0 0 1 −1 ⎦

This last matrix is in reduced row echelon form. The linear system associated to this matrix is very simple:

Correct answer, well done.

x1 = -3 Marks for this submission: 1.00/1.00.

Correct answer, well done.

x2 = 2 Marks for this submission: 1.00/1.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 8/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Correct answer, well done.

x3 = -1 Marks for this submission: 1.00/1.00.

Therefore, the unique solution of the system is

Correct answer, well done.
x =
-3 Marks for this submission: 1.00/1.00. .
2

-1

By the Main Theorem stated previously, this is also the unique solution of the initial linear system.

In this example, x1 , x2 , x3 are leading variables and hence there are no free variables .

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

Moreover, rank(A) = 3 and rank([ A |b ]) = 3 .

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

Geometrically, we see that each equation in the linear system is a general equation for a plane in R . We have just shown that these three planes
3

intersect at the single point with position vector

Correct answer, well done.
x =
-3 Marks for this submission: 1.00/1.00. .
2

-1

Note: Each matrix in the row reduction above is the augmented matrix of a system of linear equations. So keep in mind that when you apply a
row operation to an augmented matrix, that is the same as applying that operation to the underlying equations.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 9/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 7

Correct

Mark 2.00 out of 2.00

Exercise: Each of the following matrices represents the reduced row echelon form of the augmented matrix [ A | b ] of a linear system. Match
each system with its unique solution.

5
⎡ ⎤
5
a) [Math Error] b) [Math Error] c) x = ⎢ −4 ⎥ d) x = [ ]
⎣ ⎦ −4
0

1
⎡ 1 0 0 ⎤
2

1. ⎢
⎢ 0 1 0 −
1 ⎥
⎥
⎢ 2 ⎥

⎣ 0 0 1 0 ⎦

Unique solution: a) 

⎡ 1 0 5 ⎤

2. ⎢
⎢ 0 1 −4 ⎥
⎥
⎣ 0 0 0 ⎦

Unique solution: d) 

For each augmented matrix above, recall that the number of columns is equal to the number of variables in the corresponding linear system.

Correct
Marks for this submission: 2.00/2.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 10/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 8

Correct

Mark 11.00 out of 11.00

For a video with a similar example as the one presented below, see Solving systems of linear equations part 1 between 14:57 and 20:53. An
example of a larger system with infinitely many solutions is presented in the video Solving systems of linear equations part 2.

Example: A consistent system with infinitely many solutions.

Solve the following linear system

3x1 − 6x2 − 2x3 + 5x4 = −5

−x1 + 2x2 + 3x3 + 3x4 = 4

The augmented matrix of this system is

3 −6 −2 5 −5
[ A |b ] = [ ].
−1 2 3 3 4

The next step is to transform this augmented matrix into reduced row echelon form.

3 −6 −2 5 −5 −−−−−−−−→ 1 −2 4 11 3
[ A |b ] = [ ] R1 + 2 R2 [ ]
−1 2 3 3 4 −1 2 3 3 4

−−−−→
−−−−−−−→ 1 −2 4 11 3 1 −2 4 11 3
1
R2 + R1 [ ] R2 [ ]
7
0 0 7 14 7 0 0 1 2 1

−−−−−−−−→ 1 −2 0 3 −1
R1 − 4 R2 [ ]
0 0 1 2 1

This final augmented matrix is associated to the system:

x1 − 2x2 + 0x3 + 3x4 = −1

x3 + 2x4 = 1

The variables x1 and x3 are leading variables and the variables x2 and x4 are free variables .

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

All the solutions to the last system can be expressed in terms of the free variables. Here is how to proceed.

Solve the first equation x1 − 2x2 + 3x4 = −1 for the leading variable x1 . Solve the second equation x3 + 2x4 = 1 for the

leading variable variable x3 .

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

Set x2 = s and x4 = t . Here, s and t are called parameters.

Explicitly, we obtain:
x1 = −1 + 2x2 − 3x4 = −1 + 2s − 3t

x2 = s

x3 = 1 − 2x4 = 1 − 2t

x4 = t s, t ∈ R

https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 11/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review
Lining this up gives us

x1 = −1 + 2s − 3t

x2 = 0 + 1s + 0t

x3 = 1 + 0s − 2t

x4 = 0 + 0s + 1t

x1
⎡ ⎤

⎢ x2 ⎥
Set x = ⎢ ⎥ . The general solution of the initial linear system can be written in terms of the parameters as:
⎢ x ⎥
3

⎣ ⎦
x4

-1 2 -3

0 1 0
x = +s +t , s, t ∈ R
1 0 -2

0 0 1

Correct answer, well done. Correct answer, well done. Correct answer, well done.
Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

Moreover, rank(A) = 2 and rank([ A |b ]) = 2 .

(Recall the notion of rank from the learning activity on Row Operations.)

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.

Geometrically, the two equation in this linear system form hyperplanes in R . We see by our solution that these hyperplanes intersect along a
4

plane in R4 as the number of parameters is 2 .

Correct answer, well done. Correct answer, well done.

Marks for this submission: 1.00/1.00. Marks for this submission: 1.00/1.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 12/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 9

Correct

Mark 2.00 out of 2.00

Exercise: Each of the following matrices represents the reduced row echelon form of the augmented matrix [ A | b ] of a linear system. Match
each system with its general solution.

⎡ 1 0 −2 4 ⎤

1. ⎢
⎢ 0 1 3 −1 ⎥
⎥
⎣ 0 0 0 0 ⎦

4 −2
⎡ ⎤ ⎡ ⎤
4 2
a) x = [ ] + t[ ], t ∈ R b) x = ⎢ −1 ⎥ + t ⎢ 3 ⎥, t ∈ R
−1 −3 ⎣ ⎦ ⎣ ⎦
0 1

4 2 4 2
⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤
c) x = ⎢ −1 ⎥ + t ⎢ −3 ⎥ , t ∈ R d) x = ⎢ −1 ⎥ + t ⎢ −3 ⎥ , t ∈ R
⎣ ⎦ ⎣ ⎦ ⎣ ⎦ ⎣ ⎦
0 1 0 0

General solution: c) 

⎡ 1 5 −3 0 2 ⎤

2. ⎢
⎢ 0 0 0 1 −7 ⎥
⎥
⎣ 0 0 0 0 0 ⎦

2 −5 3
⎡ ⎤ ⎡ ⎤ ⎡ ⎤

e) x = ⎢ −7 ⎥ + s ⎢ 1 ⎥ + t⎢0⎥, s, t ∈ R

⎣ ⎦ ⎣ ⎦ ⎣ ⎦
0 0 1

2 −5 3
⎡ ⎤ ⎡ ⎤ ⎡ ⎤

⎢ 0 ⎥ ⎢ 1 ⎥ ⎢ 0⎥
f) x = ⎢ ⎥ + s⎢ ⎥ + t⎢ ⎥, s, t ∈ R
⎢ 0 ⎥ ⎢ 0 ⎥ ⎢ 1⎥

⎣ ⎦ ⎣ ⎦ ⎣ ⎦
−7 0 0

2 −5 3
⎡ ⎤ ⎡ ⎤ ⎡ ⎤

⎢ 0⎥ ⎢ 1 ⎥ ⎢ 0 ⎥
g) x = ⎢ ⎥ + s⎢ ⎥ + t⎢ ⎥, s, t ∈ R
⎢ 0⎥ ⎢ 0 ⎥ ⎢ 1 ⎥

⎣ ⎦ ⎣ ⎦ ⎣ ⎦
0 0 −7

2 5 −3
⎡ ⎤ ⎡ ⎤ ⎡ ⎤

⎢ 0 ⎥ ⎢ 1⎥ ⎢ 0 ⎥
h) x = ⎢ ⎥ + s⎢ ⎥ + t⎢ ⎥, s, t ∈ R
⎢ 0 ⎥ ⎢ 0⎥ ⎢ 1 ⎥

⎣ ⎦ ⎣ ⎦ ⎣ ⎦
−7 0 0

General solution: f) 

Correct 
https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 13/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review
Marks for this submission: 2.00/2.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 14/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 10

Correct

Mark 5.00 out of 5.00

Consider the linear system

3x1 + 6x2 + x3 − x4 = 0

−2x1 − 4x2 + x3 + 4x4 = −5

5x1 + 10x2 − x3 − 7x4 = 8

The augmented matrix for the above linear system is

3 6 1 -1 0 .
-2 -4 1 4 -5

5 10 -1 -7 8

Your last answer was interpreted as follows:

3 6 1 −1 0
⎡ ⎤

⎢ −2 −4 1 4 −5 ⎥
⎣ ⎦
5 10 −1 −7 8

Correct answer, well done.

Marks for this submission: 1.00/1.00.

This has row reduced echelon form

1 2 0 -1 1 .
0 0 1 2 -3

0 0 0 0 0

Your last answer was interpreted as follows:

1 2 0 −1 1
⎡ ⎤

⎢ 0 0 1 2 −3 ⎥
⎣ ⎦
0 0 0 0 0

Correct answer, well done.

Marks for this submission: 1.00/1.00.

The general solution for this system is

1 -2 1
x1
⎡ ⎤

⎢ x2 ⎥
0 1 0
⎢ ⎥ = +s +t
⎢ x ⎥
3 -3 0 -2
⎣ ⎦
x4
0 0 1

Your last answer was interpreted as follows:

1
⎡ ⎤

⎢ 0 ⎥
⎢ ⎥
⎢ −3 ⎥

⎣ ⎦
0

Correct answer, well done.

Marks for this submission: 1.00/1.00.

Your last answer was interpreted as follows:


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 15/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review
−2
⎡ ⎤

⎢ 1 ⎥
⎢ ⎥
⎢ 0 ⎥

⎣ ⎦
0

Correct answer, well done.

Marks for this submission: 1.00/1.00.

Your last answer was interpreted as follows:

1
⎡ ⎤

⎢ 0 ⎥
⎢ ⎥
⎢ −2 ⎥

⎣ ⎦
1

Correct answer, well done.

Marks for this submission: 1.00/1.00.

Correct answer, well done.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 16/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 11

Correct

Mark 11.00 out of 11.00

For a video with a similar example as the one presented below, see Solving systems of linear equations part 1 between 0:00 and 10:20.

Example: An inconsistent system. (No solutions)

Let's try to solve the following linear system.

x1 + 2x2 = 0

2x1 + 3x2 = −1

−4x1 − 8x2 = 3

Its augmented matrix is

⎡ 1 2 0 ⎤

[ A |b ] = ⎢ 2 3 −1 ⎥
⎢ ⎥
⎣ −4 −8 3 ⎦

Let's put it in reduced row echelon form.

⎡ 1 2 0 ⎤ −−−−−−−−→ ⎡ 1 2 0 ⎤
R2 − 2 R1
[ A |b ] = ⎢ 2 3 −1 ⎥ ⎢ 0 −1 −1 ⎥
⎢ ⎥ ⎢ ⎥
R3 + 4 R1
⎣ −4 −8 3 ⎦ ⎣ 0 0 3 ⎦

This last matrix is in row echelon form and corresponds to a linear system of equations. Its 3rd row represents the third equation of that system,
which is

 x1 +

 x2 =

This equation has no solutions  . We can also interpret row 3 as the statement 0 = 3 , which is false.

Therefore, this system has no solutions and hence is inconsistent.

Note: rank(A) =

 <  rank([ A | b ]) =


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 17/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Each equation in that above system is the equation of a line  . That the system is inconsistent means that the intersection of these

lines  is empty  .

Theorem: A linear system is inconsistent if and only if the last non-zero row in a row echelon form of the augmented matrix [ A | b ] has the
form

[ 0 0 ⋯ 0 | c ]

for some non-zero c ∈ R , that is, there is a leading entry in the last column of a row echelon form [ A | b ]. Thus, a linear system is inconsistent
if and only if rank([ A | b ]) = rank(A)+
1

 .
(Recall: The rank of a matrix B is the number of non-zero rows in a row echelon form of B. This is the same as the number of leading entries in
a row echelon form of B. )

Thus, to test if a linear system is consistent or inconsistent, we can use the following theorem:
Theorem: Consider a linear system with coefficient matrix A and augmented matrix [ A | b ]. Then:

rank(A) ⟺ the system is consistent

rank([ A | b ]) = {
rank(A) + 1 ⟺ the system is inconsistent

Correct
Marks for this submission: 11.00/11.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 18/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 12

Correct

Mark 4.00 out of 4.00

Example: A homogeneous linear system.

Recall: A system of linear equations is called homogeneous if all of the constant terms are 0  .

Also recall: Homogeneous systems are always consistent  .

Solve the following homogeneous system of linear equations:

4x1 − 2x2 = 0

3x1 + x2 = 0

4 −2 0 −−−−−−−→ 1 −3 0 −−−−−−−−→ 1 −3 0
[ A |0 ] = [ ] R1 − R2 [ ] R2 − 3 R1 [ ]
3 1 0 3 1 0 0 10 0

−−−−→ 1 −3 0 −−−−−−−−→ 1 0 0
1
R2 [ ] R1 + 3 R2 [ ]
10
0 1 0 0 1 0

Therefore, x1 =

 and x2 =

0
 and hence the system has only the trivial solution x = [ ] .
0

Note: As we were row reducing the augmented matrix [ A |0 ], the augmented column 0 was unchanged. As such, often when solving
homogeneous systems [ A |0 ], we omit the augmented column 0 and only show the row reduction for A.

Correct
Marks for this submission: 4.00/4.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 19/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 13

Correct

Mark 15.00 out of 15.00

Recall: The rank of a matrix A is the number of non-zero rows in a row echelon form of A. This is the same as the number of leading entries in a
row echelon form of A.
The rank of a matrix is a very useful concept, in particular when it comes to systems of equations. The ranks of the coefficient matrix and
augmented matrix of a linear system tell us important information about the system.
We have already seen that a system of linear equations with coefficient matrix A and augmented matrix [ A | b ] is consistent exactly when
rank(A) = rank([ A | b ]) . In the case that the system is consistent, rank(A) can tell us even more.

The Rank Theorem

Let A be the coefficient matrix of a linear system in a set of n variables. If the system is consistent, then

rank(A) + number of free variables = n

Note: Since the system has n variables, the matrix A has n columns.

Example: Let A be the coefficient matrix of a consistent linear system.

If the system has 5 variables and the rank of A is 3 , then the system has
2

 free variables.
If the system has 9 variables, 5 of which are free, then rank(A) =

 .
If the system has 6 free variables and rank(A) = 5 , then A has
11

 columns.

Let's illustrate the Rank Theorem by looking at two previous examples.

Previous Example: Consistent system with a unique solution.

− 5x2 − 6x3 = −4

3x1 + 3x2 + 5x3 = −8

x1 − x2 − x3 = −4

So, rank(A) =

 # of free variables =

https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 20/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

 n =


Also, rank([ A | b ]) =

 (= rank(A) )

For a system to have a unique solution, it cannot have any free variables  ! Every variable must be a leading variable  . From
the Rank Theorem, we know that for a system to have a unique solution, rank(A) = n ( = # of columns of A ).

Previous Example: Consistent system with infinitely many solutions.

3x1 − 6x2 − 2x3 + 5x4 = −5

−x1 + 2x2 + 3x3 + 3x4 = 4

So rank(A) =

 # of free variables =
2

 n =


Also, rank([ A | b ]) =

 (= rank(A) )
For a system to have a infinitely many solutions, it must have at least one free variable. So by the Rank Theorem, rank(A) < n .

The general solution for this system is:

−1 2 −3
⎡ ⎤ ⎡ ⎤ ⎡ ⎤

⎢ 0 ⎥ ⎢ 1⎥ ⎢ 0 ⎥
x = ⎢ ⎥ + s⎢ ⎥ + t⎢ ⎥ , s, t ∈ R
⎢ 1 ⎥ ⎢ 0⎥ ⎢ −2 ⎥

⎣ ⎦ ⎣ ⎦ ⎣ ⎦
0 0 1

The system has

2

 free variables and there are

2

 parameters in the general solution.

For any consistent system, the number of free variables is equal to the number of parameters in the general solution of the system.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 21/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Correct
Marks for this submission: 15.00/15.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 22/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 14

Correct

Mark 9.00 out of 9.00

When we require a row echelon form of a matrix, we will most often use the reduced row echelon form. Some may wonder what's the point of
even defining a row echelon form of a matrix if we can simply use the reduced row echelon form.
A row echelon form of a matrix is the "minimal" form to which we have to row reduce in order to determine how many solutions a linear system
has. So if all we want to know is how many solutions a system has, but we don't care what the actual solutions are (if the system has any), then
we save ourselves some work by just row reducing to a row echelon form.

An example similar to the one presented below is the content of the video Solving systems of linear equations part 3.

Example: Let a ∈ R. Determine the values of a (if any) for which the following system has no solutions, exactly one solution (a unique solution),
or infinitely many solutions.

x + y + 6z = −2

2x + 3y + 5z = 7

2
x + 2y + (a − 10)z = 3a

Solution: Since the value of a is unknown, we have to consider the possibility that a could be 0 . So unless we consider cases, we should avoid
using the row operations aRi and 1a Ri . Let's row reduce the augmented matrix of that system.

⎡ 1 1 6 −2 ⎤ −−−−−−−→ ⎡ 1 1 6 −2 ⎤
R 2 − 2R 1
[ A | b] = ⎢
⎢ 2 3 5 7 ⎥
⎥
⎢
⎢ 0 1 −7 11 ⎥
⎥
R3 − R1
⎣ 1 2 a
2
− 10 3a ⎦ ⎣ 0 1 a
2
− 16 3a + 2 ⎦

⎡ 1 1 6 −2 ⎤
−−−−−−−→

R3 − R2
⎢ 0 1 −7 11 ⎥
⎢ ⎥
⎣ 0 0 a
2
− 9 3a − 9 ⎦

In this case, since we are only interested in how many solutions the system has, we only have to obtain a row echelon form. Row reducing a
matrix that has variables as entries becomes very messy, very fast! So in such situations, if a row echelon form is sufficient to answer the
question, then we only row reduce to a row echelon form.

No solutions: For the system to be an inconsistent system, we need to have a leading entry in the last column of a row echelon form of [ A | b].
So we require

a
2
− 9 =0  and 3a − 9 ≠ 0  .

Thus, the system has no solution if and only if a =

-3

 .

Unique solution: To get a unique solution, the system has to be consistent and the rank of the coefficient matrix A must be 3, i.e. we must have
a leading entry in every column of a row echelon form of A.

Thus, a 2 − 9 ≠0  .

Therefore, the system has a unique solution if and only if a is any real number other than
3

 (enter the positive value) or


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 23/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

-3

 (enter the negative value).

Infinitely many solution: For the system to have infinitely many solutions, we need to have a consistent system with at least one free variable
(which in this case must be z ).

Thus, we require a 2 − 9 =0  and 3a − 9 =0  .

Thus, the system has infinitely many solutions if and only if a =

 .

Correct
Marks for this submission: 9.00/9.00.

Question 15

Correct

Mark 10.00 out of 10.00

An example similar to the one presented below is the content of the video Solving systems of linear equations part 3.

The linear system

x − 3y − 10z = −1

−2x + 7y + 18z = b

x − 5y + bz = 3a

will have infinitely many solutions if b = 

-6

 and a = 

 ,

it will have no solution if b = 

-6

 and a ≠ 

 ,

and it will have a unique solution if b ≠ 

-6

 .

Correct
Marks for this submission: 10.00/10.00.


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 24/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review

Question 16

Correct

Mark 8.00 out of 8.00

The methods of this section allow us to address certain basic geometric problems.

For example, we now have the tools to convert a vector equation of a plane in R to a normal equation (and so also a general equation).
3

Example: Find a normal equation and a general equation of the plane in R with vector equation:
3

0 1 2
⎡ ⎤ ⎡ ⎤ ⎡ ⎤
P : x = ⎢ 1 ⎥ + s ⎢ −2 ⎥ + t ⎢ −3 ⎥ , s, t ∈ R
⎣ ⎦ ⎣ ⎦ ⎣ ⎦
−1 1 5

1 2
⎡ ⎤ ⎡ ⎤
Solution: Let v = ⎢ −2 ⎥ and w = ⎢ −3 ⎥ .
⎣ ⎦ ⎣ ⎦
1 5

a
⎡ ⎤
Let n = ⎢ b ⎥ be a normal vector for P . We know that n is orthogonal  to both of the direction vectors v and w , so that n ⋅ v =
⎣ ⎦
c

 and n ⋅ w =

 .

Therefore, to find n, we solve the linear system

a − 2b + c = 0

2a − 3b + 5c = 0

Note that a , b, and c are the variables of this system.

1 −2 1 0 −−−−−−−−→ 1 −2 1 0 −−−−−−−−→ 1 0 7 0
[ ] R2 − 2 R1 [ ] R1 + 2 R2 [ ]
2 −3 5 0 0 1 3 0 0 1 3 0

Thus c  is a free variable and so we assign it a parameter. Set c = r . The general solution of this system has parametric equations:

a = −7r

b = −3r

c = r , r ∈ R

We may choose any non-zero value of r to find a normal vector n. Choosing r =

-1

7
⎡ ⎤
 gives n = ⎢ 3 . Thus an equation for P in normal form is
⎥
⎣ ⎦
−1

7 x 7 0
⎡ ⎤ ⎡ ⎤ ⎡ ⎤ ⎡ ⎤

⎢ 3 ⎥ ⋅ ⎢ y ⎥ = ⎢ 3 ⎥ ⋅ ⎢ 1 ⎥
⎣ ⎦ ⎣ ⎦ ⎣ ⎦ ⎣ ⎦
−1 z −1 −1

and a general equation is 7x + 3y − z =

 .


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 25/26
26/9/22, 01:12 Solving Systems of Linear Equations: Attempt review
Example: Two planes P1 , P2 in R described by the equations a 1 x + b1 y + c1 z and a 2 x + b2 y + c2 z intersect if and only if the
3
= d1 = d2

linear system

a 1 x + b1 y + c1 z = d1

a 2 x + b2 y + c2 z = d2

is consistent  . If they do intersect, the intersection can be found by solving the system.

Other problems of this kind that can be solved using similar techniques include:

Determining the intersection point(s) of two lines.

Determining the intersection point(s) of a line and a plane.
Determining the intersection point(s) of three planes.

In all of these cases, if the objects do not intersect, then the underlying system of equations is inconsistent  .

Correct
Marks for this submission: 8.00/8.00.

◄ Systems of Linear Equations

Jump to...

Linear Combinations and Span ►


https://eclass.srv.ualberta.ca/mod/quiz/review.php?attempt=11005975&cmid=6434351 26/26