Skip to main content
Logo image

A First Course in Linear Algebra

Robert A. Beezer

Section ILT Injective Linear Transformations

Some linear transformations possess one, or both, of two key properties, which go by the names injective and surjective. We will see that they are closely related to ideas like linear independence and spanning, and subspaces like the null space and the column space. In this section we will define an injective linear transformation and analyze the resulting consequences. The next section will do the same for the surjective property. In the final section of this chapter we will see what happens when we have the two properties simultaneously.
🔗

Subsection ILT Injective Linear Transformations

As usual, we lead with a definition.
🔗

Definition ILT. Injective Linear Transformation.

Suppose T:U→V is a linear transformation. Then T is injective if whenever T(x)=T(y), then x=y.
🔗
🔗
Given an arbitrary function, it is possible for two different inputs to yield the same output (think about the function f(x)=x2 and the inputs x=3 and x=−3). For an injective function, this never happens. If we have equal outputs (T(x)=T(y)) then we must have achieved those equal outputs by employing equal inputs (x=y). Some authors prefer the term one-to-one where we use injective, and we will sometimes refer to an injective linear transformation as an injection.
🔗
🔗

Subsection EILT Examples of Injective Linear Transformations

It is perhaps most instructive to examine a linear transformation that is not injective first.
🔗

Example NIAQ. Not injective, Archetype Q.

Archetype Q is the linear transformation
T:C5→C5,T([x1x2x3x4x5])=[−2x1+3x2+3x3−6x4+3x5−16x1+9x2+12x3−28x4+28x5−19x1+7x2+14x3−32x4+37x5−21x1+9x2+15x3−35x4+39x5−9x1+5x2+7x3−16x4+16x5].
Notice that for
x=[13−124]y=[47057]
we have
T([13−124])=[455727731]T([47057])=[455727731].
So we have two vectors from the domain, x≠y, yet T(x)=T(y), in violation of Definition ILT. This is another example where you should not concern yourself with how x and y were selected, as this will be explained shortly. However, do understand why these two vectors provide enough evidence to conclude that T is not injective.
Here is a cartoon of a non-injective linear transformation. Notice that the central feature of this cartoon is that T(u)=v=T(w). Even though this happens again with some unnamed vectors, it only takes one occurrence to destroy the possibility of injectivity. Note also that the two vectors displayed in the bottom of V have no bearing, either way, on the injectivity of T.
🔗
svg
Figure NILT. Non-Injective Linear Transformation
🔗
To show that a linear transformation is not injective, it is enough to find a single pair of inputs that get sent to the identical output, as in Example NIAQ. However, to show that a linear transformation is injective we must establish that this coincidence of outputs never occurs. Here is an example that shows how to establish this.
🔗

Example IAR. Injective, Archetype R.

Archetype R is the linear transformation
T:C5→C5,T([x1x2x3x4x5])=[−65x1+128x2+10x3−262x4+40x536x1−73x2−x3+151x4−16x5−44x1+88x2+5x3−180x4+24x534x1−68x2−3x3+140x4−18x512x1−24x2−x3+49x4−5x5].
To establish that R is injective we must begin with the assumption that T(x)=T(y) and somehow arrive at the conclusion that x=y. Here we go,
[00000]=T(x)−T(y)=T([x1x2x3x4x5])−T([y1y2y3y4y5])=[−65x1+128x2+10x3−262x4+40x536x1−73x2−x3+151x4−16x5−44x1+88x2+5x3−180x4+24x534x1−68x2−3x3+140x4−18x512x1−24x2−x3+49x4−5x5]−[−65y1+128y2+10y3−262y4+40y536y1−73y2−y3+151y4−16y5−44y1+88y2+5y3−180y4+24y534y1−68y2−3y3+140y4−18y512y1−24y2−y3+49y4−5y5]=[−65(x1−y1)+128(x2−y2)+10(x3−y3)−262(x4−y4)+40(x5−y5)36(x1−y1)−73(x2−y2)−(x3−y3)+151(x4−y4)−16(x5−y5)−44(x1−y1)+88(x2−y2)+5(x3−y3)−180(x4−y4)+24(x5−y5)34(x1−y1)−68(x2−y2)−3(x3−y3)+140(x4−y4)−18(x5−y5)12(x1−y1)−24(x2−y2)−(x3−y3)+49(x4−y4)−5(x5−y5)]=[−6512810−2624036−73−1151−16−44885−1802434−68−3140−1812−24−149−5][x1−y1x2−y2x3−y3x4−y4x5−y5].
Now we recognize that we have a homogeneous system of 5 equations in 5 variables (the terms xi−yi are the variables), so we row-reduce the coefficient matrix to
[1000001000001000001000001].
So the only solution is the trivial solution
x1−y1=0x2−y2=0x3−y3=0x4−y4=0x5−y5=0
and we conclude that indeed x=y. By Definition ILT, T is injective.
Here is the cartoon for an injective linear transformation. It is meant to suggest that we never have two inputs associated with a single output. Again, the two lonely vectors at the bottom of V have no bearing either way on the injectivity of T.
🔗
svg
Figure ILT. Injective Linear Transformation
🔗
Let us now examine an injective linear transformation between abstract vector spaces.
🔗

