EXERCISE SET 8.

2.

Using the usual notation, we have

T(u + v) = (2(u1 + v1) (u2 + v2) + (u3 + v3), (u2 + v2) 4(u3 + v3))
= (2u1 u2 + u3, u2 4u3) + (2v1 v2 + v3, v2 4v3)
= T(u) + T(v)

and
T(cu) = (2cu1 cu2 + cu3, cu2 4cu3) = cT(u)

3.

5.

Since T (u) =
u
=
u
= T(u) T(u) unless u = 0, the function is not linear.

We observe that
T(A1 + A2) = (A1 + A2)B = A1B + A2B = T(A1) + T(A2)
and
T(cA) = (cA)B = c(AB) = cT(A)

Hence, T is linear.

6.

Since T(A + B) = tr(A + B) = tr(A) + tr(B) = T(A) + T(B) and T(cA) = tr(cA) = c(tr(A))
= cT(A), T is linear.

375

376

8.

Exercise Set 8.1

(b) Since both properties fail, T is nonlinear. For instance,

a
T k
c

b
2 2
2 2
= k a + k b
d
a
kT
c

10.

b
in general.
d

(a) T is not linear because it sends the zero function to f(x) = 1.

(b) Since
T(f(x) + g(x)) = T((f + g)(x)) = (f + g)(x + 1)
= f(x + 1) + g(x + 1) = T(f(x)) + T(g(x))

and
T(cf(x)) = cf(x + 1) = cT(f(x))

T is linear.

12.

Let v = (x1, x2) = av1 + bv2 = a(1, 1) + b(1, 0). This yields the equations x1 = a + b and
x2 = a, so that v = x2v1 + (x1 x2)v2. Thus
T(v) = T(x1, x2) = x2T(v1) + (x1 x2)T(v2)
= x2(1, 2) + (x1 x2)(4, 1)
= (4x1 + 5x2, x1 3x2)
so that
T(2, 3) = (8 15, 2 + 9) = (23, 11)

14.

Let v = (x1, x2, x3) = av1 + bv2 + cv3 = a(1, 1, 1) + b(1, 1, 0) + c(1, 0, 0). Thus x1 = a + b
+ c, x2 = a + b, and x3 = a, so that v = x3v1 + (x2 x3)v2 + (x1 x2)v3. Therefore

Exercise Set 8.1

377

T(v) = T(x1, x2, x3) = x3T(v1) + (x2 x3)T(v2) + (x1 x2)T(v3)

= x3(2, 1, 4) + (x2 x3)(3, 0, 1) + (x1 x2)(1, 5, 1)
= (x1 + 4x2 x3, 5x1 5x2 x3, x1 + 3x3)
and
T(2, 4, 1) = (2 + 16 + 1, 10 20 + 1, 2 3) = (15, 9, 1)

16.

We have
T(2v1 3v2 + 4v3) = 2T(v1) 3T(v2) + 4T(v3)
= (2, 2, 4) + (0, 9, 6) + (12, 4, 8)
= (10, 7, 6)

17.

(a) Since T1 is dened on all of R2, the domain of T2
T1 is R2. We have T2
T1(x, y) =
T2(T1(x, y)) = T2(2x, 3y) = (2x 3y, 2x + 3y). Since the system of equations
2x 3y = a
2x + 3y = b
can be solved for all values of a and b, the codomain is also all of R2.
(d) Since T1 is dened on all of R2, the domain of T2

T1 is R2. We have

T2(T1(x, y)) = T2(x y, y + z, x z) = (0, 2x)

Thus the codomain of T2

18.

T1 is the y-axis.

(a) Since T1 is dened on all of R2, the domain of T3

T3
T2
T1(x, y)

T2

T1 is R2. We have

= T3
T2 (2y, 3x, x 2y)

= T3(3x, x 2y, 2y)
= (3x 2y, x)

This vector can assume all possible values in R2, so the codomain is R2.

378

19.

Exercise Set 8.1

(a) We have

a
(T1
T2 )( A) = tr( AT ) = tr
b

c
= a+d
d

(b) Since the range of T1 is not contained in the domain of T2, T2
T1 is not well dened.

20.

We have
(T1
T2)(p(x)) = T1(p(x + 1)) = p((x 1) + 1) = p(x)
and
(T2
T1)(p(x)) = T2(p(x 1)) = p((x + 1) 1) = p(x)

22.

We have
T2
T1 (a0 + a1x + a2x2) = T2 (a0 + a1(x + 1) + a2(x + 1)2)
= T2((a0 + a1 + a2) + (a1 + 2a2)x + a2 x2)
= (a0 + a1 + a2)x + (a1 + 2a2)x2 + a2x3

24.

(b) We have
(T3
T2)
T1(v) = (T3
T2)(T1(v))
= T3(T2(T1(v)))
= T3
T2
T1(v)

25.

Since (1, 0, 0) and (0, 1, 0) form an orthonormal basis for the xy-plane, we have T(x, y, z)
= (x, 0, 0) + (0, y, 0) = (x, y, 0), which can also be arrived at by inspection. Then T(T(x,
y, z)) = T(x, y, 0) = (x, y, 0) = T(x, y, z). This says that T leaves every point in the x-y
plane unchanged.

Exercise Set 8.1

26.

379

(a) From the linearity of T and the denition of kT, we have

(kT)(u + v) = k(T(u + v)) = k(T(u) + T(v))
= kT(u) + kT(v) = (kT)(u) + (kT)(v)

and
(kT)(cu) = k(T(cu)) = kcT(u) = c(kT)(u)
Therefore, kT is linear.

28.

(a) F is linear since

F((x1, y1) + (x2, y2)) = F(x1 + x2, y1 + y2)
= (a1(x1 + x2) + b1(y1 + y2), a2 (x1 + x2) + b2 (y1 + y2))
= (a1x1 + b1y1, a2x1 + b2y1) + (a1x2 + b1y2, a2x2 + b2y2)
= F(x1, y1) + F(x2, y2)
and
F(c(x, y)) = F(cx, cy)
= (a1cx + b1cy, a2cx + b2cy)
= c(a1x + b1y, a2x + b2y)
= cF(x, y)
(b) Since F(c(x, y)) = F(cx, cy) = c2 F(x, y), F is not a linear operator.

30.

Let v = a1v1 + + anvn be any vector in V. Then

T(v)= a1T(v1) + + anT(vn)
= a 1v 1 + + a nv n
=v

Hence T is the identity transformation on V.

380

31.

Exercise Set 8.1

(b) We have
x

( J D)(sin x ) = (sin t ) dt = sin( x ) sin( 0) = sin( x )

0

(c) We have
x

( J D)( e x + 3) = ( e x + 3) dt = e x 1
0

33.

(a) True. Let c1 = c2 = 1 to establish Part (a) of the denition and let c2 = 0 to establish
Part (b).
(b) False. All linear transformations have this property, and, for instance there is more
than one linear transformation from R2 to R2.
(c) True. If we let u = 0, then we have T(v) = T(v) = T(v). That is, T(v) = 0 for all
vectors v in V. But there is only one linear transformation which maps every vector to
the zero vector.
(d) False. For this operator T, we have
T(v + v) = T(2v) = v0 + 2 v
But
T(v) + T(v) = 2T(v) = 2v0 + 2v
Since v0 0, these two expressions cannot be equal.

34.

Since B is a basis for the vector space V, we can write any vector v in V in one and only one
way as a linear combination v = c1v1 + c2v2 + + cnvn of vectors from B. Thus for any
linear operator T, we have
T(v) = c1T(v1) + c2T(v2) + + cnT(vn)
That is, to dene T, we need only specify where it maps each of the basis vectors in B. If
T is to map B into itself, then we have n choices for each of the n vectors T(vi), and hence
a total of nn possible operators T.

35.

Yes. Let T  Pn Pm be the given transformation, and let TR  Rn+1 Rm+1 be the
corresponding linear transformation in the sense of Section 4.4. Let
n  Pn Rn+1 be the
function that maps a polynomial in Pn to its coordinate vector in Rn+1, and let
m  Pm
Rm+1 be the function that maps a polynomial in Pm to its coordinate vector in Rm+1.

Exercise Set 8.1

381

By Example 7, both
n and
m are linear transformations. Theorem 5.4.1 implies that a
1 is also a linear transformation.
coordinate map is invertible, so
m
1
T

, so T is a composition of linear transformations. Refer to the
We have T=
m
R
n
diagram below:

Pn

Rn+1

Pm
m1

TR

Rm+1

Thus, by Theorem 8.1.2., T is itself a linear transformation.

EXERCISE SET 8.2

1.

(a) If (1, 4) is in R(T), then there must be a vector (x, y) such that T(x, y) = (2x y,
8x + 4y) = (1, 4). If we equate components, we nd that 2x y = 1 or y = t and x
= (1 + t)/2. Thus T maps innitely many vectors into (1, 4).
(b) Proceeding as above, we obtain the system of equations
2x y = 5
8x + 4y = 0
Since 2x y = 5 implies that 8x + 4y = 20, this system has no solution. Hence
(5, 0) is not in R(T).

