Chapter 5.

5
Row, Column and Null Spaces
 Outline:

• Row, Column, and Null Space

• Basis for he null space of a matrix

• Basis for the row space of a matrix

• Basis for the column space of a matrix

 Row Space, Column Space and Null Space
If 𝐴 is an 𝑚 × 𝑛 matrix, then the subspace of 𝑹𝑛 spanned by the row vectors of 𝐴 is called
the row space of 𝐴, and the subspace of 𝑹𝑚 spanned by the column vectors of 𝐴 is called
the column space of 𝐴. The solution space of the homogeneous system of equations
𝐴𝑋 = 0, which is a subspace of 𝑹𝑛 , is called the null space of 𝐴.

𝑎11 𝑎12 ⋯ 𝑎1𝑛

𝑎21 𝑎22 ⋯ 𝑎2𝑛
Example: For an 𝑚 × 𝑛 matrix 𝐴 = ⋮ ⋮ ⋮ ⋮
𝑎𝑚1 𝑎𝑚2 … 𝑎𝑚𝑛

The vectors 𝒓𝟏 = 𝑎11 𝑎12 ⋯ 𝑎1𝑛 , 𝒓𝟐 = 𝑎21 𝑎22 ⋯ 𝑎2𝑛 , … … . . . ,

𝒓𝒎 = 𝑎𝑚1 𝑎𝑚2 ⋯ 𝑎𝑚𝑛 in 𝑹𝑛 that are formed from the rows of A, are called the row
vectors of A and the vectors
 Row Space, Column Space and Null Space

𝑎11 𝑎12 𝑎1𝑛

𝑎21 𝑎22 𝑎2𝑛
𝒄𝟏 = ⋮ , 𝒄𝟐 = ⋮ , … . . , 𝒄𝒏 = ⋮ in 𝑹𝑚 are columns of A are called
𝑎𝑚1 𝑎𝑚2 𝑎𝑚𝑛

the column vectors of A.

The space spanned by 𝒓𝟏 , 𝒓𝟐 , … . , 𝒓𝒏 are called the row space of A.

The space spanned by 𝒄𝟏 , 𝒄𝟐 , … . , 𝒄𝒎 are called the column space of A.

And the solution space of 𝐴𝑋 = 0 is called the null space of A.

 Row Space, Column Space and Null Space
Theorem: A system of linear equations 𝐴𝑋 = 𝑩 is consistent if and only if 𝐵 is in the column
space of 𝐴.
Proof:
𝑎11 𝑎12 ⋯ 𝑎1𝑛 𝑥1
𝑎21 𝑎22 ⋯ 𝑎2𝑛 𝑥2
Suppose that 𝐴 = ⋮ ⋮ ⋮ ⋮ and X= ⋮ then
𝑎𝑚1 𝑎𝑚2 … 𝑎𝑚𝑛 𝑥𝑛

If 𝒄𝟏 , 𝒄𝟐 , … , 𝒄𝒏 denote the column vectors of 𝐴, then the product 𝐴𝑋 can be expressed as a

linear combination of these vectors with coefficients from 𝑋; that is,
𝐴𝑋 = 𝑥1 𝒄𝟏 + 𝑥2 𝒄𝟐 + ⋯ . +𝑥𝑛 𝒄𝒏
Thus, a linear system, 𝐴𝑿 = 𝐵, of m equations in 𝑛 unknowns can be written as
𝑥1 𝒄𝟏 + 𝑥2 𝒄𝟐 + ⋯ . +𝑥𝑛 𝒄𝒏 = 𝐵
from which we conclude that 𝐴𝑿 = 𝑩 is consistent if and only if 𝐵 is expressible as a linear
combination of the column vectors of 𝐴. This yields the following theorem.
 Row Space, Column Space and Null Space
Example: Let 𝐴𝑿 = 𝑩 be the linear system
−1 3 2 𝑥1 1
1 2 −3 𝑥2 = −9
2 1 −2 𝑥3 −3
Show that 𝐵 is in the column space of 𝐴 by expressing it as a linear combination of the
column vectors of 𝐴.
Solution: Solving the system by Gaussian elimination yields
𝑥1 = 2, 𝑥2 − 1, 𝑥3 = 3

−1 3 2 1
It follows that 2 1 − 2 + 3 −3 = −9
2 1 −2 −3

