|Math 231-Fall 2019|Sections 4.7&4.

8|Page 1

Section 4.7: Row Space, Column Space, and Null Space1

Section 4.8: Rank, Nullity, and the Fundamental Matrix
Spaces
Concepts:

Section 4.7 Section 4.8

• Row vectors. • Rank
• Column vectors. • Nullity
• Row space. • Dimension Theorem
• Column space. • Overdetermined system
• Null space. • Underdetermined system
• Relationships among linear systems • Fundamental spaces of a matrix
and row spaces, column spaces, and • Relationships among the
null spaces. fundamental spaces
• Relationships among the row space, • Equivalent characterizations of
column space, and null space of a invertible matrices
matrix.
Learning Outcomes.
After completing this section, you should be able to:

Section 4.7 Section 4.8

• Determine whether a given vector is • Find the rank and nullity of a
in the column space of a matrix; if it matrix.
is, express it as a linear combination • Find the dimension of the row
of the column vectors of the matrix. space of a matrix.
• Find a basis for the null space of a
matrix.
• Find a basis for the row space of a
matrix.
• Find a basis for the column space of
a matrix.
• Find a basis for the span of a set of
vectors in ℝ𝑛𝑛 .

1
The materials of these lecture notes are based on the textbook of the course.
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 2

Row Space, Column Space, and Null Space:

Let 𝐴𝐴 be the 𝑚𝑚 × 𝑛𝑛 matrix
𝑎𝑎11 𝑎𝑎12 ⋯ 𝑎𝑎1𝑛𝑛
𝑎𝑎21 𝑎𝑎22 ⋯ 𝑎𝑎2𝑛𝑛
𝐴𝐴 = � ⋮ ⋮ ⋱ ⋮ �
𝑎𝑎𝑚𝑚1 𝑎𝑎𝑚𝑚2 ⋯ 𝑎𝑎𝑚𝑚𝑚𝑚 𝑚𝑚×𝑛𝑛

Row vectors of 𝑨𝑨 (𝒎𝒎 vectors in ℝ𝒏𝒏 ):

𝐫𝐫1 = [𝑎𝑎11 𝑎𝑎12 ⋯ 𝑎𝑎1𝑛𝑛 ]
𝐫𝐫2 = [𝑎𝑎21 𝑎𝑎22 ⋯ 𝑎𝑎2𝑛𝑛 ]
⋮
𝐫𝐫𝑚𝑚 = [𝑎𝑎𝑚𝑚1 𝑎𝑎𝑚𝑚2 ⋯ 𝑎𝑎𝑚𝑚𝑚𝑚 ]

Column vectors of 𝑨𝑨 (𝒏𝒏 vectors in ℝ𝒎𝒎 ):

𝑎𝑎11 𝑎𝑎12 𝑎𝑎1𝑛𝑛
𝑎𝑎21 𝑎𝑎22 𝑎𝑎2𝑛𝑛
𝐜𝐜1 = � ⋮ � , 𝐜𝐜2 = � ⋮ � , … , 𝐜𝐜𝑛𝑛 = � ⋮ � ,
𝑎𝑎𝑚𝑚1 𝑎𝑎𝑚𝑚2 𝑎𝑎𝑚𝑚𝑚𝑚

Row Space:
The subspace of ℝ𝑛𝑛 spanned by the row vectors of 𝐴𝐴 is called the row space of 𝐴𝐴,
row(𝐴𝐴) = span{𝐫𝐫1 , 𝐫𝐫2 , … , 𝐫𝐫𝑚𝑚 } ⊆ ℝ𝑛𝑛

Column Space:
The subspace of ℝ𝑚𝑚 spanned by the column vectors of 𝐴𝐴 is called the column space of 𝐴𝐴,
col(𝐴𝐴) = span{𝐜𝐜1 , 𝐜𝐜2 , … , 𝐜𝐜𝑛𝑛 } ⊆ ℝ𝑚𝑚

Null Space:
The solution space of the homogeneous system of equations 𝐴𝐴𝐱𝐱 = 𝟎𝟎, which is a subspace of
ℝ𝑛𝑛 , is called the null space of 𝐴𝐴,
null(𝐴𝐴) = {𝐱𝐱 ∈ ℝ𝑛𝑛 | 𝐴𝐴𝐱𝐱 = 𝟎𝟎} ⊆ ℝ𝑛𝑛
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 3

Theorem.
A system of linear equations 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is consistent if and only if
𝐛𝐛 ∈ col(𝐴𝐴) = span{column vectors of 𝐴𝐴}

Theorem.
The row space and the column space of a matrix A have the same dimension, i.e.,
dim(row(𝐴𝐴)) = dim(col(𝐴𝐴))
Rank:
The common dimension of the row space and column space of a matrix 𝐴𝐴 is called the rank
of 𝐴𝐴 and is denoted by rank(𝐴𝐴), i.e.,
rank(𝐴𝐴) = dim(row(𝐴𝐴)) = dim(col(𝐴𝐴)).

