Introduction

Systems of Linear Equations

Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Linear Algebra-1 Solve the linear system

TeacherµQiang Ma(êr)

[email protected]

Linear equations in Linear Algebra 1 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Contents
1 Introduction
2 Systems of Linear Equations
3 Row reduction and echelon forms
Echelon matrix
Pivot Positions
Row Reduction Algorithm
Solutions of linear systems
4 Solutions sets of linear systems
Vector form of linear system
Matrix form of linear system
Homogeneous Linear Systems
Solution set in parametric vector form
Solutions of Nonhomogeneous systems
5 Linear dependency and independency
6 Applications

Linear equations in Linear Algebra 2 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Text book and Reference

David C. Lay, Linear Algebra and its

applications, Fourth Edition
Guohua Peng, Langquan Li, Linear
Algebra, High Education Press, 2006.
5‚5“ê6§oAŒÆêÆÆ ?

Linear equations in Linear Algebra 3 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Final Score composition

Final Score = 50% × (Final exam) + 50% × (Regular grade)

Regular grade = 10% × (Attendance) + 50% × (Mini test)
+ 40% × (Homework)
Mini Test = average score of 4 mini tests
Homework = average score of homework about each week.

Linear equations in Linear Algebra 4 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Final Score composition

Final Score = 50% × (Final exam) + 50% × (Regular grade)

Regular grade = 10% × (Attendance) + 50% × (Mini test)
+ 40% × (Homework)
Mini Test = average score of 4 mini tests
Homework = average score of homework about each week.

Submit your homework and tests in our chat group!

Linear equations in Linear Algebra 4 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Linear equations

Definition 1
Linear equation: a1 x1 + a2 x2 + · · · + an xn = b

Definition 2
System of equations: A collection of one or more linear equations

a11 x1 + a12 x2 + · · · + a1n xn = b1

a21 x1 + a22 x2 + · · · + a2n xn = b2

(1)

 · ··
am1 x1 + am2 x2 + · · · + amn xn = bm


x1 , x2 , · · · , xn : unknown,
aij (1 ≤ i ≤ n, 1 ≤ j ≤ m): coefficients(known),
b1 , b2 , · · · , bn : right hand terms(known).

Linear equations in Linear Algebra 5 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Three forms of system of linear equations

Complete form:


a11 x1 + a12 x2 + · · · + a1n xn = b1

a x + a x + · · · + a x = b
21 1 22 2 2n n 2
(2)
· · ·


am1 x1 + am2 x2 + · · · + amn xn = bm


Vector form:
a1 x1 + a2 x2 + · · · an xn = b, (3)
Matrix form:
Ax = b. (4)

Linear equations in Linear Algebra 6 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Solution of linear system

Definition 3
Solutions of the system Ax = b: A list (s1 , s2 , . . . , sn ) satisfy all the
linear equations.

Definition 4
Two linear systems are called equivalent if they have the same solution
set.
How to solve the systems of equations and obtain the solution?
Basic idea: Make the number of unknowns in an equation as small
as possible—ax = b.

Linear equations in Linear Algebra 7 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Solution of linear system

Definition 3
Solutions of the system Ax = b: A list (s1 , s2 , . . . , sn ) satisfy all the
linear equations.

Definition 4
Two linear systems are called equivalent if they have the same solution
set.
How to solve the systems of equations and obtain the solution?
Basic idea: Make the number of unknowns in an equation as small
as possible—ax = b.
Basic technique: Equivalent transformation—Row reduction
algorithm.

Linear equations in Linear Algebra 7 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Elementary row operations

1 (Replacement) Replace one row by the sum of itself and a multiple

of another row.

Linear equations in Linear Algebra 8 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Elementary row operations

1 (Replacement) Replace one row by the sum of itself and a multiple

of another row.
2 (Interchange) Interchange two rows.

Linear equations in Linear Algebra 8 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Elementary row operations

1 (Replacement) Replace one row by the sum of itself and a multiple

of another row.
2 (Interchange) Interchange two rows.
3 (Scaling) Multiply all entries in a row by nonzero constant