Example IAV. Injective, Archetype V.

Archetype V is defined by
T:P3→M22,T(a+bx+cx2+dx3)=[a+ba−2cdb−d].
To establish that the linear transformation is injective, begin by supposing that two polynomial inputs yield the same output matrix,
T(a1+b1x+c1x2+d1x3)=T(a2+b2x+c2x2+d2x3).
Then
O=[0000]=T(a1+b1x+c1x2+d1x3)−T(a2+b2x+c2x2+d2x3)Hypothesis=T((a1+b1x+c1x2+d1x3)−(a2+b2x+c2x2+d2x3))Definition LT=T((a1−a2)+(b1−b2)x+(c1−c2)x2+(d1−d2)x3)Operations in P3=[(a1−a2)+(b1−b2)(a1−a2)−2(c1−c2)(d1−d2)(b1−b2)−(d1−d2)]Definition of T.
This single matrix equality translates to the homogeneous system of equations in the variables ai−bi,
(a1−a2)+(b1−b2)=0(a1−a2)−2(c1−c2)=0(d1−d2)=0(b1−b2)−(d1−d2)=0.
This system of equations can be rewritten as the matrix equation
[110010−200001010−1][(a1−a2)(b1−b2)(c1−c2)(d1−d2)]=[0000].
Since the coefficient matrix is nonsingular (check this) the only solution is trivial, i.e.
a1−a2=0b1−b2=0c1−c2=0d1−d2=0
so that
a1=a2b1=b2c1=c2d1=d2
so the two inputs must be equal polynomials. By Definition ILT, T is injective.
🔗

Subsection KLT Kernel of a Linear Transformation

For a linear transformation T:U→V, the kernel is a subset of the domain U. Informally, it is the set of all inputs that the transformation sends to the zero vector of the codomain. It will have some natural connections with the null space of a matrix, so we will keep the same notation, and if you think about your objects, then there should be little confusion. Here is the careful definition.
🔗

Definition KLT. Kernel of a Linear Transformation.

Suppose T:U→V is a linear transformation. Then the kernel of T is the set
🔗
K(T)={u∈U|T(u)=0}.
🔗
🔗
Notice that the kernel of T is just the preimage of 0, T−1(0) (Definition PI). Here is an example.
🔗

Example NKAO. Nontrivial kernel, Archetype O.

