Linear Algebra/Representing Linear Maps with Matrices

From Wikibooks, the open-content textbooks collection

< Linear Algebra
Jump to: navigation, search

< Linear Algebra


[Index]


Consider a map h with domain \Re^2 and codomain \Re^3 (fixing 
B={
\begin{bmatrix}
2 \\ 0
\end{bmatrix},
\begin{bmatrix}
1 \\ 4
\end{bmatrix}}
\text{and} 
D={
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix},
\begin{bmatrix}
0 \\ -2 \\ 0
\end{bmatrix},
\begin{bmatrix}
1 \\ 0 \\ 1
\end{bmatrix}}
as the bases for these spaces) that is determined by this action on the vectors in the domain's basis. 
\begin{bmatrix}
2 \\ 0
\end{bmatrix}
	o{h}
\begin{bmatrix}
1 \\ 1 \\ 1
\end{bmatrix}

\begin{bmatrix}
1 \\ 4
\end{bmatrix}
	o{h}
\begin{bmatrix}
1 \\ 2 \\ 0
\end{bmatrix}
To compute the action of this map on any vector at all from the domain, we first express h(\vec{\beta}_1) and h(\vec{\beta}_2) with respect to the codomain's basis: 
\begin{bmatrix}
1 \\ 1 \\ 1
\end{bmatrix}=
0\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}
-\frac{1}{2}\begin{bmatrix}
0 \\ -2 \\ 0
\end{bmatrix}
+1\begin{bmatrix}
1 \\ 0 \\ 1
\end{bmatrix}
\text{so} 
{ h(\vec{\beta}_1) }{D}=\begin{bmatrix}
0 \\ -1/2 \\ 1
\end{bmatrix}_D           
and 
\begin{bmatrix}
1 \\ 2 \\ 0
\end{bmatrix}=
1\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}
-1\begin{bmatrix}
0 \\ -2 \\ 0
\end{bmatrix}
+0\begin{bmatrix}
1 \\ 0 \\ 1
\end{bmatrix}
\text{so} 
{ h(\vec{\beta}_2) }{D}=\begin{bmatrix}
1 \\ -1 \\ 0
\end{bmatrix}_D
(these are easy to check). Then, as described in the preamble, for any member \vec{v} of the domain, we can express the image h(\vec{v}) in terms of the h(\vec{\beta})'s. Failed to parse (syntax error): h(\vec{v}) =h(c_1\cdot \begin{bmatrix} 2 \\ 0 \end{bmatrix}+c_2\cdot \begin{bmatrix} 1 \\ 4 \end{bmatrix}) \\ =c_1\cdot h(\begin{bmatrix} 2 \\ 0 \end{bmatrix})+c_2\cdot h(\begin{bmatrix} 1 \\ 4 \end{bmatrix}) \\ =c_1\cdot ( 0\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix} \!-\frac{1}{2}\begin{bmatrix} 0 \\ -2 \\ 0 \end{bmatrix} \!+1\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\! ) +c_2\cdot ( 1\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix} \!-1\begin{bmatrix} 0 \\ -2 \\ 0 \end{bmatrix} \!+0\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\! ) \\ =(0c_1+1c_2)\cdot \begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix} +(-\frac{1}{2}c_1-1c_2)\cdot \begin{bmatrix} 0 \\ -2 \\ 0 \end{bmatrix} +(1c_1+0c_2)\cdot \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}

Thus,

with {\vec{v

{B}=\begin{bmatrix}

c_1 \\ c_2 \end{bmatrix} then {\,h(\vec{v})\,}{D} =\begin{bmatrix} 0c_1+1c_2 \\ -(1/2)c_1-1c_2 \\ 1c_1+0c_2 \end{bmatrix}.

For instance,

with {\begin{bmatrix} 4 \\ 8 \end{bmatrix}}{B}=\begin{bmatrix} 1 \\ 2 \end{bmatrix}_B then {\,h(\begin{bmatrix} 4 \\ 8 \end{bmatrix})\,}{D} =\begin{bmatrix} 2 \\ -5/2 \\ 1 \end{bmatrix}.

}}


We will express computations like the one above with a matrix notation. 
\begin{pmatrix}
0             &1  \\
-1/2          &-1  \\
1             &0
\end{pmatrix}_{B,D}
\begin{bmatrix}
c_1 \\ c_2
\end{bmatrix}_B
=
\begin{bmatrix}
0c_1+1c_2 \\ (-1/2)c_1-1c_2 \\ 1c_1+0c_2
\end{bmatrix}_D
In the middle is the argument \vec{v} to the map, represented with respect to the domain's basis B by a column vector with components c_1 and c_2. On the right is the value h(\vec{v}) of the map on that argument, represented with respect to the codomain's basis D by a column vector with components 0c_1+1c_2, etc. The matrix on the left is the new thing. It consists of the coefficients from the vector on the right, 0 and 1 from the first row, -1/2 and -1 from the second row, and 1 and 0 from the third row.

This notation simply breaks the parts from the right, the coefficients and the c's, out separately on the left, into a vector that represents the map's argument and a matrix that we will take to represent the map itself.

Definition

Suppose that ( V ) and ( W ) are vector spaces of dimensions ( n ) and ( m ) with bases ( B ) and ( D ), and that ( \map{h}{V}{W} ) is a linear map. If Failed to parse (syntax error): {h( \vec{\beta}_1 )}{D} = \begin{bmatrix} h_{1,1 \end{bmatrix} \\ h_{2,1} \\ \vdots \\ h_{m,1}}_D \;\ldots\; {h( \vec{\beta}_n )}{D} = \begin{bmatrix} h_{1,n \end{bmatrix} \\ h_{2,n} \\ \vdots \\ h_{m,n}}_D

then Failed to parse (unknown function\generalmatrix): {h}{B,D}=\generalmatrix{h}{n}{m}_{B,D}

is the matrix representation of ( h ) with respect to ( B, D ).% [Index][Index]%

[Index]


Briefly, the vectors representing the h(\vec{\beta})'s are adjoined to make the matrix representing the map. Failed to parse (lexing error): {h}{B,D}= \left(\begin{array}{c|@{\hspace{1.5em}}c@{\hspace{1.5em}}|c} \vdots & &\vdots \\ {\,h(\vec{\beta}_1)\,}{D} &\cdots &{\,h(\vec{\beta}_n)\,}{D} \\ \vdots & &\vdots \end{array}\right)

Observe that the number of columns~n of the matrix is the dimension of the domain of the map, and the number of rows~m is the dimension of the codomain.


If ( \map{h}{\Re^3}{\polyspace_1} ) is given by 
\begin{bmatrix}
a_1 \\ a_2 \\ a_3
\end{bmatrix}
	o{h}
(2a_1+a_2)+(-a_3)x
then where 
B=
{\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix},
\begin{bmatrix}
0 \\ 2 \\ 0
\end{bmatrix},
\begin{bmatrix}
2 \\ 0 \\ 0
\end{bmatrix} }
\text{and} 
D=
{1+x,-1+x}
the action of ( h ) on ( B ) is given by 
\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix}	o{h}-x
\begin{bmatrix}
0 \\ 2 \\ 0
\end{bmatrix}	o{h}2
\begin{bmatrix}
2 \\ 0 \\ 0
\end{bmatrix}	o{h}4
and a simple calculation gives 
{-x}{D}=\begin{bmatrix}
-1/2 \\ -1/2
\end{bmatrix}_D
{2}{D}=\begin{bmatrix}
1 \\ -1
\end{bmatrix}_D 
{4}{D}=\begin{bmatrix}
2 \\ -2
\end{bmatrix}_D 
showing that this is the matrix representing h with respect to the bases.


{h}{B,D}
=
\begin{pmatrix}
-1/2  &1   &2  \\
-1/2  &-1  &-2
\end{pmatrix}_{B,D}


We will use lower case letters for a map, upper case for the matrix, and lower case again for the entries of the matrix. Thus for the map ( h ), the matrix representing it is ( H ), with entries ( h_{i,j} ).

Theorem

Assume that ( V ) and ( W ) are vector spaces of dimensions ( m ) and ( n ) with bases ( B ) and ( D ), and that ( \map{h}{V}{W} ) is a linear map. If ( h ) is represented by Failed to parse (unknown function\generalmatrix): {h}{B,D}=\generalmatrix{h}{n}{m}_{B,D}

