Math 107 (Spring 2022)

Week 2 — Lecture 3

Linear Systems : Existence & Uniqueness of the Solution ,

Finding the General Solution

Emre Mengi
February 19, 2022
 Pivot Positions and Columns

The echelon form of a matrix A is not unique.

188871
T L3 T

too it
G 12 21

F
echelon
forms

1
 Pivot Positions and Columns

The echelon form of a matrix A is not unique.

If twolinear
systems have
But the leading entries are located at exactly the same
positions in all echelon forms of A.

matrix can the same solution

If a
set
be obtained fromm
another matrix by then those linear
row
applying systems are
operations
matrices
called
then the
are called equivalent
1
 Pivot Positions and Columns

The echelon form of a matrix A is not unique.

But the leading entries are located at exactly the same
positions in all echelon forms of A.

On the other hand, the reduced echelon form of A is unique.

1
 Pivot Positions and Columns

The echelon form of a matrix A is not unique.

But the leading entries are located at exactly the same
positions in all echelon forms of A.

On the other hand, the reduced echelon form of A is unique.

Definition 3.1.

The positions of the leading entries in an echelon form

of A (or in the reduced echelon form) are called the
pivot positions of A.

1
 Pivot Positions and Columns

The echelon form of a matrix A is not unique.

But the leading entries are located at exactly the same
positions in all echelon forms of A.

On the other hand, the reduced echelon form of A is unique.

Definition 3.1.

The positions of the leading entries in an echelon form

of A (or in the reduced echelon form) are called the
pivot positions of A.

A column of A that contains a pivot position is called a

pivot column of A.

1
 Pivot Positions and Columns

Example
2 3
0 1 3 5
6 7
4 3 2 1 95
1 1 1 5

2
 Pivot Positions and Columns

pinoptosition
operations
Example
yapplyow
2
6
off OF leading
0
4 3
1
1
2
1
3
1
1
5
95
5
3

entries
7
2
6
1 0 0 2

echelon form
40 1 0 25
0 0 1 1
3
7

in

If'm
pivot Efron
form

2
 Pivot Positions and Columns

Example
2 3 2 3
0 1 3 5 1 0 0 2
6 7 6 7
4 3 2 1 95 40 1 0 25
1 1 1 5 0 0 1 1

Pivot positions are highlighted in red.

2
 Pivot Positions and Columns

Example
2 3 2 3
0 1 3 5 1 0 0 2
6 7 6 7
4 3 2 1 95 40 1 0 25
1 1 1 5 0 0 1 1

Pivot positions are highlighted in red.

1st, 2nd, 3rd columns are the pivot columns.

2
 Free and Basic Variables

Free Variable

A variable that corresponds to a nonpivot column of the augmented

matrix.

3
 Free and Basic Variables

Free Variable

A variable that corresponds to a nonpivot column of the augmented

matrix.

Basic Variable

A variable that corresponds to a pivot column of the augmented matrix.

3
 Free and Basic Variables

Free Variable

A variable that corresponds to a nonpivot column of the augmented

matrix.

Basic Variable

A variable that corresponds to a pivot column of the augmented matrix.

Example
Consider the system with the augmented matrix
2 3
1 2 5 6 0 5
6 7
6 0 1 6 3 0 2 7
4 5
0 0 0 0 1 0

It's
3
 Free and Basic Variables

Free Variable

A variable that corresponds to a nonpivot column of the augmented

matrix.

Basic Variable

A variable that corresponds to a pivot column of the augmented matrix.

Example
Consider the system with the augmented matrix
2 3
1 2 5 6 0 5
6 7
6 0 1 6 3 0 2 7
4 5
0 0 0 0 1 0

• x3, x4 are free variables (as 3rd, 4th columns are nonpivot columns)

3
 Free and Basic Variables

Free Variable

A variable that corresponds to a nonpivot column of the augmented

matrix.

Basic Variable

A variable that corresponds to a pivot column of the augmented matrix.

Example
Consider the system with the augmented matrix
2 3
1 2 5 6 0 5
6 7
6 0 1 6 3 0 2 7
4 5
0 0 0 0 1 0

• x3, x4 are free variables (as 3rd, 4th columns are nonpivot columns)

• x1, x2, x5 are basic variables (1st, 2nd, 5th columns are pivot columns)

3
 Existence Question
A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

4
 Existence Question
A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. ... 7
4 . 5
am1 am2 . . . amn bm

4
 Existence Question
A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. ... 7
4 . 5
am1 am2 . . . amn bm

Does the system of linear equations have a solution?

4
 Existence Question
A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. ... 7
4 . 5
am1 am2 . . . amn bm

Does the system of linear equations have a solution?

This can be determined from the echelon form of the

