From A First Course in Linear Algebra
Version 2.21
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/
We begin by establishing an invertible linear transformation between any vector space
V of dimension
m and
{ℂ}^{m}. This will
allow us to “go back and forth” between the two vector spaces, no matter how abstract the
definition of V
might be.
Definition VR
Vector Representation
Suppose that V is a vector
space with a basis B = \left \{{v}_{1},\kern 1.95872pt {v}_{2},\kern 1.95872pt {v}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {v}_{n}\right \}.
Define a function {ρ}_{B}: V → {ℂ}^{n} as
follows. For w ∈ V define
the column vector {ρ}_{B}\left (w\right ) ∈ {ℂ}^{n}
by
(This definition contains Notation VR.) △
This definition looks more complicated that it really is, though the form above will be useful in proofs. Simply stated, given w ∈ V , we write w as a linear combination of the basis elements of B. It is key to realize that Theorem VRRB guarantees that we can do this for every w, and furthermore this expression as a linear combination is unique. The resulting scalars are just the entries of the vector {ρ}_{B}\left (w\right ). This discussion should convince you that {ρ}_{B} is “welldefined” as a function. We can determine a precise output for any input. Now we want to establish that {ρ}_{B} is a function with additional properties  it is a linear transformation.
Theorem VRLT
Vector Representation is a Linear Transformation
The function {ρ}_{B}
(Definition VR) is a linear transformation.
□
Proof We will take a novel approach in this proof. We will construct another function, which we will easily determine is a linear transformation, and then show that this second function is really {ρ}_{B} in disguise. Here we go.
Since B is a basis, we can define T : V → {ℂ}^{n} to be the unique linear transformation such that T\left ({v}_{i}\right ) = {e}_{i}, 1 ≤ i ≤ n, as guaranteed by Theorem LTDB, and where the {e}_{i} are the standard unit vectors (Definition SUV). Then suppose for an arbitrary w ∈ V we have,
As column vectors, Definition CVE implies that T\left (w\right ) = {ρ}_{B}\left (w\right ). Since w was an arbitrary element of V , as functions T = {ρ}_{B}. Now, since T is known to be a linear transformation, it must follow that {ρ}_{B} is also a linear transformation. ■
The proof of Theorem VRLT provides an alternate definition of vector representation relative to a basis B that we could state as a corollary (Technique LC): {ρ}_{B} is the unique linear transformation that takes B to the standard unit basis.
Example VRC4
Vector representation in {ℂ}^{4}
Consider the vector y ∈ {ℂ}^{4}
y = \left [\array{
6\cr
14
\cr
6\cr
7 } \right ]

We will find several vector representations of y in this example. Notice that y never changes, but the representations of y do change.
One basis for {ℂ}^{4} is
B = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt {u}_{4}\right \} = \left \{\left [\array{
−2\cr
1
\cr
2\cr
−3 } \right ],\kern 1.95872pt \left [\array{
3\cr
−6
\cr
2\cr
−4 } \right ],\kern 1.95872pt \left [\array{
1\cr
2
\cr
0\cr
5 } \right ],\kern 1.95872pt \left [\array{
4\cr
3
\cr
1\cr
6 } \right ]\right \}

as can be seen by making these vectors the columns of a matrix, checking that the matrix is nonsingular and applying Theorem CNMB. To find {ρ}_{B}\left (y\right ), we need to find scalars, {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3},\kern 1.95872pt {a}_{4} such that
y = {a}_{1}{u}_{1} + {a}_{2}{u}_{2} + {a}_{3}{u}_{3} + {a}_{4}{u}_{4}

By Theorem SLSLC the desired scalars are a solution to the linear system of equations with a coefficient matrix whose columns are the vectors in B and with a vector of constants y. With a nonsingular coefficient matrix, the solution is unique, but this is no surprise as this is the content of Theorem VRRB. This unique solution is
Then by Definition VR, we have
{
ρ}_{B}\left (y\right ) = \left [\array{
2\cr
−1
\cr
−3\cr
4 } \right ]

