Vector Space Isomorphism

S. F. Ellermeyer
Our goal here is to explain why two nitedimensional vector spaces,
V and W , are isomorphic to each other if and only if they have the same
dimension. In the process, we will also discuss the concept of an equivalence
relation. This concept is important throughout mathematics.

What is an Equivalence Relation?

If X is some nonempty set of objects, then we can partition X into equivalence classes based on some criteria of our choosing. When we say that
we are going to partition X, we mean that we are going to create disjoint
subdivisions of X whose union gives us all of X. In the Venn diagram shown
below, the big set X has been partitioned into three subsets, A; B; and C.
In this diagram, we have A \ B = ;; B \ C = ;; and A \ C = ; and we also
have X = A [ B [ C. Thus X is the disjoint union of the subsets A; B; and
C.

Here is an example of an equivalence relation: Suppose that X is a group

of six students (Ann, Bob, Carrie, Doug, Evan, Frank) whose attributes are
given in the table below.
Name Gender
Year
Major
Eye Color
Ann
Female
Senior
Computer Science
Blue
Bob
Male
Senior
Mathematics
Green
Carrie Female Sophomore
Biology
Blue
Doug
Male
Junior
Chemistry
Blue
Evan
Male Sophomore Computer Science
Blue
Frank
Male
Junior
Computer Science
Hazel
We can partition X into a disjoint union of subsets (equivalence classes)
by saying that any two students in the set will be considered to be equivalent to each other if they have the same gender. If we denote the gender
equivalence relation by the symbol , then
Ann

Carrie

Doug

Evan

and
Bob

Frank.

This equivalence relation partitions the set X into two disjoint subsets, which
we might choose to call F and M , as shown in the following Venn diagram.

Note that F \ M = ; and that X = F [ M .

Another way to partition this group of students would be according to
eye color. In this case, assuming that this equivalence relation is denoted by
the symbol , we have
2

Ann

Carrie

Doug

Evan

and Bob is an equivalence class by himself and Frank is in an equivalence

class by himself. A Venn diagram of this equivalence relation is shown below.

In this case we have B \ G = ;; B \ H = ;; and G \ H = ;, and we also

have X = B [ G [ H.
In general, dening an equivalence relation, , on a given set, X, requires
that we choose some criterion for which the following three conditions are
satised:
1.

must be reexive. This means that x

x for all x 2 X.

2.

must be symmetric. This means that if x

true that y x.

3.

must be transitive. This means that if x

y, then it must also be

y and y

z, then x

z.

Thus an equivalence relation is a relation which is reexive, symmetric,

and transitive. We will now present some examples of equivalence relations
that are more mathematicalin nature than the examples given above.

1.1

Example: RowEquivalence of Matrices

Let X be the set of all 2 2 matrices with real entries. We will dene
A B to mean that B can be obtained from A by performing a sequence of
elementary row operations. To verify that
is an equivalence relation, we
must verify that is reexive, symmetric, and transitive.
3

1. To see that
is reexive, let A be any 2 2 matrix. By performing
the row operation 1 R1 ! R1 on A, we end up with A itself. Thus
A A.
2. To see that
is reexive, suppose that A
B. This means that B
can be obtained from A by performing a sequence of elementary row
operations. However, since all elementary row operations are reversible
(meaning that they all can be undone), then A can also be obtained
from B by performing a sequence of elementary row operations. Therefore B A.
3. To see that
is transitive, suppose that A
B and B
C. This
means that B can be obtained from A by performing a sequence of
elementary row operations and that C can be obtained from B by
performing a sequence of elementary row operations. But then clearly
C can be obtained from A by performing a sequence of elementary row
operations. Therefore A C.

1.2

Example: Equivalence of Integers Via Residues

Let Z be the set of all integers and dene x y to mean that x and y have
the same remainder when divided by 3. (Note that we are using the symbol
rather than the symbol
do denote this relation.) As an example to
illustrate what we are doing here, notice that when we divide 16 by 3, the
remainder is 1, and when we divide 58 by 3, the remainder is also 1. Thus
16 58. Let us now show that is reexive symmetric, and transitive (and
hence that is an equivalence relation).
1. It is obvious that is reexive because if x is any integer, then x and
x have the same remainder when divided by 3.
2. It is also obvious that is symmetric because if x and y have the same
remainder when divided by 3, then y and x have the same remainder
when divided by 3.
3. Transitivity is also obvious: If x and y have the same remainder when
divided by 3 and y and z have the same remainder when divided by 3,
then x and z have the same remainder when divided by 3.

Note that gives rise to exactly three equivalence classes. One of these
is the set of integers that have remainder 0 when divided by 3; the other is
the set of integers that have remainder 1 when divided by 3, and the third
is the set of integers that have remainder 2 when divided by 3:
9

10

11

The above three equivalence classes are usually denoted, respectively, by 0; 1;

and 2. These three subsets are then usually referred to as the integers modulo
3. Note that the sets 0; 1; and 2 are pairwise disjoint and that Z = 0 [ 1 [ 2.
Thus these three sets form a partition of Z. Further study of the integers
modulo n (where n is some given integer) is usually encountered in a course
in Abstract Algebra (also called Modern Algebra). The integers modulo n
are also often referred to as the ring of residues modulo n.

1.3

Example: An Equivalence Relation From Calculus

Let X be the set of all continuous functions with domain [0; 1]. Recall from
Calculus that all such functions, f , are integrable. This means that
Z 1
f (x) dx
0

is guaranteed to exist (and be equal to some real number).

We can dene an equivalence relation, , on X by saying that f
Z 1
Z 1
f (x) dx =
g (x) dx.
0

g if

For example, if f is the function f (x) = x2 and g is the function g (x) = 23 x,

then f g. (Verify this for yourself.)
It is not di cult to see that is reexive, symmetric, and transitive and
hence that
is an equivalence relation. Certainly,
determines innitely
many equivalence classes (one corresponding to each real number).

1.4

Example: A Relation That is Not an Equivalence

Relation

Let Z be the set of all integers and consider the wellknown relation .
When we write x y, we mean that the number x is less than or equal to
the number y. Why is not an equivalence relation on Z? It does satisfy
two of the three requirements of an equivalence relation. Which one does it
not satisfy?

Equivalence of Vector Spaces Via Isomorphism

Now that we have introduced the concept of equivalence relations, we will

embark on our main agenda which is to show that isomorphism is an equivalence relation on the set of all vector spaces. Recall that if V and W are
vector spaces and T : V ! W is a linear transformation that is both one
toone and onto W , then T is called an isomorphism. Also recall that if V
and W are vector spaces and there exists an isomorphism T : V ! W , then
we say that V is isomorphic to W .
With the above denitions in mind, let us take X to be the set of all
vector spaces and let us dene V
W to mean that V is isomorphic to W .
We are going to prove that
is an equivalence relation on X. The details
needed to prove this fact will be established via three lemmas.
Lemma 1 Let V be any vector space and dene I : V ! V by I (v) =
v for all v 2 V . Then I is an isomorphism (which is called the identity
transformation).
Proof. We want to prove that I is an isomorphism (meaning that I is a
linear transformation that is both onetoone and onto V ).
To see that I is a linear transformation, let u and v 2 V . Then
I (u + v) = u + v = I (u) + I (v) .
Next let u 2 V and let c be a scalar. Then
I (cu) = cu = cI (u) .
This shows that I is a linear transformation.
6

To see that I maps V onto V , let v be any vector in V . Since I (v) = v,

then v is in the range of I. Thus every vector in V is in the range of I which
means that I maps V onto V .
To see that I is onetoone, let u and v be any two vectors in V with
I (u) = I (v). Since I (u) = u and I (v) = v, then u = v. Thus any two
dierent vectors in V are mapped by I to dierent vectors in V . This shows
that I is onetoone and completes the proof that I is an isomorphism.
Before giving our next lemma, we must dene the concept of the inverse
of a linear transformation.
Denition 2 Suppose that T : V ! W is an isomorphism. The inverse of
T is dened to be the mapping T 1 : W ! V dened by T 1 (w) = v where
v is the unique vector in V such that T (v) = w.
Remark 3 We know that v, as given in the above denition, is unique because T is onetoone. In addition, we know that such a v exists for each
given w 2 W because T maps V onto W . Thus the mapping T 1 is well
dened and has domain W .
Remark 4 Observe that if v is any vector in V , then T 1 (T (v)) = v. Also
observe that if w is any vector in W , then T (T 1 (w)) = w.
Lemma 5 If V and W are vector spaces and T : V ! W is an isomorphism,
then T 1 : W ! V is also an isomorphism.
Proof. To see that T 1 is a linear transformation, let w1 and w2 be vectors
in W . Then T 1 (w1 ) = v1 where v1 is the unique vector in V such that
T (v1 ) = w1 and T 1 (w2 ) = v2 where v2 is the unique vector in V such that
T (v2 ) = w2 . Also, since T is a linear transformation, then
T (v1 + v2 ) = T (v1 ) + T (v2 ) = w1 + w2
and since T is onetoone, then it must be the case that v1 + v2 is the
only vector in V that is mapped by T to the vector w1 + w2 . Thus
T 1 (w1 + w2 ) = v1 + v2 (by denition of T 1 ). We now see that
T

(w1 + w2 ) = v1 + v2 = T

(w1 ) + T

(w2 ) .

Next let w be a vector in W and let c be a scalar. Then T 1 (w) = v where

v is the unique vector in V such that T (v) = w. Also, since T is a linear
transformation, then
T (cv) = cT (v) = cw
7

and since T is onetoone, then cv is the only vector in V such that is mapped
by T onto the vector cw. Therefore T 1 (cw) = cv and we now observe that
T

(cw) = cv = cT

(w) .

This completes the proof that T 1 is a linear transformation.

To see that T 1 maps W onto V , let v be any vector in V and suppose
that T (v) = w. Then T 1 (w) = v which means that v is in the range of
T 1 . Therefore T 1 maps W onto V .
To see that T 1 is onetoone, let w1 and w2 be two vectors in W and
suppose that T 1 (w1 ) = T 1 (w2 ). (We need to show that w1 = w2 .) Since
T is a linear transformation, then
T (0V ) = T T

(w1 )

(w2 ) = T T

(w1 )

T T

(w2 ) = w1 w2 .

However, since T is a linear transformation, then it also must be true that

T (0V ) = 0W .
Since T is onetoone, we conclude that w1 w2 = 0W and hence that
w1 = w2 . This completes the proof that T 1 is onetoone.
Before stating our third lemma, we recall the meaning of the composition
of two functions.
Denition 6 Suppose that V , W , and Y are vector spaces and suppose that
T : V ! W and that S : W ! Y . The composition, S T , is the mapping
S T : V ! Y dened by
S

T (v) = S (T (v)) for all v 2 V .

Lemma 7 Suppose that V , W , and Y are vector spaces and suppose that
T : V ! W and S : W ! Y are both isomorphisms. Then S T : V ! Y is
also an isomorphism.
Proof. To see that S T is a linear transformation, let u and v be vectors
in V . Since S and T are both linear transformations, we see that
S

T (u + v) = S (T (u + v))
= S (T (u) + T (v))
= S (T (u)) + S (T (v))
= S T (u) + S T (v) .
8

In addition, if u is a vector in V and c is a scalar, then

S

T (cu) = S (T (cu))
= S (cT (u))
= cS (T (u))
= cS T (u)

showing that S T is a linear transformation.

To see that S T maps V onto Y , let y be any vector in Y . Since S
maps W onto Y , then there is some vector w 2 W such that S (w) = y. In
addition, since T maps V onto W , then there is some vector v 2 V such that
T (v) = w. Thus we have that
S

T (v) = S (T (v)) = S (w) = y

and this shows that y is in the range of S T . Therefore S T maps V onto

Y.
To see that S T is onetoone, let v1 and v2 be vectors in V and
suppose that S T (v1 ) = S T (v2 ). Then S (T (v1 )) = S (T (v2 )). Since
S is onetoone, it must then be true that T (v1 ) = T (v2 ). However, T is
also onetoone, so it must be true that v1 = v2 . This shows that S T is
onetoone and completes our proof that S T is an isomorphism.
We now combine Lemmas 1, 5, and 7 to obtain the following main result.
Theorem 8 Let X be the set of all vector spaces and dene the relation
on X by
V
W if and only if V is isomorphic to W .
Then

is an equivalence relation on X.

Proof. We must show that

is reexive, symmetric, and transitive.

1. Let V be any vector space. By Lemma 1, the identity transformation,

I : V ! V is an isomorphism. Thus V
V . This shows that
is
reexive.
2. Let V and W be vector spaces and suppose that V
W . Then there
1
exists an isomorphism T : V ! W . By Lemma 5, T : W ! V is also
an isomorphism. Thus W V . This shows that is symmetric.
9

3. Let V , W , and Y be vector spaces and suppose that V

W and
W
Y . Then there exists an isomorphism T : V ! W and there
also exists an isomorphism S : W ! Y . By Lemma 7, the composition
S T : V ! Y is also an isomorphism. Therefore V
Y . This shows
that is transitive.

Equivalence of FiniteDimensional Vector

Spaces

Theorem 8 applies to the set of all vector spaces. The theorem tells us that
the set of all vector spaces can be decomposed into equivalence classes that
consist of vector spaces that are isomorphic to each other. There is a simpler
equivalent criterion by which to obtain this decomposition for the set of all
nitedimensional vector spaces.
Theorem 9 Two nitedimensional vector spaces, V and W , are isomorphic to each other if and only if they have the same dimension.
Proof. Suppose that dim (V ) = dim (W ) = n. Then V has a basis
B = fv1 ; v2 ; : : : ; vn g
and W has a basis
C = fw1 ; w2 ; : : : ; wn g .
To show that V must be isomorphic to W , we dene T : V ! W as follows:
For any v 2 V , there exist unique scalars a1 ; a2 ; : : : ; an such that
v = a1 v1 + a2 v2 +

+ an vn .

We dene
T (v) = a1 w1 + a2 w2 +

+ an wn .

It can be seen that T is a linear transformation that is both onetoone and

onto W . Thus V is isomorphic to W .
Now, to prove the converse statement, suppose that V is isomorphic to
W and suppose that dim (V ) = n. Then there exists an isomorphism T :
10

V ! W and there also exists a basis, B = fv1 ; v2 ; : : : ; vn g, for V . We claim

that C = fT (v1 ) ; T (v2 ) ; : : : ; T (vn )g is a basis for W .
To prove that C is linearly independent, consider the equation
+ cn T (vn ) = 0W .

c1 T (v1 ) + c2 T (v2 ) +

Since T is a linear transformation, this equation is equivalent to

T (c1 v1 + c2 v2 +

+ cn vn ) = 0W .

Because T (0V ) = 0W and because T is onetoone, it must be the case that

+ cn vn = 0V .

c1 v1 + c2 v2 +

Because B is linearly independent, it must then be the case that c1 = c2 =

= cn = 0. This shows that C is linearly independent.
To prove that C spans W , let w 2 W . Since T maps V onto W , there
exists a vector v 2 V such that T (v) = w. Also, since B is a basis for V
(and hence spans V ) then there are scalars, a1 ; a2 ; : : : ; an ; such that
v = a1 v1 + a2 v2 +

+ an vn .

Now observe that

w = T (v) = a1 T (v1 ) + a2 T (v2 ) +

+ an T (vn )

which shows that w 2 Span(C). This proves that W = Span(C).

Since W has a basis containing exactly n vectors, then dim (W ) = n.
Therefore dim (V ) = dim (W ).

11