← Back to Math 010

8.1 General Linear Transformations: Class Notes

Definition: (analogous to Theorem 1.8.2)

If T:V→W is a mapping from a vector space V to a vector space W, then T is called a linear transformation from V to W if the following two properties hold for all vectors 𝐮 and 𝐯 in V and for all scalars k:
a) T(k𝐮)=kT(𝐮) (homogeneity property)
b) T(𝐮+𝐯)=T(𝐮)+T(𝐯) (additivity property)

In the special case where V=W, the linear transformation T is called a linear operator on the vector space V.

Theorem 8.1.1 (analogous to Theorem 1.8.1)

If T:V→W is a linear transformation, then:
a) T(𝟎)=𝟎.
b) T(𝐮−𝐯)=T(𝐮)−T(𝐯) for all 𝐮 and 𝐯 in V.
c) T(−𝐯)=−T(𝐯) for all 𝐯 in V.

Proof of (a)

Since T is linear, T(kx→)=kT(x→) for all scalars k. Let k=0. Then

T(0→)=T(0x→)=0T(x→)=0→.

Examples of Linear Transformations

Theorem 8.1.2

Let T:V→W be a linear transformation, for which the vector space V is finite-dimensional. If S={𝐯1,𝐯2,…,𝐯n} is a basis for V, then the image of any vector 𝐯 in V can be expressed as
T(𝐯)=c1T(𝐯1)+c2T(𝐯2)+…+cnT(𝐯n) where c1,c2,…,cn are the coefficients required to express 𝐯 as a linear combination of the vectors in the basis S.

That is, linear transformations preserve linear combinations.

Proof

Let v→∈V. Then there are ci∈R such that v→=∑i=1nciv→i. So

T(v→)=T(∑i=1nciv→i)=∑i=1nT(civ→i)=∑i=1nciT(v→i).

The second line uses additivity and the third uses homogeneity. ✓

#20

Consider the basis S={𝐯1,𝐯2} for R2, where 𝐯1=(−2,1) and 𝐯2=(1,3), and let T:R2→R3 be the linear transformation such that T(𝐯1)=(−1,2,0) and T(𝐯2)=(0,−3,5). Find a formula for T(x1,x2) and use that formula to find T(2,−3).

Solution

When we did this in 1.8, we wanted the standard matrix for the transformation. Here, we will find the formula.

We start by expressing x→=(x1,x2) as a linear combination of v→1 and v→2:

(x1,x2)=c1(−2,1)+c2(1,3)

This gives the system below; row reduce its augmented matrix:

−2c1+c2=x1c1+3c2=x2⟶[−21x113x2]⟶[10−37x1+17x20117x1+27x2]

c1=−37x1+17x2,c2=17x1+27x2

(x1,x2)=(−37x1+17x2)(−2,1)+(17x1+27x2)(1,3)

Then, by Theorem 8.1.2, with T(v→1) and T(v→2) given,

T(x1,x2)=(−37x1+17x2)T(v→1)+(17x1+27x2)T(v→2)=(−37x1+17x2)(−1,2,0)+(17x1+27x2)(0,−3,5)

Collect the first, second, and third components:

=(37x1−17x2+0,−67x1+27x2−37x1−67x2,0+57x1+107x2)

T(x1,x2)=(37x1−17x2,−97x1−47x2,57x1+107x2)

So

T(2,−3)=(67+37,−187+127,107−307)=(97,−67,−207).

Answer:

T(x1,x2)=(37x1−17x2,−97x1−47x2,57x1+107x2)

T(2,−3)=(97,−67,−207)

Definition: (analogous to definitions seen in Section 4.2 (kernel) and Section 1.8 (range); also related to Definition 2 of Section 4.8 (null space) and, by Theorem 4.8.1, column space)

If T:V→W is a linear transformation, then the set of vectors in V that T maps into 𝟎 is called the kernel of T and is denoted by ker(T). The set of all vectors in W that are images under T of at least one vector in V is called the range of T and is denoted by R(T).

Diagram: T maps V to W; ker(T) in V goes to the zero vector, and V goes onto R(T) in W

A linear transformation T:V→W drawn as two planes, V on the left and W on the right. Inside V is a smaller region, ker(T); solid lines (in blue) show every vector in ker(T) going to the single point 0 in W. Dotted lines (in magenta) from the corners of V show all of V going onto a smaller region of W, the range R(T), which contains 0.