and ( \vec{v}\in V ) is represented by 
{\vec{v}}{B}=\begin{bmatrix}
c_1 \\ c_2 \\ \vdots \\ c_n
\end{bmatrix}_B
then the representation of the image of \vec{v} is this. Failed to parse (syntax error): {\, h(\vec{v}) \,}{D} = \begin{bmatrix} h_{1,1 \end{bmatrix}c_1+h_{1,2}c_2+\dots+h_{1,n}c_n \\ h_{2,1}c_1+h_{2,2}c_2+\dots+h_{2,n}c_n \\ \vdots \\ h_{m,1}c_1+h_{m,2}c_2+\dots+h_{m,n}c_n}_D


Proof
\nearbyexercise{exer:MatVecMultRepLinMap}.


We will think of the matrix {h}{B,D} and the vector {\vec{v}}{B} as combining to make the vector {h(\vec{v})}{D}.

Definition

The matrix-vector product[Index]% [Index] of a ( \nbym{m}{n} ) matrix and a ( \nbym{n}{1} ) vector is this. Failed to parse (unknown function\generalmatrix): \generalmatrix{a}{n}{m} \begin{bmatrix} c_1 \\ \vdots \\ c_n \end{bmatrix} = \begin{bmatrix} a_{1,1 \end{bmatrix}c_1+a_{1,2}c_2+\dots+a_{1,n}c_n \\ a_{2,1}c_1+a_{2,2}c_2+\dots+a_{2,n}c_n \\ \vdots \\ a_{m,1}c_1+a_{m,2}c_2+\dots+a_{m,n}c_n}


The point of \nearbydefinition{def:MatRepMap} is to generalize ex:TypLinMapRepByMat, that is, the point of the definition is \nearbytheorem{th:MatMultRepsFuncAppl}, that the matrix describes how to get from the representation of a domain vector with respect to the domain's basis to the representation of its image in the codomain with respect to the codomain's basis. With \nearbydefinition{def:MatrixVecProd}, we can restate this as:~application of a linear map is represented by the matrix-vector product of the map's representative and the vector's representative.


With the matrix from ex:PolyOneToRThree we can calculate where that map sends this vector. 
\vec{v}=\begin{bmatrix}
4 \\ 1 \\ 0
\end{bmatrix}
This vector is represented, with respect to the domain basis B, by 
{\vec{v}}{B}=\begin{bmatrix}
0 \\ 1/2 \\ 2
\end{bmatrix}_B
and so this is the representation of the value h(\vec{v}) with respect to the codomain basis D. Failed to parse (syntax error): {h(\vec{v})}{D} =\begin{pmatrix} -1/2 &1 &2 \\ -1/2 &-1 &-2 \end{pmatrix}_{B,D} \begin{bmatrix} 0 \\ 1/2 \\ 2 \end{bmatrix}_B \\ =\begin{bmatrix} (-1/2)\cdot 0+1\cdot (1/2) + 2\cdot 2 \\ (-1/2)\cdot 0-1\cdot (1/2) - 2\cdot 2 \end{bmatrix}_D =\begin{bmatrix} 9/2 \\ -9/2 \end{bmatrix}_D

To find h(\vec{v}) itself, not its representation,

take (9/2)(1+x)-(9/2)(-1+x)=9.



Let ( \map{\pi}{\Re^3}{\Re^2} ) be projection onto the ( xy )-plane. To give a matrix representing this map, we first fix bases. 
B={
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix},
\begin{bmatrix}
1 \\ 1 \\ 0
\end{bmatrix},
\begin{bmatrix}
-1 \\ 0 \\ 1
\end{bmatrix} }

D={
\begin{bmatrix}
2 \\ 1
\end{bmatrix},
\begin{bmatrix}
1 \\ 1
\end{bmatrix} }
For each vector in the domain's basis, we find its image under the map. 
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}	o{\pi}\begin{bmatrix}
1 \\ 0
\end{bmatrix}

\begin{bmatrix}
1 \\ 1 \\ 0
\end{bmatrix}	o{\pi}\begin{bmatrix}
1 \\ 1
\end{bmatrix}

\begin{bmatrix}
-1 \\ 0 \\ 1
\end{bmatrix}	o{\pi}\begin{bmatrix}
-1 \\ 0
\end{bmatrix}
Then we find the representation of each image with respect to the codomain's basis 
{\begin{bmatrix}
1 \\ 0
\end{bmatrix}}{D}=\begin{bmatrix}
1 \\ -1
\end{bmatrix}

{\begin{bmatrix}
1 \\ 1
\end{bmatrix}}{D}=\begin{bmatrix}
0 \\ 1
\end{bmatrix}

{\begin{bmatrix}
-1 \\ 0
\end{bmatrix}}{D}=\begin{bmatrix}
-1 \\ 1
\end{bmatrix}
(these are easily checked). Finally, adjoining these representations gives the matrix representing ( \pi ) with respect to ( B,D ). 
{\pi}{B,D}
=\begin{pmatrix}
1  &0  &-1  \\
-1 &1  &1
\end{pmatrix}_{B,D}
We can illustrate \nearbytheorem{th:MatMultRepsFuncAppl} by computing the matrix-vector product representing the following statement about the projection map. 
\pi(
\begin{bmatrix}
2 \\ 2 \\ 1
\end{bmatrix}
)=\begin{bmatrix}
2 \\ 2
\end{bmatrix}
Representing this vector from the domain with respect to the domain's basis 
{\begin{bmatrix}
2 \\ 2 \\ 1
\end{bmatrix}}{B}=
\begin{bmatrix}
1 \\ 2 \\ 1
\end{bmatrix}_B
gives this matrix-vector product. 
{ \,\pi(\begin{bmatrix}
2 \\ 1 \\ 1
\end{bmatrix})\,}{D}=
\begin{pmatrix}
1  &0  &-1  \\
-1 &1  &1
\end{pmatrix}_{B,D}
\begin{bmatrix}
1 \\ 2 \\ 1
\end{bmatrix}_B
=
\begin{bmatrix}
0 \\ 2
\end{bmatrix}_D
Expanding this representation into a linear combination of vectors from ( D ) 
0\cdot\begin{bmatrix}
2 \\ 1
\end{bmatrix}
+2\cdot\begin{bmatrix}
1 \\ 1
\end{bmatrix}
=
\begin{bmatrix}
2 \\ 2
\end{bmatrix}
checks that the map's action is indeed reflected in the operation of the matrix. (We will sometimes compress these three displayed equations into one 
\begin{bmatrix}
2 \\ 2 \\ 1
\end{bmatrix}=\begin{bmatrix}
1 \\ 2 \\ 1
\end{bmatrix}_B
\;\overset{h}{\underset{H}{\longmapsto}}\;
\begin{bmatrix}
0 \\ 2
\end{bmatrix}_D=\begin{bmatrix}
2 \\ 2
\end{bmatrix}

in the course of a calculation.)


We now have two ways to compute the effect of projection, the straightforward formula that drops each three-tall vector's third component to make a two-tall vector, and the above formula that uses representations and matrix-vector multiplication. Compared to the first way, the second way might seem complicated. However, it has advantages. The next example shows that giving a formula for some maps is simplified by this new scheme.


To represent a rotation[Index]

map \map{t_{\theta

{\Re^2}{\Re^2} that

turns all vectors in the plane counterclockwise through an angle \theta

\small

Image:Linear Algebra Book2 ch3.15

we start by fixing bases. Using \stdbasis_2 both as a domain basis and as a codomain basis is natural, Now, we find the image under the map of each vector in the domain's basis. 
\begin{bmatrix}
1 \\ 0
\end{bmatrix}	o{t_\theta}\begin{bmatrix}
\cos\theta \\ \sin\theta
\end{bmatrix}

\begin{bmatrix}
0 \\ 1
\end{bmatrix}	o{t_\theta}\begin{bmatrix}
-\sin\theta \\ \cos\theta
\end{bmatrix}
Then we represent these images with respect to the codomain's basis. Because this basis is \stdbasis_2, vectors are represented by themselves. Finally, adjoining the representations gives the matrix representing the map. Failed to parse (unknown function\stdbasis): {t_\theta}{\stdbasis_2,\stdbasis_2} = \begin{pmatrix} \cos\theta &-\sin\theta \\ \sin\theta &\cos\theta \end{pmatrix}

The advantage of this scheme is that just by knowing how to represent the image of the two basis vectors, we get a formula that tells us the image of any vector at all; here a vector rotated by \theta=\pi/6. 
\begin{bmatrix}
3  \\ -2
\end{bmatrix}\;	o{t_{\pi/6}}\;
\begin{pmatrix}
\sqrt{3}/2  &-1/2  \\
1/2        &\sqrt{3}/2
\end{pmatrix}
\begin{bmatrix}
3  \\ -2
\end{bmatrix}
\approx
\begin{bmatrix}
3.598 \\ -0.232
\end{bmatrix}  
(Again, we are using the fact that, with respect to \stdbasis_2, vectors represent themselves.) }}


