From A First Course in Linear Algebra
Version 2.00
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/
In this section we will conclude our introduction to linear transformations by
bringing together the twin properties of injectivity and surjectivity and consider
linear transformations with both of these properties.
One preliminary definition, and then we will have our main definition for this section.
Definition IDLT
Identity Linear Transformation
The identity linear transformation on the vector space
W is
defined as
{I}_{W }: W\mathrel{↦}W,\quad \quad {I}_{W }\left (w\right ) = w

Informally, {I}_{W } is the “donothing” function. You should check that {I}_{W } is really a linear transformation, as claimed, and then compute its kernel and range to see that it is both injective and surjective. All of these facts should be straightforward to verify (Exercise IVLT.T05). With this in hand we can make our main definition.
Definition IVLT
Invertible Linear Transformations
Suppose that T : U\mathrel{↦}V
is a linear transformation. If there is a function
S : V \mathrel{↦}U such
that
then T is invertible. In this case, we call S the inverse of T and write S = {T}^{−1}. △
Informally, a linear transformation T is invertible if there is a companion linear transformation, S, which “undoes” the action of T. When the two linear transformations are applied consecutively (composition), in either order, the result is to have no real effect. It is entirely analogous to squaring a positive number and then taking its (positive) square root.
Here is an example of a linear transformation that is invertible. As usual at the beginning of a section, do not be concerned with where S came from, just understand how it illustrates Definition IVLT.
Example AIVLT
An invertible linear transformation
Archetype V is the linear transformation
T : {P}_{3}\mathrel{↦}{M}_{22},\quad T\left (a + bx + c{x}^{2} + d{x}^{3}\right ) = \left [\array{
a + b&a − 2c
\cr
d & b − d } \right ]

Define the function S : {M}_{22}\mathrel{↦}{P}_{3} defined by
S\left (\left [\array{
a&b
\cr
c&d } \right ]\right ) = (a−c−d)+(c+d)x+{1\over
2}(a−b−c−d){x}^{2}+c{x}^{3}

Then
For now, understand why these computations show that T is invertible, and that S = {T}^{−1}. Maybe even be amazed by how S works so perfectly in concert with T! We will see later just how to arrive at the correct form of S (when it is possible). ⊠
It can be as instructive to study a linear transformation that is not invertible.
Example ANILT
A noninvertible linear transformation
Consider the linear transformation T : {ℂ}^{3}\mathrel{↦}{M}_{
22}
defined by
T\left (\left [\array{
a
\cr
b
\cr
c } \right ]\right ) = \left [\array{
a − b & 2a + 2b + c
\cr
3a + b + c&−2a − 6b − 2c } \right ]

Suppose we were to search for an inverse function S : {M}_{22}\mathrel{↦}{ℂ}^{3}.
First verify that the 2 × 2 matrix A = \left [\array{ 5&3 \cr 8&2 } \right ] is not in the range of T. This will amount to finding an input to T, \left [\array{ a \cr b \cr c } \right ], such that
As this system of equations is inconsistent, there is no input column vector, and A∉ℛ\kern 1.95872pt \left (T\right ). How should we define S\left (A\right )? Note that
T\left (S\left (A\right )\right ) = \left (T ∘ S\right )\left (A\right ) = {I}_{{M}_{22}}\left (A\right ) = A

So any definition we would provide for S\left (A\right ) must then be a column vector that T sends to A and we would have A ∈ℛ\kern 1.95872pt \left (T\right ), contrary to the definition of T. This is enough to see that there is no function S that will allow us to conclude that T is invertible, since we cannot provide a consistent definition for S\left (A\right ) if we assume T is invertible.
Even though we now know that T is not invertible, let’s not leave this example just yet. Check that
How would we define S\left (B\right )?
Which definition should we provide for S\left (B\right )? Both are necessary. But then S is not a function. So we have a second reason to know that there is no function S that will allow us to conclude that T is invertible. It happens that there are infinitely many column vectors that S would have to take to B. Construct the kernel of T,
K\kern 1.95872pt \left (T\right ) = \left \langle \left \{\left [\array{
−1
\cr
−1
\cr
4 } \right ]\right \}\right \rangle

Now choose either of the two inputs used above for T and add to it a scalar multiple of the basis vector for the kernel of T. For example,
x = \left [\array{
1
\cr
−2
\cr
4 } \right ]+(−2)\left [\array{
−1
\cr
−1
\cr
4 } \right ] = \left [\array{
3
\cr
0
\cr
−4 } \right ]