2.

(a) The vector (5, 10) is in ker(T) since

T(5, 10) = (2(5) 10, 8(5) + 4(10)) = (0, 0)
(b) The vector (3, 2) is not in ker(T) since T(3, 2) = (4, 16) (0, 0).

3.

(b) The vector (1, 3, 0) is in R(T) if and only if the following system of equations has a
solution:
4x + y 2z 3w = 1
2x + y + z 4w = 3
6x

9z + 9w = 0

This system has innitely many solutions x = (3/2)(t 1), y = 10 4t, z = t, w = 1

where t is arbitrary. Thus (1, 3, 0) is in R(T).

383

384

Exercise Set 8.2

4.

(b) Since T(0, 0, 0, 1) = (3, 4, 9) (0, 0, 0), the vector (0, 0, 0, 1) is not in ker(T).

5.

(a) Since T(x2) = x3 0, the polynomial x2 is not in ker(T).

6.

(a) Since T(1 + x) = x + x2, the polynomial x + x2 is in R(T).

(c) Since there doesnt exist a polynomial p(x) such that xp(x) = 3 x2, then 3 x2 is not
in R(T).

7.

(a) We look for conditions on x and y such that 2x y = and 8x + 4y = 0. Since these
equations are satised if and only if y = 2x, the kernel will be spanned by the vector
(1, 2), which is then a basis.
(c) Since the only vector which is mapped to zero is the zero vector, the kernel is {0} and
has dimension zero so the basis is the empty set.

8.

(a) Since 8x + 4y = 4(2x y) and 2x y can assume any real value, the range of T is
the set of vectors (x, 4x) or the line y = 4x. The vector (1, 4) is a basis for this
space.
(c) The range of T is just the set of all polynomials in P3 with constant term zero. The set
{x, x2, x3} is a basis for this space.

9.

(a) Here n = dim(R2) = 2, rank(T) = 1 by the result of Exercise 8(a), and nullity(T) = 1
by Exercise 7(a). Recall that 1 + 1 = 2.
(c) Here n = dim(P2) = 3, rank(T) = 3 by virtue of Exercise 8(c), and nullity(T) = 0 by
Exercise 7(c). Thus we have 3 = 3 + 0.

10.

(a) We know from Example 1 that the range of T is the column space of A. Using
elementary column operations, we reduce to the matrix
1

5
7

0
1
1

0
1

0 or 0
2
0

0
1
1

0
0

1
0
1
0
Thus 5 and 1 as well as 0 and 1 form a basis for the column space




7
1
2
1
and therefore also for the range of T.

Exercise Set 8.2

385

(b) To investigate the solution space of A, we look for conditions on x, y, and z such that
1

5
7

1
6
4

4
2

x 0

y = 0
z 0

The solution of the resulting system of equations is x = 14t, y = 19t, and z = 11t
14

where t is arbitrary. Thus one basis for ker(T) is the vector 19 .

11
(c) By Parts (a) and (b), we have rank(T) = 2 and nullity(T) = 1.
(d) Since rank(A) = 2 and A has 3 columns, nullity (A) = 3 2 = 1. This also follows from
Theorem 8.2.2 and Part (c) above.

12.

(a) Since the range of T is the column space of A, we reduce using column operations.
This yields
1

0
1

0
0

1
0
Thus and form a basis for the range of T.
0
1
(b) If

1
2

5
3

x

2 y 0
=

0 z 0

w

then x = s 4r, y = s + 2r, z = s, and w = 7r where s and r are arbitrary. Thus,

4
1
x



y = 1 s + 2 r
0
1
z



7
0
w
That is, the set {[1, 1, 1, 0]T, [4, 2, 0, 7]T} is one basis for ker(T).

386

12.

Exercise Set 8.2

(c) By Parts (a) and (b), rank(T) = nullity(T) = 2.

(d) Since A has 4 columns and rank(A) = 2, we have nullity(A) = 4 2 = 2. This also
follows from Theorem 8.2.2 and Part (c) above.

14.

(a) The orthogonal projection on the xz-plane maps R3 to the entire xz-plane. Hence its
range is the xz-plane. It maps only the y-axis to (0, 0, 0), so that its nullspace is the
y-axis.

16.

(a) The nullity of T is 5 3 = 2.

(c) The nullity of T is 6 3 = 3.

18.

(a) The dimension of the solution space of Ax = 0 is, by virtue of the Dimension Theorem,
7 4 = 3.
(b) Since the range space of A has dimension 4, the range cannot be R5, which has
dimension 5.

19.

By Theorem 8.2.1, the kernel of T is a subspace of R3. Since the only subspaces of R3 are
the origin, a line through the origin, a plane through the origin, or R3 itself, the result
follows. It is clear that all of these possibilities can actually occur.

21.

(a) If
1

3
2

3
4
2

7
0

x 0

y = 0
z 0

then x = t, y = t, z = t. These are parametric equations for a line through the origin.
(b) Using elementary column operations, we reduce the given matrix to
1

3
2

0
5
8

0
0

Exercise Set 8.2

387

Thus, (1, 3, 2)T and (0, 5, 8)T form a basis for the range. That range, which we can
interpret as a subspace of R3, is a plane through the origin. To nd a normal to that
plane, we compute
(1, 3, 2) (0, 5, 8) = (14, 8, 5)
Therefore, an equation for the plane is
14x 8y 5z = 0
Alternatively, but more painfully, we can use elementary row operations to reduce
the matrix
1

3
2

3
4
2

4
7
0

y
z

to the matrix
1

0
0

( 4 x + 3y ) 5

( 3x y ) 5
14 x 8 y 5 z

Thus the vector (x, y, z) is in the range of T if and only if 14x 8y 5z = 0.

22.

Suppose that v is any vector in V and write

(*)

v = a 1v 1 + a 2 v 2 + + a nv n

Now dene a transformation T  V W by

T(v) = a1w1 + a2w2 + + anwn
Note that T is well-denied because, by Theorem 5.4.1, the constants a1, a2, , an in (*)
are unique.
In order to complete the problem, you must show that (i) T is linear and (ii)
T(vi) = wi for i = 1, 2, , n.

23.

The rank of T is at most 1, since dimR = 1 and the image of T is a subspace of R. So, we
know that either rank(T) = 0 or rank(T) = 1. If rank(T) = 0, then every matrix A is in the
kernel of T, so every n n matrix A has diagonal entries that sum to zero. This is clearly
false, so we must have that rank(T) = 1. Thus, by the Dimension Theorem (Theorem 8.2.3),
dim (ker(T)) = n2 1.

388

24.

Exercise Set 8.2

(a) Suppose that {v1, v2, , vn} is a basis for V and let
v = a 1v 1 + a 2v 2 + + a nv n

(*)

be an arbitrary vector in V. Since T is linear, we have

T(v) = a1T(v1) + + anT(vn)

(**)

The hypothesis that dim(ker(T)) = 0 implies that T(v) = 0 if and only if v = 0. Since
{v1, , vn} is a linearly independent set, by (*), v = 0 if and only if
a1 = a2 = = an = 0
Thus, by (**), T(v) = 0 if and only if
a1 = a2 = = an = 0
That is, the vectors T(v1), T(v2), , T(vn) form a linearly independent set in R(T).
Since they also span R(T), then dim(R(T)) = n.

26.

If J(p)=

1(ax + b)dx = (ax 2 / 2 + bx )1 =

-2b, then the kernel of J is the set of all

p(x) = ax + b for which b = 0 except the y-axis.

27.

If f(x) is in the kernel of D
D, then f (x) = 0 or f(x) = ax + b. Since these are the only
eligible functions f(x) for which f (x) = 0 (Why?), the kernel of D
D is the set of all
functions f(x) = ax + b, or all straight lines in the plane. Similarly, the kernel of D
D
D
is the set of all functions f(x) = ax2 + bx + c, or all straight lines except the y-axis and
certain parabolas in the plane.

28.

(a) kernel, range

(b) (1, 1, 1)
(c) the dimension of V
(d) 3

29.

(a) Since the range of T has dimension 3 minus the nullity of T, then the range of T has
dimension 2. Therefore it is a plane through the origin.

Exercise Set 8.2

389

(b) As in Part (a), if the range of T has dimension 2, then the kernel must have dimension
1. Hence, it is a line through the origin.

30.

(a) If T(f(x)) = f (x), then T(ax3 + bx2 + cx + d) = 0 for all polynomials in P3. Moreover,
these are the only functions which are mapped to the zero vector, that is, the function
which is identically zero.
(b) If T transforms f(x) to its (n + 1)st derivative, then kernel (T) = Pn.

EXERCISE SET 8.3