We have already seen the addition and scalar multiplication operations of matrices and the dot product operation of vectors. Matrix-vector multiplication is a new operation in the arithmetic of vectors and matrices. Nothing in \nearbydefinition{def:MatrixVecProd} requires us to view it in terms of representations. We can get some insight into this operation by turning away from what is being represented, and instead focusing on how the entries combine.


In the definition the width of the matrix equals the height of the vector. Hence, the first product below is defined while the second is not. 
\begin{pmatrix}
1  &0  &0  \\
4  &3  &1
\end{pmatrix}
\begin{bmatrix}
1 \\ 0 \\ 2
\end{bmatrix}
=
\begin{bmatrix}
1 \\ 6
\end{bmatrix}

\begin{pmatrix}
1  &0  &0  \\
4  &3  &1
\end{pmatrix}
\begin{bmatrix}
1 \\ 0
\end{bmatrix}
One reason that this product is not defined is purely formal:~the definition requires that the sizes match, and these sizes don't match. Behind the formality, though, is a reason why we will leave it undefined— the matrix represents a map with a three-dimensional domain while the

vector represents a member of a two-dimensional space.


A good way to view a matrix-vector product is as the dot products of the rows of the matrix with the column vector. Failed to parse (syntax error): \begin{pmatrix} &\vdots \\ a_{i,1} &a_{i,2} &\ldots &a_{i,n} \\ &\vdots \end{pmatrix} \begin{bmatrix} c_1 \\ c_2 \\ \vdots \\ c_n \end{bmatrix} = \begin{bmatrix} \vdots \\ a_{i,1 \end{bmatrix}c_1+a_{i,2}c_2+\ldots+a_{i,n}c_n \\ \vdots}

Looked at in this row-by-row way, this new operation generalizes dot product.

Matrix-vector product can also be viewed column-by-column. Failed to parse (unknown function\generalmatrix): \generalmatrix{h}{n}{m} \begin{bmatrix} c_1 \\ c_2 \\ \vdots \\ c_n \end{bmatrix} =\begin{bmatrix} h_{1,1 \end{bmatrix}c_1+h_{1,2}c_2+\dots+h_{1,n}c_n \\ h_{2,1}c_1+h_{2,2}c_2+\dots+h_{2,n}c_n \\ \vdots \\ h_{m,1}c_1+h_{m,2}c_2+\dots+h_{m,n}c_n} \\ =c_1\begin{bmatrix} h_{1,1 \end{bmatrix} \\ h_{2,1} \\ \vdots \\ h_{m,1}} +\dots +c_n\begin{bmatrix} h_{1,n \end{bmatrix} \\ h_{2,n} \\ \vdots \\ h_{m,n}}




\begin{pmatrix}
1  &0  &-1  \\
2  &0  &3
\end{pmatrix}
\begin{bmatrix}
2 \\ -1 \\ 1
\end{bmatrix}
=
2\begin{bmatrix}
1 \\ 2
\end{bmatrix}
-1\begin{bmatrix}
0 \\ 0
\end{bmatrix}
+1\begin{bmatrix}
-1 \\ 3
\end{bmatrix}
=
\begin{bmatrix}
1 \\ 7
\end{bmatrix}


The result has the columns of the matrix weighted by the entries of the vector. This way of looking at it brings us back to the objective stated at the start of this section, to compute ( h(c_1\vec{\beta}_1+\dots+c_n\vec{\beta}_n) ) as ( c_1h(\vec{\beta}_1)+\dots+c_nh(\vec{\beta}_n) ).

We began this section by noting that the equality of these two enables us to compute the action of h on any argument knowing only h(\vec{\beta}_1), \ldots, h(\vec{\beta}_n). We have developed this into a scheme to compute the action of the map by taking the matrix-vector product of the matrix representing the map and the vector representing the argument. In this way, any linear map is represented with respect to some bases by a matrix. In the next subsection, we will show the converse, that any matrix represents a linear map. }}

Contents

[edit] Exercises

This exercise is recommended for all readers.

}}

[edit] Exercise 1

Problem

Multiply the matrix 
\begin{pmatrix}
1  &3  &1  \\
0  &-1 &2  \\
1  &1  &0
\end{pmatrix}
by each vector (or state ``not defined). \begin{exparts*}

  1. ( \begin{bmatrix}

2 \\ 1 \\ 0 \end{bmatrix} )

  1. ( \begin{bmatrix}

-2 \\ -2 \end{bmatrix} )

  1. ( \begin{bmatrix}

0 \\ 0 \\ 0 \end{bmatrix} ) \end{exparts*}

Answer

\begin{exparts*}

  1. (

\begin{bmatrix} 1\cdot 2+3\cdot 1+1\cdot 0 \\ 0\cdot 2+(-1)\cdot 1+2\cdot 0 \\ 1\cdot 2+1\cdot 1+0\cdot 0 \end{bmatrix} =\begin{bmatrix} 5 \\ -1 \\ 3 \end{bmatrix} )

  1. Not defined.
  2. ( \begin{bmatrix}

0 \\ 0 \\ 0 \end{bmatrix} )

\end{exparts*}

[edit] Exercise 2

Problem

Perform, if possible, each matrix-vector multiplication. \begin{exparts*}

  1. \begin{pmatrix}

2 &1 \\ 3 &-1/2 \end{pmatrix} \begin{bmatrix} 4 \\ 2 \end{bmatrix}

  1. \begin{pmatrix}

1 &1 &0 \\ -2 &1 &0 \end{pmatrix} \begin{bmatrix} 1 \\ 3 \\ 1 \end{bmatrix}

  1. \begin{pmatrix}

1 &1 \\ -2 &1 \end{pmatrix} \begin{bmatrix} 1 \\ 3 \\ 1 \end{bmatrix} \end{exparts*}

Answer

\begin{exparts*}

  1. \begin{bmatrix}

2\cdot 4 +1\cdot 2 \\ 3\cdot 4-(1/2)\cdot 2 \end{bmatrix} =\begin{bmatrix} 10 \\ 11 \end{bmatrix}

  1. \begin{bmatrix}

4 \\ 1 \end{bmatrix}

  1. Not defined.

\end{exparts*}

This exercise is recommended for all readers.

[edit] Exercise 3

Problem

Solve this matrix equation. 
\begin{pmatrix}
2  &1  &1  \\
0  &1  &3  \\
1  &-1 &2
\end{pmatrix}
\begin{bmatrix}
x \\ y \\ z
\end{bmatrix}
=\begin{bmatrix}
8 \\ 4 \\ 4
\end{bmatrix}

Answer

Matrix-vector multiplication gives rise to a linear system. 
<math>\begin{bmatrix}
2x  &+  &y  &+  &z  =  &8  \\
&   &y  &+  &3z =  &4  \\
x  &-  &y  &+  &2z =  &4 
\end{bmatrix} </math> Gaussian reduction shows that ( z=1 ), ( y=1 ), and ( x=3 ).

This exercise is recommended for all readers.

[edit] Exercise 4

Problem

For a homomorphism from ( \polyspace_2 ) to ( \polyspace_3 ) that sends 
1\mapsto 1+x,

x\mapsto 1+2x,
\text{and} 
x^2\mapsto x-x^3
where does ( 1-3x+2x^2 ) go?

Answer

Here are two ways to get the answer.

First, obviously 1-3x+2x^2=1\cdot 1-3\cdot x+2\cdot x^2, and so we can apply the general property of preservation of combinations to get h(1-3x+2x^2) =h(1\cdot 1-3\cdot x+2\cdot x^2) =1\cdot h(1)-3\cdot h(x)+2\cdot h(x^2) =1\cdot (1+x)-3\cdot (1+2x)+2\cdot (x-x^3) =-2-3x-2x^3.

The other way uses the computation scheme developed in this subsection. Because we know where these elements of the space go, we consider this basis ( B={1,x,x^2} ) for the domain. Arbitrarily, we can take ( D={1,x,x^2,x^3} ) as a basis for the codomain. With those choices, we have that 
{h}{B,D}
=\begin{pmatrix}
1   &1  &0  \\
1   &2  &1  \\
0   &0  &0  \\
0   &0  &-1
\end{pmatrix}_{B,D}
and, as 
{1-3x+2x^2}{B}=\begin{bmatrix}
1 \\ -3 \\ 2
\end{bmatrix}_B
the matrix-vector multiplication calculation gives this. 
{h(1-3x+2x^2)}{D}=
\begin{pmatrix}
1   &1  &0  \\
1   &2  &1  \\
0   &0  &0  \\
0   &0  &-1
\end{pmatrix}_{B,D}
\begin{bmatrix}
1 \\ -3 \\ 2
\end{bmatrix}_B
=\begin{bmatrix}
-2 \\ -3 \\ 0 \\ -2
\end{bmatrix}_D
Thus, ( h(1-3x+2x^2) =-2\cdot 1-3\cdot x+0\cdot x^2-2\cdot x^3 =-2-3x-2x^3 ), as above.