Theorem: Elementary row operations do not change the null space of a matrix.
Theorem: Elementary row operations do not change the row space of a matrix.
 General Solution of a Nonhomogeneous Linear System
Theorem: If 𝒙𝟎 is any solution of a consistent linear system 𝐴𝑿 = 𝐵, and if 𝑆 =
{𝒗1 , 𝒗2 , . . . , 𝒗𝑘 } is a basis for the null space of 𝐴, then every solution of 𝐴𝑋 = 𝑩 can be
expressed in the form
𝒙 = 𝒙𝟎 + 𝑐1 𝒙𝟏 + 𝑐1 𝒙𝟐 + ⋯ . +𝑐𝑘 𝒙𝒌 (1)
Conversely, for all choices of scalars 𝑐1 , 𝑐2 , … , 𝑐𝑘 the vector 𝒙 in this formula is a solution
of 𝐴𝑿 = 𝐵.

The vector 𝒙𝟎 in Formula (1) is called a particular solution of

𝐴𝑿 = 𝐵, and the remaining part of the formula is called the
general solution of 𝐴𝑿 = 𝟎.

Geometrically, the solution set of 𝐴𝑿 = 𝑩 can be viewed as

the translation by 𝒙𝟎 of the solution space of 𝐴𝑿 = 𝟎
 General Solution of a Linear System
Solved the nonhomogeneous linear system
𝑥1 + 3𝑥2 − 2𝑥3 + 2𝑥5 =0
2𝑥1 + 6𝑥2 − 5𝑥3 − 2𝑥4 + 4𝑥5 − 3𝑥6 = −1
5𝑥3 + 10𝑥4 + 15𝑥6 = 5
2𝑥1 + 6𝑥2 + 8𝑥4 + 4𝑥5 + 18𝑥6 = 6
Solution: Corresponding augmented matrix is
1 3 −2 0 2 0 0 1 3 0 4 2 0 0
2 6 −5 −2 4 −3 −1 0 0 1 2 0 0 0
≈
0 0 5 10 0 15 5 0 0 0 0 0 1 1/3
2 6 0 8 4 18 6 0 0 0 0 0 0 0
and deduced that the general solution 𝒙 of the nonhomogeneous system and the general solution 𝒙ℎ of the
corresponding homogeneous system (when written in column-vector form) are related by
𝑥1 −3𝑟 − 4𝑠 − 2𝑡 0 −3 −4 −2
𝑥2 𝑟 0 1 0 0
𝑥3 −2𝑠 0 0 −2 0
𝑥4 = = + 𝑟 + 𝑠 + 𝑡
𝑠 0 0 1 0
𝑥5 𝑡 0 0 0 1
𝑥6 1/3 1/3 0 0 0
 Basis for the Null Space
Example: Find a basis for and the dimension of the solution space of the homogeneous system
2𝑥1 + 2𝑥2 − 𝑥3 + 𝑥5 = 0
−𝑥1 − 𝑥2 + 2𝑥3 − 3𝑥4 + 𝑥5 = 0
𝑥1 + 2𝑥2 − 𝑥3 − 𝑥5 = 0
𝑥3 + 𝑥4 + 𝑥5 = 0
Solution: The augmented matrix for the system is
2 2 −1 0 1 0
−1 −1 2 −3 1 0
1 2 −1 0 −1 0
0 0 1 1 1 0
Reducing this matrix to reduced row-echelon form, we obtain
1 1 0 0 1 0
0 0 1 0 1 0
0 0 0 1 0 0
0 0 0 0 0 0
The corresponding system of equations is
𝑥1 + 𝑥2 + 𝑥5 = 0
𝑥3 + 𝑥5 = 0
𝑥4 = 0
 Basis for the Null Space
Solving for the leading variables yields 𝑥1 = −𝑥2 − 𝑥5
𝑥3 = −𝑥5
𝑥4 = 0
Let 𝑥2 = 𝑠 and 𝑥5 = 𝑡. Thus, the general solution is
𝑥1 = −𝑠 − 𝑡, 𝑥2 = 𝑠, 𝑥3 = −𝑡, 𝑥4 = 0, 𝑥5 = 𝑡
Therefore, the solution vectors can be𝑥written as
1 −𝑠 − 𝑡 −1 −1
𝑥2 𝑠 1 0
𝑥3 = −𝑡 = 𝑠 0 +𝑡 −1
𝑥4 0 0 0
𝑥5 𝑡 0 1

