Discovery guide 20.1 Discovery guide
Subsection 20.1.1 Column space
Take a minute to remind yourself of the column-wise view of matrix multiplication from (✶✶✶) in Subsection 4.3.7. In words, this matrix multiplication pattern says that in a matrix product
- the first column of
is the result of multiplying matrix against the first column of - the second column of
is the result of multiplying matrix against the second column of - and so on.
In the first discovery activity, we’ll use this pattern to obtain another important pattern involving the standard basis vectors.
Discovery 20.1.
Notice that the columns of the identity matrix are precisely the standard basis vectors of Use this observation, the matrix multiplication pattern described above, and the matrix identity to complete the following.
- Product
is equal to . - Product
is equal to . - Product
is equal to .
Discovery 20.2.
Think of an matrix as being made out of three column vectors from
(a)
Suppose we want to compute where (but as a column vector). Use the pattern you discovered in Discovery 20.1 to fill in the following.
Since
then
From this, we see that the column vector is in the span of
.
(b)
Convince yourself that the details/conclusion of Task a would be the same for every not just the example we used.
(c)
Now consider system If this system is consistent (i.e. has at least one solution), then our final conclusion from Task a would also be true about the column vector since for at least one
So system can only be consistent if is in the span of
.
For matrix from Discovery 20.2 it appears that the subspace of obtained by taking the span of the columns of is important when considering consistency of the system Call this subspace the column space of . Let’s explore how to reduce our spanning set (the columns of ) down to a basis. For this task we’ll need a fact about how multiplication by a matrix affects the linear independence of column vectors that we will state as Statement 1 of Proposition 20.5.1 in Subsection 20.5.1. You should read this statement before proceeding.
Discovery 20.3.
The following matrix is in RREF:
(a)
Build a linearly independent set of column vectors from by working from left to right, and either including or discarding each column based on whether it is linearly independent from the vectors you have already accumulated. (You should, of course, begin by “including” the first column.) What do you notice about your final set of linearly independent columns, relative to the reduced form of
(b)
Suppose is a matrix that can be reduced to by a single elementary operation. Then there is an elementary matrix so that
where the are the columns of Use your answer to Task a along with the above-referenced Statement 1 to determine which columns of form a linearly independent set.
(c)
Now suppose is a matrix that can be reduced to by two elementary operations. Then there are elementary matrices so that Similarly to Task b, from decide which columns of are linearly independent. Then from the above-referenced Statement 1 and
(where the are the columns of ), decide which columns of are linearly independent.
(d)
Now extrapolate to any number of row operations to complete the following statement: to create a linearly independent set of column vectors from a matrix row reduce to RREF, and then take those columns of that correspond to in
Discovery 20.4.
(a)
Use the procedure you’ve developed in Discovery 20.3.d to develop a reinterpretation of the Test for Linear Dependence/Independence for vectors in if are vectors in write these vectors as columns in a matrix, row reduce, and then you will know the original vectors are linearly independent if .
(b)
Recall that a square matrix is invertible if and only if it can be row reduced to Use the procedure for testing linear independence that you’ve developed in Task a to create another condition that is equivalent to invertibility: a square matrix is invertible if and only if its columns .
(c)
Subsection 20.1.2 Row space
Why let the columns of a matrix have all the fun? Let’s now explore the subspace of formed by the span of the rows in an matrix, called the row space of the matrix.
In the next discovery activity, we’ll need to recall Statement 2 of Proposition 16.5.6 that gives us a way to determine when two spans are the same. You should re-read that statement before proceeding.
Discovery 20.5.
Assume to be vectors in some vector space
(a)
(b)
Complete the statement: if matrix is obtained from by swapping two rows, then the row spaces of and of are .
(c)
(d)
Complete the statement: if matrix is obtained from by multiplying some row by a nonzero constant, then the row spaces of and of are .
(e)
(f)
Complete the statement: if matrix is obtained from by adding a multiple of one row to another, then the row spaces of and of are .
Discovery 20.6.
(a)
Based on Discovery 20.5, the row spaces of a matrix and of its RREF are .
(b)
Determine a basis for the row space of a matrix for which
Discovery 20.7.
If you have a collection of vectors in and you want to obtain a basis for the subspace that the collection spans, you now have two options: either use those vectors as the columns in a matrix and row reduce to determine a basis for its column space, or use those vectors as the rows in a matrix and row reduce to determine a basis for its row space. Can you think of a reason you might choose to use column space instead of row space? And a reason you might choose to use row space instead of column space?
Subsection 20.1.3 Null space
There is one more subspace of associated to a matrix — the solution space of the homogeneous system Instead of solution space, from this point forward we will refer to it as the null space of
Discovery 20.8.
Suppose is a matrix whose RREF is as given below. Use the “independent parameter” method to determine a basis for the null space of
Subsection 20.1.4 Relationship between the three spaces
Discovery 20.9.
(a)
How can you determine the dimensions of the column/row/null spaces of a matrix from its RREF?
(b)
For an matrix what is the relationship between the dimension of its column space, the dimension of its null space, and its size?