This exercise is recommended for all readers.

[edit] Exercise 5

Problem

Assume that ( \map{h}{\Re^2}{\Re^3} ) is determined by this action. 
\begin{bmatrix}
1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
2 \\ 2 \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
0 \\ 1 \\ -1
\end{bmatrix}
Using the standard bases, find

  1. the matrix representing this map;
  2. a general formula for ( h(\vec{v}) ).
Answer

Again, as recalled in the subsection, with respect to \stdbasis_i, a column vector represents itself.

  1. To represent ( h ) with respect

to ( \stdbasis_2,\stdbasis_3 ) we take the images of the basis vectors from the domain, and represent them with respect to the basis for the codomain. Failed to parse (unknown function\stdbasis): {\,h(\vec{e}_1)\,}{\stdbasis_3} ={\begin{bmatrix} 2 \\ 2 \\ 0 \end{bmatrix}}{\stdbasis_3} =\begin{bmatrix} 2 \\ 2 \\ 0 \end{bmatrix} {\,h(\vec{e}_2)\,}{\stdbasis_3} ={\begin{bmatrix} 0 \\ 1 \\ -1 \end{bmatrix}}{\stdbasis_3} =\begin{bmatrix} 0 \\ 1 \\ -1 \end{bmatrix}

These are adjoined to make the matrix. Failed to parse (unknown function\stdbasis): {h}{\stdbasis_2,\stdbasis_3}= \begin{pmatrix} 2 &0 \\ 2 &1 \\ 0 &-1 \end{pmatrix}

  1. For any ( \vec{v} ) in the domain ( \Re^2 ),

Failed to parse (unknown function\stdbasis): {\vec{v}}{\stdbasis_2} ={\begin{bmatrix} v_1 \\ v_2 \end{bmatrix}}{\stdbasis_2} =\begin{bmatrix} v_1 \\ v_2 \end{bmatrix}

and so Failed to parse (unknown function\stdbasis): {\,h(\vec{v})\,}{\stdbasis_3} =\begin{pmatrix} 2 &0 \\ 2 &1 \\ 0 &-1 \end{pmatrix} \begin{bmatrix} v_1 \\ v_2 \end{bmatrix} =\begin{bmatrix} 2v_1 \\ 2v_1+v_2 \\ -v_2 \end{bmatrix}

is the desired representation.


This exercise is recommended for all readers.

[edit] Exercise 6

Problem

Let ( \map{d/dx}{\polyspace_3}{\polyspace_3} ) be the derivative transformation.

  1. Represent ( d/dx ) with respect to ( B,B ) where

( B={1,x,x^2,x^3} ).

  1. Represent ( d/dx ) with respect to ( B,D ) where

( D={1,2x,3x^2,4x^3} ).

Answer

\begin{exparts*}

We must first find the image of each vector from the domain's basis, and then represent that image with respect to the codomain's basis. 
{\frac{d\,1}{dx}}{B}=\begin{bmatrix}
0 \\ 0 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x}{dx}}{B}=\begin{bmatrix}
1 \\ 0 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x^2}{dx}}{B}=\begin{bmatrix}
0 \\ 2 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x^3}{dx}}{B}=\begin{bmatrix}
0 \\ 0 \\ 3 \\ 0
\end{bmatrix}
Those representations are then adjoined to make the matrix representing the map. 
{\frac{d}{dx}}{B,B}=
\begin{pmatrix}
0  &1  &0  &0  \\
0  &0  &2  &0  \\
0  &0  &0  &3  \\
0  &0  &0  &0 
\end{pmatrix}

  1. Proceeding as in the prior item, we represent the images

of the domain's basis vectors 
{\frac{d\,1}{dx}}{B}=\begin{bmatrix}
0 \\ 0 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x}{dx}}{B}=\begin{bmatrix}
1 \\ 0 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x^2}{dx}}{B}=\begin{bmatrix}
0 \\ 1 \\ 0 \\ 0
\end{bmatrix}

{\frac{d\,x^3}{dx}}{B}=\begin{bmatrix}
0 \\ 0 \\ 1 \\ 0
\end{bmatrix}
and adjoin to make the matrix. 
{\frac{d}{dx}}{B,D}=
\begin{pmatrix}
0  &1  &0  &0  \\
0  &0  &1  &0  \\
0  &0  &0  &1  \\
0  &0  &0  &0
\end{pmatrix}  
\end{exparts*}

This exercise is recommended for all readers.

[edit] Exercise 7

Problem

Represent each linear map with respect to each pair of bases.

  1. ( \map{d/dx}{\polyspace_n}{\polyspace_n} ) with respect to

( B,B ) where ( B={1,x,\dots,x^n} ), given by 
a_0+a_1x+a_2x^2+\dots+a_nx^n
\mapsto
a_1+2a_2x+\dots+na_nx^{n-1}

  1. ( \map{\int}{\polyspace_n}{\polyspace_{n+1

)

with respect to ( B_n,B_{n+1} ) where ( B_i={1,x,\dots,x^i} ), given by 
a_0+a_1x+a_2x^2+\dots+a_nx^n
\mapsto
a_0x+\frac{a_1}{2}x^2+\dots+\frac{a_n}{n+1}x^{n+1}

  1. ( \map{\int^1_0}{\polyspace_n}{\Re} ) with respect to

( B,\stdbasis_1 ) where ( B={1,x,\dots,x^n} ) and ( \stdbasis_1={1} ), given by 
a_0+a_1x+a_2x^2+\dots+a_nx^n
\mapsto
a_0+\frac{a_1}{2}+\dots+\frac{a_n}{n+1}

  1. ( \map{\text{eval}_3}{\polyspace_n}{\Re} ) with respect to

( B,\stdbasis_1 ) where ( B={1,x,\dots,x^n} ) and ( \stdbasis_1={1} ), given by 
a_0+a_1x+a_2x^2+\dots+a_nx^n
\mapsto
a_0+a_1\cdot 3+a_2\cdot 3^2+\dots+a_n\cdot 3^n

  1. ( \map{\text{slide}_{-1}}{\polyspace_n}{\polyspace_n} )

with respect to ( B,B ) where ( B={1,x,\ldots,x^n} ), given by 
a_0+a_1x+a_2x^2+\dots+a_nx^n
\mapsto
a_0+a_1\cdot (x+1)+\dots+a_n\cdot (x+1)^n

Answer

For each, we must find the image of each of the domain's basis vectors, represent each image with respect to the codomain's basis, and then adjoin those representations to get the matrix.

  1. The basis vectors from the domain have these images


1\mapsto 0  
x\mapsto 1  
x^2\mapsto 2x  
\ldots
and these images are represented with respect to the codomain's basis in this way. 
{0}{B}=\begin{bmatrix}
0 \\ 0 \\ 0 \\ \vdots \\ \  \\  \ 
\end{bmatrix}

{1}{B}=\begin{bmatrix}
1 \\ 0 \\ 0 \\ \vdots \\ \  \\ \ 
\end{bmatrix}

{2x}{B}=\begin{bmatrix}
0 \\ 2 \\ 0 \\ \vdots \\ \  \\ \ 
\end{bmatrix}
\ldots 
{nx^{n-1}}{B}=\begin{bmatrix}
0 \\ 0 \\ 0 \\ \vdots \\ n \\ 0
\end{bmatrix}
The matrix 
{\frac{d}{dx}}{B,B}
=\begin{pmatrix}
0  &1  &0  &\ldots  &0  \\
0  &0  &2  &\ldots  &0  \\
&\vdots             \\
0  &0  &0  &\ldots  &n  \\
0  &0  &0  &\ldots  &0
\end{pmatrix}
has n+1 rows and columns.

  1. Once the images under this map of the domain's basis

vectors are determined 
1\mapsto x 
x\mapsto x^2/2  
x^2\mapsto x^3/3 
\ldots
then they can be represented with respect to the codomain's basis 
{x}{B_{n+1}}=\begin{bmatrix}
0 \\ 1 \\ 0 \\ \vdots \\ \ 
\end{bmatrix}

{x^2/2}{B_{n+1}}=\begin{bmatrix}
0 \\ 0 \\ 1/2 \\ \vdots \\ \ 
\end{bmatrix}
\ldots 
{x^{n+1}/(n+1)}{B_{n+1}}
=\begin{bmatrix}
0 \\ 0 \\ 0 \\ \vdots \\ 1/(n+1)
\end{bmatrix}
and put together to make the matrix. 
{\int}{B_{n},B_{n+1}}
=\begin{pmatrix}
0  &0  &\ldots  &0      &0  \\
1  &0  &\ldots  &0      &0  \\
0  &1/2&\ldots  &0      &0  \\
&\vdots                  \\
0  &0  &\ldots  &0      &1/(n+1)
\end{pmatrix}

  1. The images of the basis vectors of the domain are

 
1\mapsto 1 
x\mapsto 1/2 
x^2\mapsto 1/3 
\ldots
and they are represented with respect to the codomain's basis as Failed to parse (unknown function\stdbasis): {1}{\stdbasis_1}=1 {1/2}{\stdbasis_1}=1/2 \ldots

so the matrix is Failed to parse (unknown function\stdbasis): {\int}{B,\stdbasis_1} =\begin{pmatrix} 1 &1/2 &\cdots &1/n &1/(n+1) \end{pmatrix}

(this is an \nbym{1}{(n+1)} matrix).

  1. Here, the images of the domain's basis vectors are

  
1\mapsto 1 
x\mapsto 3 
x^2\mapsto 9
\ldots 
and they are represented in the codomain as Failed to parse (unknown function\stdbasis): {1}{\stdbasis_1}=1 {3}{\stdbasis_1}=3 {9}{\stdbasis_1}=9 \ldots

and so the matrix is this. Failed to parse (unknown function\stdbasis): {\int_0^1}{B,\stdbasis_1} =\begin{pmatrix} 1 &3 &9 &\cdots &3^n \end{pmatrix}

  1. The images of the basis vectors from the domain are

 
1\mapsto 1 
x\mapsto x+1=1+x  
x^2\mapsto (x+1)^2=1+2x+x^2  
x^3\mapsto (x+1)^3=1+3x+3x^2+x^3  
\ldots 
which are represented as 
{1}{B}=\begin{bmatrix}
1 \\ 0 \\ 0 \\ 0 \\ \vdots \\ 0
\end{bmatrix}

{1+x}{B}=\begin{bmatrix}
1 \\ 1 \\ 0 \\ 0 \\ \vdots \\ 0
\end{bmatrix}

{1+2x+x^2}{B}=\begin{bmatrix}
1 \\ 2 \\ 1 \\ 0 \\ \vdots \\ 0
\end{bmatrix}
\ldots
The resulting matrix Failed to parse (unknown function\renewcommand): \renewcommand{\arraystretch}{1.2} {\int}{B,B} =\begin{pmatrix} 1 &1 &1 &1 &\ldots &1 \\ 0 &1 &2 &3 &\ldots &\binom{n}{2} \\ 0 &0 &1 &3 &\ldots &\binom{n}{3} \\ &\vdots \\ 0 &0 &0 & &\ldots &1 \end{pmatrix}

is Pascal's triangle[Index] (recall that \binom{n}{r} is the number of ways to choose r things, without order and without repetition, from a set of size n).


}}

