The properties for an abstract vector space are the same as the properties satisfied by columns-of-numbers vectors. A subspace of a vector space is a special type of subset of the vector space. This special set is characterized by the property that it is closed under addition and scalar multiplication. A consequence of this characterization is that there must always be a zero vector in a subspace. This fact sometimes provides an easy test to determine if a given subset is a not a subspace. If the zero vector is not in the subset, then the subset cannot be a subspace. If the zero vector is in the subset, then further analysis is needed to show whether the subset is a subspace. There is one very important type of subset that is always a subspace: if W is subset of vectors from some vector space V, then the set of all linear combinations of the vectors in W, Span(W), is always a subspace of V. A good way to explicitly describe a subspace is to give a spanning set for the subspace.
Two important subspaces associated with an
matrix A are the null
space Nul(A), and the column space Col(A). It is easy to see that the
column space is a subspace of
because Col(A) is just the span of the
columns of A. Col(A) is explicitly described as Span(W), where W is the
set containing the columns of A. It is more difficult to think of Nul(A) as
a subspace because it is defined implicitly as the set of all
in
that are transformed to
by A. But a spanning set for Nul(A) is just
the set of vectors that are used in the parametric form for the solutions to
, so all you need to do to find an explicit description for Nul(A)
is to completely reduce A, and determine the vectors that you would
use to describe parametric solutions to
.
Remember that Nul(A) is a subspace of
, but Col(A) is a subspace of
. These two subspaces are generalized when T is a linear transformation
from a vector space V into a vector space W. In this case, what corresponds
to the column space for a matrix is called the range of T and what
corresponds to the null space for a matrix is called the kernel of T.
Finding the kernel of a linear transformation can sometimes appear difficult,
but remember: you can represent linear transformations with matrices.
Problems involving non-matrix linear transformations are often solved using
matrices.