−1 −1
1 0
Which shows that the vectors 𝒗1 = 0 and 𝒗2 = −1 spans the solution space. Since they are also
0 0
0 1
linearly independent(verify), 𝑆 = {𝒗𝟏 , 𝒗𝟐 } is a basis for the solution space and the solution space is two
dimensional.
 Basis for the Null Space of a Matrix
Example: Find a basis for the null space of the matrix
1 3 −2 0 2 0
2 6 −5 −2 4 −3
𝐴=
0 0 5 10 0 15
2 6 0 8 4 18
Solution: The null space of A is the solution space of the homogeneous linear system 𝐴𝑋 = 𝟎
Corresponding augmented matrix is
1 3 −2 0 2 0 0 1 3 0 4 2 0 0
2 6 −5 −2 4 −3 0 0 0 1 2 0 0 0
≈
0 0 5 10 0 15 0 0 0 0 0 0 1 0
2 6 0 8 4 18 0 0 0 0 0 0 0 0
and deduced that the general solution 𝒙 of the homogeneous system
𝑥1 −3𝑟 − 4𝑠 − 2𝑡 0 −3 −4 −2
𝑥2 𝑟 0 1 0 0
𝑥3 −2𝑠 0 0 −2 0
𝑥4 = = + 𝑟 +𝑠 +𝑡
𝑠 0 0 1 0
𝑥5 𝑡 0 0 0 1
𝑥6 0 0 0 0 0
Basis for the Null Space is 𝐵 = 𝒗𝟏 , 𝒗𝟐 , 𝒗𝟑
 Basis for the Row Space and Column Space

Theorem: If a matrix 𝑅 is in row echelon form, then the row vectors with the leading 1’s (the nonzero row
vectors) form a basis for the row space of 𝑅, and the column vectors with the leading 1’s of the row vectors
form a basis for the column space of 𝑅.

Theorem: If A and B are row equivalent matrices, then

(a) A given set of column vectors of A is linearly independent if and only if the corresponding column vectors
of B are linearly independent.
(b) A given set of column vectors of A forms a basis for the column space of A if and only if the
corresponding column vectors of B form a basis for the column space of B.
 Bases for the Row and Column Spaces of a Matrix in Row Echelon Form
Example: Find bases for the row and column spaces of the matrix
1 −2 5 0 3
0 1 3 0 0
𝑅=
0 0 0 1 0
0 0 0 0 0
Solution:
Since the matrix R is in row echelon form, the vectors
𝑟1 = 1 −2 5 0 3
𝑟2 = 0 1 3 0 0
𝑟3 = 0 0 0 1 0

form a basis for the row space of R, and the vectors

1 −2 0
0 1 0
𝑐1 = , 𝑐2 = , 𝑐4 =
0 0 1
0 0 0
form a basis for the column space of R.
 Bases for the Row Space of a Matrix by Row Reduction
Example: Find a basis for the row space of the matrix
1 −3 4 −2 5 4
2 −6 9 −1 8 2
𝐴=
2 −6 9 −1 9 7
−1 3 −4 2 −5 −4
Solution: Since elementary row operations do not change the row space of a matrix, we can find a basis for
the row space of A by finding a basis for the row space of any row echelon form of A. Reducing A to row
echelon form, we obtain (verify)
1 −3 4 −2 5 4
0 0 1 3 −2 −6
𝑅=
0 0 0 0 1 5
0 0 0 0 0 0
the nonzero row vectors of R form a basis for the row space of R and hence form a basis for the row space
of A. These basis vectors are
𝑟1 = 1 −3 4 −2 5 4
𝑟2 = 0 0 1 3 −2 −6
𝑟3 = 0 0 0 0 1 5
Basis set, 𝑆 = {𝒓𝟏 , 𝒓𝟐 , 𝒓𝟑 }
 Bases for the Row Space of a Matrix by Row Reduction