[edit] Exercise 8

Problem

Represent the identity map on any nontrivial space with respect to ( B,B ), where ( B ) is any basis.

Answer

Where the space is ( n )-dimensional, 
{\text{id}}{B,B}=
\begin{pmatrix}
1  &0  \ldots  &0  \\
0  &1  \ldots  &0  \\
&\vdots         \\
0  &0  \ldots  &1
\end{pmatrix}_{B,B}

is the n identity matrix.

[edit] Exercise 9

Problem

Represent, with respect to the natural basis, the transpose transformation on the space ( \matspace_{2} ) of 2 matrices.

Answer

Taking this as the natural basis 
B={\vec{\beta}_1,\vec{\beta}_2,\vec{\beta}_3,\vec{\beta}_4}
={
\begin{pmatrix}
1  &0  \\
0  &0
\end{pmatrix},
\begin{pmatrix}
0  &1  \\
0  &0
\end{pmatrix},
\begin{pmatrix}
0  &0  \\
1  &0
\end{pmatrix},
\begin{pmatrix}
0  &0  \\
0  &1
\end{pmatrix}   }
the transpose map acts in this way 
\vec{\beta}_1\mapsto\vec{\beta}_1 
\vec{\beta}_2\mapsto\vec{\beta}_3 
\vec{\beta}_3\mapsto\vec{\beta}_2 
\vec{\beta}_4\mapsto\vec{\beta}_4  
so that representing the images with respect to the codomain's basis and adjoining those column vectors together gives this.


{\text{trans}}{B,B}=
\begin{pmatrix}
1  &0  &0  &0  \\
0  &0  &1  &0  \\
0  &1  &0  &0  \\
0  &0  &0  &1
\end{pmatrix}_{B,B}

[edit] Exercise 10

Problem

Assume that ( B={\vec{\beta}_1,\vec{\beta}_2,\vec{\beta}_3,\vec{\beta}_4} ) is a basis for a vector space. Represent with respect to ( B,B ) the transformation that is determined by each.

  1. ( \vec{\beta}_1\mapsto\vec{\beta}_2 ),

( \vec{\beta}_2\mapsto\vec{\beta}_3 ), ( \vec{\beta}_3\mapsto\vec{\beta}_4 ), ( \vec{\beta}_4\mapsto\zero )

  1. ( \vec{\beta}_1\mapsto\vec{\beta}_2 ),

( \vec{\beta}_2\mapsto\zero ), ( \vec{\beta}_3\mapsto\vec{\beta}_4 ), ( \vec{\beta}_4\mapsto\zero )

  1. ( \vec{\beta}_1\mapsto\vec{\beta}_2 ),

( \vec{\beta}_2\mapsto\vec{\beta}_3 ), ( \vec{\beta}_3\mapsto\zero ), ( \vec{\beta}_4\mapsto\zero )

Answer
  1. With respect to the basis of the codomain, the images of

the members of the basis of the domain are represented as Failed to parse (unknown function\zero): {\vec{\beta}_2}{B}=\begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \end{bmatrix} {\vec{\beta}_3}{B}=\begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \end{bmatrix} {\vec{\beta}_4}{B}=\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \end{bmatrix} {\zero}{B}=\begin{bmatrix} 0 \\ 0 \\ 0 \\ 0 \end{bmatrix}

and consequently, the matrix representing the transformation is this. 
\begin{pmatrix}
0  &0  &0  &0  \\
1  &0  &0  &0  \\
0  &1  &0  &0  \\
0  &0  &1  &0
\end{pmatrix}

\begin{pmatrix} 0 &0 &0 &0 \\ 1 &0 &0 &0 \\ 0 &0 &0 &0 \\ 0 &0 &1 &0 \end{pmatrix}

\begin{pmatrix} 0 &0 &0 &0 \\ 1 &0 &0 &0 \\ 0 &1 &0 &0 \\ 0 &0 &0 &0

\end{pmatrix}

[edit] Exercise 11

Problem

exam:RepsOfRigidPlaneMaps shows how to represent the rotation transformation of the plane with respect to the standard basis. Express these other transformations also with respect to the standard basis.

  1. the dilation map d_s, which multiplies

all vectors by the same scalar s[Index]

  1. the reflection map f_\ell, which reflects all

all vectors across a line \ell through the origin

Answer
  1. The picture of \map{d_s}{\Re^2}{\Re^2} is this.
\small

Image:Linear Algebra Book2 ch3.75

This map's effect on the vectors in the standard basis for the domain is  
\begin{bmatrix}
1 \\ 0
\end{bmatrix}	o{d_s}\begin{bmatrix}
s \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 1
\end{bmatrix}	o{d_s}\begin{bmatrix}
0 \\ s
\end{bmatrix}
and those images are represented with respect to the codomain's basis (again, the standard basis) by themselves. Failed to parse (unknown function\stdbasis): {\begin{bmatrix} s \\ 0 \end{bmatrix}}{\stdbasis_2}=\begin{bmatrix} s \\ 0 \end{bmatrix} {\begin{bmatrix} 0 \\ s \end{bmatrix}}{\stdbasis_2}=\begin{bmatrix} 0 \\ s \end{bmatrix}

Thus the representation of the dilation map is this. Failed to parse (unknown function\stdbasis): {d_s}{\stdbasis_2,\stdbasis_2} =\begin{pmatrix} s &0 \\ 0 &s \end{pmatrix}

  1. The picture of \map{f_\ell}{\Re^2}{\Re^2} is this.
\small

Image:Linear Algebra Book2 ch3.76

Some calculation (see Exercise~I.\ref{exer:RigidPlaneMapsAutos}) shows that when the line has slope k 
\begin{bmatrix}
1 \\ 0
\end{bmatrix}
	o{f_\ell}\begin{bmatrix}
