Archetype S

From A First Course in Linear Algebra
Version 2.30
http://linear.ups.edu/

Summary  Domain is column vectors, codomain is matrices. Domain is dimension 3 and codomain is dimension 4. Not injective, not surjective.

A linear transformation: (Definition LT)

 T : {ℂ}^{3} → {M}_{ 22},\quad 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 ]

A basis for the null space of the linear transformation: (Definition KLT)

 \left \{\left [\array{ −1\cr −1 \cr 4 } \right ]\right \}

Injective: No. (Definition ILT)
Since the kernel is nontrivial Theorem KILT tells us that the linear transformation is not injective. Also, since the rank can not exceed 3, we are guaranteed to have a nullity of at least 1, just from checking dimensions of the domain and the codomain. In particular, verify that

\eqalignno{ T\left (\left [\array{ 2\cr 1 \cr 3 } \right ]\right ) & = \left [\array{ 1 & 9\cr 10 &−16 } \right ] &T\left (\left [\array{ 0\cr −1 \cr 11 } \right ]\right ) & = \left [\array{ 1 & 9\cr 10 &−16 } \right ] & & & & }

This demonstration that T is not injective is constructed with the observation that

\eqalignno{ \left [\array{ 0\cr −1 \cr 11 } \right ] & = \left [\array{ 2\cr 1 \cr 3 } \right ] + \left [\array{ −2\cr −2 \cr 8 } \right ] & & \text{and} \cr z & = \left [\array{ −2\cr −2 \cr 8 } \right ] ∈K\kern -1.95872pt \left (T\right ) & & }

so the vector z effectively “does nothing” in the evaluation of T.

A basis for the range of the linear transformation: (Definition RLT)
Evaluate the linear transformation on a standard basis to get a spanning set for the range (Theorem SSRLT):

 \left \{\left [\array{ 1& 2\cr 3&−2 } \right ],\kern 1.95872pt \left [\array{ −1& 2\cr 1 &−6 } \right ],\kern 1.95872pt \left [\array{ 0& 1\cr 1&−2 } \right ]\right \}

If the linear transformation is injective, then the set above is guaranteed to be linearly independent (Theorem ILTLI). This spanning set may be converted to a “nice” basis, by making the vectors the rows of a matrix (perhaps after using a vector reperesentation), row-reducing, and retaining the nonzero rows (Theorem BRS), and perhaps un-coordinatizing. A basis for the range is:

 \left \{\left [\array{ 1&0\cr 1&2 } \right ],\kern 1.95872pt \left [\array{ 0& 1\cr 1&−2 } \right ]\right \}

Surjective: No. (Definition SLT)
The dimension of the range is 2, and the codomain ({M}_{22}) has dimension 4. So the transformation is not surjective. Notice too that since the domain {ℂ}^{3} has dimension 3, it is impossible for the range to have a dimension greater than 3, and no matter what the actual definition of the function, it cannot possibly be surjective in this situation.

To be more precise, verify that \left [\array{ 2&−1\cr 1& 3 } \right ]∉ℛ\kern -1.95872pt \left (T\right ), by setting the output of T equal to this matrix and seeing that the resulting system of linear equations has no solution, i.e. is inconsistent. So the preimage, {T}^{−1}\left (\left [\array{ 2&−1 \cr 1& 3} \right ]\right ), is empty. This alone is sufficient to see that the linear transformation is not onto.

Subspace dimensions associated with the linear transformation. Examine parallels with earlier results for matrices. Verify Theorem RPNDD.

\eqalignno{ \text{Domain dimension: }3 & &\text{Rank: }2 & &\text{Nullity: }1 & & & & & & }

Invertible: No.
Not injective (Theorem ILTIS), and the relative dimensions of the domain and codomain prohibit any possibility of being surjective.

Matrix representation (Definition MR):

\eqalignno{ B & = \left \{\left [\array{ 1\cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0\cr 1 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0\cr 0 \cr 1 } \right ]\right \} & & \cr C & = \left \{\left [\array{ 1&0\cr 0&0 } \right ],\kern 1.95872pt \left [\array{ 0&1\cr 0&0 } \right ],\kern 1.95872pt \left [\array{ 0&0\cr 1&0 } \right ],\kern 1.95872pt \left [\array{ 0&0\cr 0&1 } \right ]\right \} & & \cr {M}_{B,C}^{T } & = \left [\array{ 1 &−1& 0\cr 2 & 2 & 1 \cr 3 & 1 & 1\cr −2 &−6 &−2 } \right ] & & }