1.

(a) Clearly ker(T) = {(0, 0)}, so T is one-to-one.

(c) Since T(x, y) = (0, 0) if and only if x = y and x = y, the kernel is {0, 0} and T is oneto-one.
(e) Here T(x, y) = (0, 0, 0) if and only if x and y satisfy the equations x y = 0, x + y
= 0, and 2x 2y = 0. That is, (x, y) is in ker(T) if and only if x = y, so the kernel of
T is this line and T is not one-to-one.

2.

(a) Since det(A) = 1 0, then T has an inverse. By direct calculation

1
A1 =
2

and so

x
x x1 2 x2
T 1 1 = A1 1 =

x2
x2 2 x1 + 5 x2
3.

(a) Since det(A) = 0, or equivalently, rank(A) < 3, T has no inverse.

391

392

3.

Exercise Set 8.3

(c) Since A is invertible, we have

1

x1
x1 2
1

T 1 x2 = A1 x2 =
2
x
x
3
3
1
2

1
2
1
2
1
2

1
2
1
2

1

2

x1

x2
x
3

2 ( x1 x2 + x3 )

= ( x1 + x2 + x3 )
2

1 ( x +x x )
1
2
3
2

4.

(a) Since the kernel of this transformation is the line x = 2y, the transformation is not oneto-one.
(c) Since the kernel of the transformation is {0, 0}, the transformation is one-to-one.

5.

(a) The kernel of T is the line y = x since all points on this line (and only those points)
map to the origin.
(b) Since the kernel is not {0, 0}, the transformation is not one-to-one.

7.

(b) Since nullity(T) = n rank(T) = 1, T is not one-to-one.

(c) Here T cannot be one-to-one since rank(T) n < m, so nullity(T) 1.

8.

(b) If p(x) = a0 + a1x + a2x2, then

T(p(x)) = a0 + a1 (x + 1) + a2(x + 1)2
= (a0 + a1 + a2) + (a1 + 2a2)x + a2x2
Thus T(p(x)) = 0 if and only if a2 = a1 + 2 a2 = a0 + a1 + a2 = 0, or a2 = a1 = a0 = 0.
That is, the nullity of T is zero so T is one-to-one.

Exercise Set 8.3

10.

393

(a) Since innitely many vectors (0, 0, , 0, xn) map to the zero vector, T is not one-toone.
(c) Here T is one-to-one and T1 (x1, x2, , xn) = (xn, x1, , xn1).

11.

(a) We know that T will have an inverse if and only if its kernel is the zero vector, which
means if and only if none of the numbers ai = 0.

12.

Note that T1 and T2 can be represented by the matrices

1
AT =
1
1

1
and
1

2
AT =
2
1

that is,
x
x
x
x
T1 = AT and T2 = AT
1
2
y
y
y
y
(a) Since det(A T ) = 2 0 and det(AT2 ) = 5 0, it follows that both T1 and T2 are
1
one-to-one.
(b) The transformations T 11 and T21 are represented by AT1 and AT1, respectively, where
1

AT1 =
1

Then T2

1 1

2 1

1
and
1

AT1 =

1 2

5 1

T1 can be represented by
3
AT AT =
2
1
1

and (T2

T1)1 can be represented by

( AT AT )1 = 101 31
2

394

Exercise Set 8.3

that is
x
1 3
(T2
T1 )1 =

y 10 1
12.

1 x
1 3x y

=
3 y 10 x + 3y

(c) It is easy to verify that

AT11 AT12 = (AT2 AT1)1
Alternative Solution: If you want to do this the hard way, notice that if T1(x, y) =
x + y x y
,
(x + y, x y), then T11(x, y) =
and if T2(x, y) = (2x + y, x 2y)
2
2
2 x + y x 2y
,
then T21(x, y) =
. Also T2
5
5
(3x + y, x + 3y) and (T1

13.

T1(x, y) = T2(x + y, x y) =

3 x y x + 3y
T2)1(x, y) =
.
,
10
10

(a) By inspection, T11(p(x)) = p(x)/x, where p(x) must, of course, be in the range of T1
and hence have constant term zero. Similarly T21(p(x)) = p(x 1), where, again, p(x)
must be in the range of T2. Therefore (T2

T1)1(p(x)) = p(x 1)/x for appropriate

polynomials p(x).

16.

17.

If there were such a transformation T, it would have nullity zero (because it would be oneto-one) and rank equal to the dimension of W (because its range would be W). But the
Dimension Theorem guarantees that rank(T) + nullity(T) = dim(V), which is, by
hypothesis, greater than dim(V). Thus there can be no such transformation.
0
(a) Since T sends the nonzero matrix
0

1
to the zero matrix, it is not one-to-one.
0

(c) Since T sends only the zero matrix to the zero matrix, it is one-to-one. By inspection,
T 1(A) = T(A).
Alternative Solution: T can be represented by the matrix

Exercise Set 8.3

395

TB =

0
0
0
1

0
1
0
0

0
0
1
0

1
0
0
0

By direct calculation, TB = (TB)1, so T = T1.

18.

If T(x, y) = (x + ky, y) = (0, 0), then x = y = 0. Hence ker(T) = {(0, 0)} and therefore T
is one-to-one. Since T(T(x, y)) = T(x + ky, y) = (x + ky + k(y), (y)) = (x, y), we have
T1 = T.

19.

Suppose that w1 and w2 are in R(T). We must show that

T1(w1 + w2) = T1(w1) + T1(w2)
and
T1(kw1) = kT1(w1)
Because T is one-to-one, the above equalities will hold if and only if the results of applying
T to both sides are indeed valid equalities. This follows immediately from the linearity of the
transformation T.

21.

It is easy to show that T is linear. However, T is not one-to-one, since, for instance, it sends
the function f(x) = x 5 to the zero vector.

24.

(a) False. Since T is not one-to-one, it has no inverse. For T1 to exist, T must map each
point in its domain to a unique point in its range.
(b) True. If T1(v1) = T1(v2) where v1 v2, then T2

T1(v1) = T2

T1(v2) where v1 v2.

(c) True, since such rotations and reections are one-to-one linear transformations.

25.

Yes. The transformation is linear and only (0, 0, 0) maps to the zero polynomial. Clearly
distinct triples in R3 map to distinct polynomials in P2.

396

Exercise Set 8.3

26.

It does. T is a linear operator on M22. If EA = O for any matrix A, then A = E1O = O. Thus
T is one-to-one. Alternatively, if EA1 = EA2, then E(A1 A2) = O, so A1 = A2 = E1O = O.
That is, A1 = A2.

27.

No. T is a linear operator by Theorem 3.4.2. However, it is not one-to-one since T(a) = a
a = 0 = T(0). That is, T maps a to the zero vector, so if T is one-to-one, a must be the
zero vector. But then T would be the zero transformation, which is certainly not one-to-one.

EXERCISE SET 8.4

2.

(a) Let B = {1, x, x2} = {u1, u2, u3} and B = {1, x} = {v1, v2}. Observe that
T(u1) = T(1) = 1

= 1v1

T(u2) = T(x) = 1 2x = 1v1 2v2

T(u3) = T(x2) = 3x =

3v2

Hence the matrix of T with respect to B and B is

1
2

(b) We have

1
[T ] B ', B [x] B =
0

1
2

c0
0 c0 + c1

c =
3 1 2c1 3c2
c
2

and
[T(c0 + c1x + c2x2)]B = [(c0 + c1) (2c1 + 3c2)x]B
c0 + c1
=

2c1 3c2

397

398

4.

Exercise Set 8.4

(a) Since
0
T( u1 ) = = 2u1 + 2u 2
2
and
1
T( u 2 ) = = u1
1
we have
1

2
[T ] B =
2
(b) Since
1 x1

0 x2 B

2
[T ]B [x]B =
2
2
=
2

1
x ( u 2 ) + x2 ( u1 + u 2 )
B
0 1

2
=
2

x2 x1 + x2

x2 x1 2 x2

and
x x

[T ( x )]B = x1 + x2

2 B

= ( x1 + x2 ) u1 + 2 x2 u 2

Formula (5a) does, indeed, hold.

6.

(a) Observe that

T(v1) = (1, 1, 0)

= v1 v2

3
1
1
T ( v 2 ) = ( 1, 1, 1) = v1 + v 2 + v 3
2
2
2
1
1
1
T ( v 3 ) = ( 0, 0, 1) =
v1 + v 2 v 3
2
2
2

Exercise Set 8.4

399

Thus the matrix of T with respect to B is

1
2
1
2

3
2
1
2
1
2

(b) If we solve for (x1, x2, x3)B = a1v1 + a2v2 + a3v3, we nd that

x B

x x2 + x3
= 1
2

x1 + x2 + x3
2

x1 + x2 x3

Thus we have

[T ]B [x]B = 1

3
2
1
2
1
2

2
1

2
1

2