Nullity:
The dimension of the null space of 𝐴𝐴 is called the nullity of 𝐴𝐴 and is denoted by nullity(𝐴𝐴),
i.e.,
nullity(𝐴𝐴) = dim(null(𝐴𝐴))
Maximum Value for Rank:
Let 𝐴𝐴 be an 𝑚𝑚 × 𝑛𝑛 matrix, then
rank(𝐴𝐴) ≤ min(𝑚𝑚, 𝑛𝑛).
If rank(𝐴𝐴) = min(𝑚𝑚, 𝑛𝑛), then we say that 𝐴𝐴 is full rank.
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 4

Theorem.
If 𝐴𝐴 is an 𝑚𝑚 × 𝑛𝑛 matrix, then
a) rank(𝐴𝐴) + nullity(𝐴𝐴) = 𝑛𝑛.
b) rank(𝐴𝐴) = the number of leading variables in the solution of 𝐴𝐴𝐱𝐱 = 𝟎𝟎.
c) nullity(𝐴𝐴) = the number of parameters in the solution of 𝐴𝐴𝐱𝐱 = 𝟎𝟎.

Example. Find the number of parameters in the solution of 𝐴𝐴𝐱𝐱 = 𝟎𝟎 if 𝐴𝐴 is a 5 × 7 matrix

with rank(𝐴𝐴) = 3.

Example. Find the rank of a 5 × 7 matrix 𝐴𝐴 for which 𝐴𝐴𝐱𝐱 = 𝟎𝟎 has a two-dimensional
solution space.

Example. Let 𝐴𝐴 be a 7 × 6 matrix such that 𝐴𝐴𝐱𝐱 = 𝟎𝟎 has only the trivial solution. Find the
rank and nullity of 𝐴𝐴.
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 5

Bases for the Row and Column Spaces of a Matrix in Row Echelon Form

If a matrix 𝑹𝑹 is in row echelon form, then:

• the row vectors with the leading 1’s form a basis for the row space of 𝑅𝑅.
• the column vectors with the leading 1’s form a basis for the column space of 𝑅𝑅.

Example. Let:
1 −2 5 0 3
0 1 3 0 0
𝑅𝑅 = � �
0 0 0 1 0
0 0 0 0 0
a) Find bases for row(𝑅𝑅) (the row space of 𝑅𝑅).
b) Find bases for col(𝑅𝑅) (the column space of 𝑅𝑅).
c) Find dim(row(𝐴𝐴)) and dim(col(𝐴𝐴)).
d) Find rank(𝑅𝑅) and nullity(𝑅𝑅).
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 6

Row Space, Column Space, Null Space and elementary row operations:

• Elementary row operations do not change the null space of a matrix.

• Elementary row operations do not change the row space of a matrix.
• Elementary row operations may change the column space of a matrix.

Remark.
Since elementary row operations do not change the row space of a matrix, we can find a
basis for the row space of a matrix 𝐴𝐴 by finding a basis for the row space of any row echelon
form of 𝐴𝐴.

Example. Let:
1 −1 1
𝐴𝐴 = � 2 −2 2 �
−3 3 −3
a) Find bases for row(𝐴𝐴) (the row space of 𝐴𝐴).
b) Find a basis for null(𝐴𝐴) (the null space of 𝐴𝐴).
c) Find the rank and nullity of 𝐴𝐴.
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 7

Example. Let
−1 2 0 4 5 −3
3 −7 2 0 1 4
𝐴𝐴 = � �
2 −5 2 4 6 1
4 −9 2 −4 −4 7
a) Find a basis for row(𝐴𝐴) (the row space of 𝐴𝐴).
b) Find rank(𝐴𝐴) and dim(null(𝐴𝐴)).
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 8

Column Space and elementary row operations:

• Elementary row operations may alter the column space of a matrix 𝐴𝐴.
• Elementary row operations do not alter dependence relationships among the column
vectors of 𝐴𝐴.
• Elementary row operations do not change the dimension of col(𝐴𝐴).

Theorem.
If 𝐴𝐴 is a give matrix and 𝑅𝑅 is any row echelon form of 𝐴𝐴. Then
• A given set of column vectors of 𝐴𝐴 is linearly independent if and only if the
corresponding column vectors of 𝑅𝑅 are linearly independent.
• A given set of column vectors of 𝐴𝐴 forms a basis for the column space of 𝐴𝐴 if and only
if the corresponding column vectors of 𝑅𝑅 form a basis for the column space of 𝑅𝑅.
Example. Let:
1 −3 4 −2 5 4
2 −6 9 −1 8 2
𝐴𝐴 = � �
2 −6 9 −1 9 7
−1 3 −4 2 −5 −4
a) Find a basis for row(𝐴𝐴) (the row space of 𝐴𝐴).
b) Find a basis for col(𝐴𝐴) (the column space of 𝐴𝐴).
c) Find dim(row(𝐴𝐴)) and dim(col(𝐴𝐴)).
d) Find rank(𝐴𝐴) and nullity(𝐴𝐴).
 |Math 231-Fall 2019|Sections 4.7&4.8|Page 9

