From A First Course in Linear Algebra
Version 2.22
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/
Summary Linear transformation with domain larger than its codomain, so it is guaranteed to not be injective. Happens to be onto.
A linear transformation: (Definition LT)
|
T : {ℂ}^{5} → {ℂ}^{3},\quad T\left (\left [\array{
{x}_{1}
\cr
{x}_{2}
\cr
{x}_{3}
\cr
{x}_{4}
\cr
{x}_{5} } \right ]\right ) = \left [\array{
2{x}_{1} + {x}_{2} + 3{x}_{3} − 4{x}_{4} + 5{x}_{5}
\cr
{x}_{1} − 2{x}_{2} + 3{x}_{3} − 9{x}_{4} + 3{x}_{5}
\cr
3{x}_{1} + 4{x}_{3} − 6{x}_{4} + 5{x}_{5} } \right ]
|
A basis for the null space of the linear transformation: (Definition KLT)
|
\left \{\left [\array{
1\cr
−1
\cr
−2\cr
0
\cr
1 } \right ],\kern 1.95872pt \left [\array{
−2\cr
−1
\cr
3\cr
1
\cr
0 } \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 2, just from checking dimensions of the domain and the
codomain. In particular, verify that
This demonstration that T is not injective is constructed with the observation that
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{
2\cr
1
\cr
3 } \right ],\kern 1.95872pt \left [\array{
1\cr
−2
\cr
0 } \right ],\kern 1.95872pt \left [\array{
3\cr
3
\cr
4 } \right ],\kern 1.95872pt \left [\array{
−4\cr
−9
\cr
−6 } \right ],\kern 1.95872pt \left [\array{
5\cr
3
\cr
5 } \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\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 \}
|
Surjective: Yes. (Definition SLT)
Notice that the basis for the range above is the standard basis for
{ℂ}^{3}. So the range
is all of {ℂ}^{3}
and thus the linear transformation is surjective.
Subspace dimensions associated with the linear transformation. Examine parallels with earlier results for matrices. Verify Theorem RPNDD.
Invertible: No.
Not surjective, and the relative sizes of the domain and codomain mean the linear
transformation cannot be injective. (Theorem ILTIS)
Matrix representation (Theorem MLTCV):
|
T : {ℂ}^{5} → {ℂ}^{3},\quad T\left (x\right ) = Ax,\quad A = \left [\array{
2& 1 &3&−4&5\cr
1&−2 &3 &−9 &3
\cr
3& 0 &4&−6&5 } \right ]
|