Suppose now that we construct a representation of y relative to another basis of {ℂ}^{4},
C = \left \{\left [\array{
−15\cr
9
\cr
−4\cr
−2
} \right ],\kern 1.95872pt \left [\array{
16\cr
−14
\cr
5\cr
2 } \right ],\kern 1.95872pt \left [\array{
−26\cr
14
\cr
−6\cr
−3
} \right ],\kern 1.95872pt \left [\array{
14\cr
−13
\cr
4\cr
6 } \right ]\right \}

As with B, it is easy to check that C is a basis. Writing y as a linear combination of the vectors in C leads to solving a system of four equations in the four unknown scalars with a nonsingular coefficient matrix. The unique solution can be expressed as
y = \left [\array{
6\cr
14
\cr
6\cr
7 } \right ] = (−28)\left [\array{
−15\cr
9
\cr
−4\cr
−2
} \right ]+(−8)\left [\array{
16\cr
−14
\cr
5\cr
2 } \right ]+11\left [\array{
−26\cr
14
\cr
−6\cr
−3
} \right ]+0\left [\array{
14\cr
−13
\cr
4\cr
6 } \right ]

so that Definition VR gives
{
ρ}_{C}\left (y\right ) = \left [\array{
−28\cr
−8
\cr
11\cr
0} \right ]

We often perform representations relative to standard bases, but for vectors in {ℂ}^{m} its a little silly. Let’s find the vector representation of y relative to the standard basis (Theorem SUVB),
D = \left \{{e}_{1},\kern 1.95872pt {e}_{2},\kern 1.95872pt {e}_{3},\kern 1.95872pt {e}_{4}\right \}

Then, without any computation, we can check that
y = \left [\array{
6\cr
14
\cr
6\cr
7 } \right ] = 6{e}_{1}+14{e}_{2}+6{e}_{3}+7{e}_{4}

so by Definition VR,
{
ρ}_{D}\left (y\right ) = \left [\array{
6\cr
14
\cr
6\cr
7 } \right ]

which is not very exciting. Notice however that the order in which we place the vectors in the basis is critical to the representation. Let’s keep the standard unit vectors as our basis, but rearrange the order we place them in the basis. So a fourth basis is
E = \left \{{e}_{3},\kern 1.95872pt {e}_{4},\kern 1.95872pt {e}_{2},\kern 1.95872pt {e}_{1}\right \}

Then,
y = \left [\array{
6\cr
14
\cr
6\cr
7 } \right ] = 6{e}_{3}+7{e}_{4}+14{e}_{2}+6{e}_{1}

so by Definition VR,
{
ρ}_{E}\left (y\right ) = \left [\array{
6\cr
7
\cr
14\cr
6 } \right ]

So for every possible basis of {ℂ}^{4} we could construct a different representation of y. ⊠
Vector representations are most interesting for vector spaces that are not {ℂ}^{m}.
Example VRP2
Vector representations in {P}_{2}
Consider the vector u = 15 + 10x − 6{x}^{2} ∈ {P}_{
2}
from the vector space of polynomials with degree at most 2 (Example VSP). A nice
basis for {P}_{2}
is
B = \left \{1,\kern 1.95872pt x,\kern 1.95872pt {x}^{2}\right \}

so that
u = 15 + 10x − 6{x}^{2} = 15(1) + 10(x) + (−6)({x}^{2})

so by Definition VR
{
ρ}_{B}\left (u\right ) = \left [\array{
15\cr
10
\cr
−6 } \right ]

Another nice basis for {P}_{2} is
B = \left \{1,\kern 1.95872pt 1 + x,\kern 1.95872pt 1 + x + {x}^{2}\right \}

so that now it takes a bit of computation to determine the scalars for the representation. We want {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3} so that
15 + 10x − 6{x}^{2} = {a}_{
1}(1) + {a}_{2}(1 + x) + {a}_{3}(1 + x + {x}^{2})

Performing the operations in {P}_{2} on the righthand side, and equating coefficients, gives the three equations in the three unknown scalars,
The coefficient matrix of this sytem is nonsingular, leading to a unique solution (no surprise there, see Theorem VRRB),
so by Definition VR
{
ρ}_{C}\left (u\right ) = \left [\array{
5\cr
16
\cr
−6 } \right ]