Archetype O is the linear transformation
T:C3→C5,T([x1x2x3])=[−x1+x2−3x3−x1+2x2−4x3x1+x2+x32x1+3x2+x3x1+2x3].
To determine the elements of C3 in K(T), find those vectors u such that T(u)=0, that is,
T(u)=0[−u1+u2−3u3−u1+2u2−4u3u1+u2+u32u1+3u2+u3u1+2u3]=[00000].
Vector equality (Definition CVE) leads us to a homogeneous system of 5 equations in the variables ui,
−u1+u2−3u3=0−u1+2u2−4u3=0u1+u2+u3=02u1+3u2+u3=0u1+2u3=0.
Row-reducing the coefficient matrix gives
[10201−1000000000].
The kernel of T is the set of solutions to this homogeneous system of equations, which by Theorem BNS can be expressed as
K(T)=⟨{[−211]}⟩.
We know that the span of a set of vectors is always a subspace (Theorem SSS), so the kernel computed in Example NKAO is also a subspace. This is no accident, the kernel of a linear transformation is always a subspace.
🔗

Proof.

We can apply the three-part test of Theorem TSS. First T(0U)=0V by Theorem LTTZZ, so 0U∈K(T) and we know that the kernel is nonempty.
Suppose we assume that x,y∈K(T). Is x+y∈K(T)? We have
T(x+y)=T(x)+T(y)Definition LT=0+0x,y∈K(T)=0Property Z.
This qualifies x+y for membership in K(T). So we have additive closure.
Suppose we assume that α∈C and x∈K(T). Is αx∈K(T)? We have
T(αx)=αT(x)Definition LT=α0x∈K(T)=0Theorem ZVSM.
This qualifies αx for membership in K(T). So we have scalar closure and Theorem TSS tells us that K(T) is a subspace of U.
Let us compute another kernel, now that we know in advance that it will be a subspace.
🔗

Example TKAP. Trivial kernel, Archetype P.

Archetype P is the linear transformation
T:C3→C5,T([x1x2x3])=[−x1+x2+x3−x1+2x2+2x3x1+x2+3x32x1+3x2+x3−2x1+x2+3x3].
To determine the elements of C3 in K(T), find those vectors u such that T(u)=0, that is,
T(u)=0[−u1+u2+u3−u1+2u2+2u3u1+u2+3u32u1+3u2+u3−2u1+u2+3u3]=[00000].
Vector equality (Definition CVE) leads us to a homogeneous system of 5 equations in the variables ui,
−u1+u2+u3=0−u1+2u2+2u3=0u1+u2+3u3=02u1+3u2+u3=0−2u1+u2+3u3=0.
Row-reducing the coefficient matrix gives
[100010001000000].
The kernel of T is the set of solutions to this homogeneous system of equations, which is simply the trivial solution u=0, so
K(T)={0}=⟨{ }⟩.
Our next theorem says that if a preimage is a nonempty set then we can construct it by picking any one element and adding on elements of the kernel.
🔗

Proof.

Let M={u+z|z∈K(T)}. First, we show that M⊆T−1(v). Suppose that w∈M, so w has the form w=u+z, where z∈K(T). Then
T(w)=T(u+z)=T(u)+T(z)Definition LT=v+0u∈T−1(v), z∈K(T)=vProperty Z
which qualifies w for membership in the preimage of v, w∈T−1(v).
For the opposite inclusion, suppose x∈T−1(v). Then,
T(x−u)=T(x)−T(u)Definition LT=v−vx,u∈T−1(v)=0.
This qualifies x−u for membership in the kernel of T, K(T). So there is a vector z∈K(T) such that x−u=z. Rearranging this equation gives x=u+z and so x∈M. So T−1(v)⊆M and we see that M=T−1(v), as desired.
This theorem, and its proof, should remind you very much of Theorem PSPHS. Additionally, you might go back and review Example SPIAS. Can you tell now which is the only preimage to be a subspace?
🔗
Here is the cartoon which describes the “many-to-one” behavior of a typical linear transformation. Presume that T(ui)=vi, for i=1,2,3, and as guaranteed by Theorem LTTZZ, T(0U)=0V. Then four preimages are depicted, each labeled slightly different. T−1(v2) is the most general, employing Theorem KPI to provide two equal descriptions of the set. The most unusual is T−1(0V) which is equal to the kernel, K(T), and hence is a subspace (by Theorem KLTS). The subdivisions of the domain, U, are meant to suggest the partioning of the domain by the collection of preimages. It also suggests that each preimage is of similar size or structure, since each is a “shifted” copy of the kernel. Notice that we cannot speak of the dimension of a preimage, since it is almost never a subspace. Also notice that x,y∈V are elements of the codomain with empty preimages.
🔗
svg
Figure KPI. Kernel and Preimage
🔗
The next theorem is one we will cite frequently, as it characterizes injections by the size of the kernel.
🔗