3 x1 2 x2 + x3

x + 2x + x
2
3
= 1

x1 + x3

x1 x2 + x3

x + x + x
2
3
1

2
x +x x
3
2
1

and
[T(x)]B = [(x1 x2, x2 x1, x1 x3)]B
( x1 x2 ) ( x2 x1 ) + ( x1 x3 ) 3 x1 2 x2 x3

2
2

(
x

x
)
+
(
x

x
)
+

+
2
x
x2 x3

(
x
x
)

1
3
1
2
2
1
=
= 1

2
2

x1 + x3
( x1 x2 ) + ( x2 x1 ) ( x1 x3 )

2
2

400

Exercise Set 8.4

6.

(c) No. The transformation T is not invertible because x1 x2 = (x2 x1) and thus
rank(T) = 2 3. We can see this because the reduced row-echelon form of the matrix
[T]B of the transformation is
1

0
0

8.

0
1
0

1 I .
0

(a) Since
T(1) = x
T(x) = x(x 3) = 3x + x2
T(x2) = x(x 3)2 = 9x 6x2 + x3
we have

[T ] B , B

1
=
0

9
6

0
3
1
0

(b) Since we are working with standard bases, we have

0

1
[T ] B , B [x] B =
0

0
3
1
0

9
6

0
1

11
1 = 7
1

so that T(1 + x x2) = 11x + 7x2 x3.

(c) We have T(1 + x x2) = x(1 + (x 3) (x 3)2) = 11x + 7x2 x3.

9.

(a) Since A is the matrix of T with respect to B, then we know that the rst and second
columns of A must be [T(v1)]B and [T(v2)]B, respectively. That is
1
T ( v 1 ) =

B
2
3
T ( v 2 ) =
B
5

Exercise Set 8.4

401

Alternatively, since v1 = 1v1 + 0v2 and v2 = 0v1 + 1v2, we have

1 1
T ( v1 ) B = A =
0 2
and
0 3
T ( v 2 ) B = A =
1 5
(b) From Part (a),
3
T( v )1 = v1 2 v 2 =
5
and
2
T( v 2 ) = 3 v1 + 5 v 2 =
29
(c) Since we already know T(v1) and T(v2), all we have to do is express [x1
of v1 and v2. If
x1
1
1

= av1 + bv 2 = a + b
3
4
x2
then
x1 = a b
x2 = 3a + 4b
or
a = (4x1 + x2)/7
b = (3x1 + x2)/7
Thus
x1 4 x1 + x2 3 3 x1 + x2 2

+
x =
7
7
2
5
29
18 x1 + x2

7
=
107 x1 + 24 x2

x2]T in terms

402

9.

Exercise Set 8.4

(d) By the above formula,

1
19 7
T =

1
83 7

11.

(a) The columns of A, by denition, are [T(v1)]B, [T(v2)]B, and [T(v3)]B, respectively.
(b) From Part (a),
T(v1) = v1 + 2v2 + 6v3 = 16 + 51x + 19x2
= 6 5x + 5x2

T(v2) = 3v1 2v3

T(v3) = v1 + 5v2 + 4v3 = 7 + 40x + 15x2

(c) Let a0 + a1x + a2x2 = b0v1 + b1v2 + b2v3. Then
a0 =

b1 + 3b2

a1 = 3b0 + 3b1 + 7b2

a2 = 3b0 + 2b1 + 2b2
This system of equations has the solution
b0 = (a0 a1 + 2a2)/3
b1 = (5a0 + 3a1 3a2)/8
b2 = (a0 + a1 a2)/8
Thus
T(a0 + a1x + a2x2) = b0T(v1) + b1T(v2) + b2T(v3)

239a0 161a1 + 247 a2

24
+

201a0 111a1 + 247 a2

8
+

61a0 31a1 + 107 a2

12

x2

Exercise Set 8.4

403

(d) By the above formula,

T(1 + x2) = 2 + 56x + 14x2

13.

(a) Since
T1(1) = 2
T2(1) = 3x

and

T1(x) = 3x2

T2(x) = 3x2

T2 T1(1) = 6x

and

and

T2(x2) = 3x3

T2 T1(x) = 9x3

we have

[T1 ] B , B

= 0
0

0
0

0 [T2 ] B , B =
0
3

and

T2 T1
B , B

6
=
0
0

0
9

(b) We observe that here

[T2 T1]B,B = [T2]B,B [T1]B,B

0
0
3
0

0
0

404

Exercise Set 8.4

15.

If T is a contraction or a dilation of V, then T maps any basis B = {v1, , vn} of V to

{kv1, , kvn} where k is a nonzero constant. Therefore the matrix of T with respect to B is
k

0
0


0

0
k
0

0

0
0
k

0

0
0


k

17.

The standard matrix for T is just the m n matrix whose columns are the transforms of the
standard basis vectors. But since B is indeed the standard basis for Rn, the matrices are the
same. Moreover, since B is the standard basis for Rm, the resulting transformation will yield
vector components relative to the standard basis, rather than to some other basis.

18.

(a) Since D(1) = 0, D(x) = 1, and D(x2) = 2x, then

0
0

1
0
0

2
0

is the matrix of D with respect to B.

23p
16 p ,
(b) Since D(2) = 0, D(2 3x) = 3 = 3 p1 and D(2 3x + 8x2) = 3 + 16x =
2
6 1 6 2
the matrix of D with respect to B is

3
2
0
0

23

6
16

3

Exercise Set 8.4

405

(c) Using the matrix of Part (a), we obtain

D( 6 6 x + 24 x ) = 0
0

2
0

1
0
0

6 6

6 = 48 = 6 + 48 x
24 0

(d) Since 6 6x + 24x2 = p1 p2 + 3p3, we have

D( 6 6 x + 24 x 2 ) = 0

3
2
0
0

23
6
16

3

1
13

6
1 = 16
3
0
B

or
D(6 6x + 24x2) = 13(2) 16(2 3x) = 6 + 48x

19.

(c) Since D(f1) = 2f1, D(f2) = f1 + 2f2, and D(f3) = 2f2 + 2f3, we have the matrix
2

0
0

20.

1
2
0

2
2

The upper left-hand corner is all vectors in the space V. The upper right-hand corner is all
vectors in the range of T. Thus it is a subspace of W. Since V is a real vector space, the
lower left-hand corner is all of R4. The lower right-hand corner is the range of the
transformation obtained by multiplying every element of R4 by the matrix [T]B,B. It is thus
a subspace of R7.

EXERCISE SET 8.5

1.

First, we nd the matrix of T with respect to B. Since

1
T( u1 ) =
0
and

2
T( u 2 ) =
1
then

1
A = T B =
0

In order to nd P, we note that v1 = 2u1 + u2 and v2 = 3u1 + 4u2. Hence the transition
matrix from B to B is

2
P=
1

Thus

P 1 = 11
1
11

407

3
11
2
11

408

Exercise Set 8.5

and therefore

A = [T ] B = P 1[T ] B P =

3
11
=
2
11
2.

3 1

2 0

1 4

11 1

2 2

1 1

56
11
3
11

In order to compute A = [T]B, we note that

16
T( u1 ) = = ( 0.8 )u1 + ( 3.6)u 2
2
and

3
T( u 2 ) =
= ( 6.1)u1 + ( 3.8 )u 2
16
Hence

0.8
A = T B =
3.6

6.1

3.8

In order to nd P, we note that

v1 = (1.3)u1 + (0.4)u2
v2 = (0.5)u1
Hence

1.3
P=
0.4

0.5

Exercise Set 8.5

409

and
2.5

6.5

0
P 1 =
2
It then follows that

15.5
A = T B = P 1 AP =
37.5

3.

Since T(u1) = (1/

respect to B is

4.5

12.5

2,
1/ 2)
and T(u2) = (1/ 2,
1/ 2),
then the matrix of T with

1
A = T B =
1

P 1 =

1 4

11 1

From Exercise 1, we know that

2
P=
1

3
and
4

Thus

A = T B ' = P 1 AP =
5.

13

11 2 5
1

25

Since T(e1) = (1, 0, 0), T(e2) = (0, 1, 0), and T(e3) = (0, 0, 0), we have
1

A = T B = 0
0

0
1
0

0
0

In order to compute P, we note that v1 = e1, v2 = e1 + e2, and v3 = e1 + e2 + e3. Hence,

410

Exercise Set 8.5

P = 0
0

1
1

1
1
0

and

= 0
0

1
1
0

1
1

Thus

T B

7.

= 0
0

1
1
0

1
1

0
0

0
1
0

0
0

0
0

1
1
0

1 1

1 = 0
1 0

Since

T ( p1 ) = 9 + 3 x =

2
1
p1 + p 2
3
2

and

2
4
T ( p 2 ) = 12 + 2 x = p1 + p 2
9
3
we have

2
3
T B =
1
2

2
9
4
3

