Section ILT  Injective Linear Transformations

From A First Course in Linear Algebra
Version 2.90
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/

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.

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\left (x\right ) = T\left (y\right ), 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) = {x}^{2} and the inputs x = 3 and x = −3). For an injective function, this never happens. If we have equal outputs (T\left (x\right ) = T\left (y\right )) 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

Notice that for

So we have two vectors from the domain, x\mathrel{≠}y, yet T\left (x\right ) = T\left (y\right ), 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’s a cartoon of a non-injective linear transformation. Notice that the central feature of this cartoon is that T\left (u\right ) = v = T\left (w\right ). 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.

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

To establish that R is injective we must begin with the assumption that T\left (x\right ) = T\left (y\right ) and somehow arrive from this at the conclusion that x = y. Here we go,

Now we recognize that we have a homogeneous system of 5 equations in 5 variables (the terms {x}_{i} − {y}_{i} are the variables), so we row-reduce the coefficient matrix to

So the only solution is the trivial solution

and we conclude that indeed x = y. By Definition ILT, T is injective. ⊠

Here’s 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.

Let’s now examine an injective linear transformation between abstract vector spaces.

Example IAV
Injective, Archetype V
Archetype V is defined by

To establish that the linear transformation is injective, begin by supposing that two polynomial inputs yield the same output matrix,

Then

This single matrix equality translates to the homogeneous system of equations in the variables {a}_{i} − {b}_{i},

This system of equations can be rewritten as the matrix equation

Since the coefficient matrix is nonsingular (check this) the only solution is trivial, i.e.

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’s 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

(This definition contains Notation KLT.) △

Notice that the kernel of T is just the preimage of 0, {T}^{−1}\left (0\right ) (Definition PI). Here’s an example.

Example NKAO
Nontrivial kernel, Archetype O
Archetype O is the linear transformation

To determine the elements of {ℂ}^{3} in K\kern -1.95872pt \left (T\right ), find those vectors u such that T\left (u\right ) = 0, that is,

Vector equality (Definition CVE) leads us to a homogeneous system of 5 equations in the variables {u}_{i},

Row-reducing the coefficient matrix gives

The kernel of T is the set of solutions to this homogeneous system of equations, which by Theorem BNS can be expressed as

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.

Theorem KLTS
Kernel of a Linear Transformation is a Subspace
Suppose that T : U → V is a linear transformation. Then the kernel of T, K\kern -1.95872pt \left (T\right ), is a subspace of U. □

Proof   We can apply the three-part test of Theorem TSS. First T\left ({0}_{U}\right ) = {0}_{V } by Theorem LTTZZ, so {0}_{U} ∈K\kern -1.95872pt \left (T\right ) and we know that the kernel is non-empty.

Suppose we assume that x,\kern 1.95872pt y ∈K\kern -1.95872pt \left (T\right ). Is x + y ∈K\kern -1.95872pt \left (T\right )?

This qualifies x + y for membership in K\kern -1.95872pt \left (T\right ). So we have additive closure.

Suppose we assume that α ∈ {ℂ}^{} and x ∈K\kern -1.95872pt \left (T\right ). Is αx ∈K\kern -1.95872pt \left (T\right )?

This qualifies αx for membership in K\kern -1.95872pt \left (T\right ). So we have scalar closure and Theorem TSS tells us that K\kern -1.95872pt \left (T\right ) is a subspace of U. ■

Let’s 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

To determine the elements of {ℂ}^{3} in K\kern -1.95872pt \left (T\right ), find those vectors u such that T\left (u\right ) = 0, that is,

Vector equality (Definition CVE) leads us to a homogeneous system of 5 equations in the variables {u}_{i},

Row-reducing the coefficient matrix gives

The kernel of T is the set of solutions to this homogeneous system of equations, which is simply the trivial solution u = 0, so

Our next theorem says that if a preimage is a non-empty set then we can construct it by picking any one element and adding on elements of the kernel.

Theorem KPI
Kernel and Pre-Image
Suppose T : U → V is a linear transformation and v ∈ V . If the preimage {T}^{−1}\left (v\right ) is non-empty, and u ∈ {T}^{−1}\left (v\right ) then