Proof.

(⇒) 
We assume T is injective and we need to establish that two sets are equal (Definition SE). Since the kernel is a subspace (Theorem KLTS), {0}⊆K(T). To establish the opposite inclusion, suppose x∈K(T). We have
T(x)=0Definition KLT=T(0)Theorem LTTZZ.
We can apply Definition ILT to conclude that x=0. Therefore K(T)⊆{0} and by Definition SE, K(T)={0}.
(⇐) 
To establish that T is injective, appeal to Definition ILT and begin with the assumption that T(x)=T(y). Then
T(x−y)=T(x)−T(y)Definition LT=0Hypothesis.
So x−y∈K(T) by Definition KLT and with the hypothesis that the kernel is trivial we conclude that x−y=0. Then
y=y+0=y+(x−y)=x
thus establishing that T is injective by Definition ILT.
You might begin to think about how Figure KPI would change if the linear transformation is injective, which would make the kernel trivial by Theorem KILT.
🔗

Example NIAQR. Not injective, Archetype Q, revisited.

We are now in a position to revisit our first example in this section, Example NIAQ. In that example, we showed that Archetype Q is not injective by constructing two vectors, which when used to evaluate the linear transformation provided the same output, thus violating Definition ILT. Just where did those two vectors come from?
The key is the vector
z=[34133]
which you can check is an element of K(T) for Archetype Q. Choose a vector x at random, and then compute y=x+z (verify this computation back in Example NIAQ). Then
T(y)=T(x+z)=T(x)+T(z)Definition LT=T(x)+0z∈K(T)=T(x)Property Z.
Whenever the kernel of a linear transformation is nontrivial, we can employ this device and conclude that the linear transformation is not injective. This is another way of viewing Theorem KILT. For an injective linear transformation, the kernel is trivial and our only choice for z is the zero vector, which will not help us create two different inputs for T that yield identical outputs. For every one of the archetypes that is not injective, there is an example presented of exactly this form.

Example NIAO. Not injective, Archetype O.

In Example NKAO the kernel of Archetype O was determined to be
⟨{[−211]}⟩
a subspace of C3 with dimension 1. Since the kernel is not trivial, Theorem KILT tells us that T is not injective.

Example IAP. Injective, Archetype P.

In Example TKAP it was shown that the linear transformation in Archetype P has a trivial kernel. So by Theorem KILT, T is injective.

Sage ILT. Injective Linear Transformations.

By now, you have probably already figured out how to determine if a linear transformation is injective, and what its kernel is. You may also now begin to understand why Sage calls the null space of a matrix a kernel. Here are two examples, first a reprise of Example NKAO.
So we have a concrete demonstration of one half of Theorem KILT. Here is the second example, a do-over for Example TKAP, but renamed as S.
And so we have a concrete demonstration of the other half of Theorem KILT.
Now that we have Theorem KPI, we can return to our discussion from Sage PI. The .preimage_representative() method of a linear transformation will give us a single element of the preimage, with no other guarantee about the nature of that element. That is fine, since this is all Theorem KPI requires (in addition to the kernel). Remember that not every element of the codomain may have a nonempty preimage (as indicated in the hypotheses of Theorem KPI). Here is an example using T from above, with a choice of a codomain element that has a nonempty preimage.
Now the following will create random elements of the preimage of v, which can be verified by the test always returning True. Use the compute cell just below if you are curious what p looks like.
As suggested, some choices of v can lead to empty preimages, in which case Theorem KPI does not even apply.
The situation is less interesting for an injective linear transformation. Still, preimages may be empty, but when they are nonempty, they are just singletons (a single element) since the kernel is empty. So a repeat of the above example, with S rather than T, would not be very informative.
🔗