augmented matrix.

4
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 0

5
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 0

Forward stage of the row-reduction algorithm

2 3 2 3
6
4
2
3
1
2
1
2
1
2 5
7 6
40
1 1/2 1/2 1/2
1
7
1 1/7 5 echelon
form
11 5 5 0 0 0 0 1

FORWARD
STAGE

5
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2

leading
11x1 5x2 + 5x3 = 0

Forward stage of the row-reduction algorithm

2 3 2 3 entries
6
4
2
3
1
2
1
2
1
2 5
7 6o
40
1 1/2 1/2 1/2
1
7
1 1/7 5
11 5 5 0 0 0 0 1

Last row 0=1 (the linear system has no solution)

1st 2nd 4th columns

are
pivot columns

5
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 0

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 1/2 1/2 1/2
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 0 0 0 0 1

Last row 0=1 (the linear system has no solution)

Theorem 3.2.

The following are equivalent.

5
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 0

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 1/2 1/2 1/2
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 0 0 0 0 1

Last row 0=1 (the linear system has no solution)

Theorem 3.2.

The following are equivalent.

1. A system of linear equations has a solution.

5
 Existence Question

Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 0

Forward stage of the row-reduction algorithm

1
2 3 2 3
6
2 1 1 1
7 6
1 1/2 1/2 1/2
7 X t X2 2
4 3 2 2 2 5 40 1 1 1/7 5
3
4 3 3
11 5 5 0 0 0 0 1

Last row 0=1 (the linear system has no solution) 2x 2 2

Theorem 3.2.
Towie duction
1 I 2 I
4 31
The following are equivalent.
1. A system of linear equations has a solution.
2. The last column of the corresponding augmented matrix
is not a pivot column.
2 2
FEI
5
1883101914mn
 Uniqueness Question

A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. .. 7
.
4 . 5
am1 am2 . . . amn bm

6
 Uniqueness Question

A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. .. 7
.
4 . 5
am1 am2 . . . amn bm

Suppose the system of linear equations has a solution.

6
 Uniqueness Question

A system of m linear equations in n variables

a11x1 + a12x2 + · · · + a1nxn = b1

a21x1 + a22x2 + · · · + a2nxn = b2

...

am1x1 + am2x2 + · · · + amnxn = bm

Corresponding Augmented Matrix

2 3
a11 a12 . . . a1n b1
6 a 7
6 21 a22 . . . a2n b2 7
6 .. .. 7
.
4 . 5
am1 am2 . . . amn bm

Suppose the system of linear equations has a solution.

Is there only one solution?

6
 Uniqueness Question
Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 7

7
 Uniqueness Question
Example
2x1
3x1
x2 + x3 =
2x2 + 2x3 =
1
2
x
417
t
11x1 5x2 + 5x3 = 7

Fenian
Forward stage of the row-reduction algorithm
2 3 2 3
6
4
2
3
1
2
1
2
1
2 5
7 6
40o
1 0
1
0 4/7
7
1 1/7 5
11 5 5 7 0 0 0 0
form
1 I FORWARD
pilot
columns STAGE
Xi Xz basic
variables
xp free variable
7
 Uniqueness Question
Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 7

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 0 0 4/7
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 7 0 0 0 0
x1 = 4/7
x2 x3 = 1/7

7
 Uniqueness Question
Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 7

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 0 0 4/7
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 7 0 0 0 0
x1 = 4/7
x2 x3 = 1/7
Free to choose x3. Different choices of x3 yield different solutions.

7
 Uniqueness Question
Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 7

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 0 0 4/7
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 7 0 0 0 0
x1 = 4/7
x2 x3 = 1/7
Free to choose x3. Different choices of x3 yield different solutions.

Theorem 3.3.
Suppose a system of linear equations has a solution.
The following are equivalent.

7
 Uniqueness Question
Example
2x1 x2 + x3 = 1
3x1 2x2 + 2x3 = 2
11x1 5x2 + 5x3 = 7

Forward stage of the row-reduction algorithm

2 3 2 3
2 1 1 1 1 0 0 4/7
6 7 6 7
4 3 2 2 2 5 40 1 1 1/7 5
11 5 5 7 0 0 0 0
x1 = 4/7
x2 x3 = 1/7
Free to choose x3. Different choices of x3 yield different solutions.

Theorem 3.3.
Suppose a system of linear equations has a solution.
The following are equivalent.
1. The system has a unique solution.
2. The system has no free variables.

7
 Uniqueness Question

Find the
General Solution
solution
The set of all solutions to a system of linear equations. set of

system
this
I 0 1 6 3 0
a
2

to
augmented
matrix
8
 Uniqueness Question

General Solution

The set of all solutions to a system of linear equations.

Finding the General Solution