then verify that T\left (x\right ) = B. Practice creating a few more inputs for T that would be sent to B, and see why it is hopeless to think that we could ever provide a reasonable definition for S\left (B\right )! There is a “whole subspace’s worth” of values that S\left (B\right ) would have to take on. ⊠
In Example ANILT you may have noticed that T is not surjective, since the matrix A was not in the range of T. And T is not injective since there are two different input column vectors that T sends to the matrix B. Linear transformations T that are not surjective lead to putative inverse functions S that are undefined on inputs outside of the range of T. Linear transformations T that are not injective lead to putative inverse functions S that are multiplydefined on each of their inputs. We will formalize these ideas in Theorem ILTIS.
But first notice in Definition IVLT that we only require the inverse (when it exists) to be a function. When it does exist, it too is a linear transformation.
Theorem ILTLT
Inverse of a Linear Transformation is a Linear Transformation
Suppose that T : U\mathrel{↦}V
is an invertible linear transformation. Then the function
{T}^{−1}: V \mathrel{↦}U is a linear
transformation. □
Proof We work through verifying Definition LT for {T}^{−1}, using the fact that T is a linear transformation to obtain the second equality in each half of the proof. To this end, suppose x,\kern 1.95872pt y ∈ V and α ∈ {ℂ}^{}.
}
So {T}^{−1} fulfills the requirements of Definition LT and is therefore a linear transformation. So when T has an inverse, {T}^{−1} is also a linear transformation. Additionally, {T}^{−1} is invertible and its inverse is what you might expect.
Theorem IILT
Inverse of an Invertible Linear Transformation
Suppose that T : U\mathrel{↦}V
is an invertible linear transformation. Then
{T}^{−1} is an invertible linear
transformation and {\left ({T}^{−1}\right )}^{−1} = T.
□
Proof Because T is invertible, Definition IVLT tells us there is a function {T}^{−1}: V \mathrel{↦}U such that
Additionally, Theorem ILTLT tells us that {T}^{−1} is more than just a function, it is a linear transformation. Now view these two statements as properties of the linear transformation {T}^{−1}. In light of Definition IVLT, they together say that {T}^{−1} is invertible (let T play the role of S in the statement of the definition). Furthermore, the inverse of {T}^{−1} is then T, i.e. {\left ({T}^{−1}\right )}^{−1} = T. ■
We now know what an inverse linear transformation is, but just which linear transformations have inverses? Here is a theorem we have been preparing for all chapter long.
Theorem ILTIS
Invertible Linear Transformations are Injective and Surjective
Suppose T : U\mathrel{↦}V is a linear
transformation. Then T is
invertible if and only if T is
injective and surjective. □
Proof ( ⇒) Since T is presumed invertible, we can employ its inverse, {T}^{−1} (Definition IVLT). To see that T is injective, suppose x,\kern 1.95872pt y ∈ U and assume that T\left (x\right ) = T\left (y\right ),
}
So there is an element from U, when used as an input to T (namely {T}^{−1}\left (v\right )) that produces the desired output, v, and hence T is surjective by Definition SLT.
( ⇐) Now assume that T is both injective and surjective. We will build a function S : V \mathrel{↦}U that will establish that T is invertible. To this end, choose any v ∈ V . Since T is surjective, Theorem RSLT says ℛ\kern 1.95872pt \left (T\right ) = V , so we have v ∈ℛ\kern 1.95872pt \left (T\right ). Theorem RPI says that the preimage of v, {T}^{−1}\left (v\right ), is nonempty. So we can choose a vector from the preimage of v, say u. In other words, there exists u ∈ {T}^{−1}\left (v\right ).
Since {T}^{−1}\left (v\right ) is nonempty, Theorem KPI then says that
{T}^{−1}\left (v\right ) = \left \{\left .u + z\kern 1.95872pt \right \vert \kern 1.95872pt z ∈K\kern 1.95872pt \left (T\right )\right \}

However, because T is injective, by Theorem KILT the kernel is trivial, K\kern 1.95872pt \left (T\right ) = \left \{0\right \}. So the preimage is a set with just one element, {T}^{−1}\left (v\right ) = \left \{u\right \}. Now we can define S by S\left (v\right ) = u. This is the key to this half of this proof. Normally the preimage of a vector from the codomain might be an empty set, or an infinite set. But surjectivity requires that the preimage not be empty, and then injectivity limits the preimage to a singleton. Since our choice of v was arbitrary, we know that every preimage for T is a set with a single element. This allows us to construct S as a function. Now that it is defined, verifying that it is the inverse of T will be easy. Here we go.
Choose u ∈ U. Define v = T\left (u\right ). Then {T}^{−1}\left (v\right ) = \left \{u\right \}, so that S\left (v\right ) = u and,
\left (S ∘ T\right )\left (u\right ) = S\left (T\left (u\right )\right ) = S\left (v\right ) = u = {I}_{U}\left (u\right )

and since our choice of u was arbitrary we have function equality, S ∘ T = {I}_{U}.
Now choose v ∈ V . Define u to be the single vector in the set {T}^{−1}\left (v\right ), in other words, u = S\left (v\right ). Then T\left (u\right ) = v, so
\left (T ∘ S\right )\left (v\right ) = T\left (S\left (v\right )\right ) = T\left (u\right ) = v = {I}_{V }\left (v\right )