Proof   Let M = \left \{\left .u + z\right \vert z ∈K\kern -1.95872pt \left (T\right )\right \}. First, we show that M ⊆ {T}^{−1}\left (v\right ). Suppose that w ∈ M, so w has the form w = u + z, where z ∈K\kern -1.95872pt \left (T\right ). Then

which qualifies w for membership in the preimage of v, w ∈ {T}^{−1}\left (v\right ).

For the opposite inclusion, suppose x ∈ {T}^{−1}\left (v\right ). Then,

This qualifies x − u for membership in the kernel of T, K\kern -1.95872pt \left (T\right ). So there is a vector z ∈K\kern -1.95872pt \left (T\right ) such that x − u = z. Rearranging this equation gives x = u + z and so x ∈ M. So {T}^{−1}\left (v\right ) ⊆ M and we see that M = {T}^{−1}\left (v\right ), 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?

The next theorem is one we will cite frequently, as it characterizes injections by the size of the kernel.

Theorem KILT
Kernel of an Injective Linear Transformation
Suppose that T : U → V is a linear transformation. Then T is injective if and only if the kernel of T is trivial, K\kern -1.95872pt \left (T\right ) = \left \{0\right \}. □

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), \left \{0\right \} ⊆K\kern -1.95872pt \left (T\right ). To establish the opposite inclusion, suppose x ∈K\kern -1.95872pt \left (T\right ).

We can apply Definition ILT to conclude that x = 0. Therefore K\kern -1.95872pt \left (T\right ) ⊆\left \{0\right \} and by Definition SE, K\kern -1.95872pt \left (T\right ) = \left \{0\right \}.

( ⇐) To establish that T is injective, appeal to Definition ILT and begin with the assumption that T\left (x\right ) = T\left (y\right ). Then

So x − y ∈K\kern -1.95872pt \left (T\right ) by Definition KLT and with the hypothesis that the kernel is trivial we conclude that x − y = 0. Then

thus establishing that T is injective by Definition ILT. ■

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

which you can check is an element of K\kern -1.95872pt \left (T\right ) for Archetype Q. Choose a vector x at random, and then compute y = x + z (verify this computation back in Example NIAQ). Then

Whenever the kernel of a linear transformation is non-trivial, 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

a subspace of {ℂ}^{3} 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. ⊠

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.

Theorem ILTLI
Injective Linear Transformations and Linear Independence
Suppose that T : U → V is an injective linear transformation and S = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{t}\right \} is a linearly independent subset of U. Then R = \left \{T\left ({u}_{1}\right ),\kern 1.95872pt T\left ({u}_{2}\right ),\kern 1.95872pt T\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt T\left ({u}_{t}\right )\right \} is a linearly independent subset of V . □

Proof   Begin with a relation of linear dependence on R (Definition RLD, Definition LI),

Since this is a relation of linear dependence on the linearly independent set S, we can conclude that

and this establishes that R is a linearly independent set. ■