(1-k^2)/(1+k^2) \\ 2k/(1+k^2)
\end{bmatrix}

\begin{bmatrix}
0 \\ 1
\end{bmatrix}
	o{f_\ell}\begin{bmatrix}
2k/(1+k^2) \\ -(1-k^2)/(1+k^2)
\end{bmatrix}
(the case of a line with undefined slope is separate but easy) and so the matrix representing reflection is this. Failed to parse (unknown function\stdbasis): {f_\ell}{\stdbasis_2,\stdbasis_2} =\frac{1}{1+k^2}\cdot\begin{pmatrix} 1-k^2 &2k \\ 2k &-(1-k^2) \end{pmatrix}


This exercise is recommended for all readers.

[edit] Exercise 12

Problem

Consider a linear transformation of ( \Re^2 ) determined by these two. 
\begin{bmatrix}
1 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
2 \\ 0
\end{bmatrix}

\begin{bmatrix}
1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
-1 \\ 0
\end{bmatrix}

  1. Represent this transformation with respect to the standard

bases.

  1. Where does the transformation send this vector?


\begin{bmatrix}
0 \\ 5
\end{bmatrix}

  1. Represent this transformation with respect to these bases.


B={\begin{bmatrix}
1 \\ -1
\end{bmatrix},\begin{bmatrix}
1 \\ 1
\end{bmatrix}}

D={\begin{bmatrix}
2 \\ 2
\end{bmatrix},\begin{bmatrix}
-1 \\ 1
\end{bmatrix}}

  1. Using ( B ) from the prior item,

represent the transformation with respect to ( B,B ).

Answer

Call the map ( \map{t}{\Re^2}{\Re^2} ).

  1. To represent this map with respect to the standard bases, we

must find, and then represent, the images of the vectors \vec{e}_1 and \vec{e}_2 from the domain's basis. The image of \vec{e}_1 is given.

One way to find the image of \vec{e}_2 is by eye— we can see this. 
\begin{bmatrix}
1 \\ 1
\end{bmatrix}-\begin{bmatrix}
1 \\ 0
\end{bmatrix}=\begin{bmatrix}
0 \\ 1
\end{bmatrix}
\;	o{t}\;
\begin{bmatrix}
2 \\ 0
\end{bmatrix}-\begin{bmatrix}
-1 \\ 0
\end{bmatrix}=\begin{bmatrix}
3 \\ 0
\end{bmatrix}

A more systemmatic way to find the image of \vec{e}_2 is to use the given information to represent the transformation, and then use that representation to determine the image. Taking this for a basis, 
C={\begin{bmatrix}
1 \\ 1
\end{bmatrix},\begin{bmatrix}
1 \\ 0
\end{bmatrix}}
the given information says this. Failed to parse (unknown function\stdbasis): {t}{C,\stdbasis_2} \begin{pmatrix} 2 &-1 \\ 0 &0 \end{pmatrix}

As 
{\vec{e}_2}{C}=\begin{bmatrix}
1 \\ -1
\end{bmatrix}_C
we have that Failed to parse (unknown function\stdbasis): {t(\vec{e}_2)}{\stdbasis_2} =\begin{pmatrix} 2 &-1 \\ 0 &0 \end{pmatrix}_{C,\stdbasis_2} \begin{bmatrix} 1 \\ -1 \end{bmatrix}_C =\begin{bmatrix} 3 \\ 0 \end{bmatrix}_{\stdbasis_2}

and consequently we know that t(\vec{e}_2)=3\cdot\vec{e}_1 (since, with respect to the standard basis, this vector is represented by itself). Therefore, this is the representation of t with respect to \stdbasis_2,\stdbasis_2. Failed to parse (unknown function\stdbasis): {t}{\stdbasis_2,\stdbasis_2} =\begin{pmatrix} -1 &3 \\ 0 &0 \end{pmatrix}_{\stdbasis_2,\stdbasis_2}

  1. To use the matrix developed in the prior item, note that

Failed to parse (unknown function\stdbasis): {\begin{bmatrix} 0 \\ 5 \end{bmatrix}}{\stdbasis_2}=\begin{bmatrix} 0 \\ 5 \end{bmatrix}_{\stdbasis_2}

and so we have this is the representation, with respect to the codomain's basis, of the image of the given vector. Failed to parse (unknown function\stdbasis): {t(\begin{bmatrix} 0 \\ 5 \end{bmatrix})}{\stdbasis_2} =\begin{pmatrix} -1 &3 \\ 0 &0 \end{pmatrix}_{\stdbasis_2,\stdbasis_2} \begin{bmatrix} 0 \\ 5 \end{bmatrix}_{\stdbasis_2} =\begin{bmatrix} 15 \\ 0 \end{bmatrix}_{\stdbasis_2}

Because the codomain's basis is the standard one, and so vectors in the codomain are represented by themselves, we have this. 
t(\begin{bmatrix}
0 \\ 5
\end{bmatrix})
=\begin{bmatrix}
15 \\ 0
\end{bmatrix}

  1. We first find the image of each member of ( B ), and then

represent those images with respect to ( D ). For the first step, we can use the matrix developed earlier. Failed to parse (unknown function\stdbasis): {\begin{bmatrix} 1 \\-1 \end{bmatrix}}{\stdbasis_2} =\begin{pmatrix} -1 &3 \\ 0 &0 \end{pmatrix}_{\stdbasis_2,\stdbasis_2} \begin{bmatrix} 1 \\ -1 \end{bmatrix}_{\stdbasis_2} =\begin{bmatrix} -4 \\ 0 \end{bmatrix}_{\stdbasis_2} \text{so} t(\begin{bmatrix} 1 \\ -1 \end{bmatrix})=\begin{bmatrix} -4 \\ 0 \end{bmatrix}

Actually, for the second member of B there is no need to apply the matrix because the problem statement gives its image. 
t(\begin{bmatrix}
1 \\ 1
\end{bmatrix})=\begin{bmatrix}
2 \\ 0
\end{bmatrix}
Now representing those images with respect to D is routine. 
{\begin{bmatrix}
-4 \\ 0
\end{bmatrix}}{D}=\begin{bmatrix}
-1 \\ 2
\end{bmatrix}_D
\text{and} 
{\begin{bmatrix}
2 \\ 0
\end{bmatrix}}{D}=\begin{bmatrix}
1/2 \\ -1
\end{bmatrix}_D
Thus, the matrix is this. 
{t}{B,D}=
\begin{pmatrix}
-1  &1/2  \\
2  &-1
\end{pmatrix}_{B,D}

  1. We know the images of the members of the domain's basis

from the prior item. 
t(\begin{bmatrix}
1 \\ -1
\end{bmatrix})=\begin{bmatrix}
-4 \\ 0
\end{bmatrix}

t(\begin{bmatrix}
1 \\ 1
\end{bmatrix})=\begin{bmatrix}
2 \\ 0
\end{bmatrix}
We can compute the representation of those images with respect to the codomain's basis. 
{\begin{bmatrix}
-4 \\ 0
\end{bmatrix}}{B}=\begin{bmatrix}
-2 \\ -2
\end{bmatrix}_B
\text{and} 
{\begin{bmatrix}
2 \\ 0
\end{bmatrix}}{B}=\begin{bmatrix}
1 \\ 1
\end{bmatrix}_B
Thus this is the matrix.


{t}{B,B}=
\begin{pmatrix}
-2  &1  \\
-2  &1
\end{pmatrix}_{B,B}

[edit] Exercise 13

Problem

Suppose that ( \map{h}{V}{W} ) is nonsingular so that by \nearbytheorem{th:OOHomoEquivalence}, for any basis ( B={\vec{\beta}_1,\dots,\vec{\beta}_n}\subset V ) the image ( h(B)={h(\vec{\beta}_1),\dots,h(\vec{\beta}_n)} ) is a basis for ( W ).

  1. Represent the map h with respect to B,h(B).
  2. For a member \vec{v} of the domain, where

the representation of \vec{v} has components c_1, \ldots, c_n, represent the image vector ( h(\vec{v}) ) with respect to the image basis h(B).

Answer
  1. The images of the members of the domain's basis are


\vec{\beta}_1\mapsto h(\vec{\beta}_1)

\vec{\beta}_2\mapsto h(\vec{\beta}_2)
\ldots  
\vec{\beta}_n\mapsto h(\vec{\beta}_n)
and those images are represented with respect to the codomain's basis in this way. 
{\,h(\vec{\beta}_1)\,}{h(B)}=\begin{bmatrix}
1 \\ 0 \\ \vdots \\ 0
\end{bmatrix}