Basis for the Space Spanned by a Set of Vectors:

To find a basis for the space span(𝑆𝑆) where 𝑆𝑆 = {𝐯𝐯1 , 𝐯𝐯2 , … , 𝐯𝐯𝑘𝑘 } ⊂ ℝ𝑛𝑛 :
Step 1. Form the matrix 𝐴𝐴 whose columns are the vectors 𝐯𝐯1 , 𝐯𝐯2 , … , 𝐯𝐯𝑘𝑘 .
Step 2. Reduce the matrix 𝐴𝐴 to row echelon form 𝑅𝑅.
Step 3. Denote the column vectors of 𝑅𝑅 by 𝐰𝐰1 , 𝐰𝐰2 , … , 𝐰𝐰𝑘𝑘 .
Step 4. Identify the columns of 𝑅𝑅 that contain the leading 1’s. The corresponding column
vectors of 𝐴𝐴 form a basis for span(𝑆𝑆).
Example.
Find a subset of the vectors:
𝐯𝐯1 = (1, −2,0,3), 𝐯𝐯2 = (2, −5, −3,6), 𝐯𝐯3 = (0,1,3,0),
𝐯𝐯4 = (2, −1,4, −7), 𝐯𝐯5 = (5, −8,1,2),
that forms a basis for the subspace of ℝ4 spanned by these vectors.
 | M a t h 2 3 1 - F a l l 2 0 1 9 | S e c t i o n s 4 . 7 & 4 . 8 | P a g e 10

The Fundamental Spaces of a Matrix:

There are six important vector spaces associated with a matrix 𝐴𝐴 and its transpose 𝐴𝐴𝑇𝑇 :
1) row(𝐴𝐴) 4) row(𝐴𝐴𝑇𝑇 )
2) col(𝐴𝐴) 5) col(𝐴𝐴𝑇𝑇 )
3) null(𝐴𝐴) 6) null(𝐴𝐴𝑇𝑇 )

Theorem.
If 𝐴𝐴 is any matrix, then rank(𝐴𝐴) = rank(𝐴𝐴𝑇𝑇 ).

Remark.
If 𝐴𝐴 is an 𝑚𝑚 × 𝑛𝑛 matrix, then
• The spaces row(𝐴𝐴) and null(𝐴𝐴) are subspaces of ℝ𝑛𝑛
• The spaces col(𝐴𝐴) and null(𝐴𝐴𝑇𝑇 ) are subspaces of ℝ𝑚𝑚 .
• rank(𝐴𝐴) + nullity(𝐴𝐴) = 𝑛𝑛.
• rank(𝐴𝐴) + nullity(𝐴𝐴𝑇𝑇 ) = 𝑚𝑚.

Remark.
If 𝐴𝐴 is an 𝑛𝑛 × 𝑛𝑛 matrix (i.e., 𝐴𝐴 is a square matrix), then nullity(𝐴𝐴) = nullity(𝐴𝐴𝑇𝑇 ).

Remark.
If 𝐴𝐴 is an 𝑚𝑚 × 𝑛𝑛 matrix and rank(𝐴𝐴) = 𝑟𝑟, then
• dim(row(𝐴𝐴)) = 𝑟𝑟
• dim(col(𝐴𝐴)) = 𝑟𝑟
• dim(null(𝐴𝐴)) = 𝑛𝑛 − 𝑟𝑟
• dim(null(𝐴𝐴𝑇𝑇 )) = 𝑚𝑚 − 𝑟𝑟

Remark. Let 𝐴𝐴𝐱𝐱 = 𝐛𝐛 be a linear system of 𝑚𝑚 equations in 𝑛𝑛 unknowns (i.e., 𝐴𝐴 is an 𝑚𝑚 × 𝑛𝑛

matrix, 𝐱𝐱 ∈ ℝ𝑛𝑛 , 𝐛𝐛 ∈ ℝ𝑚𝑚 ).
1) The linear system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is consistent if and only if 𝐛𝐛 ∈ col(𝐴𝐴).
2) If 𝐛𝐛 ∈ col(𝐴𝐴), then nullity(𝐴𝐴) = the number of parameters in the solution of 𝐴𝐴𝐱𝐱 = 𝐛𝐛.
3) If 𝐛𝐛 ∈ col(𝐴𝐴) and nullity(𝐴𝐴) = 0, then the linear system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 have a unique
solution.
4) The non-homogeneous linear system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 will be always consistent if
dim(col(𝐴𝐴)) = 𝑚𝑚.
 | M a t h 2 3 1 - F a l l 2 0 1 9 | S e c t i o n s 4 . 7 & 4 . 8 | P a g e 11

