Unformatted text preview: LINEAR ALGEBRA
W W L CHEN
c W W L Chen, 1994, 2005. This chapter is available free to all individuals, on the understanding that it is not to be used for ﬁnancial gain,
and may be downloaded and/or photocopied, with or without permission from the author.
However, this document may not be kept on any information storage and retrieval system without permission
from the author, unless such system is not accessible to any individuals other than its owners. Chapter 6
VECTOR SPACES
ASSOCIATED WITH MATRICES 6.1. Introduction
Consider an m × n matrix a11
.
.
A=
.
am1 (1) ...
... a1n
.
.
,
.
amn with entries in R. Then the rows of A can be described as vectors in Rn as
(2) r1 = (a11 , . . . .a1n ), ..., rm = (am1 , . . . .amn ), while the columns of A can be described as vectors in Rm as a11
.
c1 = . ,
.
am1 (3) a1n
.
cn = . .
.
amn ..., For simplicity, we sometimes write r1
.
A= .
.
rm and A = ( c1 . . . cn ) . We also consider the system of homogeneous equations Ax = 0.
Chapter 6 : Vector Spaces Associated with Matrices page 1 of 8 c Linear Algebra W W L Chen, 1994, 2005 In this chapter, we shall be concerned with three vector spaces that arise from the matrix A.
Definition. Suppose that A is an m × n matrix of the form (1), with entries in R.
(RS) The subspace span{r1 , . . . , rm } of Rn , where r1 , . . . , rm are given by (2) and are the rows of the
matrix A, is called the row space of A.
(CS) The subspace span{c1 , . . . , cn } of Rm , where c1 , . . . , cn are given by (3) and are the columns of
the matrix A, is called the column space of A.
(NS) The solution space of the system of homogeneous linear equations Ax = 0 is called the nullspace
of A.
Remarks. (1) To see that span{r1 , . . . , rm } is a subspace of of Rn and that span{c1 , . . . , cn } is a
subspace of of Rm , recall Proposition 5C.
(2) To see that the nullspace of A is a subspace of Rn , recall Example 5.2.5. 6.2. Row Spaces
Our aim in this section is to ﬁnd a basis for the row space of a given matrix A with entries in R. This
task is made considerably easier by the following result.
PROPOSITION 6A. Suppose that the matrix B can be obtained from the matrix A by elementary row
operations. Then the row space of B is identical to the row space of A.
Proof. Clearly the rows of B are linear combinations of the rows of A, so that any linear combination
of the rows of B is a linear combination of the rows of A. Hence the row space of B is contained in the
row space of A. On the other hand, the rows of A are linear combinations of the rows of B , so a similar
argument shows that the row space of A is contained in the row space of B .
To ﬁnd a basis for the row space of A, we can now reduce A to row echelon form, and consider the
nonzero rows that result from this reduction. It is easily seen that these nonzero rows are linearly
independent.
Example 6.2.1. Let 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 1
3
5
2 5
−2 .
−9
−1 Then
r1 = (1, 3, −5, 1, 5),
r2 = (1, 4, −7, 3, −2),
r3 = (1, 5, −9, 5, −9),
r4 = (0, 3, −6, 2, −1).
Also the matrix A can be reduced to row echelon form as 1
0 0
0
Chapter 6 : Vector Spaces Associated with Matrices 3
1
0
0 −5
−2
0
0 1
2
1
0 5
−7 .
−5
0
page 2 of 8 c Linear Algebra W W L Chen, 1994, 2005 It follows that
v1 = (1, 3, −5, 1, 5), v2 = (0, 1, −2, 2, −7), v3 = (0, 0, 0, 1, −5) form a basis for the row space of A.
Remark. Naturally, it is not necessary that the ﬁrst nonzero entry of a basis element has to be 1. 6.3. Column Spaces
Our aim in this section is to ﬁnd a basis for the column space of a given matrix A with entries in R.
Naturally, we can consider the transpose At of A, and use the technique in Section 6.2 to ﬁnd a basis
for the row space of At . This basis naturally gives rise to a basis for the column space of A.
Example 6.3.1. Let 1
1
A=
1
0 −5
−7
−9
−6 3
4
5
3 1
3
5
2 5
−2 .
−9
−1 1
5
−9
5
−9 0
3 −6 . 2
−1 Then 1
3 At = −5 1
5 1
4
−7
3
−2 The matrix At can be reduced to row echelon form 11
0 1 0 0 00
00 as
1
2
0
0
0 0
2 1. 0
0 It follows that
w1 = (1, 1, 1, 0), w2 = (0, 1, 2, 2), w3 = (0, 0, 0, 1) form a basis for the row space of At , and so a basis for the column space of A.
Alternatively, we may pursue the following argument, which shows that elementary row operations do
not aﬀect the linear dependence relations among the columns of a matrix.
PROPOSITION 6B. Suppose that the matrix B can be obtained from the matrix A by elementary row
operations. Then any collection of columns of A are linearly independent if and only if the corresponding
collection of columns of B are linearly independent.
Proof. Let A∗ be a matrix made up of a collection of columns of A, and let B ∗ be the matrix made
up of the corresponding collection of columns of B . Consider the two systems of homogeneous linear
equations
A∗ x = 0
Chapter 6 : Vector Spaces Associated with Matrices and B ∗ x = 0.
page 3 of 8 c Linear Algebra W W L Chen, 1994, 2005 Since B ∗ can be obtained from the matrix A∗ by elementary row operations, the two systems have the
same solution set. On the other hand, the columns of A∗ are linearly independent precisely when the
system A∗ x = 0 has only the trivial solution, precisely when the system B ∗ x = 0 has only the trivial
solution, precsiely when the columns of B ∗ are linearly independent.
To ﬁnd a basis for the column space of A, we can now reduce A to row echelon form, and consider
the pivot columns that result from this reduction. It is easily seen that these pivot columns are linearly
independent, and that any nonpivot column is a linear combination of the pivot columns.
Example 6.3.2. Let 1
1
A=
1
0
Then A can be reduced to row echelon form 1
0 0
0 3
4
5
3 −5
−7
−9
−6 as
3 −5
1 −2
00
00 1
2
1
0 1
3
5
2 5
−2 .
−9
−1 5
−7 .
−5
0 It follows that the pivot columns of A are the ﬁrst, second and fourth columns. Hence
u1 = (1, 1, 1, 0), u2 = (3, 4, 5, 3), u3 = (1, 3, 5, 2) form a basis for the column space of A. 6.4. Rank of a Matrix
For the matrix 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 1
3
5
2 5
−2 ,
−9
−1 we have shown that the row space has dimension 3, and so does the column space. In fact, we have the
following important result.
PROPOSITION 6C. For any matrix A with entries in R, the dimension of the row space is the same
as the dimension of the column space.
Proof. For any matrix A, we can reduce A to row echelon form. Then the dimension of the row space
of A is equal to the number of nonzero rows in the row echelon form. On the other hand, the dimension
of the column space of A is equal to the number of pivot columns in the row echelon form. However, the
number of nonzero rows in the row echelon form is the same as the number of pivot columns.
Definition. The rank of a matrix A, denoted by rank(A), is equal to the common value of the dimension
of its row space and the dimension of its column space.
Example 6.4.1. The matrix 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 1
3
5
2 5
−2 −9
−1 has rank 3.
Chapter 6 : Vector Spaces Associated with Matrices page 4 of 8 c Linear Algebra W W L Chen, 1994, 2005 6.5. Nullspaces
Example 6.5.1. Consider the matrix 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 1
3
5
2 5
−2 .
−9
−1 We showed in Example 5.5.11 that the space of solutions of Ax = 0 has dimension 2. In other words,
the nullspace of A has dimension 2. Note that in this particular case, the dimension of the nullspace of
A and the dimension of the column space of A have a sum of 5, the number of columns of A.
Recall now that the nullspace of A is a subspace of Rn , where n is the number of columns of the
matrix A.
PROPOSITION 6D. For any matrix A with entries in R, the sum of the dimension of its column
space and the dimension of its nullspace is equal to the number of columns of A.
Sketch of Proof. We consider the system of homogeneous linear equations Ax = 0, and reduce A
to row echelon form. The number of leading variables is now equal to the dimension of the row space
of A, and so equal to the dimension of the column space of A. On the other hand, the number of free
variables is equal to the dimension of the space of solutions, which is the nullspace. Note now that the
total number of variables is equal to the number of columns of A.
Remark. Proposition 6D is sometimes known as the Ranknullity theorem, where the nullity of a matrix
is the dimension of its nullspace.
We conclude this section by stating the following result for square matrices.
PROPOSITION 6E. Suppose that A is an n × n matrix with entries in R. Then the following
statements are equivalent:
(a) A can be reduced to In by elementary row operations.
(b) A is invertible.
(c) det A = 0.
(d) The system Ax = 0 has only the trivial solution.
(e) The system Ax = b is soluble for every b ∈ Rn .
(f ) The rows of A are linearly independent.
(g) The columns of A are linearly independent.
(h) A has rank n. 6.6. Solution of NonHomogeneous Systems
Consider now a nonhomogeneous system of equations
(4) Ax = b, where (5) a11
.
.
A=
.
am1 ... a1n
.
.
. . . . amn and b1
.
b = . ,
.
bm with entries in R.
Chapter 6 : Vector Spaces Associated with Matrices page 5 of 8 c Linear Algebra W W L Chen, 1994, 2005 Our aim here is to determine whether a given system (4) has a solution without making any attempt
to actually ﬁnd any solution.
Note ﬁrst of all that a11 . . . a1n
x1
a11 x1 + . . . + a1n xn
a11
a1n
. . .
. = x1 . + . . . + xn . .
.
.
.
.
.
.
=
.
.
.
.
.
.
am1 . . . amn
xn
am1 x1 + . . . + amn xn
am1
amn
It follows that Ax can be described by
Ax = x1 c1 + . . . + xn cn ,
where c, . . . , cn are deﬁned by (3) and are the columns of A. In other words, Ax is a linear combination
of the columns of A. It follows that if the system (4) has a solution, then b must be a linear combination
of the columns of A. This means that b must belong to the column space of A, so that the two matrices (6) a11
.
.
A=
.
am1 ... a1n
.
.
. a11
.
.
(Ab) =
.
am1 and . . . amn ... a1n
.
.
. b1
.
.
. ... amn bm must have the same (column) rank.
On the other hand, if the two matrices A and (Ab) have the same rank, then b must be a linear
combination of the columns of A, so that
b = x1 c1 + . . . + xn cn
for some x1 , . . . , xn ∈ R. This gives a solution of the system (4).
We have just proved the following result.
PROPOSITION 6F. For any matrix A with entries in R, the nonhomogeneous system of equations
Ax = b has a solution if and only if the matrices A and (Ab) have the same rank. Here (Ab) is deﬁned
by (5) and (6).
Example 6.6.1. Consider the system Ax = b, where 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 5
−2 −9
−1 1
3
5
2 and 1
2
b = .
3
3 We have already shown that rank(A) = 3. Now 1
1
(Ab) = 1
0
can be reduced to row echelon form as 1
0 0
0 3
1
0
0 3
4
5
3 −5
−7
−9
−6 −5
−2
0
0 1
2
1
0 1
3
5
2 51
−2 2 −9 3
−1 3 51
−7 1 ,
−5 0
00 so that rank(Ab) = 3. It follows that the system has a solution.
Chapter 6 : Vector Spaces Associated with Matrices page 6 of 8 c Linear Algebra W W L Chen, 1994, 2005 Example 6.6.2. Consider the system Ax = b, where 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 5
−2 −9
−1 1
3
5
2 and 1
2
b = .
4
3 We have already shown that rank(A) = 3. Now 1
1
(Ab) = 1
0
can be reduced to row echelon form as 1
0 0
0 3
1
0
0 3
4
5
3 −5
−7
−9
−6 −5
−2
0
0 1
2
1
0 1
3
5
2 51
−2 2 −9 4
−1 3 51
−7 1 ,
−5 0
01 so that rank(Ab) = 4. It follows that the system has no solution.
Remark. The matrix (Ab) is sometimes known as the augmented matrix.
We conclude this chapter by describing the set of all solutions of a nonhomogeneous system of equations.
PROPOSITION 6G. Suppose that A is a matrix with entries in R. Suppose further that x0 is a
solution of the nonhomogeneous system of equations Ax = b, and that {v1 , . . . , vr } is a basis for the
nullspace of A. Then every solution of the system Ax = b can be written in the form
(7) x = x0 + c1 v1 + . . . + cr vr , where c1 , . . . , cr ∈ R. On the other hand, every vector of the form (7) is a solution to the system Ax = b.
Proof. Let x be any solution of the system Ax = b. Since Ax0 = b, it follows that A(x − x0 ) = 0.
Hence there exist c1 , . . . , cr ∈ R such that
x − x0 = c1 v1 + . . . + cr vr ,
giving (7). On the other hand, it follows from (7) that
Ax = A(x0 + c1 v1 + . . . + cr vr ) = Ax0 + c1 Av1 + . . . + cr Avr = b + 0 + . . . + 0 = b.
Hence every vector of the form (7) is a solution to the system Ax = b.
Example 6.6.3. Consider the system Ax = b, where 1
1
A=
1
0 3
4
5
3 −5
−7
−9
−6 1
3
5
2 5
−2 −9
−1 and 1
2
b = .
3
3 We have already shown in Example 5.5.11 that v1 = (1, −2, −1, 0, 0) and v2 = (1, 3, 0, −5, −1) form a
basis for the nullspace of A. On the other hand, x0 = (−4, 0, 1, 5, 1) is a solution of the nonhomogeneous
system. It follows that the solutions of the nonhomogeneous system are given by
x = (−4, 0, 1, 5, 1) + c1 (1, −2, −1, 0, 0) + c2 (1, 3, 0, −5, −1)
Chapter 6 : Vector Spaces Associated with Matrices where c1 , c2 ∈ R.
page 7 of 8 c Linear Algebra W W L Chen, 1994, 2005 Example 6.6.4. Consider the nonhomogeneous system x − 2y + z = 2 in R3 . Note that this system
has only one equation. The corresponding homogeneous system is given by x − 2y + z = 0, and this
represents a plane through the origin. It is easily seen that (1, 1, 1) and (2, 1, 0) form a basis for the
solution space of x − 2y + z = 0. On the other hand, note that (1, 0, 1) is a solution of x − 2y + z = 2.
It follows that the solutions of x − 2y + z = 2 are of the form
where c1 , c2 ∈ R. (x, y, z ) = (1, 0, 1) + c1 (1, 1, 1) + c2 (2, 1, 0),
Try to draw a picture for this problem. Problems for Chapter 6
1. For each of the following matrices, ﬁnd a basis for the row
by ﬁrst reducing the matrix to row echelon form: 59
3
1
a) 3 −5 −6 b) 1
15
3
1 11
2
1 1 3 −8 c) d) 0 4 −3 −7
3
1 12 −3 space and a basis for the column space
2
2
2 4
3
0 2
1
4 3
−1
11 −1
−1
−4 5
3
−3 4
5
2 2. For each of the following matrices, determine whether the nonhomogeneous system of linear equations A = b has a solution:
x 59
3
4
a) A = 3 −5 −6 and b = 2 15
3
6 1 2 4 −1 5
3
b) A = 1 2 3 −1 3 and b = 5 1 2 0 −4 −3
7 11
2
0 1 3 −8 1
c) A = and b = 4 −3 −7
2
1 12 −3
4 12 3 4
1
d) A = 0 1 −1 5 and b = 0 3 4 11 2
1 Chapter 6 : Vector Spaces Associated with Matrices page 8 of 8 ...
View
Full Document
 Fall '08
 PETRINA
 Linear Algebra, ax, W W L Chen, Vector Spaces Associated

Click to edit the document details