Theorem ILTB
Injective Linear Transformations and Bases
Suppose that T : U → V is a linear transformation and B = \left \{{u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {u}_{m}\right \} is a basis of U. Then T is injective if and only if C = \left \{T\left ({u}_{1}\right ),\kern 1.95872pt T\left ({u}_{2}\right ),\kern 1.95872pt T\left ({u}_{3}\right ),\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt T\left ({u}_{m}\right )\right \} is a linearly independent subset of V . □

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\kern -1.95872pt \left (T\right ). 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, {a}_{1},\kern 1.95872pt {a}_{2},\kern 1.95872pt {a}_{3},\kern 1.95872pt \mathop{\mathop{…}},\kern 1.95872pt {a}_{m}, such that

Then,

This is a relation of linear dependence (Definition RLD) on the linearly independent set C, so the scalars are all zero: {a}_{1} = {a}_{2} = {a}_{3} = \mathrel{⋯} = {a}_{m} = 0. Then

Since u was chosen as an arbitrary vector from K\kern -1.95872pt \left (T\right ), we have K\kern -1.95872pt \left (T\right ) = \left \{0\right \} and Theorem KILT tells us that T is injective. ■

Subsection ILTD: Injective Linear Transformations and Dimension

Theorem ILTD
Injective Linear Transformations and Dimension
Suppose that T : U → V is an injective linear transformation. Then \mathop{ dim}\nolimits \left (U\right ) ≤\mathop{ dim}\nolimits \left (V \right ). □

Proof   Suppose to the contrary that m =\mathop{ dim}\nolimits \left (U\right ) >\mathop{ dim}\nolimits \left (V \right ) = 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 \mathop{ dim}\nolimits \left (U\right ) ≤\mathop{ dim}\nolimits \left (V \right ). ■

Example NIDAU
Not injective by dimension, Archetype U
The linear transformation in Archetype U is

Since \mathop{ dim}\nolimits \left ({M}_{23}\right ) = 6 > 4 =\mathop{ dim}\nolimits \left ({ℂ}^{4}\right ), 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 are 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.

Theorem CILTI
Composition of Injective Linear Transformations is Injective
Suppose that T : U → V and S : V → W are injective linear transformations. Then (S ∘ T): U → W is an injective linear transformation. □

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 \left (S ∘ T\right )\left (x\right ) = \left (S ∘ T\right )\left (y\right ),

Subsection READ: Reading Questions

1. Suppose T : {ℂ}^{8} → {ℂ}^{5} is a linear transformation. Why can’t T be injective?
2. Describe the kernel of an injective linear transformation.
3. Theorem KPI should remind you of Theorem PSPHS. Why do we say this?

Subsection EXC: 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
 
Contributed by Robert Beezer

C20 The linear transformation T : {ℂ}^{4} → {ℂ}^{3} is not injective. Find two inputs x,\kern 1.95872pt y ∈ {ℂ}^{4} that yield the same output (that is T\left (x\right ) = T\left (y\right )).

 
Contributed by Robert Beezer Solution [1495]

C25 Define the linear transformation

Find a basis for the kernel of T, K\kern -1.95872pt \left (T\right ). Is T injective?  
Contributed by Robert Beezer Solution [1497]

C26 Let A = \left [\array{ 1& 2 & 3 & 1 &0\cr 2&−1 & 1 & 0 &1 \cr 1& 2 &−1&−2&1\cr 1& 3 & 2 & 1 &2 } \right ] and let T : {ℂ}^{5} → {ℂ}^{4} be given by T\left (x\right ) = Ax. Is T injective? (Hint: No calculation is required.)

 
Contributed by Chris Black Solution [1499]

C27 Let T : {ℂ}^{3} → {ℂ}^{3} be given by T\left (\left [\array{ x\cr y \cr z } \right ]\right ) = \left [\array{ 2x + y + z \cr x − y + 2z \cr x + 2y − z } \right ]. Find K\kern -1.95872pt \left (T\right ). Is T injective?  
Contributed by Chris Black Solution [1499]

C28 Let A = \left [\array{ 1& 2 & 3 & 1\cr 2&−1 & 1 & 0 \cr 1& 2 &−1&−2\cr 1& 3 & 2 & 1 } \right ] and let T : {ℂ}^{4} → {ℂ}^{4} be given by T\left (x\right ) = Ax. Find K\kern -1.95872pt \left (T\right ). Is T injective?  
Contributed by Chris Black Solution [1500]

C29 Let A = \left [\array{ 1&2&1&1\cr 2&1 &1 &0 \cr 1&2&1&2\cr 1&2 &1 &1 } \right ] and let T : {ℂ}^{4} → {ℂ}^{4} be given by T\left (x\right ) = Ax. Find K\kern -1.95872pt \left (T\right ). Is T injective?  
Contributed by Chris Black Solution [1500]

C30 Let T : {M}_{2,2} → {P}_{2} be given by T\left (\left [\array{ a&b\cr c&d } \right ]\right ) = (a+b)+(a+c)x+(a+d){x}^{2}. Is T injective? Find K\kern -1.95872pt \left (T\right ).  
Contributed by Chris Black Solution [1501]

C31 Given that the linear transformation T : {ℂ}^{3} → {ℂ}^{3}, T\left (\left [\array{ x\cr y \cr z } \right ]\right ) = \left [\array{ 2x + y \cr 2y + z \cr x + 2z } \right ]is injective, show directly that \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{2}\right ),\kern 1.95872pt T\left ({e}_{3}\right )\right \} is a linearly independent set.  
Contributed by Chris Black Solution [1502]

C32 Given that the linear transformation T : {ℂ}^{2} → {ℂ}^{3}, T\left (\left [\array{ x\cr y } \right ]\right ) = \left [\array{ x + y \cr 2x + y \cr x + 2y } \right ]is injective, show directly that \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{2}\right )\right \} is a linearly independent set.  
Contributed by Chris Black Solution [1502]

