Up Main page

Let V be a vector space over the field F having dimension n. Recall that given an ordered basis (v1,,vn) for V and a vector uV, the tuple representation of u with respect to (v1,,vn), denoted by [u](v1,,vn), is the tuple [λ1λ2λn] such that u=i=1nλivi. (Note that λ1,,λn are uniquely determined since v1,,vn form a basis for V.) 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 T(x)=Ax where A 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 V and W be vector spaces over some field F. Let Γ=(v1,,vn) be an ordered basis for V and let Ω=(w1,,wm) be an ordered basis for W.

Let T:VW be a linear transformation. We can give a matrix representation of T as follows.

For each j{1,,n}, T(vj) is a vector in W. Hence, we can write T(vj) as a linear combination of w1,,wm. Therefore, there are scalars a1,j,a2,j,,am,j such that T(vj)=a1,jw1+a2,jw2++am,jwm.

Take an arbitrary vV. Then, there exist scalars λ1,,λn such that v=λ1v1++λnvn. So [v]Γ=[λ1λn].

Hence, T(v)=T(λ1v1++λnvn)=j=1nλjT(vj)=j=1nλj(i=1mai,jwi)=j=1ni=1n(ai,jλj)wi=i=1m(j=1nai,jλj)wi

Thus, [T(v)]Ω=[j=1na1,jλjj=1na2,jλjj=1nam,jλj]=[a1,1a1,2a1,na2,1a2,2a2,nam,1am,2am,n][λ1λ2λn]. So, if we let A be the m×n matrix such that Ai,j=ai,j, then [T(v)]Ω is precisely A[v]Γ.

Hence, given any uV, we can obtain the tuple representation of T(u) with respect to Ω by computing A[u]Γ. The matrix A is called the matrix representation of T and is denoted [T]ΓΩ.

Note that column i of [T]ΓΩ is given by [T(vi)]Ω.

Example

Let T:R3P2 be a linear transformation, where P2 is the vector space of polynomials in x with real coefficients having degree at most 2, given by T([abc])=(ab)x2+cx+(a+b+c). Let Γ=([100],[110],[011]) and Ω=(x+1,x2x,x2+x1). We now find [T]ΓΩ.

One can easily check that Γ and Ω are ordered bases for R3 and P2, respectively.

We first find scalars α1,α2,α3,β1,β2,β3,γ1,γ2,γ3 such that T([100])=α1(x+1)+β1(x2x)+γ1(x2+x1)T([110])=α2(x+1)+β2(x2x)+γ2(x2+x1)T([011])=α3(x+1)+β3(x2x)+γ3(x2+x1). Then [T]ΓΩ=[α1α2α3β1β2β3γ1γ2γ3].

Now, T([100])=x2+1. Hence, we need x2+1=α1(x+1)+β1(x2x)+γ1(x2+x1), or equivalently, x2+1=(β1+γ1)x2+(α1β1+γ1)x+(α1γ1). Comparing coefficients gives 1=β1+γ10=α1β1+γ11=α1γ1. Solving gives α1=1, β1=1, γ1=0.

Similarly, we obtain T([110])=2=43(x+1)+23(x2x)23(x2+x1) and T([011])=x2+x=23(x+1)+13(x2x)+23(x2+x1).

Hence, [T]ΓΩ=[143231231302323].

We check this against a couple of vectors. Let u=[010] and v=[001]. Then T(u)=x2+1 and T(v)=x+1 and [u]Γ=[110] and [v]Γ=[111].

Let A=[T]ΓΩ.

Then A[u]Γ=[131323], which is the tuple representation of 13(x+1)13(x2x)23(x2+x1)=x2+1=T(u).

And A[v]Γ=[100], which is the tuple representation of x+1=T(v).

Remark: It is perhaps a bit confusing that tuple representations of vectors in R3 are also vectors in R3. But why would one want to have 3-tuple representations of vectors in R3? The answer to this question might not be obvious at first sight. However, when one works with Rn for large n, 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 n-dimensional vector space is essentially thinking about n-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.

Quick Quiz

Exercises

Let T:R2R2 be a linear transformation. Let Γ=([10],[11]) and Ω=([21],[10 ]) be ordered bases for R2

  1. Suppose that T is given by T([x1x2])=[2x1x2x1+x2]. Find [T]ΓΩ.  

  2. Suppose that T([10])=[21] and T([01])=[11]. Find [T]ΓΩ.