{\,h(\vec{\beta}_2)\,}{h(B)}=\begin{bmatrix}
0 \\ 1 \\ \vdots \\ 0
\end{bmatrix}
\ldots 
{\,h(\vec{\beta}_n)\,}{h(B)}=\begin{bmatrix}
0 \\ 0 \\ \vdots \\ 1
\end{bmatrix}
Hence, the matrix is the identity. 
{h}{B,h(B)}
=\begin{pmatrix}
1  &0  &\ldots  &0  \\
0  &1  &        &0  \\
&   &\ddots      \\
0  &0  &        &1 
\end{pmatrix}

  1. Using the matrix in the prior item,

the representation is this.


{\,h(\vec{v})\,}{h(B)}
=\begin{bmatrix}
c_1 \\ \vdots \\ c_n
\end{bmatrix}_{h(B)}

[edit] Exercise 14

Problem

Give a formula for the product of a matrix and ( \vec{e}_i ), the column vector that is all zeroes except for a single one in the ( i )-th position.

Answer

The product Failed to parse (syntax error): \begin{pmatrix} h_{1,1} &\ldots &h_{1,i} &\ldots &h_{1,n} \\ h_{2,1} &\ldots &h_{2,i} &\ldots &h_{2,n} \\ &\vdots \\ h_{m,1} &\ldots &h_{m,i} &\ldots &h_{1,n} \end{pmatrix} \begin{bmatrix} 0 \\ \vdots \\ 1 \\ \vdots \\ 0 \end{bmatrix} = \begin{bmatrix} h_{1,i \end{bmatrix} \\ h_{2,i} \\ \vdots \\ h_{m,i}}

gives the ( i )-th column of the matrix.

This exercise is recommended for all readers.

[edit] Exercise 15

Problem

For each vector space of functions of one real variable, represent the derivative transformation with respect to ( B,B ).

  1. ( {a\cos x+b\sin x o a,b\in\Re} ),

( B={\cos x,\sin x} )

  1. ( {ae^x+be^{2x} o a,b\in\Re} ),
( B={e^x,e^{2x

)

  1. ( {a+bx+ce^x+dxe^{x} o a,b,c,d\in\Re} ),

( B={1,x,e^x,xe^{x}} )

Answer
  1. The images of the basis vectors for the domain are

( \cos x o{d/dx}-\sin x ) and ( \sin x o{d/dx}\cos x ). Representing those with respect to the codomain's basis (again, B) and adjoining the representations gives this matrix. 
{\frac{d}{dx}}{B,B}=
\begin{pmatrix}
0  &1  \\
-1  &0
\end{pmatrix}_{B,B}

  1. The images of the vectors in the domain's basis are

( e^x o{d/dx}e^x ) and ( e^{2x} o{d/dx}2e^{2x} ). Representing with respect to the codomain's basis and adjoining gives this matrix. 
{\frac{d}{dx}}{B,B}=
\begin{pmatrix}
1  &0  \\
0  &2
\end{pmatrix}_{B,B}

  1. The images of the members of the domain's basis are

( 1 o{d/dx}0 ), ( x o{d/dx}1 ), ( e^{x} o{d/dx}e^{x} ), and ( xe^{x} o{d/dx}e^x+xe^x ). Representing these images with respect to B and adjoining gives this matrix. 
{\frac{d}{dx}}{B,B}=
\begin{pmatrix}
0  &1  &0  &0 \\
0  &0  &0  &0 \\
0  &0  &1  &1 \\
0  &0  &0  &1
\end{pmatrix}_{B,B}


}}

[edit] Exercise 16

Problem

Find the range of the linear transformation of ( \Re^2 ) represented with respect to the standard bases by each matrix. \begin{exparts*}

  1. \begin{pmatrix}

1 &0 \\ 0 &0 \end{pmatrix}

  1. \begin{pmatrix}

0 &0 \\ 3 &2 \end{pmatrix}

  1. a matrix of the form

\begin{pmatrix} a &b \\ 2a &2b \end{pmatrix} \end{exparts*}

Answer
  1. It is the set of vectors of the codomain represented with

respect to the codomain's basis in this way. 
{
\begin{pmatrix}
1  &0  \\
0  &0
\end{pmatrix}
\begin{bmatrix}
x  \\ y
\end{bmatrix}
	o x,y\in\Re}
={\begin{bmatrix}
x  \\ 0
\end{bmatrix}
	o x,y\in\Re}
As the codomain's basis is \stdbasis_2, and so each vector is represented by itself, the range of this transformation is the x-axis.

  1. It is the set of vectors of the codomain represented

in this way. 
{
\begin{pmatrix}
0  &0  \\
3  &2
\end{pmatrix}
\begin{bmatrix}
x  \\ y
\end{bmatrix}
	o x,y\in\Re}
={\begin{bmatrix}
0  \\ 3x+2y
\end{bmatrix}
	o x,y\in\Re}
With respect to \stdbasis_2 vectors represent themselves so this range is the y~axis.

  1. The set of vectors represented with

respect to \stdbasis_2 as 
{
\begin{pmatrix}
a   &b  \\
2a  &2b
\end{pmatrix}
\begin{bmatrix}
x  \\ y
\end{bmatrix}
	o x,y\in\Re}
={\begin{bmatrix}
ax+by  \\ 2ax+2by
\end{bmatrix}
	o x,y\in\Re}
={(ax+by)\cdot\begin{bmatrix}
1  \\ 2
\end{bmatrix}
	o x,y\in\Re}
is the line y=2x, provided either a or b is not zero, and is the set consisting of just the origin if both are zero.


This exercise is recommended for all readers.

[edit] Exercise 17

Problem

Can one matrix represent two different linear maps?

That is, can ( {h}{B,D}={\hat{h

{\hat{B},\hat{D}} )?

Answer

Yes, for two reasons.

First, the two maps h and \hat{h} need not have the same domain and codomain. For instance, 
\begin{pmatrix}
1  &2  \\
3  &4
\end{pmatrix}
represents a map ( \map{h}{\Re^2}{\Re^2} ) with respect to the standard bases that sends 
\begin{bmatrix}
1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
1 \\ 3
\end{bmatrix}
\text{and} 
\begin{bmatrix}
0 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
2 \\ 4
\end{bmatrix}
and also represents a ( \map{\hat{h}}{\polyspace_1}{\Re^2} ) with respect to ( {1,x} ) and ( \stdbasis_2 ) that acts in this way. 
1\mapsto\begin{bmatrix}
1 \\ 3
\end{bmatrix}
\text{and} 
x\mapsto\begin{bmatrix}
2 \\ 4
\end{bmatrix}

The second reason is that, even if the domain and codomain of ( h ) and ( \hat{h} ) coincide, different bases produce different maps. An example is the 2 identity matrix 
I=\begin{pmatrix}
1  &0  \\
0  &1
\end{pmatrix}
which represents the identity map on \Re^2 with respect to \stdbasis_2,\stdbasis_2. However, with respect to \stdbasis_2 for the domain but the basis D={\vec{e}_2,\vec{e}_1} for the codomain, the same matrix I represents the map that swaps the first and second components 
\begin{bmatrix}
x \\ y
\end{bmatrix}\mapsto\begin{bmatrix}
y \\ x
\end{bmatrix}
(that is, reflection about the line y=x).

}}

[edit] Exercise 18

Problem

Prove \nearbytheorem{th:MatMultRepsFuncAppl}.

Answer

We mimic ex:TypLinMapRepByMat, just replacing the numbers with letters.

Write ( B ) as ( {\vec{\beta}_1,\ldots,\vec{\beta}_n} ) and ( D ) as ( {\vec{\delta}_1,\dots,\vec{\delta}_m} ). By definition of representation of a map with respect to bases, the assumption that 
{h}{B,D}
=\begin{pmatrix}
h_{1,1} &\ldots  &h_{1,n}  \\
\vdots  &        &\vdots   \\
h_{m,1} &\ldots  &h_{m,n}
\end{pmatrix}
means that h(\vec{\beta}_i)=h_{i,1}\vec{\delta}_1+\dots+h_{i,n}\vec{\delta}_n. And, by the definition of the representation of a vector with respect to a basis, the assumption that 
{\vec{v}}{B}=\begin{bmatrix}
c_1 \\ \vdots \\ c_n
\end{bmatrix}
means that ( \vec{v}=c_1\vec{\beta}_1+\cdots+c_n\vec{\beta}_n ). Substituting gives Failed to parse (syntax error): h(\vec{v}) =h(c_1\cdot\vec{\beta}_1+\dots+c_n\cdot\vec{\beta}_n) \\ =c_1\cdot h(\vec{\beta}_1)+\dots+c_n\cdot \vec{\beta}_n \\ =c_1\cdot (h_{1,1}\vec{\delta}_1+\dots+h_{m,1}\vec{\delta}_m) +\dots +c_n\cdot (h_{1,n}\vec{\delta}_1+\dots+h_{m,n}\vec{\delta}_m) \\ =(h_{1,1}c_1+\dots+h_{1,n}c_n)\cdot\vec{\delta}_1 +\cdots +(h_{m,1}c_1+\dots+h_{m,n}c_n)\cdot\vec{\delta}_m