and since our choice of v was arbitary we have function equality, T ∘ S = {I}_{V }. ■
When a linear transformation is both injective and surjective, the preimage of any element of the codomain is a set of size one (a “singleton”). This fact allowed us to construct the inverse linear transformation in one half of the proof of Theorem ILTIS (see Technique C). We can follow this approach to construct the inverse of a specific linear transformation, as the next example shows.
Example CIVLT
Computing the Inverse of a Linear Transformations
Consider the linear transformation T : {S}_{22}\mathrel{↦}{P}_{2}
defined by
T is invertible, which you are able to verify, perhaps by determining that the kernel of T is empty and the range of T is all of {P}_{2}. This will be easier once we have Theorem RPNDD, which appears later in this section.
By Theorem ILTIS we know {T}^{−1} exists, and it will be critical shortly to realize that {T}^{−1} is automatically known to be a linear transformation as well (Theorem ILTLT). To determine the complete behavior of {T}^{−1}: {P}_{ 2}\mathrel{↦}{S}_{22} we can simply determine its action on a basis for the domain, {P}_{2}. This is the substance of Theorem LTDB, and an excellent example of its application. Choose any basis of {P}_{2}, the simpler the better, such as B = \left \{1,\kern 1.95872pt x,\kern 1.95872pt {x}^{2}\right \}. Values of {T}^{−1} for these three basis elements will be the single elements of their preimages. In turn, we have
Theorem LTDB says, informally, “it is enough to know what a linear transformation does to a basis.” Formally, we have the outputs of {T}^{−1} for a basis, so by Theorem LTDB there is a unique linear transformation with these outputs. So we put this information to work. The key step here is that we can convert any element of {P}_{2} into a linear combination of the elements of the basis B (Theorem VRRB). We are after a “formula” for the value of {T}^{−1} on a generic element of {P}_{2}, say p + qx + r{x}^{2}.
Notice how a linear combination in the domain of {T}^{−1} has been translated into a linear combination in the codomain of {T}^{−1} since we know {T}^{−1} is a linear transformation by Theorem ILTLT.
Also, notice how the augmented matrices used to determine the three preimages could be combined into one calculation of a matrix in extended echelon form, reminiscent of a procedure we know for computing the inverse of a matrix (see Example CMI). Hmmmm. ⊠
We will make frequent use of the characterization of invertible linear transformations provided by Theorem ILTIS. The next theorem is a good example of this, and we will use it often, too.
Theorem CIVLT
Composition of Invertible Linear Transformations
Suppose that T : U\mathrel{↦}V
and S : V \mathrel{↦}W
are invertible linear transformations. Then the composition,
\left (S ∘ T\right ): U\mathrel{↦}W is an invertible linear
transformation. □
Proof Since S and T are both linear transformations, S ∘ T is also a linear transformation by Theorem CLTLT. Since S and T are both invertible, Theorem ILTIS says that S and T are both injective and surjective. Then Theorem CILTI says S ∘ T is injective, and Theorem CSLTS says S ∘ T is surjective. Now apply the “other half” of Theorem ILTIS and conclude that S ∘ T is invertible. ■
When a composition is invertible, the inverse is easy to construct.
Theorem ICLT
Inverse of a Composition of Linear Transformations
Suppose that T : U\mathrel{↦}V and
S : V \mathrel{↦}W are invertible linear
transformations. Then S ∘ T
is invertible and {\left (S ∘ T\right )}^{−1} = {T}^{−1} ∘ {S}^{−1}.
□
Proof Compute, for all w ∈ W
}
so \left ({T}^{−1} ∘ {S}^{−1}\right ) ∘\left (S ∘ T\right ) = {I}_{ U}. By Definition IVLT, S ∘ T is invertible and {\left (S ∘ T\right )}^{−1} = {T}^{−1} ∘ {S}^{−1}. ■
Notice that this theorem not only establishes what the inverse of S ∘ T is, it also duplicates the conclusion of Theorem CIVLT and also establishes the invertibility of S ∘ T. But somehow, the proof of Theorem CIVLT is nicer way to get this property.
Does Theorem ICLT remind you of the flavor of any theorem we have seen about matrices? (Hint: Think about getting dressed.) Hmmmm.
A vector space is defined (Definition VS) as a set of objects (“vectors”) endowed with a definition of vector addition (+) and a definition of scalar multiplication (written with juxtaposition). Many of our definitions about vector spaces involve linear combinations (Definition LC), such as the span of a set (Definition SS) and linear independence (Definition LI). Other definitions are built up from these ideas, such as bases (Definition B) and dimension (Definition D). The defining properties of a linear transformation require that a function “respect” the operations of the two vector spaces that are the domain and the codomain (Definition LT). Finally, an invertible linear transformation is one that can be “undone” — it has a companion that reverses its effect. In this subsection we are going to begin to roll all these ideas into one.
A vector space has “structure” derived from definitions of the two operations and the requirement that these operations interact in ways that satisfy the ten properties of Definition VS. When two different vector spaces have an invertible linear transformation defined between them, then we can translate questions about linear combinations (spans, linear independence, bases, dimension) from the first vector space to the second. The answers obtained in the second vector space can then be translated back, via the inverse linear transformation, and interpreted in the setting of the first vector space. We say that these invertible linear transformations “preserve structure.” And we say that the two vector spaces are “structurally the same.” The precise term is “isomorphic,” from Greek meaning “of the same form.” Let’s begin to try to understand this important concept.
Definition IVS
Isomorphic Vector Spaces
Two vector spaces U
and V
are isomorphic if there exists an invertible linear transformation
T with
domain U and
codomain V ,
T : U\mathrel{↦}V . In this case, we
write U\mathop{\mathop{≅}}V , and the linear
transformation T is known as
an isomorphism between U
and V .
△
A few comments on this definition. First, be careful with your language (Technique L). Two vector spaces are isomorphic, or not. It is a yes/no situation and the term only applies to a pair of vector spaces. Any invertible linear transformation can be called an isomorphism, it is a term that applies to functions. Second, a given pair of vector spaces there might be several different isomorphisms between the two vector spaces. But it only takes the existence of one to call the pair isomorphic. Third, U isomorphic to V , or V isomorphic to U? Doesn’t matter, since the inverse linear transformation will provide the needed isomorphism in the “opposite” direction. Being “isomorphic to” is an equivalence relation on the set of all vector spaces (see Theorem SER for a reminder about equivalence relations).
Example IVSAV
Isomorphic vector spaces, Archetype V
Archetype V is a linear transformation from
{P}_{3} to
{M}_{22},
T : {P}_{3}\mathrel{↦}{M}_{22},\quad T\left (a + bx + c{x}^{2} + d{x}^{3}\right ) = \left [\array{
a + b&a − 2c
\cr
d & b − d } \right ]

Since it is injective and surjective, Theorem ILTIS tells us that it is an invertible linear transformation. By Definition IVS we say {P}_{3} and {M}_{22} are isomorphic.
At a basic level, the term “isomorphic” is nothing more than a codeword for the presence of an invertible linear transformation. However, it is also a description of a powerful idea, and this power only becomes apparent in the course of studying examples and related theorems. In this example, we are led to believe that there is nothing “structurally” different about {P}_{3} and {M}_{22}. In a certain sense they are the same. Not equal, but the same. One is as good as the other. One is just as interesting as the other.
Here is an extremely basic application of this idea. Suppose we want to compute the following linear combination of polynomials in {P}_{3},
5(2 + 3x − 4{x}^{2} + 5{x}^{3}) + (−3)(3 − 5x + 3{x}^{2} + {x}^{3})

Rather than doing it straightaway (which is very easy), we will apply the transformation T to convert into a linear combination of matrices, and then compute in {M}_{22} according to the definitions of the vector space operations there (Example VSM),
Now we will translate our answer back to {P}_{3} by applying {T}^{−1}, which we found in Example AIVLT,
{
T}^{−1}: {M}_{
22}\mathrel{↦}{P}_{3},\quad {T}^{−1}\left (\left [\array{
a&b
\cr
c&d } \right ]\right ) = (a−c−d)+(c+d)x+{1\over
2}(a−b−c−d){x}^{2}+c{x}^{3}

We compute,
{
T}^{−1}\left (\left [\array{
31&59
\cr
22& 8 } \right ]\right ) = 1+30x−29{x}^{2}+22{x}^{3}

