Lecture 06
Lecture 06
MAT 261E
yaraneri@itu.edu.tr
(f ) T : P3 → R2 defined by T (a + bX + cX 2 ) = (abc, a + b + c)
T (−(0, 1, 0)) = T (0, −1, 0) = (0, 1, 0) but − T (0, 1, 0) = −(0, 1, 0) = (0, −1, 0).
Therefore, T (−(0, 1, 0)) 6= −T (0, 1, 0), implying that T is not a linear transformation.
(b): Note that T (0, 0, 0) 6= (0, 0), that is T (~0) 6= ~0. Since any linear transformation sends the zero vector to the
zero vector, it follows that T is not a linear transformation.
(c): It is not a linear transformation because the condition
T (c~v ) = cT (~v )
T (c~v ) = cT (~v )
Ergün Yaraneri
MAT 261E
yaraneri@itu.edu.tr
(b) Find the coordinate vector (~v )S of the vector ~v = 3 − 2X + 4X 2 relative to the basis S.
Solution: (a): Since the number of vectors in S is 3 and since the dimension of P3 is also 3, to show that S is a
basis for P3 we may justify that S spans P3 (or justify that S is linearly independent).
We now show that span(S) = P3 :
1 + X 2 , 1 − X + X 2 ∈ S =⇒ (1 + X 2 ) − (1 − X + X 2 ) = X ∈ span(S).
1 + X ∈ S, X ∈ span(S) =⇒ (1 + X) − X = 1 ∈ span(S).
1, X ∈ span(S), 1 − X + X 2 ∈ S =⇒ (1 − X + X 2 ) − 1 + X = X 2 ∈ span(S).
Thus we have observed that all of 1, X, X 2 is in span(S). Since an arbitrary polynomial of degree ≤ 2 is a linear
combination of 1, X, X 2 , it follows that an arbitrary polynomial of degree ≤ 2 is in span(S). This means that
span(S) = P3 . Hence S is a basis for P3 .
(b): Let (~v )S = (c1 , c2 , c3 ). Then
c1 (1 − X + X 2 ) + c2 (1 + X) + c3 (1 + X 2 ) = 3 − 2X + 4X 2
c1 + c2 + c3 = 3
−c1 + c2 = −2
c1 + c3 = 4
shows that c2 = −1, c3 = 1 − 2c2 = 3, and c1 = 3 − c2 − c3 = 1. Therefore, (~v )S = (1, −1, 3).
(c): Since (w)
~ S = (−1, 3, 2),
1 −1 0 1 1 0 1 0
Problem 3. Given the subset S = { , , , } of M2×2 ,
0 0 1 0 0 −1 −1 0
(a) Show that S is a basis for M2×2 .
1 3
(b) Find the coordinate vector (~v )S of the vector ~v = relative to the basis S.
−2 2
(c) Find the vector w ~ S = (0, 1, −1, 2).
~ whose coordinate vector relative to S is (w)
Solution: (a): Since the number of vectors in S is 4 and since the dimension of M2×2 is also 4, to show that S
is a basis for M2×2 we may justify that S is linearly independent (or justify that S spans M2×2 ).
S is linearly independent if and only ~
if the homogenous linear system A~x = 0 has no nontrivial solutions where
1 0 1 1
−1 1 0 0
the matrix A = is obtained by writing the entries of the matrices in S as columns of A.
0 1 0 −1
0 0 −1 0
Recall that if A is a square matrix, then the homogenous linear system A~x = ~0 has no nontrivial solutions ⇐⇒
det(A) 6= 0. We see that
1 0 1 1
1 0 1
−1 1 0 0 4+3
det(A) =
0 1 0 −1 = (−1)(−1) −1 1 0 = 1(−1 − 0) + 1(−1 − 0) = −2 6= 0.
0 1 −1
0 0 −1 0
Therefore, S is linearly independent, implying that S is a basis for M2×2 .
(b): Let (~v )S = (c1 , c2 , c3 ). Then
1 −1 0 1 1 0 1 0 1 3
c1 + c2 + c3 + c4 =
0 0 1 0 0 −1 −1 0 −2 2
Equating the corresponding entries we obtain the linear system:
c1 + c3 + c4 = 1
−c1 + c2 = 3
c2 − c4 = −2
− c3 = 2
The reduction of the augmented matrix
1 0 1 1 1 1 0 1 1 1 1 0 1 1 1
−1 1 0 0 3 0 1 1 1 4 0 1 1 1 4
R1 + R2 → R2 − R2 + R3 → R3
0 1 0 −1 −2 0 1 0 −1 −2 0 0 −1 −2 −6
0 0 −1 0 2 0 0 −1 0 2 0 0 −1 0 2
1 0 0 −1 −5 1 0 0 0 −1
−R3 + R4 → R4 R4 + R3 → R3
0 1 0 −1 −2 1 R4 + R2 → R2 0 1 0 0 2
R3 + R2 → R2 0 0 −1 2
−2 −6 1
0 0 −1 0 2
R3 + R1 → R1 2 R4 + R1 → R1
0 0 0 2 8 0 0 0 2 8
shows that c1 = −1, c2 = 2, c3 = −2, and c4 = 4. Therefore, (~v )S = (−1, 2, −2, 4).
~ S = (0, 1, −1, 2),
(c): Since (w)
1 −1 0 1 1 0 1 0 1 1
w
~ =0 + − +2 = .
0 0 1 0 0 −1 −1 0 −1 1
Ergün Yaraneri
MAT 261E
yaraneri@itu.edu.tr
Problem 4. One may see that the vectors (1, 0, 1), (0, 1, 2), and (1, 1, 2) form a basis for R3 . Let T : R3 → R3 be
the linear operator satisfying:
T (1, 0, 1) = (1, 2, 3), T (0, 1, 2) = (1, 0, 0), and T (1, 1, 2) = (1, 0, 1).
Find a formula for T (a, b, c), and use that formula to find T (4, 1, 0).
Solution: We first express (a, b, c) as a linear combination of the given basis vectors. We know (or easily see)
that the coefficients c1 , c2 , c3 of the given basis vectors in the expression of (a, b, c) as a linear combination are the
(unique) solution of the following linear system:
1 0 1 c1 a
0 1 1 c2 = b
1 2 2 c3 c
shows that
c3 = a + 2b − c, c2 = b − c3 = −a − b + c, c1 = a − c3 = −2b + c.
Therefore,
(a, b, c) = (−2b + c)(1, 0, 1) + (−a − b + c)(0, 1, 2) + (a + 2b − c)(1, 1, 2).
Since T is a linear transformation
T (a, b, c) = T (−2b + c)(1, 0, 1) + (−a − b + c)(0, 1, 2) + (a + 2b − c)(1, 1, 2)
= (−2b + c)T (1, 0, 1) + (−a − b + c)T (0, 1, 2) + (a + 2b − c)T (1, 1, 2)
= (−2b + c)(1, 2, 3) + (−a − b + c)(1, 0, 0) + (a + 2b − c)(1, 0, 1)
= (−b + c, −4b + 2c, a − 4b + 2c)
T (1, −1, 1) = (2, −1), T (1, 1, 0) = (1, −1), T (3, −1, 2) = (−5, 3) ?
Solution: If the vectors (1, −1, 1), (1, 1, 0), and (3, −1, 2) are linearly independent, then we can find a linear
transformation sending each of these three vectors to the any three prescribed vectors taken from codomain R2 .
On the other hand if the (1, −1, 1), (1, 1, 0), and (3, −1, 2) are not linearly independent, then there are real numbers
c1 , c2 , c3 , not all equal to 0, such that
So we begin by determining whether the vectors (1, −1, 1), (1, 1, 0), and (1, 1, 0) are linearly independent. We
seek for the solutions of the vector equation
shows that the variable c3 is free so that the solutions of the system are given by
c1 = −2r, c2 = −r, c3 = r
As a result, if there is a linear transformation T : R3 → R2 satisfying the conditions given in the problem,
then for any real number r we must have
(0, 0) = −2rT (1, −1, 1) − rT (1, 1, 0) + rT (3, −1, 2) = −2r(2, −1) − r(1, −1) + r(−5, 3) = (−10r, 6r).
Clearly, the latest vector equation is true only for r = 0, (not true for all real numbers r).
Hence, there is no linear transformation satisfying the given conditions in the problem.
Solution: (a): T (1, 2, −1, 2) = (4, 0) 6= (0, 0). So (1, 2, −1, 2) is not in ker(T ).
(b): T (4, −3, −4, 3) = (0, 0). So (4, −3, −4, 3) is in ker(T ).
(c): (4, 2) is in R(T ) ⇐⇒ there are real numbers x, y, z, t such that T (x, y, z, t) = (4, 2). This gives (y +t, x+z) =
(4, 2). For instance we can take x = 2, y = 4, z = t = 0 so that T (2, 4, 0, 0) = (4, 2). Hence (4, 2) is in R(T ).
Problem 7. Which conditions must be placed on a, b, c for (a, b, c, 0) to be in the range of the linear operator T
on R4 given by
T (x, y, z, t) = (2x − y + z − t, y + t, 2x + z, x).
Ergün Yaraneri
MAT 261E
yaraneri@itu.edu.tr
Solution: (a, b, c, 0) is in the range of T if and only if there are real numbers x, y, z, t such that T (x, y, z, t) =
(a, b, c, 0) (2x − y + z − t, y + t, 2x + z, x) = (a, b, c, 0). Equating the corresponding entries we get the linear system:
2x − y + z − t = a
y + t = b
2x + z = c
x = 0
So, (a, b, c, 0) is in the range of T if and only if this linear system is consistent (i.e., has a solution).
We reduce the augmented matrix as follows:
2 −1 1 −1 a 0 −1 1 −1 a 0 0 1 (a + b)
0 1 0 1 b −2R4 + R3 → R3 0
1 0 1 b 0 1 0 1 b
R + R1 → R1
0 c 2
2 0 1 0 c −2R4 + R1 → R1 0 0 1 0 0 1 0 c
1 0 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 0 (a + b − c)
0 1 0 1 b
−R3 + R1 → R1 0 0 1 0
c
1 0 0 0 0
Therefore, we see from the first row of the latest matrix that the system is consistent if and only if a + b − c = 0.
Consequently, (a, b, c, 0) is in the range of T if and only if a + b − c = 0.
(a) Is T one-to-one?
(b) Find a basis for R(T ).
(c) Is T onto?
(d) Find a basis for ker(T ).
Solution: (a): T cannot be one-to-one because the dimension dim(R4 ) (= 4) of domain is not less than or equal
to the dimension dim(P3 ) (= 3) of codomain.
(b): Every vector in the range of T is of the form:
S = {1 + X 2 , X + X 2 , 1 − X}.
the set S i.e., whose columns are the coordinate vectors of the polynomials in S relative to the standard basis
{1, X, X 2 } of P3 . To find a basis for the space spanned by S we may find a basis for the column space of A.
Since the columns of R containing leading 1’s are its first two columns, it follows that the first two columns of A
form a basis for the column space of A. This means that the first two polynomials in the set form a basis for the
subspace of P3 spanned by S.
Consequently, the set {1 + X 2 , X + X 2 } is a basis for R(T ). In particular, rank(T ) = 2.
(c): Since rank(T ) is not equal to the dimension
dim(P3 ) (= 3) of codomain, it follows that T is not onto.
(d): (a, b, c, d) is in the kernel of T ⇐⇒ , T (a, b, c, d) = 0 , (a + d) + (c − d)X + (a + c)X 2 = 0. This gives us
the homogenous linear system:
a + d = 0
c − d = 0
a + c = 0
Thus, (a, b, c, d) is in the kernel of T ⇐⇒ a, b, c, d is a solution of this homogenous linear system. As a result, to
find a basis for the kernel of T we may find a basis for the solution space of this homogenous linear system.
The following reduction of the augmented matrix
1 0 0 1 0 1 0 0 1 0 1 0 0 1 0
0 0 1 −1 0 − R1 + R3 → R3 0 0 1 −1 0 − R2 + R3 → R3 0 0 1 −1 0
1 0 1 0 0 0 0 1 −1 0 0 0 0 0 0
shows
that the variables
b and d are free and the solutions of the system are given by
a −s
b r
=
c s where r and s are arbitrary real numbers. Putting r = 1, s = 0, and putting
d s
0 −1
1
and 0 form a basis for the solution space of the above
s = 1, r = 0 we see that the column vectors 0 1
0 1
homogenous linear system.
Consequently, the set {(0, 1, 0, 0), (−1, 0, 1, 1)} is a basis for ker(T ). So, nullity(T ) = 2.
(a) Is T one-to-one?
(c) Is T onto?
Solution: (a): Note that dim(M2×2 ) = 4 and dim(R3 ) = 3. As the dimension of the domain of T is greater than
the dimension of the codomain of T, it follows that T is not one-to-one.
(b): Any vector in the range of T is of the form:
a b
T( ) = (a + b + c, b + c + d, a + d)
c d
= (a, 0, a) + (b, b, 0) + (c, c, 0) + (0, d, d)
= a(1, 0, 1) + b(1, 1, 0) + c(1, 1, 0) + d(0, 1, 1)
= a(1, 0, 1) + (b + c)(1, 1, 0) + d(0, 1, 1)
so that to find a basis for the range of T we may find a basis for the subspace of R3 spanned by S. To achieve
1 1 0
this goal, we may first form the matrix A = 0 1 1 whose columns are the vectors in the set S, and we may
1 0 1
next find a basis for the column space of A. So we now reduce the matrix A as follows:
1 1 0 1 1 0
−R1 + R3 → R3 0 1 1 R2 + R3 → R3 0 1 1 .
0 −1 1 0 0 2
It follows from the latest matrix that all columns of A are linearly independent so that all vectors in S are linearly
independent.
Consequently, the set S = {(1, 0, 1), (1, 1, 0), (0, 1, 1)} is a basis for R(T ). In particular, rank(T ) = 3.
(c): Since rank(T ) = 3, we see that the dimension of the range of T is equal to the dimension of the codomain
R3 ofT. Therefore,
T is onto.
a b a b
(d): is in the kernel of T ⇐⇒ T ( ) = (a + b + c, b + c + d, a + d) = 0 ⇐⇒ a, b, c, d is a solution
c d c d
of the homogenous linear system:
a + b + c = 0
b + c + d = 0
a + d = 0
Hence, to find a basis for the kernel of T we may find a basis for the solution space of this homogenous linear
system. The following reduction of the augmented matrix of the system
1 1 1 0 0 1 0 0 −1 0 1 0 0 −1 0
0 1 1 1 0 − R2 + R1 → R1 0 1 1 1 0 − R1 + R3 → R3 0 1 1 1 0
1 0 0 1 0 1 0 0 1 0 0 0 0 2 0
shows that the variable c is free and the solutions are given by
c = r, d = 0, a = d = 0, b = −c − d = −c = −r
where r is an arbitrary real number. Putting c = 1 we see that (a, b, c, d) = (0, −1, 1, 0).
Consequently, the set {(0, −1, 1, 0)} is a basis for ker(T ).
a b
(a): An element is in the kernel of T if and only if
c d
a b (a + c − b) d 0 0
T( )= = , or d = 0 and a + c − b = 0.
c d −d −d 0 0
a b
Therefore, is in the kernel of T if and only if a, b, c, d is a solution of the homogenous linear system:
c d
a − b + c = 0
d = 0
Therefore, a basis for the kernel of T may be obtained by finding a basis for the solution space of the above
homogenous linear system. It is obvious from the homogenous linear system above that the variables b and c are
free so that the dimension of the solution space is 2.
Consequently, nullity(T ) = 2. Having found nullity(T ), we may find easily rank(T ) as rank(T ) = dim(M2×2 ) −
nullity(T ) = 4 − 2 = 2.
To sum up, the rank of T is 2. And the nullity of T is 2.
(b): We have observed in part (a) that a basis for ker(T ) can be obtained from a basis for the solution space of
the homogenous linear system:
a − b + c = 0
d = 0
a b−c
b b
Moreover the variables b and c are free so that the solution of the system is =
c
where b and c are
c
d 0
arbitrary real numbers. More to the point, two vectors, which form abasisfor the solution
space, can be found by
1 −1
1 0
putting b = 1, c = 0 and by putting c = 1, b = 0. Therefore, the set { 0 , 1 } is a basis for the solution
0 0
space.
Ergün Yaraneri
MAT 261E
yaraneri@itu.edu.tr
1 1 −1 0
Consequently, the set { , } is a basis for the kernel of T.
0 0 1 0
(c): Any vector in the range of T is of the form:
a b (a + c − b) d
T( ) =
c d −d −d
a 0 −b 0 c 0 0 d
= + + +
0 0 0 0 0 0 −d −d
1 0 −1 0 1 0 0 1
= a −b +c +d
0 0 0 0 0 0 −1 −1
1 0 0 1
= (a − b + c) +d
0 0 −1 −1
1 0
This means that the range of T is equal to the subspace of M2×2 spanned by the matrices and
0 0
0 1
. We note that this two vectors are linearly independent because they are not proportional (i.e.,
−1 −1
one of them is not a scalar multiple of the other). Since the range of T is spanned by these linearly independent
two matrices, they must also
form a basis
for the range
of T.
1 0 0 1
Consequently, the set { , } is a basis for the range of T.
0 0 −1 −1
Solution: (a): T cannot be onto because the dimension of its codomain is greater than the dimension of its
domain.
(b): If dim(ker(T )) = 2, then from the formula
Problem 12. (a) Let P3 be the vector space of all polynomials of degree < 3 with real entries, and let T :
P3 → R2 be the linear transformation defined as T a + bX + cX 2 = (a, a + b + c). Let A be an ordered
find B where B [T ]A is the matrix of T with respect to the ordered bases A and B.
(b)
Let V be a vector space and ~v1 , ~v2 , ~v3 be three vectors of V. Suppose that C = ~v1 , ~v2 , ~v3 and D =
~v3 , ~v1 , ~v2 are ordered bases for V. Write the matrix C [ ]D , the change of coordinate matrix in V from C
to D.
Solution:
T (~a2 ) B T (~a3 ) B where A = {~a1 , ~a2 , ~a3 }. Let B = {~b1 , ~b2 }. Now,
(a): Recall that B [T ]A = T (~a1 ) B
1 1 1
= T (~a1 ) B T (~a2 ) B T (~a3 ) B implies that
1 1 0
1 2
1 2
1
T (−1 + 3X) B
= , T (−1 + 3X ) B
= , T (−1 + X + X ) B
= .
1 1 0
We calculate
Therefore ~b1 = (−1, 1) and ~b2 = (−1, 2) − (−1, 1) = (0, 1). Hence, B = (−1, 1), (0, 1) .
h i
C [ ]D = (d~1 )C (d~2 )C (d~3 )C
It is clear that
0 1 0
(d~1 )C = (~v3 )C = 0 , (d~2 )C = (~v1 )C = 0 , (d~3 )C = (~v2 )C = 1 .
1 0 0
Therefore
0 1 0
C [ ]D = 0 0 1 .
1 0 0