Subsection ILTLI Injective Linear Transformations and Linear Independence

There is a connection between injective linear transformations and linearly independent sets that we will make precise in the next two theorems. However, more informally, we can get a feel for this connection when we think about how each property is defined. A set of vectors is linearly independent if the only relation of linear dependence is the trivial one. A linear transformation is injective if the only way two input vectors can produce the same output is in the trivial way, when both input vectors are equal.
🔗

Proof.

Begin with a relation of linear dependence on R (Definition RLD, Definition LI),
a1T(u1)+a2T(u2)+a3T(u3)+…+atT(ut)=0T(a1u1+a2u2+a3u3+⋯+atut)=0Theorem LTLCa1u1+a2u2+a3u3+⋯+atut∈K(T)Definition KLTa1u1+a2u2+a3u3+⋯+atut∈{0}Theorem KILTa1u1+a2u2+a3u3+⋯+atut=0Definition SET.
Since this is a relation of linear dependence on the linearly independent set S, we can conclude that
a1=0a2=0a3=0…at=0
and this establishes that R is a linearly independent set.
It is instructive to compare the proof of this theorem with the solution to Exercise MM.T80.

Proof.

(⇒) 
Assume T is injective. Since B is a basis, we know B is linearly independent (Definition B). Then Theorem ILTLI says that C is a linearly independent subset of V.
(⇐) 
Assume that C is linearly independent. To establish that T is injective, we will show that the kernel of T is trivial (Theorem KILT). Suppose that u∈K(T). As an element of U, we can write u as a linear combination of the basis vectors in B (uniquely). So there are are scalars, a1,a2,a3,…,am, such that
u=a1u1+a2u2+a3u3+⋯+amum.
Then,
0=T(u)Definition KLT=T(a1u1+a2u2+a3u3+⋯+amum)Definition SSVS=a1T(u1)+a2T(u2)+a3T(u3)+⋯+amT(um)Theorem LTLC.
This is a relation of linear dependence (Definition RLD) on the linearly independent set C, so the scalars are all zero: a1=a2=a3=⋯=am=0. Then
u=a1u1+a2u2+a3u3+⋯+amum=0u1+0u2+0u3+⋯+0umTheorem ZSSM=0+0+0+⋯+0Theorem ZSSM=0Property Z.
Since u was chosen as an arbitrary vector from K(T), we have K(T)={0} and Theorem KILT tells us that T is injective.
🔗

Subsection ILTD Injective Linear Transformations and Dimension

Proof.

Suppose to the contrary that m=dim⁡(U)>dim⁡(V)=t. Let B be a basis of U, which will then contain m vectors. Apply T to each element of B to form a set C that is a subset of V. By Theorem ILTB, C is linearly independent and therefore must contain m distinct vectors. So we have found a set of m linearly independent vectors in V, a vector space of dimension t, with m>t. However, this contradicts Theorem G, so our assumption is false and dim⁡(U)≤dim⁡(V).

Example NIDAU. Not injective by dimension, Archetype U.

The linear transformation in Archetype U is
T:M23→C4,T([abcdef])=[a+2b+12c−3d+e+6f2a−b−c+d−11fa+b+7c+2d+e−3fa+2b+12c+5e−5f].
Since dim⁡(M23)=6>4=dim⁡(C4), T cannot be injective for then T would violate Theorem ILTD.
Notice that the previous example made no use of the actual formula defining the function. Merely a comparison of the dimensions of the domain and codomain is enough to conclude that the linear transformation is not injective. Archetype M and Archetype N are two more examples of linear transformations that have “big” domains and “small” codomains, resulting in “collisions” of outputs and thus are non-injective linear transformations.
🔗
🔗

Subsection CILT Composition of Injective Linear Transformations

In Subsection LT.NLTFO we saw how to combine linear transformations to build new linear transformations, specifically, how to build the composition of two linear transformations (Definition LTC). It will be useful later to know that the composition of injective linear transformations is again injective, so we prove that here.
🔗