Example: Find a basis for the column space of the matrix
1 −3 4 −2 5 4
2 −6 9 −1 8 2
𝐴=
2 −6 9 −1 9 7
−1 3 −4 2 −5 −4
Solution: Reducing A to row echelon form, we obtain (verify)
1 −3 4 −2 5 4
0 0 1 3 −2 −6
𝑅=
0 0 0 0 1 5
0 0 0 0 0 0
Since the first, third, and fifth columns of R contain the leading 1’s of the row vectors, then the vectors

1 4 5
0 1 −2
𝑐′1 = , 𝑐′3 = , 𝑐′5 =
0 0 1
0 0 0
Form the basis for the column space of R.
 Bases for the Row Space of a Matrix by Row Reduction
Hence the corresponding columns of A form the basis for the column space of A

1 4 5
2 9 8
𝑐1 = , 𝑐3 = , 𝑐5 =
2 9 9
−1 −4 −5

Form the basis for the column space of A.

Basis set, 𝑆 = {𝒄𝟏 , 𝒄𝟑 , 𝒄𝟓 }
 Bases for the Row Space of a Matrix by Row Reduction
Example: Find a basis for the row space of
1 −2 0 0 3
2 −5 −3 −2 6
𝐴= consisting entirely of row vectors from A.
0 5 15 10 0
2 6 18 8 6
Solution: We will transpose A, thereby converting the row space of A into the column space of 𝐴𝑇 ; then we
will find a basis for the column space of 𝐴𝑇 ; and then we will transpose again to convert column vectors
back to row vectors. Transposing A yields
1 2 0 2
−2 −5 5 6
𝐴𝑇 = 0 −3 15 18
0 −2 10 8
3 6 0 6
and then reducing this matrix to row echelon form we obtain

1 2 0 2
0 1 −5 −10
0 0 0 1
0 0 0 0
0 0 0 0
 Bases for the Row Space of a Matrix by Row Reduction
1 2 0 2
0 1 −5 −10
0 0 0 1
0 0 0 0
0 0 0 0
The first, second, and fourth columns contain the leading 1’s, so the corresponding column vectors in 𝐴𝑇
form a basis for the column space of 𝐴𝑇 ; these are
1 2 2
−2 −5 6
𝑐1 = 0 , 𝑐2 = −3 , and 𝑐4 = 18
0 −2 8
3 6 6
Transposing again and adjusting the notation appropriately yields the basis vectors
𝑟1 = 1 −2 0 0 3
𝑟2 = 2 −5 −3 −2 6
𝑟4 = 2 6 18 8 6
For the row space of A.
Basis set, 𝑆 = {𝒓𝟏 , 𝒓𝟐 , 𝒓𝟒 }
 Bases for the Row Space of a Matrix by Row Reduction
Example: (a) 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.
(b) Express each vector not in the basis as a linear combination of the basis vectors.

Solution: We begin by constructing a matrix that has 𝒗1 , 𝒗2 , 𝒗3 , 𝒗4 , and 𝒗5 as its column vectors
1 2 0 2 5
−2 −5 1 −1 −8
𝐴=
0 −3 3 4 1
3 6 0 −7 2

Reducing the matrix to reduced row echelon form and denoting the column vectors of the resulting matrix
by 𝒘1 , 𝒘2 , 𝒘3 , 𝒘4 , and 𝒘5 yields

1 0 2 0 1
0 1 −1 0 1
𝑅=
0 0 0 1 1
0 0 0 0 0
 Bases for the Row Space of a Matrix by Row Reduction

The leading 1’s occur in columns 1, 2, and 4, so {𝒘1 , 𝒘2 , 𝒘4 } is a basis for the column space of R ,
and consequently, {𝒗1 , 𝒗2 , 𝒗4 } is a basis for the column space A.

(b) We will start by expressing 𝒘3 and 𝒘5 as linear combinations of the basis vectors 𝒘1 , 𝒘2 , 𝑎𝑛𝑑 𝒘4 .
𝒘3 = 2𝒘1 − 𝒘2
𝒘5 = 𝒘1 + 𝒘2 + 𝒘4

Corresponding dependency equations for 𝒗1 , 𝒗2 , 𝒗3 , 𝒗4 , and 𝒗5 are

𝒗3 = 2𝒗1 − 𝒗2
𝒗5 = 𝒗1 + 𝒗2 + 𝒗4
 Home Work

Exercise: 5.5
Page no.: 276
Problem no.: 6, 11, 12