C33 Given that the linear transformation T : {ℂ}^{3} → {ℂ}^{5}, T\left (\left [\array{ x\cr y \cr z } \right ]\right ) = \left [\array{ 1&3&2\cr 0&1 &1 \cr 1&2&1\cr 1&0 &1 \cr 3&1&2} \right ]\left [\array{ x\cr y \cr z } \right ]is injective, show directly that \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{2}\right ),\kern 1.95872pt T\left ({e}_{3}\right )\right \} is a linearly independent set.  
Contributed by Chris Black Solution [1503]

C40 Show that the linear transformation R is not injective by finding two different elements of the domain, x and y, such that R\left (x\right ) = R\left (y\right ). ({S}_{22} is the vector space of symmetric 2 × 2 matrices.)

 
Contributed by Robert Beezer Solution [1504]

M60 Suppose U and V are vector spaces. Define the function Z : U → V by T\left (u\right ) = {0}_{V } 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.)  
Contributed by Robert Beezer

T10 Suppose T : U → V is a linear transformation. For which vectors v ∈ V is {T}^{−1}\left (v\right ) a subspace of U?  
Contributed by Robert Beezer

T15 Suppose that that T : U → V and S : V → W are linear transformations. Prove the following relationship between kernels.

 
Contributed by Robert Beezer Solution [1506]

T20 Suppose that A is an m × n matrix. Define the linear transformation T by

Prove that the kernel of T equals the null space of A, K\kern -1.95872pt \left (T\right ) = N\kern -1.95872pt \left (A\right ).  
Contributed by Andy Zimmer Solution [1506]

Subsection SOL: Solutions

C20 Contributed by Robert Beezer Statement [1489]
A linear transformation that is not injective will have a non-trivial kernel (Theorem KILT), and this is the key to finding the desired inputs. We need one non-trivial element of the kernel, so suppose that z ∈ {ℂ}^{4} is an element of the kernel,

Vector equality Definition CVE leads to the homogeneous system of three equations in four variables,

The coefficient matrix of this system row-reduces as

From this we can find a solution (we only need one), that is an element of K\kern -1.95872pt \left (T\right ),

Now, we choose a vector x at random and set y = x + z,

and you can check that

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 Contributed by Robert Beezer Statement [1489]
To find the kernel, we require all x ∈ {ℂ}^{3} such that T\left (x\right ) = 0. This condition is

This leads to a homogeneous system of two linear equations in three variables, whose coefficient matrix row-reduces to

With two free variables Theorem BNS yields the basis for the null space

With n\left (T\right )\mathrel{≠}0, K\kern -1.95872pt \left (T\right )\mathrel{≠}\left \{0\right \}, so Theorem KILT says T is not injective.

C26 Contributed by Chris Black Statement [1490]
By Theorem ILTD, if a linear transformation T : U → V is injective, then \mathop{ dim}\nolimits (U) ≤\mathop{ dim}\nolimits (V ). In this case, T : {ℂ}^{5} → {ℂ}^{4}, and 5 =\mathop{ dim}\nolimits \left ({ℂ}^{5}\right ) >\mathop{ dim}\nolimits \left ({ℂ}^{4}\right ) = 4. Thus, T cannot possibly be injective.

C27 Contributed by Chris Black Statement [1490]
If T\left (\left [\array{ x\cr y \cr z } \right ]\right ) = 0, then \left [\array{ 2x + y + z \cr x − y + 2z \cr x + 2y − z } \right ] = 0. Thus, we have the system

. Thus, we are looking for the nullspace of the matrix {A}_{T } = \left [\array{ 2& 1 & 1\cr 1&−1 & 2 \cr 1& 2 &−1 } \right ]. Since {A}_{T } row-reduces to \left [\array{ \text{1}&0& 1\cr 0&\text{1 } &−1 \cr 0&0& 0 } \right ], the kernel of T is all vectors where x = −z and y = z. Thus, K\kern -1.95872pt \left (T\right ) = \left \langle \left \{\left [\array{ −1\cr 1 \cr 1 } \right ]\right \}\right \rangle .

C28 Contributed by Chris Black Statement [1490]
Since T is given by matrix multiplication, K\kern -1.95872pt \left (T\right ) = N\kern -1.95872pt \left (A\right ). We have