Proof.

That the composition is a linear transformation was established in Theorem CLTLT, so we need only establish that the composition is injective. Applying Definition ILT, choose x, y from U. Then if (S∘T)(x)=(S∘T)(y),
⇒S(T(x))=S(T(y))Definition LTC⇒T(x)=T(y)Definition ILT for S⇒x=yDefinition ILT for T.

Sage CILT. Composition of Injective Linear Transformations.

One way to use Sage is to construct examples of theorems and verify the conclusions. Sometimes you will get this wrong: you might build an example that does not satisfy the hypotheses, or your example may not satisfy the conclusions. This may be because you are not using Sage properly, or because you do not understand a definition or a theorem, or in very limited cases you may have uncovered a bug in Sage (which is always the preferred explanation!). But in the process of trying to understand a discrepancy or unexpected result, you will learn much more, both about linear algebra and about Sage. And Sage is incredibly patient — it will stay up with you all night to help you through a rough patch.
Let us illustrate the above in the context of Theorem CILTI. The hypotheses indicate we need two injective linear transformations. Where will get two such linear transformations? Well, the contrapositive of Theorem ILTD tells us that if the dimension of the domain exceeds the dimension of the codomain, we will never be injective. So we should at a minimum avoid this scenario. We can build two linear transformations from matrices created randomly, and just hope that they lead to injective linear transformations. Here is an example of how we create examples like this. The random matrix has single-digit entries, and almost always will lead to an injective linear transformation, though we cannot be absolutely certain. Evaluate this cell repeatedly, to see how rarely the result is not injective.
Our concrete example below was created this way, so here we go.
🔗

Reading Questions ILT Reading Questions

1. Why Not Injective?

Suppose T:C8→C5 is a linear transformation. Why is T not injective?
🔗
🔗

2. Kernel of an Injective Linear Transformation.

Describe the kernel of an injective linear transformation.
🔗
🔗
🔗

Exercises ILT Exercises

C10.

Each archetype below is a linear transformation. Compute the kernel for each.
🔗
Archetype M, Archetype N, Archetype O, Archetype P, Archetype Q, Archetype R, Archetype S, Archetype T, Archetype U, Archetype V, Archetype W, Archetype X
🔗
🔗

C20.

The linear transformation T:C4→C3 is not injective. Find two inputs x,y∈C4 that yield the same output (that is T(x)=T(y)).
🔗
T([x1x2x3x4])=[2x1+x2+x3−x1+3x2+x3−x43x1+x2+2x3−2x4].
🔗
Solution.
A linear transformation that is not injective will have a nontrivial kernel (Theorem KILT), and this is the key to finding the desired inputs. We need one nontrivial element of the kernel, so suppose that z∈C4 is an element of the kernel,
[000]=0=T(z)=[2z1+z2+z3−z1+3z2+z3−z43z1+z2+2z3−2z4].
Vector equality Definition CVE leads to the homogeneous system of three equations in four variables,
2z1+z2+z3=0−z1+3z2+z3−z4=03z1+z2+2z3−2z4=0.
The coefficient matrix of this system row-reduces as
[2110−131−1312−2]→RREF[10010101001−3].
From this we can find a solution (we only need one), that is an element of K(T),
z=[−1−131].
Now, we choose a vector x at random and set y=x+z,
x=[234−2]y=x+z=[234−2]+[−1−131]=[127−1]
and you can check that
T(x)=[111321]=T(y).
A quicker solution is to take two elements of the kernel (in this case, scalar multiples of z) which both get sent to 0 by T. Quicker yet, take 0 and z as x and y, which also both get sent to 0 by T.
🔗

C25.

Define the linear transformation
🔗
T:C3→C2,T([x1x2x3])=[2x1−x2+5x3−4x1+2x2−10x3].
Find a basis for the kernel of T, K(T). Is T injective?
🔗
🔗
Solution.
To find the kernel, we require all x∈C3 such that T(x)=0. This condition is
[2x1−x2+5x3−4x1+2x2−10x3]=[00].
This leads to a homogeneous system of two linear equations in three variables, whose coefficient matrix row-reduces to
[1−1252000].
With two free variables Theorem BNS yields the basis for the null space
{[−5201],[1210]}.
With n(T)≠0, K(T)≠{0}, so Theorem KILT says T is not injective.
🔗