#7

Determine whether the mapping T is a linear transformation, and if so, find its kernel.
T:P2→P2, where
a. T(a0+a1x+a2x2) =a0+a1(x+1)+a2(x+1)2
b. T(a0+a1x+a2x2) =(a0+1)+(a1+1)x+(a2+1)x2

Solution

Let p→=a0+a1x+a2x2 and q→=b0+b1x+b2x2.

a) Checking T(kp→+q→) checks both properties at once:

T(kp→+q→)=T(ka0+b0+(ka1+b1)x+(ka2+b2)x2)=ka0+b0+(ka1+b1)(x+1)+(ka2+b2)(x+1)2=k[a0+a1(x+1)+a2(x+1)2]+b0+b1(x+1)+b2(x+1)2=kT(p→)+T(q→).

T is linear.

ker(T)={p→∈P2∣a0+a1(x+1)+a2(x+1)2=0 for all x}

Since 1, x+1, and (x+1)2 are linearly independent, this forces a0=a1=a2=0, so

ker(T)={0}.

b) T(0)=1+x+x2≠0, so T is not linear (a linear transformation sends 0→ to 0→ by Theorem 8.1.1).

Answer:

a. T is linear; ker(T)={0}

b. T is not linear

#10

Let T:P2→P3 be the linear transformation defined by T(p(x))=xp(x). Which of the following are in ker(T)?
a. x2
b. 0
c. 1+x
d. −x

Solution

ker(T)={p(x)∣xp(x)=0}.

The only polynomial with xp(x)=0 is the zero polynomial. It follows that ker(T)={0}, so only b is in ker(T).

Answer: b. 0 only

#11

Let T:P2→P3 be the linear transformation in Exercise 10. Which of the following are in R(T)?
a. x+x2
b. 1+x
c. 3−x2
d. −x

Solution

R(T)={xp(x)∣p(x)∈P2}.

These are polynomials of degree less than or equal to 3 with constant term 0. Of the choices, only x+x2 and −x have constant term 0.

Answer: a. x+x2 and d. −x are in R(T)

#25

Let TA:R4→R3 be multiplication by A. Find a basis for the kernel of TA, and then find a basis for the range of TA that consists of column vectors of A.

A=[12−1−2−3134−3842]

Solution

[12−1−2−3134−3842]⟶[100−107010−270010]

So x1=107x4, x2=27x4, and x3=0. With x4=t,

x→=[1072701]t.

Letting t=7, a basis for ker(TA) is {[10207]}.

The pivots are in columns 1, 2, and 3, so a basis for R(TA) is

{[1−3−3],[218],[−134]}.

Answer:

ker(TA): {[10207]}

R(TA): {[1−3−3],[218],[−134]}

Theorem 8.1.3

If T:V→W is a linear transformation, then:
a) The kernel of T is a subspace of V.
b) The range of T is a subspace of W.

Definition: (analogous to Definition 1 of Section 4.9)

Let T:V→W be a linear transformation. In the case that the range of T is finite-dimensional its dimension is called the rank of T, denoted by rank(T); and if the kernel of T is finite-dimensional, then its dimension is called the nullity of T, denoted by nullity(T).

Theorem 8.1.4 Dimension Theorem for Linear Transformations

(generalization of Theorem 4.9.2)
If T:V→W is a linear transformation from a finite-dimensional vector space V to a vector space W, then the range of T is finite-dimensional, and
rank(T)+nullity(T)=dim(V).

#13

In each part, use the given information to find the nullity of the linear transformation T.
a. T:R5→P5 has rank 3.
b. T:P4→P3 has rank 1.
c. The range of T:Mmn→R3 is R3.
d. T:M22→M22 has rank 3.

Solution

Nullity is dim[ker(T)]. Recall that the vectors in ker(T) are domain elements, so nullity(T)=dim(V)−rank(T), where V is the domain.

a. dim(R5)=5: 5−3=2, so nullity(T)=2.

b. dim(P4)=5: 5−1=4, so nullity(T)=4.

c. dim(Mmn)=mn and the rank is 3, so nullity(T)=mn−3.

d. dim(M22)=4: 4−3=1, so nullity(T)=1.

Answer: a. 2b. 4c. mn−3d. 1