2
1
7
1
We note that q1 = p1 + p 2 and q 2 = p1 p 2 . Hence
9
3
9
6

0
1
0

1
0

Exercise Set 8.5

411

P= 9
1
3

7
9
1

6

P 1 =

7
2
1

and

3
4
3
2

Therefore

T B

8.

3
4
3
2

7 2
2 3
1
1
2

2
9
4
3

2
9

1
3

7
9
1

1
=

(a) Since T(1, 0) = (3, 1) and T(0, 1) = (4, 7), we have

det(T ) =

4
= 17
7

3
1

(c) Since T(1) = 1, T(x) = x 1, and T(x2) = (x 1)2, we have

1
det(T ) = 0
0
9.

1
1
0

1
2 = 1
1

(a) If A and C are similar n n matrices, then there exists an invertible n n matrix P
such that A = P1CP. We can interpret P as being the transition matrix from a basis B
for Rn to a basis B. Moreover, C induces a linear transformation T  Rn Rn where C
= [T]B. Hence A = [T]B. Thus A and C are matrices for the same transformation with
respect to different bases. But from Theorem 8.2.2, we know that the rank of T is
equal to the rank of C and hence to the rank of A.

412

Exercise Set 8.5

Alternate Solution: We observe that if P is an invertible n n matrix, then P

represents a linear transformation of Rn onto Rn. Thus the rank of the transformation
represented by the matrix CP is the same as that of C. Since P1 is also invertible, its
null space contains only the zero vector, and hence the rank of the transformation
represented by the matrix P1 CP is also the same as that of C. Thus the ranks of A
and C are equal. Again we use the result of Theorem 8.2.2 to equate the rank of a
linear transformation with the rank of a matrix which represents it.
Second Alternative: Since the assertion that similar matrices have the same rank deals
only with matrices and not with transformations, we outline a proof which involves
only matrices. If A = P1 CP, then P1 and P can be expressed as products of
elementary matrices. But multiplication of the matrix C by an elementary matrix is
equivalent to performing an elementary row or column operation on C. From Section
5.5, we know that such operations do not change the rank of C. Thus A and C must
have the same rank.

10.

(a) We use the standard basis for P4. Since T(1) = 1, T(x) = 2x + 1, T(x2) = (2x + 1)2,
T(x3) = (2x + 1)3, and T(x4) = (2x + 1)4, we have
1
0
det(T ) = 0
0
0

1
2
0
0
0

1
4
4
0
0

1
6
12
8
0

1
8
24 = 1024
32
16

(b) Thus rank(T) = 5, or [T] is invertible, so, by Theorem 8.4.3, T is one-to-one.

11.

(a) The matrix for T relative to the standard basis B is

1
T B =
2

The eigenvalues of [T]B are = 2 and = 3, while corresponding eigenvectors are

(1, 1) and (1, 2), respectively. If we let
1
P=
1

then

2
P 1 =
1

Exercise Set 8.5

413

and

2
P 1[T ] B P =
0

is diagonal. Since P represents the transition matrix from the basis B to the standard
basis B, we have
1 1
B =
,

1 2

as a basis which produces a diagonal matrix for [T]B.

12.

(b) The matrix for T relative to the standard basis B is

1
0
1

T B = 1
1

1
0

The eigenvalues of [T]B are = 1 and = 2. The eigenspace corresponding to = 1

1
1

is spanned by the vectors 1 and 0 and the eigenspace corresponding to = 2

0
1
1
is spanned by the vector 1 . If we let

1
1

P= 1
0

1
0
1

1
1

then P1[T]BP will be diagonal. Hence the basis

1 1

B = 1 , 0 ,
0 1

will produce a diagonal matrix for [T]B.

1
1

414

13.

Exercise Set 8.5

(a) The matrix of T with respect to the standard basis for P2 is

5

A=0
1

8
2

6
1
0

The characteristic equation of A is

3 22 15 + 36 = ( 3)2( + 4) = 0
and the eigenvalues are therefore = 4 and = 3.
(b) If we set = 4, then (I A)x = 0 becomes
9

0
1

6
3
0

8
2

x1 0

x2 = 0
x3 0

The augmented matrix reduces to

1

0
0

0
1
0

2
8 3
0

0
0

s, and x3 = s. Therefore the vector

and hence x1 = 2s, x2 = 8
3
2

8 3
1
is a basis for the eigenspace associated with = 4. In P2, this vector represents the
polynomial 2 + 8
x + x 2.
3
If we set = 3 and carry out the above procedure, we nd that x1 = 5 s, x2 = 2s,
and x3 = s. Thus the polynomial 5 2x + x2 is a basis for the eigenspace associated
with = 3.

Exercise Set 8.5

14.

415

(a) We look for values of such that

b
a
=
d
c

or
2c

b 2c

a + c a
=
d c

If we equate corresponding entries, we nd that

a

2c

=0

a + b

=0

b + ( + 2)c

=0

(*)
( 1)d= 0

This system of equations has a nontrivial solution for a, b, c, and d only if

1
det
0

1
0

2
1
+2
0

0
=0
0

or
( 1)( + 2)(2 1) = 0
Therefore the eigenvalues are = 1, = 2, and = 1.
(b) We find a basis only for the eigenspace of T associated with = 1. The bases
associated with the other eigenvalues are found in a similar way. If = 1, the equation
T(x) = x becomes T(x) = x and the augmented matrix for the system of equations
(*) above is

1
0

0
1
1
0

2
1
3
0

0
0
0
0

0
0

416

Exercise Set 8.5

This reduces to

1
0
0
0

0
1
0
0

2
3
0
0

0
0

0
0
0
0

and hence a = 2t, b = 3t, c = t, and d = s. Therefore the matrices

2

3
and
0

form a basis for the eigenspace associated with = 1.

15.

If v is an eigenvector of T corresponding to , then v is a nonzero vector which satises

the equation T(v) = v or (I T)v = 0. Thus I T maps v to 0, or v is in the kernel of
I T.

17.

Since C[x]B = D[x]B for all x in V, we can, in particular, let x = vi for each of the basis
vectors v1, , vn of V. Since [vi]B = ei for each i where {e1, , en} is the standard basis for
Rn, this yields Cei = Dei for i = 1, , n. But Cei and Dei are just the ith columns of C and
D, respectively. Since corresponding columns of C and D are all equal, we have C = D.

18.

Let B be the standard basis for R2, and let

B = {(cos , sin ), (sin , cos )} = {v1, v2}
be the basis consisting of the unit vector v1 lying along
and the unit vector v2
perpendicular to
. Note that to change basis from B to B, we rotate through an angle .
Now relative to B, T is just the orthogonal projection on the v1-axis, which is accomplished
by setting the v2-coordinate equal to zero. Then to return to the basis B, we rotate through
an angle . Thus

Exercise Set 8.5

417

x
x
= [T ]B, B [T ]B [ I ]B , B
y
y
cos
=
sin

sin

cos

cos2
=
sin cos

19.

cos

sin

sin

cos

x

y

sin cos x

sin 2 y

(a) False. Every matrix is similar to itself, since A = I1 AI.

(b) True. Suppose that A = P1 BP and B = Q1 CQ. Then
A = P1(Q1 CQ)P = (P1Q1)C(QP) = (QP)1C(QP)
Therefore A and C are similar.
(c) True. By Table 1, A is invertible if and only if B is invertible, which guarantees that A
is singular if and only if B is singular.
Alternatively, if A = P1 BP, then B = PAP1. Thus, if B is singular, then so is A.
Otherwise, B would be the product of 3 invertible matrices.
(d) True. If A = P1 BP, then A1=(P1 BP)1 = P1 B1(P1)1 = P1B1P, so A1 and B1 are
similar.

20.

If A is invertible and B is singular, then it follows from Exercise 19(c)that A and B cannot
be similar. Hence

1
A=
0

0
and
1

1
B=
0

are not similar.

Moreover, if A and B are both invertible but have different determinants, then it follows
from Table 1 that they cannot be similar. Hence.

1
A=
0
are not similar.

0
and
1

2
B=
0

418

Exercise Set 8.5

22.

Let B = P1 AP so that A = PBP1. Let be an eigenvalue common to A and B and let x be

an eigenvector of A corresponding to . Then Ax = x, or
Ax = (PBP1)x = x
so that
BP1x = P1 x
Thus
B(P1x) = (P1x)
That is, P1x is an eigenvector of B corresponding to .

24.

For every f in V, T(f) = f(x 2). Thus, if f is an eigenvector with eigenvalue = 1, we

have T(f) = 1 f, so f(x 2) = f(x) for all x. Thus, the eigenspace of = 1 is precisely the
set of all functions f that are periodic with periods that evenly divide 2.

25.

First, we need to prove that for any square matrices A and B, the trace satises tr(A) =
tr(B). Let
a11

a
A = 21

an1

a12
a22

an 2

a1n

a2 n

ann