C26.

Let
🔗
A=[123102−110112−1−2113212]
and let T:C5→C4 be given by T(x)=Ax. Is T injective? (Hint: No calculation is required.)
🔗
🔗
Solution.
By Theorem ILTD, if a linear transformation T:U→V is injective, then dim⁡(U)≤dim⁡(V). In this case, T:C5→C4, and 5=dim⁡(C5)>dim⁡(C4)=4. Thus, T cannot possibly be injective.
🔗

C27.

Let T:C3→C3 be given by T([xyz])=[2x+y+zx−y+2zx+2y−z]. Find K(T). Is T injective?
🔗
Solution.
If T([xyz])=0, then [2x+y+zx−y+2zx+2y−z]=0. Thus, we have the system
2x+y+z=0x−y+2z=0x+2y−z=0.
Thus, we are looking for the null space of the matrix
AT=[2111−1212−1].
Since AT row-reduces to
[10101−1000],
the kernel of T is all vectors where x=−z and y=z. Thus, K(T)=⟨{[−111]}⟩.
Since the kernel is not trivial, Theorem KILT tells us that T is not injective.
🔗

C28.

Let
🔗
A=[12312−11012−1−21321]
and let T:C4→C4 be given by T(x)=Ax. Find K(T). Is T injective?
🔗
🔗
Solution.
Since T is given by matrix multiplication, K(T)=N(A). We have
[12312−11012−1−21321]→RREF[1000010000100001].
The null space of A is {0}, so the kernel of T is also trivial: K(T)={0}.
🔗

C29.

Let
🔗
A=[1211211012121211]
and let T:C4→C4 be given by T(x)=Ax. Find K(T). Is T injective?
🔗
🔗
Solution.
Since T is given by matrix multiplication, K(T)=N(A). We have
[1211211012121211]→RREF[101/30011/3000010000].
Thus, a basis for the null space of A is {[−1−130]}, and the kernel is K(T)=⟨{[−1−130]}⟩. Since the kernel is nontrivial, this linear transformation is not injective.
🔗

C30.

Let T:M22→P2 be given by T([abcd])=(a+b)+(a+c)x+(a+d)x2. Is T injective? Find K(T).
🔗
Solution.
We can see without computing that T is not injective, since the dimension of M22 is larger than the dimension of P2. However, that does not address the question of the kernel of T. We need to find all matrices [abcd] so that (a+b)+(a+c)x+(a+d)x2=0. This means a+b=0, a+c=0, and a+d=0, or equivalently, b=d=c=−a. Thus, the kernel is a one-dimensional subspace of M22 spanned by [1−1−1−1]. Symbolically, we have K(T)=⟨{[1−1−1−1]}⟩.
🔗

C31.

Given that the linear transformation T:C3→C3, T([xyz])=[2x+y2y+zx+2z] is injective, show directly that
🔗
{T(e1),T(e2),T(e3)}
is a linearly independent set.
🔗
🔗
Solution.
We have
T(e1)=[201]T(e2)=[120]T(e3)=[012].
Let us put these vectors into a matrix and row reduce to test their linear independence.
[210021102]→RREF[100010001]
so the set of vectors {T(e1),T(e2),T(e3)} is linearly independent.
🔗

C32.

Given that the linear transformation T:C2→C3, T([xy])=[x+y2x+yx+2y] is injective, show directly that
🔗
{T(e1),T(e2)}
is a linearly independent set.
🔗
🔗
Solution.
We have T(e1)=[121] and T(e2)=[112]. Putting these into a matrix as columns and row-reducing, we have
[112112]→RREF[100100].
Thus, the set of vectors {T(e1),T(e2)} is linearly independent.
🔗

C33.