Linear equations in Linear Algebra 8 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)
Three cases:
b
1 a 6= 0, we have the unique solution x = .
a
2 a = 0, but b 6= 0, the solution does not exist.
3 a = 0, and b = 0, all the numbers are solution(There are infinite
many solutions).

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)
Three cases:
b
1 a 6= 0, we have the unique solution x = .
a
2 a = 0, but b 6= 0, the solution does not exist.
3 a = 0, and b = 0, all the numbers are solution(There are infinite
many solutions).
For the Linear System, the same equation arises

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)
Three cases:
b
1 a 6= 0, we have the unique solution x = .
a
2 a = 0, but b 6= 0, the solution does not exist.
3 a = 0, and b = 0, all the numbers are solution(There are infinite
many solutions).
For the Linear System, the same equation arises
Does a linear system have a solution? If does, is the solution unique
or not?

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)
Three cases:
b
1 a 6= 0, we have the unique solution x = .
a
2 a = 0, but b 6= 0, the solution does not exist.
3 a = 0, and b = 0, all the numbers are solution(There are infinite
many solutions).
For the Linear System, the same equation arises
Does a linear system have a solution? If does, is the solution unique
or not?
How to present the solution?

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Existence and uniqueness of a linear system

The simplest equation

ax = b (5)
Three cases:
b
1 a 6= 0, we have the unique solution x = .
a
2 a = 0, but b 6= 0, the solution does not exist.
3 a = 0, and b = 0, all the numbers are solution(There are infinite
many solutions).
For the Linear System, the same equation arises
Does a linear system have a solution? If does, is the solution unique
or not?
How to present the solution?
We should solve the linear system in a systematic or standard way.

Linear equations in Linear Algebra 9 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Echelon matrix

Definition 5
A rectangle matrix is in echelon form if it has the following three
properties:
1 All nonzero rows are above any rows of all zeros.
2 Each leading entry of a row is in a column to the right of the leading
entry of the row above it.
3 All entries in a column below a leading entry are zeros.

Definition 6
A matrix in reduced echelon form satisfies the following additional
properties:
1 The leading entry in each nonzero row in 1.
2 Each leading 1 is the only nonzero entry in its column.

Linear equations in Linear Algebra 10 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Echelon matrix

Echelon matrix:

, ,

Reduced echelon matrix:

, ,

Linear equations in Linear Algebra 11 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Pivot position

Definition 7
A pivot position in a matrix A is a location in A corresponding to a
leading 1 in the reduced echelon form of A. A pivot column is a column
of A that contains a pivot position.

Theorem 8
Each matrix is row equivalent to one and only one reduced echelon
matrix.

Any nonzero matrix may be row reduced into more than one matrix
in echelon form. However, the reduced echelon form one obtains
from a matrix is unique.

Linear equations in Linear Algebra 12 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Pivot position

Definition 7
A pivot position in a matrix A is a location in A corresponding to a
leading 1 in the reduced echelon form of A. A pivot column is a column
of A that contains a pivot position.

Theorem 8
Each matrix is row equivalent to one and only one reduced echelon
matrix.

Any nonzero matrix may be row reduced into more than one matrix
in echelon form. However, the reduced echelon form one obtains
from a matrix is unique.
How to row reduce a matrix to a reduced echelon form?

Linear equations in Linear Algebra 12 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Row Reduction Algorithm

Five steps to produce a matrix in reduced echelon form

1 Begin with the leftmost nonzero column. This is a pivot column.
The pivot position in at the top.

Linear equations in Linear Algebra 13 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Row Reduction Algorithm

Five steps to produce a matrix in reduced echelon form

1 Begin with the leftmost nonzero column. This is a pivot column.
The pivot position in at the top.
2 Select a nonzero entry in the pivot column as a pivot. If necessary,
interchange rows to move this entry into the pivot position.

Linear equations in Linear Algebra 13 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Row Reduction Algorithm

Five steps to produce a matrix in reduced echelon form

1 Begin with the leftmost nonzero column. This is a pivot column.
The pivot position in at the top.
2 Select a nonzero entry in the pivot column as a pivot. If necessary,
interchange rows to move this entry into the pivot position.
3 Use row replacement operations to create zeros in all positions
below the pivot.

Linear equations in Linear Algebra 13 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Row Reduction Algorithm

Five steps to produce a matrix in reduced echelon form