While we often form vector representations relative to “nice” bases, nothing prevents us from forming representations relative to “nasty” bases. For example, the set
D = \left \{−2 − x + 3{x}^{2},\kern 1.95872pt 1 − 2{x}^{2},\kern 1.95872pt 5 + 4x + {x}^{2}\right \}

can be verified as a basis of {P}_{2} by checking linear independence with Definition LI and then arguing that 3 vectors from {P}_{2}, a vector space of dimension 3 (Theorem DP), must also be a spanning set (Theorem G). Now we desire scalars {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3} so that
15 + 10x − 6{x}^{2} = {a}_{
1}(−2 − x + 3{x}^{2}) + {a}_{
2}(1 − 2{x}^{2}) + {a}_{
3}(5 + 4x + {x}^{2})

Performing the operations in {P}_{2} on the righthand side, and equating coefficients, gives the three equations in the three unknown scalars,
The coefficient matrix of this sytem is nonsingular, leading to a unique solution (no surprise there, see Theorem VRRB),
so by Definition VR
{
ρ}_{D}\left (u\right ) = \left [\array{
−2\cr
1
\cr
2 } \right ]

Theorem VRI
Vector Representation is Injective
The function {ρ}_{B}
(Definition VR) is an injective linear transformation.
□
Proof We will appeal to Theorem KILT. Suppose U is a vector space of dimension n, so vector representation is of the form {ρ}_{B}: U → {ℂ}^{n}. Let B = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{n}\right \} be the basis of U used in the definition of {ρ}_{B}. Suppose u ∈K\kern 1.95872pt \left ({ρ}_{B}\right ). We write u as a linear combination of the vectors in the basis B where the scalars are the components of the vector representation, {ρ}_{B}\left (u\right ).
Thus an arbitrary vector, u, from the kernel ,K\kern 1.95872pt \left ({ρ}_{B}\right ), must equal the zero vector of U. So K\kern 1.95872pt \left ({ρ}_{B}\right ) = \left \{0\right \} and by Theorem KILT, {ρ}_{B} is injective. ■
Theorem VRS
Vector Representation is Surjective
The function {ρ}_{B}
(Definition VR) is a surjective linear transformation.
□
Proof We will appeal to Theorem RSLT. Suppose U is a vector space of dimension n, so vector representation is of the form {ρ}_{B}: U → {ℂ}^{n}. Let B = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{n}\right \} be the basis of U used in the definition of {ρ}_{B}. Suppose v ∈ {ℂ}^{n}. Define the vector u by
u ={ \left [v\right ]}_{1}{u}_{1} +{ \left [v\right ]}_{2}{u}_{2} +{ \left [v\right ]}_{3}{u}_{3} + \mathrel{⋯} +{ \left [v\right ]}_{n}{u}_{n}