which is, as expected, exactly what we would have computed for the original linear combination had we just used the definitions of the operations in {P}_{3} (Example VSP). Notice this is meant only as an illustration and not a suggested route for doing this particular computation. ⊠
Checking the dimensions of two vector spaces can be a quick way to establish that they are not isomorphic. Here’s the theorem.
Theorem IVSED
Isomorphic Vector Spaces have Equal Dimension
Suppose U and
V are isomorphic
vector spaces. Then \mathop{ dim}\nolimits \left (U\right ) =\mathop{ dim}\nolimits \left (V \right ).
□
Proof If U and V are isomorphic, there is an invertible linear transformation T : U\mathrel{↦}V (Definition IVS). T is injective by Theorem ILTIS and so by Theorem ILTD, \mathop{ dim}\nolimits \left (U\right ) ≤\mathop{ dim}\nolimits \left (V \right ). Similarly, T is surjective by Theorem ILTIS and so by Theorem SLTD, \mathop{ dim}\nolimits \left (U\right ) ≥\mathop{ dim}\nolimits \left (V \right ). The net effect of these two inequalities is that \mathop{ dim}\nolimits \left (U\right ) =\mathop{ dim}\nolimits \left (V \right ). ■
The contrapositive of Theorem IVSED says that if U and V have different dimensions, then they are not isomorphic. Dimension is the simplest “structural” characteristic that will allow you to distinguish nonisomorphic vector spaces. For example {P}_{6} is not isomorphic to {M}_{34} since their dimensions (7 and 12, respectively) are not equal. With tools developed in Section VR we will be able to establish that the converse of Theorem IVSED is true. Think about that one for a moment.
Just as a matrix has a rank and a nullity, so too do linear transformations. And just like the rank and nullity of a matrix are related (they sum to the number of columns, Theorem RPNC) the rank and nullity of a linear transformation are related. Here are the definitions and theorems, see the Archetypes (Appendix A) for loads of examples.
Definition ROLT
Rank Of a Linear Transformation
Suppose that T : U\mathrel{↦}V
is a linear transformation. Then the rank of
T,
r\left (T\right ), is the dimension
of the range of T,
r\left (T\right ) =\mathop{ dim}\nolimits \left (ℛ\kern 1.95872pt \left (T\right )\right )

(This definition contains Notation ROLT.) △
Definition NOLT
Nullity Of a Linear Transformation
Suppose that T : U\mathrel{↦}V
is a linear transformation. Then the nullity of
T,
n\left (T\right ), is the dimension
of the kernel of T,
n\left (T\right ) =\mathop{ dim}\nolimits \left (K\kern 1.95872pt \left (T\right )\right )

(This definition contains Notation NOLT.) △
Here are two quick theorems.
Theorem ROSLT
Rank Of a Surjective Linear Transformation
Suppose that T : U\mathrel{↦}V
is a linear transformation. Then the rank of
T is the
dimension of V ,
r\left (T\right ) =\mathop{ dim}\nolimits \left (V \right ), if and
only if T is
surjective. □
Proof By Theorem RSLT, T is surjective if and only if ℛ\kern 1.95872pt \left (T\right ) = V . Applying Definition ROLT, ℛ\kern 1.95872pt \left (T\right ) = V if and only if r\left (T\right ) =\mathop{ dim}\nolimits \left (ℛ\kern 1.95872pt \left (T\right )\right ) =\mathop{ dim}\nolimits \left (V \right ). ■
Theorem NOILT
Nullity Of an Injective Linear Transformation
Suppose that T : U\mathrel{↦}V
is a linear transformation. Then the nullity of
T is zero,
n\left (T\right ) = 0, if and
only if T is
injective. □
Proof By Theorem KILT, T is injective if and only if K\kern 1.95872pt \left (T\right ) = \left \{0\right \}. Applying Definition NOLT, K\kern 1.95872pt \left (T\right ) = \left \{0\right \} if and only if n\left (T\right ) = 0. ■
Just as injectivity and surjectivity come together in invertible linear transformations, there is a clear relationship between rank and nullity of a linear transformation. If one is big, the other is small.
Theorem RPNDD
Rank Plus Nullity is Domain Dimension
Suppose that T : U\mathrel{↦}V
is a linear transformation. Then
r\left (T\right ) + n\left (T\right ) =\mathop{ dim}\nolimits \left (U\right )

Proof Let r = r\left (T\right ) and s = n\left (T\right ). Suppose that R = \left \{{v}_{1},\kern 1.95872pt {v}_{2},\kern 1.95872pt {v}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {v}_{r}\right \} ⊆ V is a basis of the range of T, ℛ\kern 1.95872pt \left (T\right ), and S = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{s}\right \} ⊆ U is a basis of the kernel of T, K\kern 1.95872pt \left (T\right ). Note that R and S are possibly empty, which means that some of the sums in this proof are “empty” and are equal to the zero vector.
Because the elements of R are all in the range of T, each must have a nonempty preimage by Theorem RPI. Choose vectors {w}_{i} ∈ U, 1 ≤ i ≤ r such that {w}_{i} ∈ {T}^{−1}\left ({v}_{ i}\right ). So T\left ({w}_{i}\right ) = {v}_{i}, 1 ≤ i ≤ r. Consider the set
B = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{s},\kern 1.95872pt {w}_{1},\kern 1.95872pt {w}_{2},\kern 1.95872pt {w}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {w}_{r}\right \}