1 Begin with the leftmost nonzero column. This is a pivot column.
The pivot position in at the top.
2 Select a nonzero entry in the pivot column as a pivot. If necessary,
interchange rows to move this entry into the pivot position.
3 Use row replacement operations to create zeros in all positions
below the pivot.
4 Cover(or ignore) the row containing the pivot position and cover all
rows, if any, above it. Apply step 1-3 to the submatrix that remains.
Repeat the process until there are no more nonzero rows to modify.

Linear equations in Linear Algebra 13 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Row Reduction Algorithm

Five steps to produce a matrix in reduced echelon form

1 Begin with the leftmost nonzero column. This is a pivot column.
The pivot position in at the top.
2 Select a nonzero entry in the pivot column as a pivot. If necessary,
interchange rows to move this entry into the pivot position.
3 Use row replacement operations to create zeros in all positions
below the pivot.
4 Cover(or ignore) the row containing the pivot position and cover all
rows, if any, above it. Apply step 1-3 to the submatrix that remains.
Repeat the process until there are no more nonzero rows to modify.
5 Beginning with the rightmost pivot and working upward and to the
left, create zeros above each pivot. If a pivot is not 1, make it 1 by a
scaling operation.

Linear equations in Linear Algebra 13 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

→ ,
(a) (b) Step 1

, , ,
(c) Step 2 (d) Step 3 (e) Step 4-1

, ,
(f) Step 4-2 (g) Step 4-3 (h) Step 5

Linear equations in Linear Algebra 14 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Existence and uniqueness theorem

Definition 9
Basic variables: Variables corresponding to the pivot columns.
Free variables: Variables not corresponding to the pivot columns.

Theorem 10
A linear system is consistent if and only if the rightmost column of the
augmented matrix is not a pivot column—that is, if and only if an
echelon form of the augmented matrix has no row of the form
[0 ··· 0 b], b 6= 0
If a linear system is consistent, then the solution set contains
(i) A unique solution, when there are no free variables,
(ii) Infinitely many solutions, when there is at least one free variable.

Linear equations in Linear Algebra 15 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.
2 Use the row reduction algorithm to obtain an equivalent augmented
matrix in echelon form.

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.
2 Use the row reduction algorithm to obtain an equivalent augmented
matrix in echelon form.
3 Decide whether the system is consistent. If there is no solution, stop;
otherwise go to the next step.

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.
2 Use the row reduction algorithm to obtain an equivalent augmented
matrix in echelon form.
3 Decide whether the system is consistent. If there is no solution, stop;
otherwise go to the next step.
4 Continue row reduction to obtain the reduced echelon form

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.
2 Use the row reduction algorithm to obtain an equivalent augmented
matrix in echelon form.
3 Decide whether the system is consistent. If there is no solution, stop;
otherwise go to the next step.
4 Continue row reduction to obtain the reduced echelon form
5 Write the system of equations corresponding to the matrix obtained
in step 3.

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Ax = b
Coefficient matrix: A; Augmented matrix: [A b].
Using row reduction to solve the linear system:
1 Write the augmented matrix [A b] of the system.
2 Use the row reduction algorithm to obtain an equivalent augmented
matrix in echelon form.
3 Decide whether the system is consistent. If there is no solution, stop;
otherwise go to the next step.
4 Continue row reduction to obtain the reduced echelon form
5 Write the system of equations corresponding to the matrix obtained
in step 3.
6 Rewrite each nonzero equation from step 4 so that its one basic
variable is expressed in terms of any free variable appearing in the
equation.

Linear equations in Linear Algebra 16 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Example 11
Determine the existence and uniqueness of the solutions of the system

Linear equations in Linear Algebra 17 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Example 11
Determine the existence and uniqueness of the solutions of the system

Solution: The augmented matrix is row reduced to

Linear equations in Linear Algebra 17 / 30

 Introduction
Systems of Linear Equations Echelon matrix
Row reduction and echelon forms Pivot Positions
Solutions sets of linear systems Row Reduction Algorithm
Linear dependency and independency Solutions of linear systems
Applications

Example 11
Determine the existence and uniqueness of the solutions of the system

Solution: The augmented matrix is row reduced to

Basic variables: x1 , x2 , x5 ; Free variables: x3 , x4 .

The System is consistent and has infinitely many solutions.
Linear equations in Linear Algebra 17 / 30
 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Definition 12
Given vectors v1 , v2 , · · · , vp in Rn , and scalars c1 , c2 , . . . , cp , the vector y
defined by
y = c1 v1 + c2 v2 + · · · + cp vp
is called a linear combination of v1 , v2 , · · · , vp with weights c1 , c2 , . . . , cp .

