Let’s return to isomorphisms. Let be vector spaces over a field
. When are
and
isomorphic? When we can find a vector space isomorphism
between them. Well, how do we find such an isomorphism?
In general, this is a rather challenging task. However, the first isomorphism theorem yields us a partial solution. But first, let’s review some ideas in discrete mathematics.
Lemma 1. Let be a surjective function. Define the quotient set
and the (surjective) projection map
by
. Then, there exists a unique bijection
such that
.
The proof of Lemma 1 can furnished by students in discrete mathematics using the notions of equivalence classes and partitions. For our discussion on linear algebra, we will accept this idea and use it to make sense of vector space isomorphisms.
Theorem 1 (First Isomorphism Theorem). Let be a surjective linear transformation. Let
be the canonical bijection in Lemma 1. Then
can be equipped with a vector space structure, called a quotient space, and
becomes an isomorphism. Furthermore, for any
,
Elements of the form are known as cosets. Concisely, if
is a surjective linear transformation, then
.
Proof. Since there exists a bijection from to the vector space
, we can equip
with the vector space structure defined by
and
so that and
.
To describe the elements of , we observe that for each
,
Therefore, we recover the usual definitions of the quotient space and coset arithmetic:
and
The isomorphism theorem, somewhat surprisingly, is the reason behind why we need to put a “” at the end of our integrals. In fact, it is behind a more fundamental process: solving systems of linear equations like
.
Corollary 1. Let be a linear transformation, and suppose for the vector
, there exists a vector
such that
. Then the set of solutions to the equation
is
.
Proof. Using ideas in the isomorphism theorem, the set of solutions is
Corollary 2. Let denote the subspace of continuously differentiable functions on
. Then
.
Proof. Consider the linear transformation defined by
. By the fundamental theorem of calculus,
is surjective. By the first isomorphism theorem,
By the mean value theorem, , so that
Furthermore, implies that the indefinite integral
so that we write
where is an arbitrary constant.
Finally, we can use the first isomorphism theorem to prove the rank-nullity theorem.
Corollary 3. Suppose as a subspace and
is finite-dimensional. Then
is finite-dimensional and
.
Proof. Since is finite-dimensional, so is
. Let
be a basis for
, and extend it to a basis
of
, so that
and
. Define
and the surjective linear transformation
by
It is obvious that , so that the first isomorphism theorem yields
, hence
Corollary 4. Let be a linear transformation, and suppose
is finite-dimensional. Define
and
. Then
Proof. The map is surjective, so the first isomorphism theorem yields
. Taking dimensions,
as required.
—Joel Kindiak, 2 Mar 25, 1529H
Leave a comment