and

b11

b
B = 21

bn1

b12
b22

bn 2

b1n

b2 n

bnn

Then,

[ AB]11 = a11b11 + a12b21 + a13b31 + + a1nbn1 = a1 j b j1

j =1

[ AB]22 = a21b12 + a22b22 + a23b32 + + a2 nbn 2 = a2 j b j 2

j =1


n

[ AB]nn = an1b1n + an 2b2 n + an 3b3 n + + annbnn = anj b jn .

j =1

Exercise Set 8.5

419

Thus,
tr(AB) = [AB]11 + [AB]22 + + [AB]nn
n

j =1

j =1

j =1

= a1 j b j1 + a2 j b j 2 + + anj b jn
n

= akj bkj .
k =1 j =1

Reversing the order of summation and the order of multiplication, we have

tr( AB ) =

b jka jk
j =1 k =1

k =1

k =1

k =1

b1kak1 + b2kak2 +  + bnkakn

= [ BA]11 + [ BA]22 +  + [ BA]nn

= tr( BA).
Now, we show that the trace is a similarity invariant. Let B = P1 AP. Then
tr(B) = tr(P1 AP)
= tr((P1 A)P)
= tr(P(P1 A))
= tr(PP1)A)
= tr(I A)
= tr(A).

EXERCISE SET 8.6

1.

(a) This transformation is onto because for any ordered pair (a, b) in R2, T(b, a) = (a, b).
(b) We use a counterexample to show that this transformation is not onto. Since there is
no pair (x, y) that satises T(x, y) = (1, 0), T is not onto.
a + b a b
(c) This transformation is onto. For any ordered pair (a, b) in R2, T
= (a, b).
,
2
2
(d) This is not an onto transformation. For example, there is no
pair (x, y) that satises T(x, y) = (1, 1, 0).
(e) The image of this transformation is all vectors in R3 of the form (a, a, 2a). Thus, the
image of T is a one-dimensional subspace of R3 and cannot be all of R3. In particular,
there is no vector (x, y) that satises T(x, y) = (1, 1, 0), and this transformation is not
onto.
(f) This is an onto transformation. For any point (a, b) in R2, there are an innite number
a+b ab
of points that map to it. One such example is T
,
, 0 = (a, b).
2

2.

The transformation TA is not onto if the image of TA is not all of Rn. Thus, rank(TA) < n, or
equivalently, null(T) > 0. This is equivalent to the matrix A being singular.

3.

(a) We nd that rank(A) = 2, so the image of T is a two-dimensional subspace of R3. Thus,

T is not onto.
(b) We nd that rank(A) = 3, so the image of T is all of R3. Thus, T is not onto.
(c) We nd that rank(A) = 3, so the image of T is all of R3. Thus, T is onto.
(d) We nd that rank(A) = 3, so the image of T is all of R3. Thus, T is onto.

4.

(a) We nd that rank(A) = 1 and the codomain is R3, so this is not onto.
(b) We nd that rank(A) = 3 and the codomain is R3, so this is an onto transformation.
(c) We nd that rank(A) = 2 and the codomain is R3, so this is not onto.

421

422

Exercise Set 8.6

5.

(a) The transformation T is not a bijection because it is not onto. There is no p(x) in
P2(x) so that xp(x) = 1.
(b) The transformation T(A) = AT is one-to-one, onto, and linear, so it is a bijection.
(c) By Theorem 8.6.1, there is no bijection between R4 and R3, so T cannot be a bijection. In
particular, it fails being one-to-one. As an example, T(1, 1, 2, 2) = T(1, 1, 0, 0) = (1, 1, 0).
(d) Because dim P3 = 4 and dim R3 = 3, Theorem 8.6.1 states that there is no bijection
between P3 and R3, so T cannot be a bijection. In particular, it fails being one-to-one.
As an example, T(x + x2 + x3) = T(1 + x + x2 + x3) = (1, 1, 1).

6.

Let T  V W be a bijection. Then T is one-to-one, onto, and invertible.

First, we show that T1  W V is one-to-one. If T1(w1) = T1(w2), then T(T1(w1)) =
T(T1(w2)) so w1 = w2, and T1 is one-to-one. Second, we show that T1 is onto. Let v be any
vector in V, and let w = T(v). Then T1(w) = T1(T(v)) = v, so v is in the image of T1 for
any v in V, and T1 is onto. Thus, the inverse of a bijection is again a bijection.
Now, we want to show that if T  V W is a bijective linear transformation, then
1
T  W V is also a bijective linear transformation.
Because T is onto, for any w in W, there is a vector v in V so that w = T(v). Then,
T1(cw) = T1(cT(v)).
Since T is a linear transformation, cT(v) = T(cv), so
T1(cw) = T1(T(cv))
= cv
= cT1(w).
Also, for any two vectors w1 and w2 in W, there exist vectors v1 and v2 in V so that w1 =
T(v1) and w2 = T(v2), since T is onto. Thus,
T1(w1 + w2) = T1(v1) + T(v2)).
Since T is a linear transformation, T(v1) + T(v2) = T(v1 + v2), and we have
T1(w1 + w2) = T1(v1 + v2))
= v1 + v2
= T1(w1) + T1(w2).
Thus, T1 is a linear transformation.

7.

Assume there exists a surjective (onto) linear transformation T  V W, where dim W >
dim V. Let m = dim V and n = dim W, with m < n. Then, the matrix AT of the
transformation is an n m matrix, with m < n. The maximal rank of AT is m, so the
dimension of the image of T is at most m. Since the dimension of the image of T is smaller
than the dimension of the codomain Rn, T is not onto. Thus, there cannot be a surjective
transformation from V onto W if dim V < dim W.

Exercise Set 8.6

423

If n = dim W dim V = m, then the matrix AT of the transformation is an n m matrix

with maximim possible rank n. If rank(AT) = n, then T is a surjective transformation.
Thus, it is only possible for T  V W to be a surjective linear transformation if dim W
dim V.
8.

Let V be the vector of all symmetric 3 3 matrices, and let T  V R6 be dened by

b
c

b
d
e

a

b
c
c

e =
d
f
e

f

Clearly, T is one-to-one and onto, so T is a bijection. Because T is the coordinate map

from V to R6, it is a linear transformation (refer to Example 7 in Section 8.1). Thus, T is a
bijective linear transformation.
9.

Let T  V Rn be dened by T(v) = (v)S, where S = {u1, u2, , un} is a basis of V. We

know from Example 7 in Section 8.1 that the coordinate map is a linear transformation.
Let (a1, a2, , an) be any point in Rn. Then, for the vector v = a1u1 + a2u2 + + anun, we
have
T(v) = T(a1u1 + a2u2 + + anun) = (a1, a2, , an)
so T is onto.
Also, let v1 = a1u1 + a2u2 + + anun and v2 = b1u1 + b2u2 + + bnun. If T(v1) =
T(v2), then (v1)S = (v2)S, and thus (a1, a2, , an) = (b1, b2, , bn). It follows that a1 = b1,
a2 = b2, , an = bn, and thus
v 1 = a 1u 1 + a 2u 2 + + a nu n = v 2.
So, T is one-to-one and is thus an isomorphism.

10.

T1 and T2 are both bijective linear transformations, we know from Theorem 8.1.2 that
T1
T2 is also a linear transformation. Let T1  V W and T2  U V. Because T1 is onto,
we know that for any w in W, there exists a v in V so that T1(v) = w. Similarly, because T2
is onto, we know that for any v in V, there exists a u so that T2(u) = v. Then
(T1
T2)(u) = T1(T2(u)) = T1(v) = w,
and T1

T2 is onto.

If there are two vectors u1 and u2 so that (T1
T2)(u1) = (T1
T2)(u2), then T1(T2(u1))
= T1(T2(u2)). Since T1 is one-to-one, this means that T2(u1) = T2(u2), and since T2 is oneto-one, this means that u1 = u2. Thus, the composition T1
T2 is one-to-one.
Thus, the composition of two bijective linear transformations is again a bijective linear
transformation.

424

Exercise Set 8.6

11.

Let V = Span{1, sin x, cos x, sin 2x, cos 2x}. Differentiation is a linear transformation (see
Example 11, Section 8.1). In this case, D maps functions in V into other functions in V. To
construct the matrix of the linear transformation with respect to the basis B = {1, sin x,
cos x, sin 2x, cos 2x}, we look at coordinate vectors of the derivatives of the basis vectors:
D(1) = 0

D(sin x) = cos x
D(cos x) = sin x
D(cos 2x) = 2 sin 2x

D(sin 2x) = 2 cos 2x

The coordinate matrices are:

0
0
0
0
0





0
0
1
0
0
[ D(1)] B = 0 [ D(sin x )] B = 1 [ D(cos x )] B = 0 [ D(sin 2 x )] B = 0 [ D(cos 2 x )] B = 0 .