x1 a1 + x2 a2 + · · · + xn an = b
The above vector equation has the same solution set as the linear system
whose augmented matrix is

[a1 a2 ··· an b]

In particular, b can be represented(generated) by a linear combination of

a1 , . . . , an with the weight x1 , x2 , . . . , xn if and only if there exists a
solution to the linear system corresponding to the augmented matrix
above.
Linear equations in Linear Algebra 18 / 30
 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Definition 13
If A is an m × n matrix, with column a1 , a2 , . . . , an , and if x is in Rn ,
the product of A and x, denoted by Ax, is the linear combination of the
column of A using the corresponding entries in x as weights, that is

Note: Ax is well defined only if the number of columns of A equals the

number of entries in x.

Linear equations in Linear Algebra 19 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Theorem 14
The matrix
Ax = b
has the same solutions set as the vector equation
x1 a1 + x2 a2 + · · · + xn an = b
which in turn has the same solution set as the linear system whose
augmented matrix is
[a1 a2 · · · an b]

Existence of solutions
The equation Ax = b has a solution if and only if b is a linear
combination of the columns of A.

Linear equations in Linear Algebra 20 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Existence of linear system

Theorem 15
Let A be an m × n matrix, then the following statements are logically
equivalent.
1 For each b in Rm , the equation Ax = b has a solution.

Linear equations in Linear Algebra 21 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Existence of linear system

Theorem 15
Let A be an m × n matrix, then the following statements are logically
equivalent.
1 For each b in Rm , the equation Ax = b has a solution.
2 Each b in Rm is a linear combination of the column of A.

Linear equations in Linear Algebra 21 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Existence of linear system

Theorem 15
Let A be an m × n matrix, then the following statements are logically
equivalent.
1 For each b in Rm , the equation Ax = b has a solution.
2 Each b in Rm is a linear combination of the column of A.
3 The columns of A span Rm .

Linear equations in Linear Algebra 21 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Existence of linear system

Theorem 15
Let A be an m × n matrix, then the following statements are logically
equivalent.
1 For each b in Rm , the equation Ax = b has a solution.
2 Each b in Rm is a linear combination of the column of A.
3 The columns of A span Rm .
4 A has a pivot positions in every row.

Linear equations in Linear Algebra 21 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Definition 16
A linear system Ax = b is said to be homogeneous if b = 0.

Trivial solution: x = 0 such that Ax = 0 holds.

Nontrivial solution: x 6= 0 such that Ax = 0 holds.

The homogeneous equations Ax = 0 has a nontrivial solution if and only

if the equation has at least one free variable.

Example 17
Determine if the following homogeneous system has a nontrivial solution.

Linear equations in Linear Algebra 22 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Parametric vector form

Example 18
Describe all solutions of the homogeneous “system”
10x1 − 3x2 − 2x3 = 0

The solutions set is all the linear combinations of the vectors u and v, i.e.
the Span{u, v}. We say that the solution is in parametric vector form.
Linear equations in Linear Algebra 23 / 30
 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

When a nonhomogeneous linear system has many solutions, the general

solution can be written in parametric form as one vector plus an arbitrary
linear combinations of vectors that satisfy the corresponding
homogeneous system.

Nonhomogeneous Solution =one Particular Solution

+ Homogeneous Solution Set.

Example 19
Describe all solutions of Ax = b, where

Linear equations in Linear Algebra 24 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Theorem 20
Suppose the equation Ax = b is consistent for some given b, and let p be
a solution. Then the solution set of Ax = b is the set of all vectors of the
form w = p + vh , where vh is any solution of the homogeneous equations
Ax = 0.
Writing a solution set in parametric vector form
Row reduce the augmented matrix to reduced echelon form.

Linear equations in Linear Algebra 25 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Theorem 20
Suppose the equation Ax = b is consistent for some given b, and let p be
a solution. Then the solution set of Ax = b is the set of all vectors of the
form w = p + vh , where vh is any solution of the homogeneous equations
Ax = 0.
Writing a solution set in parametric vector form
Row reduce the augmented matrix to reduced echelon form.
Express each basic variable in terms of any free variables appearing
in an equation.