Then for 1 ≤ i ≤ n
so the entries of vectors {ρ}_{B}\left (u\right ) and v are equal and Definition CVE yields the vector equality {ρ}_{B}\left (u\right ) = v. This demonstrates that v ∈ℛ\kern 1.95872pt \left ({ρ}_{B}\right ), so {ℂ}^{n} ⊆ℛ\kern 1.95872pt \left ({ρ}_{ B}\right ). Since ℛ\kern 1.95872pt \left ({ρ}_{B}\right ) ⊆ {ℂ}^{n} by Definition RLT, we have ℛ\kern 1.95872pt \left ({ρ}_{B}\right ) = {ℂ}^{n} and Theorem RSLT says {ρ}_{B} is surjective. ■
We will have many occasions later to employ the inverse of vector representation, so we will record the fact that vector representation is an invertible linear transformation.
Theorem VRILT
Vector Representation is an Invertible Linear Transformation
The function {ρ}_{B}
(Definition VR) is an invertible linear transformation.
□
Proof The function {ρ}_{B} (Definition VR) is a linear transformation (Theorem VRLT) that is injective (Theorem VRI) and surjective (Theorem VRS) with domain V and codomain {ℂ}^{n}. By Theorem ILTIS we then know that {ρ}_{B} is an invertible linear transformation. ■
Informally, we will refer to the application of {ρ}_{B} as coordinatizing a vector, while the application of {ρ}_{B}^{−1} will be referred to as uncoordinatizing a vector.
Limiting our attention to vector spaces with finite dimension, we now describe every possible vector space. All of them. Really.
Theorem CFDVS
Characterization of Finite Dimensional Vector Spaces
Suppose that V is a vector
space with dimension n.
Then V is
isomorphic to {ℂ}^{n}.
□
Proof Since V has dimension n we can find a basis of V of size n (Definition D) which we will call B. The linear transformation {ρ}_{B} is an invertible linear transformation from V to {ℂ}^{n}, so by Definition IVS, we have that V and {ℂ}^{n} are isomorphic. ■
Theorem CFDVS is the first of several surprises in this chapter, though it might be a bit demoralizing too. It says that there really are not all that many different (finite dimensional) vector spaces, and none are really any more complicated than {ℂ}^{n}. Hmmm. The following examples should make this point.
Example TIVS
Two isomorphic vector spaces
The vector space of polynomials with degree 8 or less,
{P}_{8},
has dimension 9 (Theorem DP). By Theorem CFDVS,
{P}_{8} is isomorphic
to {ℂ}^{9}.
⊠
Example CVSR
Crazy vector space revealed
The crazy vector space, C
of Example CVS, has dimension 2 by Example DC. By Theorem CFDVS,
C is isomorphic to
{ℂ}^{2}. Hmmmm. Not really
so crazy after all? ⊠
Example ASC
A subspace characterized
In Example DSP4 we determined that a certain subspace
W of
{P}_{4} has dimension
4. By
Theorem CFDVS, W
is isomorphic to {ℂ}^{4}.
⊠
Theorem IFDVS
Isomorphism of Finite Dimensional Vector Spaces
Suppose U
and V
are both finitedimensional vector spaces. Then
U and
V are isomorphic
if and only if \mathop{ dim}\nolimits \left (U\right ) =\mathop{ dim}\nolimits \left (V \right ).
□
Proof ( ⇒) This is just the statement proved in Theorem IVSED.
( ⇐) This is the advertised converse of Theorem IVSED. We will assume U and V have equal dimension and discover that they are isomorphic vector spaces. Let n be the common dimension of U and V . Then by Theorem CFDVS there are isomorphisms T : U → {ℂ}^{n} and S : V → {ℂ}^{n}.
T is therefore an invertible linear transformation by Definition IVS. Similarly, S is an invertible linear transformation, and so {S}^{−1} is an invertible linear transformation (Theorem IILT). The composition of invertible linear transformations is again invertible (Theorem CIVLT) so the composition of {S}^{−1} with T is invertible. Then \left ({S}^{−1} ∘ T\right ): U → V is an invertible linear transformation from U to V and Definition IVS says U and V are isomorphic. ■
Example MIVS
Multiple isomorphic vector spaces
{ℂ}^{10},
{P}_{9},
{M}_{2,5} and
{M}_{5,2} are
all vector spaces and each has dimension 10. By Theorem IFDVS each is
isomorphic to any other.
The subspace of {M}_{4,4} that contains all the symmetric matrices (Definition SYM) has dimension 10, so this subspace is also isomorphic to each of the four vector spaces above. ⊠
With {ρ}_{B} available as an invertible linear transformation, we can translate between vectors in a vector space U of dimension m and {ℂ}^{m}. Furthermore, as a linear transformation, {ρ}_{B} respects the addition and scalar multiplication in U, while {ρ}_{B}^{−1} respects the addition and scalar multiplication in {ℂ}^{m}. Since our definitions of linear independence, spans, bases and dimension are all built up from linear combinations, we will finally be able to translate fundamental properties between abstract vector spaces (U) and concrete vector spaces ({ℂ}^{m}).
Theorem CLI
Coordinatization and Linear Independence
Suppose that U is a vector
space with a basis B
of size n. Then
S = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{k}\right \} is a linearly independent
subset of U if and
only if R = \left \{{ρ}_{B}\left ({u}_{1}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{2}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {ρ}_{B}\left ({u}_{k}\right )\right \} is a linearly
independent subset of {ℂ}^{n}.
□
Proof The linear transformation {ρ}_{B} is an isomorphism between U and {ℂ}^{n} (Theorem VRILT). As an invertible linear transformation, {ρ}_{B} is an injective linear transformation (Theorem ILTIS), and {ρ}_{B}^{−1} is also an injective linear transformation (Theorem IILT, Theorem ILTIS).
( ⇒) Since {ρ}_{B} is an injective linear transformation and S is linearly independent, Theorem ILTLI says that R is linearly independent.
( ⇐) If we apply {ρ}_{B}^{−1} to each element of R, we will create the set S. Since we are assuming R is linearly independent and {ρ}_{B}^{−1} is injective, Theorem ILTLI says that S is linearly independent. ■
Theorem CSS
Coordinatization and Spanning Sets
Suppose that U is a vector
space with a basis B
of size n.
Then u ∈\left \langle \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{k}\right \}\right \rangle if and
only if {ρ}_{B}\left (u\right ) ∈\left \langle \left \{{ρ}_{B}\left ({u}_{1}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{2}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {ρ}_{B}\left ({u}_{k}\right )\right \}\right \rangle .
□
Proof ( ⇒) Suppose u ∈\left \langle \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{k}\right \}\right \rangle . Then there are scalars, {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {a}_{k}, such that
u = {a}_{1}{u}_{1} + {a}_{2}{u}_{2} + {a}_{3}{u}_{3} + \mathrel{⋯} + {a}_{k}{u}_{k}

Then,
which says that {ρ}_{B}\left (u\right ) ∈\left \langle \left \{{ρ}_{B}\left ({u}_{1}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{2}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {ρ}_{B}\left ({u}_{k}\right )\right \}\right \rangle .
( ⇐) Suppose that {ρ}_{B}\left (u\right ) ∈\left \langle \left \{{ρ}_{B}\left ({u}_{1}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{2}\right ),\kern 1.95872pt {ρ}_{B}\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {ρ}_{B}\left ({u}_{k}\right )\right \}\right \rangle . Then there are scalars {b}_{1},\kern 1.95872pt {b}_{2},\kern 1.95872pt {b}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {b}_{k} such that
{ρ}_{B}\left (u\right ) = {b}_{1}{ρ}_{B}\left ({u}_{1}\right ) + {b}_{2}{ρ}_{B}\left ({u}_{2}\right ) + {b}_{3}{ρ}_{B}\left ({u}_{3}\right ) + \mathrel{⋯} + {b}_{k}{ρ}_{B}\left ({u}_{k}\right )

Recall that {ρ}_{B} is invertible (Theorem VRILT), so
which says that u ∈\left \langle \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{k}\right \}\right \rangle . ■
Here’s a fairly simple example that illustrates a very, very important idea.
Example CP2
Coordinatizing in {P}_{2}
In Example VRP2 we needed to know that
D = \left \{−2 − x + 3{x}^{2},\kern 1.95872pt 1 − 2{x}^{2},\kern 1.95872pt 5 + 4x + {x}^{2}\right \}

is a basis for {P}_{2}. With Theorem CLI and Theorem CSS this task is much easier. First, choose a known basis for {P}_{2}, a basis that forms vector representations easily. We will choose
B = \left \{1,\kern 1.95872pt x,\kern 1.95872pt {x}^{2}\right \}

Now, form the subset of {ℂ}^{3} that is the result of applying {ρ}_{B} to each element of D,
F = \left \{{ρ}_{B}\left (−2 − x + 3{x}^{2}\right ),\kern 1.95872pt {ρ}_{
B}\left (1 − 2{x}^{2}\right ),\kern 1.95872pt {ρ}_{
B}\left (5 + 4x + {x}^{2}\right )\right \} = \left \{\left [\array{
−2\cr
−1
\cr
3 } \right ],\kern 1.95872pt \left [\array{
1\cr
0
\cr
−2 } \right ],\kern 1.95872pt \left [\array{
5\cr
4
\cr
1 } \right ]\right \}

and ask if F is a linearly independent spanning set for {ℂ}^{3}. This is easily seen to be the case by forming a matrix A whose columns are the vectors of F, rowreducing A to the identity matrix {I}_{3}, and then using the nonsingularity of A to assert that F is a basis for {ℂ}^{3} (Theorem CNMB). Now, since F is a basis for {ℂ}^{3}, Theorem CLI and Theorem CSS tell us that D is also a basis for {P}_{2}. ⊠
Example CP2 illustrates the broad notion that computations in abstract vector spaces can be reduced to computations in {ℂ}^{m}. You may have noticed this phenomenon as you worked through examples in Chapter VS or Chapter LT employing vector spaces of matrices or polynomials. These computations seemed to invariably result in systems of equations or the like from Chapter SLE, Chapter V and Chapter M. It is vector representation, {ρ}_{B}, that allows us to make this connection formal and precise.
Knowing that vector representation allows us to translate questions about linear combinations, linear independence and spans from general vector spaces to {ℂ}^{m} allows us to prove a great many theorems about how to translate other properties. Rather than prove these theorems, each of the same style as the other, we will offer some general guidance about how to best employ Theorem VRLT, Theorem CLI and Theorem CSS. This comes in the form of a “principle”: a basic truth, but most definitely not a theorem (hence, no proof).
The Coordinatization Principle Suppose that U is a vector space with a basis B of size n. Then any question about U, or its elements, which ultimately depends on the vector addition or scalar multiplication in U, or depends on linear independence or spanning, may be translated into the same question in {ℂ}^{n} by application of the linear transformation {ρ}_{B} to the relevant vectors. Once the question is answered in {ℂ}^{n}, the answer may be translated back to U (if necessary) through application of the inverse linear transformation {ρ}_{B}^{−1}.
Example CM32
Coordinatization in {M}_{32}
This is a simple example of the Coordinatization Principle, depending
only on the fact that coordinatizing is an invertible linear transformation
(Theorem VRILT). Suppose we have a linear combination to perform in
{M}_{32}, the vector
space of 3 × 2
matrices, but we are adverse to doing the operations of
{M}_{32}
(Definition MA, Definition MSM). More specifically, suppose we are faced with
the computation
6\left [\array{
3 & 7\cr
−2 & 4
\cr
0 &−3 } \right ]+2\left [\array{
−1&3\cr
4 &8
\cr
−2&5 } \right ]

We choose a nice basis for {M}_{32} (or a nasty basis if we are so inclined),
B = \left \{\left [\array{
1&0\cr
0&0
\cr
0&0 } \right ],\kern 1.95872pt \left [\array{
0&0\cr
1&0
\cr
0&0 } \right ],\kern 1.95872pt \left [\array{
0&0\cr
0&0
\cr
1&0 } \right ],\kern 1.95872pt \left [\array{
0&1\cr
0&0
\cr
0&0 } \right ],\kern 1.95872pt \left [\array{
0&0\cr
0&1
\cr
0&0 } \right ],\kern 1.95872pt \left [\array{
0&0\cr
0&0
\cr
0&1 } \right ]\right \}

and apply {ρ}_{B} to each vector in the linear combination. This gives us a new computation, now in the vector space {ℂ}^{6},
6\left [\array{
3\cr
−2
\cr
0\cr
7
\cr
4\cr
−3 } \right ]+2\left [\array{
−1\cr
4
\cr
−2\cr
3
\cr
8\cr
5 } \right ]

which we can compute with the operations of {ℂ}^{6} (Definition CVA, Definition CVSM), to arrive at
\left [\array{
16\cr
−4
\cr
−4\cr
48
\cr
40\cr
−8 } \right ]

We are after the result of a computation in {M}_{32}, so we now can apply {ρ}_{B}^{−1} to obtain a 3 × 2 matrix,
16\left [\array{
1&0\cr
0&0
\cr
0&0 } \right ]+(−4)\left [\array{
0&0\cr
1&0
\cr
0&0 } \right ]+(−4)\left [\array{
0&0\cr
0&0
\cr
1&0 } \right ]+48\left [\array{
0&1\cr
0&0
\cr
0&0 } \right ]+40\left [\array{
0&0\cr
0&1
\cr
0&0 } \right ]+(−8)\left [\array{
0&0\cr
0&0
\cr
0&1 } \right ] = \left [\array{
16&48\cr
−4 & 40
\cr
−4&−8 } \right ]

which is exactly the matrix we would have computed had we just performed the matrix operations in the first place. So this was not meant to be an easier way to compute a linear combination of two matrices, just a different way. ⊠
B = \left \{\left [\array{
1\cr
2
\cr
−1} \right ],\kern 1.95872pt \left [\array{
3\cr
−1
\cr
2} \right ],\kern 1.95872pt \left [\array{
1\cr
1
\cr
1} \right ]\right \}

Compute {ρ}_{B}\left (\left [\array{ 5\cr 8 \cr −1} \right ]\right ).
C10 In the vector space {ℂ}^{3}, compute the vector representation {ρ}_{B}\left (v\right ) for the basis B and vector v below.
Contributed by Robert Beezer Solution [1664]
C20 Rework Example CM32 replacing the basis B by the basis
C = \left \{\left [\array{
−14&−9\cr
10 & 10
\cr
−6 &−2 } \right ],\kern 1.95872pt \left [\array{
−7&−4\cr
5 & 5
\cr
−3&−1 } \right ],\kern 1.95872pt \left [\array{
−3&−1\cr
0 &−2
\cr
1 & 1 } \right ],\kern 1.95872pt \left [\array{
−7&−4\cr
3 & 2
\cr
−1& 0 } \right ],\kern 1.95872pt \left [\array{
4 & 2\cr
−3 &−3
\cr
2 & 1 } \right ],\kern 1.95872pt \left [\array{
0 & 0\cr
−1 &−2
\cr
1 & 1 } \right ]\right \}

Contributed by Robert Beezer Solution [1665]
M10 Prove that the set S below is a basis for the vector space of 2 × 2 matrices, {M}_{22}. Do this choosing a natural basis for {M}_{22} and coordinatizing the elements of S with respect to this basis. Examine the resulting set of column vectors from {ℂ}^{4} and apply the Coordinatization Principle.
S = \left \{\left [\array{
33&99\cr
78 &−9 } \right ],\kern 1.95872pt \left [\array{
−16&−47\cr
−36 & 2 } \right ],\kern 1.95872pt \left [\array{
10&27\cr
17 & 3 } \right ],\kern 1.95872pt \left [\array{
−2&−7\cr
−6 & 4 } \right ]\right \}

Contributed by Andy Zimmer
C10 Contributed by Robert Beezer Statement [1662]
We need to express the vector v
as a linear combination of the vectors in
B.
Theorem VRRB tells us we will be able to do this, and do it uniquely. The vector
equation
{
a}_{1}\left [\array{
2\cr
−2
\cr
2 } \right ]+{a}_{2}\left [\array{
1\cr
3
\cr
1 } \right ]+{a}_{3}\left [\array{
3\cr
5
\cr
2 } \right ] = \left [\array{
11\cr
5
\cr
8 } \right ]

becomes (via Theorem SLSLC) a system of linear equations with augmented matrix,
\left [\array{
2 &1&3&11\cr
−2 &3 &5 & 5
\cr
2 &1&2& 8 } \right ]

This system has the unique solution {a}_{1} = 2, {a}_{2} = −2, {a}_{3} = 3. So by Definition VR,
{
ρ}_{B}\left (v\right ) = {ρ}_{B}\left (\left [\array{
11\cr
5
\cr
8 } \right ]\right ) = {ρ}_{B}\left (2\left [\array{
2\cr
−2
\cr
2 } \right ] + (−2)\left [\array{
1\cr
3
\cr
1 } \right ] + 3\left [\array{
3\cr
5
\cr
2 } \right ]\right ) = \left [\array{
2\cr
−2
\cr
3 } \right ]

C20 Contributed by Robert Beezer Statement [1662]
The following computations replicate the computations given in Example CM32, only using
the basis C.