Let be a vector space over the field
having dimension .
Recall that given
an ordered basis for and a vector ,
the tuple representation of with respect to
, denoted by ,
is the tuple
such that .
(Note that are uniquely determined since
form a basis for .)
As a result, one can work with tuples instead of the vectors in the original
vector space.
We will now see that we can express linear transformations
as matrices as well. Hence, one can simply focus on studying
linear transformations of the form where is a matrix.
As for tuple representations of vectors, matrix representations of a
linear transformation will depend on the choice of the ordered basis
for the domain and that for the codomain.
Matrix representations of linear transformations
Let and be vector spaces over some field .
Let be an ordered basis for
and
let be an ordered basis for .
Let be a linear transformation. We can give a
matrix representation of as follows.
For each , is a vector in .
Hence, we can write as a linear combination of .
Therefore, there are scalars
such that
.
Take an arbitrary . Then, there exist scalars
such that . So .
Hence,
Thus,
So, if we let be the matrix such that
,
then is precisely .
Hence, given any , we can obtain the tuple representation
of with respect to by computing .
The matrix is called the matrix representation of and is
denoted .
Note that column of
is given by .
Example
Let be a linear transformation, where
is the vector space of polynomials in with real coefficients
having degree at most 2,
given by
Let and
.
We now find .
One can easily check that and are ordered bases for
and , respectively.
We first find scalars such that
Then
Now,
.
Hence, we need
or equivalently,
Comparing coefficients gives
Solving gives , , .
Similarly, we obtain
and
Hence,
We check this against a couple of vectors.
Let
and .
Then and
and
and .
Let .
Then , which is the tuple representation of
.
And ,
which is the tuple representation of .
Remark: It is perhaps a bit confusing that tuple representations
of vectors in are also vectors in .
But why would one want to have -tuple representations
of vectors in ? The answer to this question might not
be obvious at first sight. However, when one works with for
large , it might be possible to choose an ordered bases in
such a way that the vectors that one is interested in have sparse
tuple representations (i.e. tuple representations in which very few
entries are nonzero.) Sparsity can drastically
improve certain kinds of computations and is one of the main ingredients
on which current digital audio and image compression algorithms are based.
Summary
With tuple representations for vectors and matrix representations for
linear transformations, we have a unifying framework for computations
over all finite-dimensional vector spaces. In other words, thinking
about an -dimensional vector space
is essentially thinking about -tuples
and thinking about
linear transformations is essentially thinking about matrices.
The usefulness of this fact cannot be overstated,
especially when it comes to developing
computer software that works with vector spaces.