Linear equations in Linear Algebra 25 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Theorem 20
Suppose the equation Ax = b is consistent for some given b, and let p be
a solution. Then the solution set of Ax = b is the set of all vectors of the
form w = p + vh , where vh is any solution of the homogeneous equations
Ax = 0.
Writing a solution set in parametric vector form
Row reduce the augmented matrix to reduced echelon form.
Express each basic variable in terms of any free variables appearing
in an equation.
Write a typical solution x as a vector whose entries depend on the
free variables, if any.

Linear equations in Linear Algebra 25 / 30

 Introduction
Vector form of linear system
Systems of Linear Equations
Matrix form of linear system
Row reduction and echelon forms
Homogeneous Linear Systems
Solutions sets of linear systems
Solution set in parametric vector form
Linear dependency and independency
Solutions of Nonhomogeneous systems
Applications

Theorem 20
Suppose the equation Ax = b is consistent for some given b, and let p be
a solution. Then the solution set of Ax = b is the set of all vectors of the
form w = p + vh , where vh is any solution of the homogeneous equations
Ax = 0.
Writing a solution set in parametric vector form
Row reduce the augmented matrix to reduced echelon form.
Express each basic variable in terms of any free variables appearing
in an equation.
Write a typical solution x as a vector whose entries depend on the
free variables, if any.
Decompose x into a linear combination of vectors(with numeric
entries) using free variables as parameters.

Linear equations in Linear Algebra 25 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Definition 21
An indexed set of vectors {v1 , · · · , vp } in Rn is said to be linearly
independent if the vector equation
x1 v1 + x2 v2 + · · · + xp vp = 0
has only trivial solution. The set {v1 , · · · , vp } is said to be linearly
dependent if there exist weights c1 , · · · , cp , not all zeros, such that
c1 v1 + c2 v2 + · · · + cp vp = 0

Example 22
     
1 4 2
     
Determine if the set v1 = 2 , v2 = 5 , v3 = 1
    
 is linearly
3 6 0
independent.

Linear equations in Linear Algebra 26 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Matrix equations Ax = 0 can be written as

x1 a1 + x2 a2 + · · · + xp ap = 0

Each linear dependence relation among the columns of A corresponding

to a nontrivial solution of Ax = 0.

Theorem 23
The columns of a matrix A are linearly independent if and only if the
equation Ax = 0 has only trivial solution.

Linear equations in Linear Algebra 27 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

A set containing only one vector v is linear independent if and only if v is

not the zero vector.

A set of two vectors {v1 , v2 } is linear dependent if at least one of the

vectors is a multiple of the other. The set is linearly independent if and
only if neither of the vectors is a multiplier of the other.

An indexed set S = {v1 , · · · , vp } of two and more vectors is linearly

dependent if and only if at least one of the vectors in S is a linear
combination of the others. In fact, if S is linearly dependent and v1 6= 0,
then some vj (withj > 1) is a linear combination of the proceeding
vectors, v1 , · · · , vj−1 .

Linear equations in Linear Algebra 28 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

Theorem 24
If a set contains more than there are entries in each vector, then the set
is linearly dependent. That is, any set {v1 , · · · , vp } in Rn is linearly
dependent if p ≥ n.

Proof: The corresponding homogeneous equations Ax = 0,

A = [v1 v2 · · · vp ] is a n × p matrix. The numbers of unknowns is
greater than the number of equations, there must be a free variable.
Hence Ax = 0 has a nontrivial solution.
Theorem 25
If a set S = {v1 , · · · , vp } in RN contains a zero vector, then the set if
linearly dependent.

Linear equations in Linear Algebra 29 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

1 Question 1: An unknown number of rabbits and chickens were

locked in a cage, count from top,there was 35 heads; count from
bottom,there was 94 feets. How many rabbits and chickens were
locked in this cage?

Linear equations in Linear Algebra 30 / 30

 Introduction
Systems of Linear Equations
Row reduction and echelon forms
Solutions sets of linear systems
Linear dependency and independency
Applications

1 Question 1: An unknown number of rabbits and chickens were

locked in a cage, count from top,there was 35 heads; count from
bottom,there was 94 feets. How many rabbits and chickens were
locked in this cage?
2 Question 2: How many pieces of RMB 1, 2 and 5 to pay 20 yuan?
List all the possible solutions.

Linear equations in Linear Algebra 30 / 30