1. Apply the row-reduction algorithm.

8
 É Éfu
Uniqueness Question
six are the general'ÉhÉ of
system witnanamente
matrix
o
General Solution

The set of all solutions to a system of linear equations.

810 6 302
B xy free o o o 0100
XI Xz Xs basic

y.gg
Finding the General Solution

g
1. Apply the row-reduction algorithm.
T E T 212
2. In the reduced echelon form, express
the basic variables in terms of the free variables.

x
2
7 3
0 3 3
9
220 8
o
8 8 8
 Uniqueness Question

Example

Find all quadratic polynomials through

( 1, 0), (1, 1).

9
 generals Uniqueness Question Find

Example qltkaotaittaz s.t.gl1

17 0 9127
Find all quadratic polynomials through
Equivalently
a
find ao a
go taz
go
( 1, 0), (1, 1).

d 3 variables Ao ta ta 2 1
5
11
5

0
Apply row reduction
-5

-10

stamina
-15

188
-20

-25
-2 -1 0 1 2 3 4 5

reduced
az free ith
FÉEIÉÉÉÉÉÉo
echelon
a9 basic
 General Procedure (To Solve Systems of Linear Equations)

1. Apply the forward stage of the row reduction algorithm.

10
 General Procedure (To Solve Systems of Linear Equations)

1. Apply the forward stage of the row reduction algorithm.

2. If the last column is a pivot column, the system has no solution.

Otherwise, the system has a solution(s), continue.

10
 General Procedure (To Solve Systems of Linear Equations)

1. Apply the forward stage of the row reduction algorithm.

2. If the last column is a pivot column, the system has no solution.

Otherwise, the system has a solution(s), continue.

3. Apply the backward stage of the row reduction algorithm.

10
 General Procedure (To Solve Systems of Linear Equations)

1. Apply the forward stage of the row reduction algorithm.

2. If the last column is a pivot column, the system has no solution.

Otherwise, the system has a solution(s), continue.

3. Apply the backward stage of the row reduction algorithm.

4. In the reduced echelon form, there is exactly one basic variable

in every nonzero row.

10
 General Procedure (To Solve Systems of Linear Equations)

not
certainly
zero
Reduced
cementing
1. Apply the forward stage of the row reduction algorithm.
ÉÉÉÉÉ
row of echelons
I
a
reduced
2. If the last column is a pivot column, the system has no solution.form
Otherwise, the system has a solution(s), continue.
XI basic
3. Apply the backward stage of the row reduction algorithm.
XI is free
it is containe

columnpivot
4. In the reduced echelon form, there is exactly one basic variable
in every nonzero row.
in a non
Express the basic variable in every nonzero row in terms of the
free variables. Tnonreroentries
except the leading entry
10
to variables
 I s
Summary

• Pivot Positions and Columns

• Free and Basic Variables

• Existence of a Solution for a System of Linear Equations

• Uniqueness of the Solution for a System of Linear Equations

• General Solution for a System of Linear Equations

11
 Exercise

x1 3x2 = 4
3x1 6x2 = 3
2x1 hx2 = b

12
 Exercise

x1 3x2 = 4
3x1 6x2 = 3
2x1 hx2 = b

For what values of h and b,

does the system above have a solution?

12
 Exercise

x1 3x2 = 4
3x1 6x2 = 3
2x1 hx2 = b

For what values of h and b,

does the system above have a solution?

12
 Exercise

Underdetermined Linear Systems

Consider the following system of m linear equations

Example
system
in n variables.
a
a11x1 + a12x2 + · · · + a1nxn = b1
a21x1 + a22x2 + · · · + a2nxn
...
= b2
with Beans
5 variables
am1x1 + am2x2 + · · · + amnxn = bm

Suppose m < n.

13
 Exercise

Underdetermined Linear Systems

Consider the following system of m linear equations

in n variables.
a11x1 + a12x2 + · · · + a1nxn = b1
a21x1 + a22x2 + · · · + a2nxn = b2
...

am1x1 + am2x2 + · · · + amnxn = bm

Suppose m < n.

Show that the linear system cannot have

a unique solution.

13
 Exercise

Underdetermined Linear Systems

Consider the following system of m linear equations

in n variables.
a11x1 + a12x2 + · · · + a1nxn = b1
a21x1 + a22x2 + · · · + a2nxn = b2
...

am1x1 + am2x2 + · · · + amnxn = bm

Suppose m < n.

Show that the linear system cannot have

a unique solution.

13
 Exercise

Find a quadratic polynomial through

(1, 1), (3, 4), (2, 1), ( 1, 1).

14
 Exercise

Find a quadratic polynomial through

(1, 1), (3, 4), (2, 1), ( 1, 1).

14