The nullspace of A is \left \{0\right \}, so the kernel of T is also trivial: K\kern -1.95872pt \left (T\right ) = \left \{0\right \}.

C29 Contributed by Chris Black Statement [1491]
Since T is given by matrix multiplication, K\kern -1.95872pt \left (T\right ) = N\kern -1.95872pt \left (A\right ). We have

Thus, a basis for the nullspace of A is \left \{\left [\array{ −1\cr −1 \cr 3\cr 0 } \right ]\right \}, and the kernel is K\kern -1.95872pt \left (T\right ) = \left \langle \left \langle \left [\array{ −1\cr −1 \cr 3\cr 0 } \right ]\right \rangle \right \rangle . Since the kernel is nontrivial, this linear transformation is not injective.

C30 Contributed by Chris Black Statement [1491]
We can see without computing that T is not injective, since the degree of {M}_{2,2} is larger than the degree of {P}_{2}. However, that doesn’t address the question of the kernel of T. We need to find all matrices \left [\array{ a&b\cr c&d } \right ] so that (a + b) + (a + c)x + (a + d){x}^{2} = 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 {M}_{2,2} spanned by \left [\array{ 1 &−1\cr −1 &−1 } \right ]. Symbolically, we have K\kern -1.95872pt \left (T\right ) = \left \langle \left [\array{ 1 &−1\cr −1 &−1 } \right ]\right \rangle .

C31 Contributed by Chris Black Statement [1491]
We have

Let’s put these vectors into a matrix and row reduce to test their linear independence.

so the set of vectors \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{1}\right )\right \} is linearly independent.

C32 Contributed by Chris Black Statement [1491]
We have T\left ({e}_{1}\right ) = \left [\array{ 1\cr 2 \cr 1 } \right ] and T\left ({e}_{2}\right ) = \left [\array{ 1\cr 1 \cr 2 } \right ]. Putting these into a matrix as columns and row-reducing, we have

Thus, the set of vectors \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{2}\right )\right \} is linearly independent.

C33 Contributed by Chris Black Statement [1491]
We have

Let’s row reduce the matrix of T to test linear independence.

so the set of vectors \left \{T\left ({e}_{1}\right ),\kern 1.95872pt T\left ({e}_{2}\right ),\kern 1.95872pt T\left ({e}_{3}\right )\right \} is linearly independent.

C40 Contributed by Robert Beezer Statement [1492]
We choose x to be any vector we like. A particularly cocky choice would be to choose x = 0, but we will instead choose

Then R\left (x\right ) = 9 + 9x. Now compute the kernel of R, which by Theorem KILT we expect to be nontrivial. Setting R\left (\left [\array{ a&b\cr b&c } \right ]\right )equalto 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,

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

is the corresponding element of the kernel. We compute the desired y as

Then check that R\left (y\right ) = 9 + 9x.

T15 Contributed by Robert Beezer Statement [1493]
We are asked to prove that K\kern -1.95872pt \left (T\right ) is a subset of K\kern -1.95872pt \left (S ∘ T\right ). Employing Definition SSET, choose x ∈K\kern -1.95872pt \left (T\right ). Then we know that T\left (x\right ) = 0. So

This qualifies x for membership in K\kern -1.95872pt \left (S ∘ T\right ).

T20 Contributed by Andy Zimmer Statement [1493]
This is an equality of sets, so we want to establish two subset conditions (Definition SE).

First, show N\kern -1.95872pt \left (A\right ) ⊆K\kern -1.95872pt \left (T\right ). Choose x ∈N\kern -1.95872pt \left (A\right ). Check to see if x ∈K\kern -1.95872pt \left (T\right ),

So by Definition KLT, x ∈K\kern -1.95872pt \left (T\right ) and thus N\kern -1.95872pt \left (A\right ) ⊆K\kern -1.95872pt \left (T\right ).

Now, show K\kern -1.95872pt \left (T\right ) ⊆N\kern -1.95872pt \left (A\right ). Choose x ∈K\kern -1.95872pt \left (T\right ). Check to see if x ∈N\kern -1.95872pt \left (A\right ),

So by Definition NSM, x ∈N\kern -1.95872pt \left (A\right ) and thus K\kern -1.95872pt \left (T\right ) ⊆N\kern -1.95872pt \left (A\right ).