2
0
0
0
0
0
2
0
0
0

Thus, the matrix of the transformation is

AD =

0
0
0
0
0

0
0
1
0
0

0
1
0
0
0

0
0
0
0
2

0
0

2
0

Then, differentiation of a function in V can be accomplished by matrix multiplication by the

formula
[D(f)]B = AD[f]B.
The nal vector, once transformed back to V from coordinates in R5, will be the desired
derivative.
For example,
3 0

4 0
[ D( 3 4 sin x + sin 2 x + 5 cos 2 x )] B = AD 0 = 0

1 0
5 0

0
0
1
0
0

0
1
0
0
0

0
0
0
0
2

0
0

2
0

3 0

4 0
0 = 4 .

1 10
5 2

Thus, D(3 4 sin x + sin 2 x + 5 cos 2x) = 4 cos x 10 sin 2x + 2 cos 2x.

12.

(a) We have
u

= u, u

1/ 2
V

= T ( u ), T ( u )

1/ 2
W

= T( u ) W

Exercise Set 8.6

425

so an inner product space isomorphism preserves lengths. The angle V between u

and v in V is given by

cos V =

( u, v )V
u

vV

and the angle W between T(u) and T(v) in W is given by

cos W =

T ( u ), T ( v )

T( u ) W T( v ) W

Thus, because the inner product space isomorphism preserves lengths,

cos W =

T ( u ), T ( v )

T( u ) W T( v )

u, v
u

vV

= cos V .

and the inner product space isomorphism also preserves angles.

(b) If B = {v1, v2, , v2} is an orthonormal set in V, then
0
(T (vi ), T (v j )) = (vi , v j ) =
1

if i j
if i = j

Thus, the set {T(v1, T(v2), , T(vn)} = is an orthonormal set in W.

R2

However, in general this is not true. Consider the linear transformation T  R2

dened by
1
T ( e1 ) = and T ( e2 ) =
0

1

1

This transformation is a change of basis transformation, and is thus one-to-one and

onto, but the vectors T(e1) and T(e2) are not orthonormal. In fact,
T(e2)
= 2,
and
T(e1), T(e2) = 1 0. Thus, length and angles are not preserved with this
transformation.
(c) The set {e1, e2, , en} is an orthonormal basis of W. By the Gram-Schmidt process, we
can construct an orthonormal basis {v1, v2, , vn} of V. Dene a linear transformation
T  V W by
T(vj) = ej, j = 1, 2, , n.

426

Exercise Set 8.6

Let u = a1v1 + a2v2 + + anvn and v = b1v1 + b2v2 + + bnvn. Then

T(u) = a1T(v1) + a2T(v2) + + anT(vn)
= a 1e 1 + a 2e 2 + + a ne n
a1

a
= 2

a
n
Similarly,
T(v) = b1T(v1) + b2T(v2) + + bnT(vn)
= b 1e 1 + b 2e 2 + + b ne n
b1

b
= 2


bn
a1 b1

a2
b2
So, if T(u) = T(v), then = and a1 = b1, a2 = b2, , an = bn. Thus, u = v
 

an bn
and T is one-to-one.
c1

c
For any vector w = 2 in W, we have


cn
c1

c

+ cnvn) = 2 = w.
T(c1v1 + c2v2 +


cn
so T is onto.

Exercise Set 8.6

427

We now need to show that T preserves the inner product. We have

u, vV = a1v1 + a2v2 + + anvn, b1v1 + b2v2 + + bnvn
n

k =1 k =1

ajbk vj, vk.

Recall that if j k, then vj, vk = 0. We then have

u, vV = a1b1 v1, v1 + a2b2 v2, v2 + + anbn vn, vn.
Now recall that vj, vj = 1. Then
u, v = a1b1 + a2b2 + + anbn
We also have
T(u), T(v)W = a1e1 + a2e2 + + anen, b1e1 + b2e2 + + bnen
a1

a
= 2


an

[b1 b2 bn]

= a 1b 1 + a 2b 2 + + a nb n.
Thus, T(u), T(v)W = u, vV and T is an inner product space isomorphism.
(d) Let dim V = dim W = n. Then by Part (c), there is an inner product isomorphism T1 
V Rn and another inner product isomorphism T2  W Rn. Then T21  Rn W is
an isomorphism by Problem 6. And, since
u, v = T2(u), T2(v)Rn,
we rename x = T2(u) and y = T2(v) and we have
T21(x), T21(y)W = x, yRn.
Thus, T21  Rn W is another inner product space isomorphism. Then, the
composition (T21
T1)  V W is an isomorphism by Problem 10. We have
u, vV = T1(u), T1(v)Rn
= T21(T1(u)), T21(T1(v))W.
= (T21
so T21

T1)(u), (T21
T1)(v)W.

T1 is an inner product isomorphism from V to W.

428

Exercise Set 8.6

(e) An orthonormal basis for P5 is {1, x, x2, x3, x4, x5}, using the inner product
a0 + a1x + a1x2 + + a5x5, b0 + b1x + b2x2 + + b5x5P = a0b0 + a1b1 + + a5b5.
5

An orthonormal basis for M22 is

1

0
0

0 0
,
0 0

1
0

0 0
,
0 0

0
0

1 0
,
0 1

0
0

0 0
,
0 0

0
1

0 0
,
0 0

( )

0
0

1
,
0

( )

0
0

0
.
1

0
0

0
,
1

using the inner product

A, BM = tr(AT B).
23

We can dene a linear transformation T  P5 M23 by

1
T (1) =
0

0
0

0
,
0

0
T ( x) =
0

( )

0
0

0
,
0

0
T x4 =
0

0
T x3 =
1

( )

1
0

0
,
0

0
T x2 =
0

0
1

0
,
0

0
T x5 =
0

The transformation T is one-to-one and onto. To see that is an inner product

isomorphism, we need to compute u, vP and T(u), T(v)M . Let u = a0 + a1x +
5
23
a2x2 + + a5x5, and let v = b0 + b1x + b2x2 + + b5x5. Then we have
u, vP = a0b0 + a1b1 + + a5b5
5

and

T ( u ), T ( v )

M23

a
a1 a2 b0 b1
= 0
,
a3 a4 a5 b3 b4
= a0b0 + a1b1 +  + a5 + b5 .

b2

b5

Thus, u, vP = T(u),T(v)M , and T is an inner product space isomorphism.

5

23

SUPPLEMENTARY EXERCISES 8

3.

By the properties of an inner product, we have

T(v + w) = v + w, v0v0
= (v, v0 + w, v0)v0
= v, v0v0 + w, v0v0
= T(v) + T(w)

and
T(kv) = kv, v0v0 = kv, v0v0 = kT(v)
Thus T is a linear operator on V.

4.

(a) By direct computation, we have

T(x + y) = ((x + y) v1, , (x + y) vm)
= (x v1 + y v1, , x vm + y vm)
= (x v1, , x vm) + (y v1, , y vm)
= T(x) + T(y)

and
T(kx) = ((kx) v1, , (kx) vm)
= (k(x v1), , k(x vm))
= kT(x)

429

430

Supplementary Exercises 8

4.

(b) If {e1, , en} is the standard basis for Rn, and if vi = (a1i, a2i, , ani) for i = 1, , m,
then
T(ej) = (aj1, aj2, , ajm)
But T(ej), interpreted as a column vector, is just the jth column of the standard matrix
for T. Thus the ith row of this matrix is (a1i, a2i, , ani), which is just vi.

5.

(a) The matrix for T with respect to the standard basis is

A=2
1

0
1
0

1
1

1
3
0

We rst look for a basis for the range of T; that is, for the space of vectors B such that
Ax = b. If we solve the system of equations
+ z + w = b1

2x + y + 3x + w = b2
+ w = b3

we nd that = z = b1 b3 and that any one of x, y, or w will determine the other two.
Thus, T(e3) and any two of the remaining three columns of A is a basis for R(T).
Alternate Solution :We can use the method of Section 5.5 to find a basis for the
column space of A by reducing AT to row-echelon form. This yields

0
0

2
1
0
0

0
1

so that the three vectors

1

2

1

0

1

0

0

0

1

form a basis for the column space of T and hence for its range.

Supplementary Exercises 8

431

Second Alternative: Note that since rank(A) = 3, then R(T) is a 3-dimensional

subspace of R3 and hence is all of R3. Thus the standard basis for R3 is also a basis for
R(T).
To nd a basis for the kernel of T, we consider the solution space of Ax = 0. If we set
b1 = b2 = b3 = 0 in the above system of equations, we nd that z = 0, x = w, and y =
w. Thus the vector (1, 1, 0, 1) forms a basis for the kernel.

7.

(a) We know that T can be thought of as multiplication by the matrix

1
[T ] B =
1

1
1
2
2

2
4
5
3

6
6

where reduction to row-echelon form easily shows that rank([T]B) = 2. Therefore the
rank of T is 2 and the nullity of T is 4 2 = 2.
(b) Since [T]B is not invertible, T is not one-to-one.

9.

(a) If A = P1 BP, then

AT = (P1 BP)T
= PT BT (P1)T
= ((PT)1)

BT (P1)T

= ((P1)T)T B (P1)T
Therefore AT and BT are similar. You should verify that if P is invertible, then so is PT
and that (PT)1 = (P1)T.

10.

If statement (i) holds, then the range of T is V and hence rank(T) = n. Therefore, by the
Dimension Theorem, the nullity of T is zero, so that statement (ii) cannot hold. Thus (i)
and (ii) cannot hold simultaneously.
Now if statement (i) does not hold, then the range of T is a proper subspace of V and
rank(T) < n. The Dimension Theorem then implies that the nullity of T is greater than
zero. Thus statement (ii) must hold. Hence exactly one of the two statements must always
hold.

432

11.

Supplementary Exercises 8

a
If we let X =
c

b
, then we have
d
a
T
c

b a + c b + d b
=
+
d 0
0 d
a + b + c 2b + d
=

d
d

The matrix X is in the kernel of T if and only if T(X) = 0, i.e., if and only if
a+b+c
2b

=0
+d=0
d=0

Hence
a
X =
a

1
The space of all such matrices X is spanned by the matrix
1

0
, and therefore has
0

dimension 1. Thus the nullity is 1. Since the dimension of M22 is 4, the rank of T must
therefore be 3.
Alternate Solution. Using the computations done above, we have that the matrix for this
transformation with respect to the standard basis in M22 is
1

0
0

1
2
0
0

1
0
0
0

1
1

Since this matrix has rank 3, the rank of T is 3, and therefore the nullity must be 1.

Supplementary Exercises 8

12.

433

We are given that there exist invertible matrices P and Q such that A = P1 BP and B = Q1
CQ. Therefore
A = P1(Q1 CQ)P = (QP)1 C(QP)
That is, A and C are similar.

13.

The standard basis for M22 is the set of matrices

1

0 0
,
0 0

1 0
,
0 1

0 0
,
0 0

If we think of the above matrices as the vectors

[1

0]T,

[0

0]T,

[0

0]T,

[0

1]T

0]T,