We claim that B is a basis for U.
To establish linear independence for B, begin with a relation of linear dependence on B. So suppose there are scalars {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {a}_{s} and {b}_{1},\kern 1.95872pt {b}_{2},\kern 1.95872pt {b}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {b}_{r}
0 = {a}_{1}{u}_{1} + {a}_{2}{u}_{2} + {a}_{3}{u}_{3} + \mathrel{⋯} + {a}_{s}{u}_{s} + {b}_{1}{w}_{1} + {b}_{2}{w}_{2} + {b}_{3}{w}_{3} + \mathrel{⋯} + {b}_{r}{w}_{r}

Then
This is a relation of linear dependence on R (Definition RLD), and since R is a linearly independent set (Definition LI), we see that {b}_{1} = {b}_{2} = {b}_{3} = \mathop{\mathop{…}} = {b}_{r} = 0. Then the original relation of linear dependence on B becomes
But this is again a relation of linear independence (Definition RLD), now on the set S. Since S is linearly independent (Definition LI), we have {a}_{1} = {a}_{2} = {a}_{3} = \mathop{\mathop{…}} = {a}_{r} = 0. Since we now know that all the scalars in the relation of linear dependence on B must be zero, we have established the linear independence of S through Definition LI.
To now establish that B spans U, choose an arbitrary vector u ∈ U. Then T\left (u\right ) ∈ R(T), so there are scalars {c}_{1},\kern 1.95872pt {c}_{2},\kern 1.95872pt {c}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {c}_{r} such that
T\left (u\right ) = {c}_{1}{v}_{1} + {c}_{2}{v}_{2} + {c}_{3}{v}_{3} + \mathrel{⋯} + {c}_{r}{v}_{r}

Use the scalars {c}_{1},\kern 1.95872pt {c}_{2},\kern 1.95872pt {c}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {c}_{r} to define a vector y ∈ U,
y = {c}_{1}{w}_{1} + {c}_{2}{w}_{2} + {c}_{3}{w}_{3} + \mathrel{⋯} + {c}_{r}{w}_{r}

Then
So the vector u − y is sent to the zero vector by T and hence is an element of the kernel of T. As such it can be written as a linear combination of the basis vectors for K\kern 1.95872pt \left (T\right ), the elements of the set S. So there are scalars {d}_{1},\kern 1.95872pt {d}_{2},\kern 1.95872pt {d}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {d}_{s} such that
u − y = {d}_{1}{u}_{1} + {d}_{2}{u}_{2} + {d}_{3}{u}_{3} + \mathrel{⋯} + {d}_{s}{u}_{s}

Then
This says that for any vector, u, from U, there exist scalars ({d}_{1},\kern 1.95872pt {d}_{2},\kern 1.95872pt {d}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {d}_{s},\kern 1.95872pt {c}_{1},\kern 1.95872pt {c}_{2},\kern 1.95872pt {c}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {c}_{r}) that form u as a linear combination of the vectors in the set B. In other words, B spans U (Definition SS).
So B is a basis (Definition B) of U with s + r vectors, and thus
\mathop{dim}\nolimits \left (U\right ) = s + r = n\left (T\right ) + r\left (T\right )

as desired. ■
Theorem RPNC said that the rank and nullity of a matrix sum to the number of columns of the matrix. This result is now an easy consequence of Theorem RPNDD when we consider the linear transformation T : {ℂ}^{n}\mathrel{↦}{ℂ}^{m} defined with the m × n matrix A by T\left (x\right ) = Ax. The range and kernel of T are identical to the column space and null space of the matrix A (Exercise ILT.T20, Exercise SLT.T20), so the rank and nullity of the matrix A are identical to the rank and nullity of the linear transformation T. The dimension of the domain of T is the dimension of {ℂ}^{n}, exactly the number of columns for the matrix A.
This theorem can be especially useful in determining basic properties of linear transformations. For example, suppose that T : {ℂ}^{6}\mathrel{↦}{ℂ}^{6} is a linear transformation and you are able to quickly establish that the kernel is trivial. Then n\left (T\right ) = 0. First this means that T is injective by Theorem NOILT. Also, Theorem RPNDD becomes
6 =\mathop{ dim}\nolimits \left ({ℂ}^{6}\right ) = r\left (T\right ) + n\left (T\right ) = r\left (T\right ) + 0 = r\left (T\right )

So the rank of T is equal to the rank of the codomain, and by Theorem ROSLT we know T is surjective. Finally, we know T is invertible by Theorem ILTIS. So from the determination that the kernel is trivial, and consideration of various dimensions, the theorems of this section allow us to conclude the existence of an inverse linear transformation for T.
Similarly, Theorem RPNDD can be used to provide alternative proofs for Theorem ILTD, Theorem SLTD and Theorem IVSED. It would be an interesting exercise to construct these proofs.
It would be instructive to study the archetypes that are linear transformations and see how many of their properties can be deduced just from considering only the dimensions of the domain and codomain. Then add in just knowlege of either the nullity or rank, and so how much more you can learn about the linear transformation. The table preceding all of the archetypes (Appendix A) could be a good place to start this analysis.
This subsection does not really belong in this section, or any other section, for that matter. It is just the right time to have a discussion about the connections between the central topic of linear algebra, linear transformations, and our motivating topic from Chapter SLE, systems of linear equations. We will discuss several theorems we have seen already, but we will also make some forwardlooking statements that will be justified in Chapter R.
Archetype D and Archetype E are ideal examples to illustrate connections with linear transformations. Both have the same coefficient matrix,
D = \left [\array{
2 &1& 7 &−7
\cr
−3&4&−5&−6
\cr
1 &1& 4 &−5 } \right ]

To apply the theory of linear transformations to these two archetypes, employ matrix multiplication (Definition MM) and define the linear transformation,
T : {ℂ}^{4}\mathrel{↦}{ℂ}^{3},\quad T\left (x\right ) = Dx = {x}_{
1}\left [\array{
2
\cr
−3
\cr
1 } \right ]+{x}_{2}\left [\array{
1
\cr
4
\cr
1 } \right ]+{x}_{3}\left [\array{
7
\cr
−5
\cr
4 } \right ]+{x}_{4}\left [\array{
−7
\cr
−6
\cr
−5 } \right ]

Theorem MBLT tells us that T is indeed a linear transformation. Archetype D asks for solutions to ℒS\kern 1.95872pt \left (D,\kern 1.95872pt b\right ), where b = \left [\array{ 8 \cr −12 \cr −4 } \right ]. In the language of linear transformations this is equivalent to asking for {T}^{−1}\left (b\right ). In the language of vectors and matrices it asks for a linear combination of the four columns of D that will equal b. One solution listed is w = \left [\array{ 7 \cr 8 \cr 1 \cr 3 } \right ]. With a nonempty preimage, Theorem KPI tells us that the complete solution set of the linear system is the preimage of b,
w + K\kern 1.95872pt \left (T\right ) = \left \{\left .w + z\kern 1.95872pt \right \vert \kern 1.95872pt z ∈K\kern 1.95872pt \left (T\right )\right \}

The kernel of the linear transformation T is exactly the null space of the matrix D (see Exercise ILT.T20), so this approach to the solution set should be reminiscent of Theorem PSPHS. The kernel of the linear transformation is the preimage of the zero vector, exactly equal to the solution set of the homogeneous system ℒS\kern 1.95872pt \left (D,\kern 1.95872pt 0\right ). Since D has a null space of dimension two, every preimage (and in particular the preimage of b) is as “big” as a subspace of dimension two (but is not a subspace).
Archetype E is identical to Archetype D but with a different vector of constants, d = \left [\array{ 2 \cr 3 \cr 2 } \right ]. We can use the same linear transformation T to discuss this system of equations since the coefficient matrix is identical. Now the set of solutions to ℒS\kern 1.95872pt \left (D,\kern 1.95872pt d\right ) is the preimage of d, {T}^{−1}\left (d\right ). However, the vector d is not in the range of the linear transformation (nor is it in the column space of the matrix, since these two sets are equal by Exercise SLT.T20). So the empty preimage is equivalent to the inconsistency of the linear system.
These two archetypes each have three equations in four variables, so either the resulting linear systems are inconsistent, or they are consistent and application of Theorem CMVEI tells us that the system has infinitely many solutions. Considering these same parameters for the linear transformation, the dimension of the domain, {ℂ}^{4}, is four, while the codomain, {ℂ}^{3}, has dimension three. Then
So the kernel of T is nontrivial simply by considering the dimensions of the domain (number of variables) and the codomain (number of equations). Preimages of elements of the codomain that are not in the range of T are empty (inconsistent systems). For elements of the codomain that are in the range of T (consistent systems), Theorem KPI tells us that the preimages are built from the kernel, and with a nontrivial kernel, these preimages are infinite (infinitely many solutions).
When do systems of equations have unique solutions? Consider the system of linear equations ℒS\kern 1.95872pt \left (C,\kern 1.95872pt f\right ) and the linear transformation S\left (x\right ) = Cx. If S has a trivial kernel, then preimages will either be empty or be finite sets with single elements. Correspondingly, the coefficient matrix C will have a trivial null space and solution sets will either be empty (inconsistent) or contain a single solution (unique solution). Should the matrix be square and have a trivial null space then we recognize the matrix as being nonsingular. A square matrix means that the corresponding linear transformation, T, has equalsized domain and codomain. With a nullity of zero, T is injective, and also Theorem RPNDD tells us that rank of T is equal to the dimension of the domain, which in turn is equal to the dimension of the codomain. In other words, T is surjective. Injective and surjective, and Theorem ILTIS tells us that T is invertible. Just as we can use the inverse of the coefficient matrix to find the unique solution of any linear system with a nonsingular coefficient matrix (Theorem SNCM), we can use the inverse of the linear transformation to construct the unique element of any preimage (proof of Theorem ILTIS).
The executive summary of this discussion is that to every coefficient matrix of a system of linear equations we can associate a natural linear transformation. Solution sets for systems with this coefficient matrix are preimages of elements of the codomain of the linear transformation. For every theorem about systems of linear equations there is an analogue about linear transformations. The theory of linear transformations provides all the tools to recreate the theory of solutions to linear systems of equations.
We will continue this adventure in Chapter R.
C10 The archetypes below are linear transformations of the form T : U\mathrel{↦}V that are invertible. For each, the inverse linear transformation is given explicitly as part of the archetype’s description. Verify for each linear transformation that
Archetype R,
Archetype V,
Archetype W
Contributed by Robert Beezer
C20 Determine if the linear transformation T : {P}_{2}\mathrel{↦}{M}_{22} is (a) injective, (b) surjective, (c) invertible.
T\left (a + bx + c{x}^{2}\right ) = \left [\array{
a + 2b − 2c& 2a + 2b
\cr
−a + b − 4c&3a + 2b + 2c } \right ]

Contributed by Robert Beezer Solution [1532]
C21 Determine if the linear transformation S : {P}_{3}\mathrel{↦}{M}_{22} is (a) injective, (b) surjective, (c) invertible.
S\left (a + bx + c{x}^{2} + d{x}^{3}\right ) = \left [\array{
−a + 4b + c + 2d&4a − b + 6c − d
\cr
a + 5b − 2c + 2d& a + 2c + 5d } \right ]

Contributed by Robert Beezer Solution [1533]
C50 Consider the linear transformation S : {M}_{12}\mathrel{↦}{P}_{1} from the set of 1 × 2 matrices to the set of polynomials of degree at most 1, defined by
S\left (\left [\array{
a&b } \right ]\right ) = (3a+b)+(5a+2b)x

Prove that S is invertible. Then show that the linear transformation
R: {P}_{1}\mathrel{↦}{M}_{12},\quad R\left (r + sx\right ) = \left [\array{
(2r − s)&(−5r + 3s) } \right ]

is the inverse of S,
that is {S}^{−1} = R.
Contributed by Robert Beezer Solution [1536]
M30 The linear transformation S below is invertible. Find a formula for the inverse linear transformation, {S}^{−1}.
S : {P}_{1}\mathrel{↦}{M}_{1,2},\quad S\left (a + bx\right ) = \left [\array{
3a + b&2a + b } \right ]

Contributed by Robert Beezer Solution [1538]
M31 The linear transformation R: {M}_{12}\mathrel{↦}{M}_{21} is invertible. Determine a formula for the inverse linear transformation {R}^{−1}: {M}_{ 21}\mathrel{↦}{M}_{12}.
R\left (\left [\array{
a&b } \right ]\right ) = \left [\array{
a + 3b
\cr
4a + 11b } \right ]

Contributed by Robert Beezer Solution [1540]
M50 Rework Example CIVLT, only in place of the basis
B for
{P}_{2}, choose instead
to use the basis C = \left \{1,\kern 1.95872pt 1 + x,\kern 1.95872pt 1 + x + {x}^{2}\right \}.
This will complicate wrting a generic element of the domain of
{T}^{−1}
as a linear combination of the basis elements, and the algebra will be
a bit messier, but in the end you should obtain the same formula for
{T}^{−1}. The
inverse linear transformation is what it is, and the choice of a particular basis
should not influence the outcome.
Contributed by Robert Beezer
T05 Prove that the identity linear transformation (Definition IDLT) is both
injective and surjective, and hence invertible.
Contributed by Robert Beezer
T15 Suppose that T : U\mathrel{↦}V
is a surjective linear transformation and
\mathop{ dim}\nolimits \left (U\right ) =\mathop{ dim}\nolimits \left (V \right ). Prove
that T
is injective.
Contributed by Robert Beezer Solution [1542]
T16 Suppose that T : U\mathrel{↦}V
is an injective linear transformation and
\mathop{ dim}\nolimits \left (U\right ) =\mathop{ dim}\nolimits \left (V \right ). Prove
that T
is surjective.
Contributed by Robert Beezer
T30 Suppose that U
and V
are isomorphic vector spaces. Prove that there are infinitely many isomophisms
between U
and V .
Contributed by Robert Beezer Solution [1543]
C20 Contributed by Robert Beezer Statement [1527]
(a) We will compute the kernel of T.
Suppose that a + bx + c{x}^{2} ∈K\kern 1.95872pt \left (T\right ).
Then
\left [\array{
0&0
\cr
0&0 } \right ] = T\left (a + bx + c{x}^{2}\right ) = \left [\array{
a + 2b − 2c& 2a + 2b
\cr
−a + b − 4c&3a + 2b + 2c } \right ]

and matrix equality (Theorem ME) yields the homogeneous system of four equations in three variables,
The coefficient matrix of this system rowreduces as
\left [\array{
1 &2&−2
\cr
2 &2& 0
\cr
−1&1&−4
\cr
3 &2& 2 } \right ]\mathop{\longrightarrow}\limits_{}^{\text{RREF}}\left [\array{
\text{1}&0& 2
\cr
0&\text{1}&−2
\cr
0&0& 0
\cr
0&0& 0 } \right ]

From the existence of nontrivial solutions to this system, we can infer nonzero polynomials in K\kern 1.95872pt \left (T\right ). By Theorem KILT we then know that T is not injective.
(b) Since 3 =\mathop{ dim}\nolimits \left ({P}_{2}\right ) <\mathop{ dim}\nolimits \left ({M}_{22}\right ) = 4, by Theorem SLTD T is not surjective.
(c) Since T is not surjective, it is not invertible by Theorem ILTIS.
C21 Contributed by Robert Beezer Statement [1528]
(a) To check injectivity, we compute the kernel of
S. To this end,
suppose that a + bx + c{x}^{2} + d{x}^{3} ∈K\kern 1.95872pt \left (S\right ),
so
\left [\array{
0&0
\cr
0&0 } \right ] = S\left (a + bx + c{x}^{2} + d{x}^{3}\right ) = \left [\array{
−a + 4b + c + 2d&4a − b + 6c − d
\cr
a + 5b − 2c + 2d& a + 2c + 5d } \right ]

this creates the homogeneous system of four equations in four variables,
The coefficient matrix of this system rowreduces as,
We recognize the coefficient matrix as being nonsingular, so the only solution to the system is a = b = c = d = 0, and the kernel of S is trivial, K\kern 1.95872pt \left (S\right ) = \left \{0 + 0x + 0{x}^{2} + 0{x}^{3}\right \}. By Theorem KILT, we see that S is injective.
(b) We can establish that S is surjective by considering the rank and nullity of S.
So, ℛ\kern 1.95872pt \left (S\right ) is a subspace of {M}_{22} (Theorem RLTS) whose dimension equals that of {M}_{22}. By Theorem EDYES, we gain the set equality ℛ\kern 1.95872pt \left (S\right ) = {M}_{22}. Theorem RSLT then implies that S is surjective.
(c) Since S is both injective and surjective, Theorem ILTIS says S is invertible.
C50 Contributed by Robert Beezer Statement [1528]
Determine the kernel of S
first. The condition that S\left (\left [\array{
a&b } \right ]\right ) = 0
becomes (3a + b) + (5a + 2b)x = 0 + 0x.
Equating coefficients of these polynomials yields the system
This homogeneous system has a nonsingular coefficient matrix, so the only solution is a = 0, b = 0 and thus
K\kern 1.95872pt \left (S\right ) = \left \{\left [\array{
0&0 } \right ]\right \}

By Theorem KILT, we know S is injective. With n\left (S\right ) = 0 we employ Theorem RPNDD to find
r\left (S\right ) = r\left (S\right ) + 0 = r\left (S\right ) + n\left (S\right ) =\mathop{ dim}\nolimits \left ({M}_{12}\right ) = 2 =\mathop{ dim}\nolimits \left ({P}_{1}\right )

Since ℛ\kern 1.95872pt \left (S\right ) ⊆ {P}_{1} and \mathop{ dim}\nolimits \left (ℛ\kern 1.95872pt \left (S\right )\right ) =\mathop{ dim}\nolimits \left ({P}_{1}\right ), we can apply Theorem EDYES to obtain the set equality ℛ\kern 1.95872pt \left (S\right ) = {P}_{1} and therefore S is surjective.
One of the two defining conditions of an invertible linear transformation is (Definition IVLT)
That \left (R ∘ S\right )\left (\left [\array{ a&b } \right ]\right ) ={ I}_{{M}_{12}}\left (\left [\array{ a&b } \right ]\right ) is similar.
M30 Contributed by Robert Beezer Statement [1529]
(Another approach to this solution would follow Example CIVLT.)
Suppose that {S}^{−1}: {M}_{ 1,2}\mathrel{↦}{P}_{1} has a form given by
{
S}^{−1}\left (\array{
z&w
} \right ) = \left (rz + sw\right )+\left (pz + qw\right )x

where r,\kern 1.95872pt s,\kern 1.95872pt p,\kern 1.95872pt q are unknown scalars. Then
Equating coefficients of these two polynomials, and then equating coefficients on a and b, gives rise to 4 equations in 4 variables,
This system has a unique solution: r = 1, s = −1, p = −2, q = 3. So the desired inverse linear transformation is
{
S}^{−1}\left (\array{
z&w
} \right ) = \left (z − w\right )+\left (−2z + 3w\right )x

Notice that the system of 4 equations in 4 variables could be split into two systems, each with two equations in two variables (and identical coefficient matrices). After making this split, the solution might feel like computing the inverse of a matrix (Theorem CINM). Hmmmm.
M31 Contributed by Robert Beezer Statement [1530]
(Another approach to this solution would follow Example CIVLT.)
We are given that R is invertible. The inverse linear transformation can be formulated by considering the preimage of a generic element of the codomain. With injectivity and surjectivity, we know that the preimage of any element will be a set of size one — it is this lone element that will be the output of the inverse linear transformation.
Suppose that we set v = \left [\array{ x \cr y } \right ] as a generic element of the codomain, {M}_{21}. Then if \left [\array{ r&s } \right ] = w ∈ {R}^{−1}\left (v\right ),
So we obtain the system of two equations in the two variables r and s,
With a nonsingular coefficient matrix, we can solve the system using the inverse of the coefficient matrix,
So we define,
{
R}^{−1}\left (v\right ) = {R}^{−1}\left (\left [\array{
x
\cr
y } \right ]\right ) = w = \left [\array{
r&s } \right ] = \left [\array{
−11x + 3y&4x − y } \right ]

T15 Contributed by Robert Beezer Statement [1531]
If T is surjective, then
Theorem RSLT says ℛ\kern 1.95872pt \left (T\right ) = V ,
so r\left (T\right ) =\mathop{ dim}\nolimits \left (V \right ). In turn, the
hypothesis gives r\left (T\right ) =\mathop{ dim}\nolimits \left (U\right ).
Then, using Theorem RPNDD,
n\left (T\right ) = \left (r\left (T\right ) + n\left (T\right )\right ) − r\left (T\right ) =\mathop{ dim}\nolimits \left (U\right ) −\mathop{ dim}\nolimits \left (U\right ) = 0

With a null space of zero dimension, K\kern 1.95872pt \left (T\right ) = \left \{0\right \}, and by Theorem KILT we see that T is injective. T is both injective and surjective so by Theorem ILTIS, T is invertible.
T30 Contributed by Robert Beezer Statement [1531]
Since U
and V are
isomorphic, there is at least one isomorphism between them (Definition IVS), say
T : U\mathrel{↦}V . As
such, T
is an invertible linear transformation.
For α ∈ ℂ define the linear transformation S : V \mathrel{↦}V by S\left (v\right ) = αv. Convince yourself that when α\mathrel{≠}0, S is an invertible linear transformation (Definition IVLT). Then the composition, S ∘ T : U\mathrel{↦}V , is an invertible linear transformation by Theorem CIVLT. Once convinced that each nonzero value of α gives rise to a different functions for S ∘ T, then we have constructed infinitely many isomorphisms from U to V .
Theorem MBLT
You give me an m × n
matrix and I’ll give you a linear transformation
T : {ℂ}^{n}\mathrel{↦}{ℂ}^{m}. This
is our first hint that there is some relationship between linear transformations and
matrices.
Theorem MLTCV
You give me a linear transformation T : {ℂ}^{n}\mathrel{↦}{ℂ}^{m}
and I’ll give you an m × n
matrix. This is our second hint that there is some relationship between linear
transformations and matrices. Generalizing this relationship to arbitrary vector spaces
(i.e. not just {ℂ}^{n}
and {ℂ}^{m})
will be the most important idea of Chapter R.
Theorem LTLC
A simple idea, and as described in Exercise LT.T20, equivalent to the
Definition LT. The statement is really just for convenience, as we’ll quote this one
often.
Theorem LTDB
Another simple idea, but a powerful one. “It is enough to know what
a linear transformation does to a basis.” At the outset of Chapter R,
Theorem VRRB will help us define a very important function, and then
Theorem LTDB will allow us to understand that this function is also a linear
transformation.
Theorem KPI
The preimage will be an important construction in this chapter, and this is one of
the most important descriptions of the preimage. It should remind you of
Theorem PSPHS, which is described in Acronyms V. See Theorem RPI, which is
also described below.
Theorem KILT
Kernels and injective linear transformations are intimately related. This result is
the connection. Compare with Theorem RSLT below.
Theorem ILTB
Injective linear transformations and linear independence are intimately
related. This result is the connection. Compare with Theorem SLTB
below.
Theorem RSLT
Ranges and surjective linear transformations are intimately related. This result is
the connection. Compare with Theorem KILT above.
Theorem SSRLT
This theorem provides the most direct way of forming the range of a linear
transformation. The resulting spanning set might well be linearly dependent, and
beg for some cleanup, but that doesn’t stop us from having very quickly formed a
reasonable description of the range. If you find the determination of spanning
sets or ranges difficult, this is one worth remembering. You can view
this as the analogue of forming a column space by a direct application of
Definition CSM.
Theorem SLTB
Surjective linear transformations and spanning sets are intimately related. This
result is the connection. Compare with Theorem ILTB above.
Theorem RPI
This is the analogue of Theorem KPI. Membership in the range is equivalent to
nonempty preimages.
Theorem ILTIS
Injectivity and surjectivity are independent concepts. You can have one without
the other. But when you have both, you get invertibility, a linear transformation
that can be run “backwards.” This result might explain the entire structure of the
four sections in this chapter.
Theorem RPNDD
This is the promised generalization of Theorem RPNC about matrices. So the
number of columns of a matrix is the analogue of the dimension of the domain.
This will become even more precise in Chapter R. For now, this can be a powerful
result for determining dimensions of kernels and ranges, and consequently, the
injectivity or surjectivity of linear transformations. Never underestimate a
theorem that counts something.