Given that the linear transformation T:C3→C5,
🔗
T([xyz])=[132011121101312][xyz]
is injective, show directly that
🔗
{T(e1),T(e2),T(e3)}
is a linearly independent set.
🔗
🔗
Solution.
We have
T(e1)=[10113]T(e2)=[31201]T(e3)=[21112].
Apply Theorem LIVRN to test the linear independence of T.
[132011121101312]→RREF[100010001000000]
so since r=3=n, the set of vectors {T(e1),T(e2),T(e3)} is linearly independent.
🔗

C40.

Show that the linear transformation R is not injective by finding two different elements of the domain, x and y, such that R(x)=R(y). (S22 is the vector space of symmetric 2×2 matrices.)
🔗
R:S22→P1R([abbc])=(2a−b+c)+(a+b+2c)x.
🔗
Solution.
We choose x to be any vector we like. A particularly cocky choice would be to choose x=0, but we will instead choose
x=[2−1−14].
Then R(x)=9+9x. Now compute the kernel of R, which by Theorem KILT we expect to be nontrivial. Setting R([abbc]) equal to the zero vector, 0=0+0x, and equating coefficients leads to a homogeneous system of equations. Row-reducing the coefficient matrix of this system will allow us to determine the values of a, b and c that create elements of the null space of R,
[2−11112]→RREF[101011].
We only need a single element of the null space of this coefficient matrix, so we will not compute a precise description of the whole null space. Instead, choose the free variable c=2. Then
z=[−2−2−22]
is the corresponding element of the kernel. We compute the desired y as
y=x+z=[2−1−14]+[−2−2−22]=[0−3−36].
Then check that R(y)=9+9x.
🔗

M60.

Suppose U and V are vector spaces. Define the function Z:U→V by Z(u)=0V for every u∈U. Then by Exercise LT.M60, Z is a linear transformation. Formulate a condition on U that is equivalent to Z being an injective linear transformation. In other words, fill in the blank to complete the following statement (and then give a proof): Z is injective if and only if U is . (See Exercise SLT.M60, Exercise IVLT.M60.)
🔗
🔗

T10.

Suppose T:U→V is a linear transformation. For which vectors v∈V is T−1(v) a subspace of U?
🔗
Solution.
Suppose that T−1(v) is a subspace of U. Then 0∈T−1(v) by Property Z, which we can rearrange to say T(0)=v. We know from Theorem LTTZZ that T(0)=0. Putting these together we have
v=T(0)=0.
So our hypothesis that the preimage is a subspace has led to the conclusion that v could only be one vector, the zero vector. We still need to verify that T−1(0) is indeed a subspace, but since T−1(0)=K(T) this is just Theorem KLTS.
🔗

T15.

Suppose that T:U→V and S:V→W are linear transformations. Prove the following relationship between kernels.
🔗
K(T)⊆K(S∘T).
🔗
Solution.
We are asked to prove that K(T) is a subset of K(S∘T). Employing Definition SSET, choose x∈K(T). Then we know that T(x)=0. So
(S∘T)(x)=S(T(x))Definition LTC=S(0)x∈K(T)=0Theorem LTTZZ.
This qualifies x for membership in K(S∘T).
🔗

T20.

Suppose that A is an m×n matrix. Define the linear transformation T by
🔗
T:Cn→Cm,T(x)=Ax.
Prove that the kernel of T equals the null space of A, K(T)=N(A).
🔗
🔗
Solution.
This is an equality of sets, so we want to establish two subset conditions (Definition SE).
First, show N(A)⊆K(T). Choose x∈N(A). Check to see if x∈K(T),
T(x)=AxDefinition of T=0x∈N(A).
So by Definition KLT, x∈K(T) and thus N(A)⊆K(T).
Now, show K(T)⊆N(A). Choose x∈K(T). Check to see if x∈N(A),
Ax=T(x)Definition of T=0x∈K(T).
So by Definition NSM, x∈N(A) and thus K(T)⊆N(A).
🔗
🔗
You have attempted 1 of 4 activities on this page.
🔗
PrevTopNext