[0

0]T,

[0

1]T

0
0
1
0

0
1
0
0

0
0

then L takes these vectors to

[1

0]T,

[0

Therefore the desired matrix for L is

1

0
0

0
14.

(a) Reading directly from P, we have

v1 = 2u1 + u2
v2 = u1 + u2 + u3
v3 = 3u1 + 4u2 + 2u3

434

14.

Supplementary Exercises 8

(b) Since

= 2
1

5
3

5
4
2

by direct calculation we have

u1 = 2v1 2v2 + v3
u2 = 5v1 + 4v2 2v3
u3 = 7v1 5v2 + 3v3

15.

The transition matrix P from B to B is

1

P = 0
0

1
1
0

1
1

Therefore, by Theorem 8.5.2, we have

[T ] B

= P [T ] B P = 1
0
1

0
0
1

2
1

Alternate Solution: We compute the above result more directly. It is easy to show that u1
= v1, u2 = v1 + v2, and u3 = v2 + v3. So
T(v1) = T(u1) = 3u1 + u2 = 4v1 + v2
T(v2) = T(u1 + u2) = T(u1) + T(u2)
= u1 + u2 + u3 = v3
T(v3) = T(u1 + u2 + u3) = T(u1) + T(u2) + T(u3)
= 8u1 u2 + u3
= 9v1 2v2 + v3

Supplementary Exercises 8

16.

a
Let P =
c

435

b
and solve for a, b, c, and d so that
d
1

1
1 2
= P
4
1

1
1
P or P
3
1

1 2
=
4 1

1
P
3

This yields the system of equations

a b = 2a + c
a + 4b = 2b + d
c d = a + 3c
c + 4d = b + 3c
which has solution b = a, c = 0, and d = a. Thus, for instance,

1
P=
0

1
and
1

1
P 1 =
0

will work.
However, if we try the same procedure on the other pair of matrices, we nd that a =
3d, b = d, and c = 3d, so that det(P) = 3d2 3d2 = 0. Thus P is not invertible.
Alternatively, if there exists an invertible matrix P such that

1
1 1
=P
2
1

2
P
0

then we have a matrix with zero determinant on the left, and one with nonzero determinant
on the right. Why? Thus the two matrices cannot be similar.

17.

Since

0 1
0 1
1 1

0 = 0 , T 1 = 1 , and T 0 = 0
0 0
0 1
1 1

436

Supplementary Exercises 8

we have
1

[T ] B = 0
1

1
1
0

0
1

In fact, this result can be read directly from [T(X)]B.

18.

We know that det(T) 0 if and only if the matrix of T relative to any basis B has nonzero
determinant; that is, if and only if every such matrix is invertible. Choose a particular basis
B for V and let V have dimension n. Then the matrix [T]B represents T as a matrix
transformation from Rn to Rn. By Theorem 4.3.1, such a transformation is one-to-one if and
only if [T]B is invertible. Thus T is one-to-one if and only if det(T) 0.

19.

(a) Recall that D(f + g) = (f(x) + g(x)) = f (x) + g(x) and D(cf) = (cf(x)) = cf (x).
(b) Recall that D(f) = 0 if and only if f(x) = a for some constant a if and only if f(x) = ax
+ b for constants a and b. Since the functions f(x) = x and g(x) = 1 are linearly
independent, they form a basis for the kernel of D.
(c) Since D(f) = f(x) if and only if f (x) = f(x) if and only if f(x) = aex + bex for a and
b arbitrary constants, the functions f(x) = ex and g(x) = ex span the set of all such
functions. This is clearly a subspace of C2 (, ) (Why?), and to show that it has
dimension 2, we need only check that ex and ex are linearly independent functions.
To this end, suppose that there exist constants c1 and c2 such that c1ex + c2ex = 0. If
we let x = 0 and x = 1, we obtain the equations c1 + c2 = 0 and c1e + c2e1 = 0. These
imply that c1 = c2 = 0, so ex and ex are linearly independent.

21.

(a) We have
p( x1 ) + q( x1 ) p( x1 ) q( x1 )

T ( p( x ) + q( x )) = p( x2 ) + q( x2 ) = p( x2 ) + q( x2 ) = T ( p( x )) + T ( q( x ))
p( x3 ) + q( x3 ) p( x3 ) q( x3 )
and
p( x1 )
kp( x1 )

T ( kp( x )) = kp( x2 ) = k p( x2 ) = kT ( p( x ))
p( x3 )
kp( x3 )

Supplementary Exercises 8

437

(b) Since T is dened for quadratic polynomials only, and the numbers x1, x2, and x3 are
distinct, we can have p(x1) = p(x2) = p(x3) = 0 if and only if p is the zero polynomial.
(Why?) Thus ker(T) = {0}, so T is one-to-one.
(c) We have
T(a1P1(x) + a2P2(x) + a3P3(x)) = a1T(P1(x)) + a2T(P2(x)) + a3T(P3(x))
1
0
0



= a1 0 + a2 1 + a3 0
0
0
1
a1

= a2
a3
(d) From the above calculations, we see that the points must lie on the curve.

23.

Since

if k = 0
0
D( x k ) = k1
if k = 1, 2, , n
kx
then

if k = 0
( 0, , 0)
[ D( x k )] B =
( 0, , k, , 0) if k = 1, 2, , n

kth component
where the above vectors all have n + 1 components. Thus the matrix of D with respect to
B is

438

Supplementary Exercises 8

0
0


0

0
24.

1
0
0

0
0

0
2
0

0
0

0
0
3

0
0





0
0


n




Call the basis B and the vectors v0, v1, , vn. Notice that D(vi) = vi1 for i = 1, , n,
while D(v0) = 0. That is,

( 0, , 0)
[ D( v k )] B =
( 0, , 1, , 0)

if k = 0
if k = 1, 2, , n

kth componeent

where the above vectors all have n + 1 components. Thus the matrix of D with respect to
B is
0

0
0


0

1
0
0

0
0

0
1
0

0
0

0
0
1

0
0







0
0


1

In fact, the differentiation operator maps Pn to Pn1.

25.

Let Bn and Bn+1 denote the bases for Pn and Pn+1, respectively. Since
xk+1 for k = 0, , n
J(xk) =
k+1

Supplementary Exercises 8

439

we have

1
[ J( x k )] Bn+1 = 0, ,
, , 0
k+1

( n + 2 components)

( k + 2)nd component
where [xk]B = [0, , 1, , 0]T with the entry 1 as the (k + 1)st component out of a total
n
of n + 1 components. Thus the matrix of J with respect to Bn+1 is
0

1
0

0


0
0
12
0

0

with n + 2 rows and n + 1 columns.

0
0
0
13

0







1 ( n + 1)