Ch 5 Linear Transformations
Ch 5 Linear Transformations
1 / 24
Definition of linear transformations and examples
Definition 1
Let V and W be vector spaces over a field F. The map T : V → W is
said be a linear mapping or a linear transformation if it satisfies the
following two properties.
i) T (u + v ) = T (u) + T (v ), for each u, v ∈ V
ii) T (cu) = cT (u), for each u ∈ V and c ∈ F .
Example 2
Show that f : R → R defined by f (x) = x is a linear map.
2 / 24
Cont...
Example 3
Let V = Pn (R) over F = R. Then show that f : V → V defined by
f (p(x)) = p ′ (x) is a linear map.
3 / 24
Properties of linear transformations
Theorem 5
Let V and W be vector spaces over the same field F and T : V → W be
a linear mapping. Then
1 T (0V ) = 0W , where 0V is the zero element of V and 0W is the zero
element of W .
2 T (−u) = −T (u) for each u ∈ V .
3 T (a1 u1 + a2 u2 + · · · + an un ) = a1 T (u1 ) + a2 T (u2 ) + · · · + an T (un )
for each ui ∈ V and ai ∈ F .
Example 6
Let T : R2 → R2 be a linear map satisfying T (1, 1) = (1, 4) and
T (2, −1) = (−2, 3). Then find
i T (3, −1)
ii) T (a, b) for all (a, b) ∈ R2 .
4 / 24
Cont...
5 / 24
Cont...
b) Let (a, b) be an arbitrary element of R2 . To find T (a, b), we first write
(a, b) as a linear combination of (1, 1) and (2, −1). Let
(a, b) = α(1, 1) + β(2, −1). Then (a, b) = (α + 2β, α − β). This implies
that, α + 2β = a and α − β = b. Solving for α and β, we get α = a+2b 3
and β = a−b a+2b a−b
3 . That is, (a, b) = 3 (1, 1) + 3 (2, −1). By properties of
linear map, we have
a + 2b a−b
T (a, b) = T (1, 1) + (2, −1)
3 3
a + 2b a−b
= T (1, 1) + T (2, −1)
3 3
a + 2b a−b
= (1, 4) + (−2, 3)
3 3
4b − a 7a + 5b
= ( , ).
3 3
Therefore, T (a, b) = ( 4b−a
3 ,
7a+5b 2
3 ), ∀(a, b) ∈ R .
6 / 24
Kernel and Image of Linear Transformations
Definition 7
Let V and W be vector spaces over F and T : V → W be a linear map.
Then
1 The null space of T or kernel of T , denoted by Ker (T ) is, defined by
Ker (T ) = {u ∈ V |T (u) = 0W }.
2 The range of T or image of T , denoted by Im(T ), is defined as
Im(T ) = {w ∈ W |T (v ) = w for some v ∈ V }.
Theorem 8
Let T : V → W be a linear map. Then
1 Kernel of T is a subspace of V .
2 Image of T is a subspace of T .
7 / 24
Example 9
Find the kernel and image of T : R3 → R3 given by T (x, y , z) = (0, y , z).
Example 10
Find the kernel and image of the linear transformation T : R3 → R2
defined by T (x, y , z) = (x + y , y − z).
Solution:
9 / 24
Cont...
10 / 24
Cont...
Theorem 11
Let T : V → W be a linear transformation. Then T is one-to-one if and
only if KerT = {0V }.
11 / 24
Cont...
Definition 12
Let T : V → W be a linear transformation. Then
a) The dimension of the Kernel (null space) of T is called the nullity of
T.
b) The dimension of the image (range) of T is called the rank of T .
Theorem 13
(Rank-Nullity Theorem) Let V and W be vector spaces over the same
field F and T : V → W be a linear transformation. If V is finite
dimensional vector space, then
Proof: Exercise
12 / 24
Cont...
Example 14
Find the nullity and image of the linear transformation T : R3 → R2
defined by T (x, y , z) = (x + y , y − z).
13 / 24
Cont...
Theorem 15
Let T : V → W be a linear transformation and v1 , v2 , · · · , vn be linearly
independent vectors in V . If Ker (T ) = {0V }, then
T (v1 ), T (v2 ), · · · , T (vn ) are linearly independent vectors in W .
14 / 24
Algebra of linear transformations
The set of linear transformations from a vector space V into itself has
algebraic structure because of ordinary composition of function, provides a
multiplication of such transformations. We shall explore these ideas in this
section.
Notation: We denote the set of all linear transformations from a vector
space V into W over the field F by L(V , W ).
Theorem 16
Let V and W be vector spaces over a field F , and T and S be linear
transformations from V into W and α ∈ F . Then
i) T + S is a linear transformation from V into W .
ii) αT is a linear transformation from V into W .
iii) L(V , W ) is a vector space over F with respect to the operations
▶ (T + S)(v ) = T (v ) + S(v ) and
▶ (αT )(v ) = αT (v ) for all v ∈ V .
Proof: Exercise
15 / 24
Cont...
Theorem 17
Let U, V and W be vector spaces over a field F . Let T : U → V and
S : V → W be linear transformations. Then
i) the composition function S ◦ T , defined by (S ◦ T )(u) = S(T (u)) for
all u ∈ U is a linear transformation.
ii) If T is invertible, then the inverse function T −1 is a linear
transformation.
Example 18
Let T : R3 → R3 be a linear transformation given by
T (x, y , z) = (x, 3y , z). Is T invertible? If so, find a rule for T −1 like the
one which defines T .
16 / 24
Cont...
Solution: We know that KerT = {0} if and only if T is one-to-one.
Theorem 19
Let T : V → W be a linear transformation and V be finite dimensional
vector space with dimV = n. Then the following statements are
equivalent.
i) T is one-to-one
ii) If v1 , v2 , · · · , vk are linearly independent vectors in V , then
T (v1 ), T (v2 ), · · · , T (vk ) are linearly independent vectors in ImT .
iii) If {v1 , v2 , · · · , vk } is a basis of V , then {T (v1 ), T (v2 ), · · · , T (vk )} is
a basis of ImT .
iv) dim(ImT ) = n.
Proof: Exercise
18 / 24
Matrix representation of linear transformations
Theorem 20
Let T : Rn → Rm be a linear transformation. Then there exists an m × n
matrix A such that T (X ) = AX for every column vector X in Rn .
Definition 21
In the above theorem, matrix A is called the matrix associated with T , or
A is called the matrix of T .
Question: For a given linear transformation T : V → W , how can we find
the matrix representation of T ?
19 / 24
Cont...
Let T : V → W be a linear transformation and B = {v1 , v2 , . . . , vn } be a basis
for V and B ′ = {w1 , w2 , . . . , wm } be a basis for W . Then to find the matrix
representation of T w.r.t the bases B and B ′ , first find T (vi ) and express it as a
linear combination of wj , for all 1 ≤ i ≤ n and 1 ≤ j ≤ m. Let
Solution:
−9 5
T (1, 1) = (1, −1) = (2, 3) + (4, 5)
2 2
−15 3
T (1, 0) = (1, 0) = (2, 3) + (4, 5).
2 2
Therefore, the matrix of T w.r.t the bases B and B ′ is
−9 5 T −9 −15
A= 2 2 = 2 2 .
−15 3 5 3
2 2 2 2
Example 23
Let T : R3 → R2 defined by T (x, y , z) = (x + 2y + 3z, 4x + 5y + 6z).
Find the matrix of T w.r.t the standard bases
B = {(1, 0, 0), (0, 1, 0), (0, 0, 1)} and B ′ = {(1, 0), (0, 1)}.
21 / 24
Cont...
Solution:
T (1, 0, 0) = (1, 4) = 1(1, 0) + 4(0, 1)
T (0, 1, 0) = (2, 5) = 2(1, 0) + 5(0, 1)
T (0, 0, 1) = (3, 6) = 3(1, 0) + 6(0, 1).
1 2 3
Therefore, the matrix of T w.r.t the bases B and B′ is A = .
4 5 6
Exercise 24
Find the matrix representation of the linear transformation T : R3 → R2
defined by T (x, y , z) = (x + y , y + z) w.r.t the bases
B = {(1, 1, 0), (0, 1, 1), (1, 0, 1)} and B ′ = {(1, 2), (3, 1)}.
22 / 24
Eigenvalues and Eigenvectors of a Linear Transformation
Definition 25
Let T : V → V be a linear operator on a vector space V over a field F .
An eigenvalue of T is a scalar λ in F such that there is a non-zero vector
v in V with T (v ) = λv . If λ is an eigenvalue of T , then
a) any vector v in V such that T (v ) = λv is called an eigenvector of T
associated with the eigenvalue λ;
b) the collection of all vectors v of V such that T (v ) = λv is called the
eigenspace associated with λ.
23 / 24
Cont...
Exercise 26
Let T : V → V be a linear operator with KerT ̸= {0}. Prove that every
non zero vector in KerT is an eigenvector of T with eigenvalue 0.
24 / 24