and so h(\vec{v}) is represented as required.

This exercise is recommended for all readers.

[edit] Exercise 19

Problem

exam:RepsOfRigidPlaneMaps shows how to represent rotation of all vectors in the plane through an angle ( \theta ) about the origin, with respect to the standard bases.

  1. Rotation of all vectors in three-space through an angle

( \theta ) about the ( x )-axis is a transformation of \Re^3. Represent it with respect to the standard bases. Arrange the rotation so that to someone whose feet are at the origin and whose head is at ( (1,0,0) ), the movement appears clockwise.

  1. Repeat the prior item, only rotate about the ( y )-axis

instead. (Put the person's head at \vec{e}_2.)

  1. Repeat, about the ( z )-axis.
  2. Extend the prior item to ( \Re^4 ).

(Hint: `rotate about the ( z )-axis' can be restated as `rotate parallel to the ( xy )-plane'.)

Answer
  1. The picture is this.
\small

Image:Linear Algebra Book2 ch3.77

The images of the vectors from the domain's basis 
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
0 \\ \cos\theta \\ -\sin\theta
\end{bmatrix}

\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
0 \\ \sin\theta \\ \cos\theta
\end{bmatrix}
are represented with respect to the codomain's basis (again, \stdbasis_3) by themselves, so adjoining the representations to make the matrix gives this. Failed to parse (unknown function\stdbasis): {r_\theta}{\stdbasis_3,\stdbasis_3}= \begin{pmatrix} 1 &0 &0 \\ 0 &\cos\theta &\sin\theta \\ 0 &-\sin\theta &\cos\theta \end{pmatrix}

  1. The picture is similar to the one in the prior answer.

The images of the vectors from the domain's basis 
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
\cos\theta \\ 0 \\ \sin\theta
\end{bmatrix}

\begin{bmatrix}
0 \\ 1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
0 \\ 1 \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
-\sin\theta \\ 0 \\ \cos\theta
\end{bmatrix}
are represented with respect to the codomain's basis \stdbasis_3 by themselves, so this is the matrix. 
\begin{pmatrix}
\cos\theta  &0       &-\sin\theta   \\
0           &1       &0             \\
\sin\theta  &0       &\cos\theta
\end{pmatrix}

  1. To a person standing up, with the vertical z-axis,

a rotation of the xy-plane that is clockwise proceeds from the positive y-axis to the positive x-axis. That is, it rotates opposite to the direction in exam:RepsOfRigidPlaneMaps. The images of the vectors from the domain's basis 
\begin{bmatrix}
1 \\ 0 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
\cos\theta \\ -\sin\theta \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 1 \\ 0
\end{bmatrix}\mapsto\begin{bmatrix}
\sin\theta \\ \cos\theta \\ 0
\end{bmatrix}

\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix}\mapsto\begin{bmatrix}
0 \\ 0 \\ 1
\end{bmatrix}
are represented with respect to \stdbasis_3 by themselves, so the matrix is this. 
\begin{pmatrix}
\cos\theta    &\sin\theta  &0   \\
-\sin\theta   &\cos\theta  &0    \\
0             &0           &1
\end{pmatrix}

\begin{pmatrix} \cos\theta &\sin\theta &0 &0 \\ -\sin\theta &\cos\theta &0 &0 \\ 0 &0 &1 &0 \\ 0 &0 &0 &1

\end{pmatrix}

[edit] Exercise 20

Problem
(Schur's Triangularization Lemma)[Index]%

[Index]

  1. Let ( U ) be a subspace of ( V ) and fix bases

( B_U\subseteq B_V ). What is the relationship between the representation of a vector from ( U ) with respect to ( B_U ) and the representation of that vector (viewed as a member of ( V )) with respect to ( B_V )?

  1. What about maps?
  2. Fix a basis

( B={\vec{\beta}_1,\dots,\vec{\beta}_n} ) for ( V ) and observe that the spans Failed to parse (unknown function\spanof): \spanof{{\zero}}={\zero}\subset\spanof{{\vec{\beta}_1}} \subset\spanof{{\vec{\beta}_1,\vec{\beta}_2}} \subset \cdots \subset\spanof{B}=V

form a strictly increasing chain of subspaces. Show that for any linear map ( \map{h}{V}{W} ) there is a chain ( W_0={\zero}\subseteq W_1\subseteq \dots \subseteq W_m =W ) of subspaces of ( W ) such that Failed to parse (unknown function\spanof): h(\spanof{{\vec{\beta}_1,\dots,\vec{\beta}_i}})\subset W_i

for each ( i ).

  1. Conclude that for every linear map

( \map{h}{V}{W} ) there are bases ( B,D ) so the matrix representing ( h ) with respect to ( B,D ) is upper-triangular

(that is, each entry ( h_{i,j} ) with ( i>j ) is zero).

[edit] Exercise 21

Problem
Is an upper-triangular representation unique?
Answer

Write ( B_U ) as ( {\vec{\beta}_1,\dots,\vec{\beta}_k} ) and then B_V as ( {\vec{\beta}_1,\dots,\vec{\beta}_k, \vec{\beta}_{k+1},\dots,\vec{\beta}_n} ). If Failed to parse (lexing error): {\vec{v}}{B_U}=\begin{bmatrix} c_1 \\ \vdots \\ c_k \end{bmatrix} \text{so that\ } \vec{v}=c_1\cdot\vec{\beta}_1+\cdots+c_k\cdot\vec{\beta}_k

then, 
{\vec{v}}{B_V}=\begin{bmatrix}
c_1 \\ \vdots\\ c_k \\ 0 \\ \vdots \\ 0
\end{bmatrix}
because \vec{v}=c_1\cdot\vec{\beta}_1+\dots+c_k\cdot\vec{\beta}_k +0\cdot\vec{\beta}_{k+1}+\dots+0\cdot\vec{\beta}_n.

We must first decide what the question means. Compare ( \map{h}{V}{W} ) with its restriction to the subspace

( \map{\restrictionmap{h}{U

{U}{W} ).

The rangespace of the restriction is a subspace of ( W ), so fix a basis ( D_{h(U)} ) for this rangespace and extend it to a basis ( D_V ) for ( W ). We want the relationship between these two. Failed to parse (unknown function\restrictionmap): {h}{B_V,D_V} \text{and} {\restrictionmap{h}{U}}{B_U,D_{h(U)}}

The answer falls right out of the prior item:~if Failed to parse (unknown function\restrictionmap): {\restrictionmap{h}{U}}{B_U,D_{h(U)}} =\begin{pmatrix} h_{1,1} &\ldots &h_{1,k} \\ \vdots & &\vdots \\ h_{p,1} &\ldots &h_{p,k} \end{pmatrix}

then the extension is represented in this way. 
{h}{B_V,D_V}
=\begin{pmatrix}
h_{1,1}  &\ldots  &h_{1,k}  &h_{1,k+1}  &\ldots  &h_{1,n}  \\
\vdots   &        &         &           &        &\vdots   \\
h_{p,1}  &\ldots  &h_{p,k}  &h_{p,k+1}  &\ldots  &h_{p,n}  \\
0        &\ldots  &0        &h_{p+1,k+1}&\ldots  &h_{p+1,n}  \\
\vdots   &        &         &           &        &\vdots   \\
0        &\ldots  &0        &h_{m,k+1}  &\ldots  &h_{m,n}
\end{pmatrix}

  1. Take ( W_i ) to be the span of

( {h(\vec{\beta}_1),\dots,h(\vec{\beta}_i)} ).

  1. Apply the answer from the second item to the third item.
  2. No.

For instance ( \map{\pi_x}{\Re^2}{\Re^2} ), projection onto the ( x )~axis, is represented by these two upper-triangular matrices Failed to parse (unknown function\stdbasis): {\pi_x}{\stdbasis_2,\stdbasis_2}= \begin{pmatrix} 1 &0 \\ 0 &0 \end{pmatrix} \text{and} {\pi_x}{C,\stdbasis_2}= \begin{pmatrix} 0 &1 \\ 0 &0 \end{pmatrix}

where ( C={\vec{e}_2,\vec{e}_1} ).


[Index] }}

[edit] References

Personal tools
Create a book
  • Add wiki page
  • Collections help