Equivalent Statements:
Theorem.
If 𝐴𝐴 is an 𝑛𝑛 × 𝑛𝑛 matrix, then the following statements are equivalent.
1) 𝐴𝐴 is invertible.
2) |𝐴𝐴| ≠ 0.
3) 𝐴𝐴𝐱𝐱 = 𝟎𝟎 has only the trivial solution.
4) 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is consistent for every 𝑛𝑛 × 1 vector 𝐛𝐛.
5) 𝐴𝐴𝐱𝐱 = 𝐛𝐛 has exactly one solution for every 𝑛𝑛 × 1 vector 𝐛𝐛.
6) The reduced row echelon form of 𝐴𝐴 is 𝐼𝐼𝑛𝑛 .
7) rank(𝐴𝐴) = 𝑛𝑛 .
8) nullity(𝐴𝐴) = 0.
9) The column vectors of 𝐴𝐴 are linearly independent.
10) The row vectors of 𝐴𝐴 are linearly independent.
11) The column vectors of 𝐴𝐴 span ℝ𝑛𝑛 .
12) The row vectors of 𝐴𝐴 span ℝ𝑛𝑛 .
13) The column vectors of 𝐴𝐴 form a basis for ℝ𝑛𝑛 .
14) The row vectors of 𝐴𝐴 form a basis for ℝ𝑛𝑛 .
 | M a t h 2 3 1 - F a l l 2 0 1 9 | S e c t i o n s 4 . 7 & 4 . 8 | P a g e 12

Overdetermined and Underdetermined Systems:

• Linear systems that have more equations than unknowns are called overdetermined
systems
• Linear systems that have fewer equations than unknowns are called
underdetermined systems.

Remark.
Let 𝐴𝐴 be an 𝑚𝑚 × 𝑛𝑛 matrix.

Overdetermined Case (𝒎𝒎 > 𝒏𝒏):

1) For each vector 𝐛𝐛 in ℝ𝑚𝑚 , the linear system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is either inconsistent, has a unique
solution or has infinitely many solutions.
2) If 𝐛𝐛 ∉ col(𝐴𝐴), then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is inconsistent.

3) If 𝐛𝐛 ∈ col(𝐴𝐴) and nullity(𝐴𝐴) = 0 (i.e., rank(𝐴𝐴) = 𝑛𝑛), then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 has a
unique solution.

4) If 𝐛𝐛 ∈ col(𝐴𝐴) and nullity(𝐴𝐴) > 0 (i.e., rank(𝐴𝐴) < 𝑛𝑛), then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 has
infinitely many solutions.

Underdetermined Case (𝒎𝒎 < 𝒏𝒏):

1) For each vector 𝐛𝐛 in ℝ𝑚𝑚 the linear system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is either inconsistent or has
infinitely many solutions.
2) If 𝐛𝐛 ∉ col(𝐴𝐴), then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is inconsistent.
3) If 𝐛𝐛 ∈ col(𝐴𝐴), then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 has infinitely many solutions.

4) It is not possible to have nullity(𝐴𝐴) = 0, so it is not possible for the linear system
𝐴𝐴𝐱𝐱 = 𝐛𝐛 to have a unique solution.

5) If rank(𝐴𝐴) = 𝑚𝑚, then the system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 is always consistent and has infinitely many
solutions. The solution of the system contains 𝑛𝑛 − 𝑚𝑚 parameters.
 | M a t h 2 3 1 - F a l l 2 0 1 9 | S e c t i o n s 4 . 7 & 4 . 8 | P a g e 13

Example. In each part, find the largest possible value for the rank of 𝐴𝐴 and the smallest
possible value for the nullity of 𝐴𝐴:
a) 𝐴𝐴 is 4 × 4

b) 𝐴𝐴 is 3 × 5

c) 𝐴𝐴 is 5 × 3

Example.
What can you say about the solutions of a system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 of 7 equations in 5 unknowns in
which 𝐴𝐴 has rank 4?

Example.
What can you say about the solutions of a system 𝐴𝐴𝐱𝐱 = 𝐛𝐛 of 5 equations in 7 unknowns in
which 𝐴𝐴 has rank 4?

Example. Let 𝐴𝐴 be a 5 × 7 matrix with rank(𝐴𝐴) = 5:

a) What is the dimension of the solution space of 𝐴𝐴𝐱𝐱 = 𝟎𝟎?

b) Is 𝐴𝐴𝐱𝐱 = 𝐛𝐛 consistent for all vectors 𝐛𝐛 in ℝ5 ? Explain.