Professional Documents
Culture Documents
Department of Mathematics
IIT Guwahati
March-June 2023
1 / 15
Linear Transformations
Topics:
Linear Transformation
Kernel and Range
Rank-Nullity Theorem
Invertible Linear Transformations
2 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT)
3 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT) if for all u, v ∈ V and α ∈ F
3 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT) if for all u, v ∈ V and α ∈ F
3 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT) if for all u, v ∈ V and α ∈ F
3 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT) if for all u, v ∈ V and α ∈ F
3 / 15
Linear Transformations
Definition: Let V and W be vector spaces over the field F. A map T : V −→ W is
called a linear transformation (LT) if for all u, v ∈ V and α ∈ F
3 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn .
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear.
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
4 / 15
Linear transformations from Rn to Rm
• Let A ∈ Rm×n . Define TA : Rn −→ Rm by TA (x) := Ax for all x ∈ Rn . Then TA is
linear. Indeed, TA (αx + βy) = A(αx + βy) = αAx + βAy = αTA (x) + βTA (y).
5 / 15
Plane rotation "in #R2 " #" # " #
x cos θ − sin θ x x cos θ − y sin θ
We have G (θ) = = .
y sin θ cos θ y x sin θ + y cos θ
e2
" #
cos θ
= G (θ)e1
sin θ
θ
e1
Plane rotation "in #R2 " #" # " #
x cos θ − sin θ x x cos θ − y sin θ
We have G (θ) = = .
y sin θ cos θ y x sin θ + y cos θ
e2
" #
cos θ
= G (θ)e1
sin θ
θ
e1
Plane rotation "in #R2 " #" # " #
x cos θ − sin θ x x cos θ − y sin θ
We have G (θ) = = .
y sin θ cos θ y x sin θ + y cos θ
" # e2
− sin θ
G (θ)e2 =
cos θ
" #
cos θ
= G (θ)e1
θ sin θ
θ
e1
Plane rotation "in #R2 " #" # " #
x cos θ − sin θ x x cos θ − y sin θ
We have G (θ) = = .
y sin θ cos θ y x sin θ + y cos θ
" # e2
− sin θ
G (θ)e2 =
cos θ
" #
cos θ
= G (θ)e1
θ sin θ
θ
e1
Plane rotation "in #R2 " #" # " #
x cos θ − sin θ x x cos θ − y sin θ
We have G (θ) = = .
y sin θ cos θ y x sin θ + y cos θ
" # e2
− sin θ
G (θ)e2 =
cos θ
" #
cos θ
= G (θ)e1
θ sin θ
θ
e1
5 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
6 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
Rx
Define T : C [0, 1] → C [0, 1] by (Tf )(x) := 0 f (t)dt. Then T is a linear
transformation.
6 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
Rx
Define T : C [0, 1] → C [0, 1] by (Tf )(x) := 0 f (t)dt. Then T is a linear
transformation.
Define T : R[x] → R by T (p(x)) := p(0). Then T is a linear transformation.
6 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
Rx
Define T : C [0, 1] → C [0, 1] by (Tf )(x) := 0 f (t)dt. Then T is a linear
transformation.
Define T : R[x] → R by T (p(x)) := p(0). Then T is a linear transformation.
Define T : Rn×n −→ Rn×n by T (A) := 2A − A> . Then T is a linear
transformation.
6 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
Rx
Define T : C [0, 1] → C [0, 1] by (Tf )(x) := 0 f (t)dt. Then T is a linear
transformation.
Define T : R[x] → R by T (p(x)) := p(0). Then T is a linear transformation.
Define T : Rn×n −→ Rn×n by T (A) := 2A − A> . Then T is a linear
transformation.
Let A ∈ Rm×m and B ∈ Rn×n . Define T : Rm×n −→ Rm×n by
T (X ) := AX − XB. Then T is a linear transformation.
6 / 15
Examples
df (x)
Define T : C 1 [0, 1] → C [0, 1] by (Tf )(x) := dx . Then T is a linear
transformation.
Rx
Define T : C [0, 1] → C [0, 1] by (Tf )(x) := 0 f (t)dt. Then T is a linear
transformation.
Define T : R[x] → R by T (p(x)) := p(0). Then T is a linear transformation.
Define T : Rn×n −→ Rn×n by T (A) := 2A − A> . Then T is a linear
transformation.
Let A ∈ Rm×m and B ∈ Rn×n . Define T : Rm×n −→ Rm×n by
T (X ) := AX − XB. Then T is a linear transformation.
" #
p(1) p(2)
Define T : Pn −→ R2×2 by T (p(x)) := . Then T is a linear
p(3) p(4)
transformation.
6 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Basic properties of LT
7 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
8 / 15
Action of an LT
Theorem: Let {v1 , . . . , vn } be a basis of V. Let u1 , . . . , un be arbitrary vectors in W.
Then there is a unique LT T : V −→ W such that T (vi ) = ui for i = 1 : n.
9 / 15
Kernel and range space
Let T : V −→ W be a linear transformation. Then the kernel (null space) N(T ) and
the range space R(T ) of T are defined by
9 / 15
Kernel and range space
Let T : V −→ W be a linear transformation. Then the kernel (null space) N(T ) and
the range space R(T ) of T are defined by
9 / 15
Kernel and range space
Let T : V −→ W be a linear transformation. Then the kernel (null space) N(T ) and
the range space R(T ) of T are defined by
9 / 15
Kernel and range space
Let T : V −→ W be a linear transformation. Then the kernel (null space) N(T ) and
the range space R(T ) of T are defined by
9 / 15
Kernel and range space
Let T : V −→ W be a linear transformation. Then the kernel (null space) N(T ) and
the range space R(T ) of T are defined by
9 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Rank-nullity theorem
10 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x).
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0}
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
R(D) = {D(a + bx + cx 2 + dx 3 ) : a, b, c, d ∈ R}
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
R(D) = {D(a + bx + cx 2 + dx 3 ) : a, b, c, d ∈ R}
= {b + 2cx + 3dx 2 : b, c, d ∈ R}
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
R(D) = {D(a + bx + cx 2 + dx 3 ) : a, b, c, d ∈ R}
= {b + 2cx + 3dx 2 : b, c, d ∈ R} = P2 .
11 / 15
Example
Let D : P3 → P3 be defined by D(p(x)) = p 0 (x). Then
N(D) = {a + bx + cx 2 + dx 3 : D(a + bx + cx 2 + dx 3 ) = 0}
= {a + bx + cx 2 + dx 3 : bx + 2cx + 3dx 2 = 0}
= {a + bx + cx 2 + dx 3 : b = c = d = 0} = {a : a ∈ R}.
R(D) = {D(a + bx + cx 2 + dx 3 ) : a, b, c, d ∈ R}
= {b + 2cx + 3dx 2 : b, c, d ∈ R} = P2 .
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
Proof: Note that T (u) = T (v) ⇐⇒ T (u − v) = 0 ⇐⇒ u − v ∈ N(T ).
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
Proof: Note that T (u) = T (v) ⇐⇒ T (u − v) = 0 ⇐⇒ u − v ∈ N(T ). Hence T is
one-one ⇐⇒ N(T ) = {0}.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
Proof: Note that T (u) = T (v) ⇐⇒ T (u − v) = 0 ⇐⇒ u − v ∈ N(T ). Hence T is
one-one ⇐⇒ N(T ) = {0}. Next rank(T ) = n ⇐⇒ R(T ) = W ⇐⇒ T is onto.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
Proof: Note that T (u) = T (v) ⇐⇒ T (u − v) = 0 ⇐⇒ u − v ∈ N(T ). Hence T is
one-one ⇐⇒ N(T ) = {0}. Next rank(T ) = n ⇐⇒ R(T ) = W ⇐⇒ T is onto.
12 / 15
One-one and onto maps
Definition: A linear transformation T : V −→ W is called one-one if T maps distinct
vectors in V to distinct vectors in W. If R(T ) = W then T is called onto.
Theorem: Let T : V −→ W be a linear transformation. Then
T is one-one ⇐⇒ N(T ) = {0}.
If dim(V) = dim(W) = n, then T is onto ⇐⇒ T is one-one ⇐⇒ rank(T ) = n.
Proof: Note that T (u) = T (v) ⇐⇒ T (u − v) = 0 ⇐⇒ u − v ∈ N(T ). Hence T is
one-one ⇐⇒ N(T ) = {0}. Next rank(T ) = n ⇐⇒ R(T ) = W ⇐⇒ T is onto.
13 / 15
Composition of linear transformations
13 / 15
Composition of linear transformations
13 / 15
Composition of linear transformations
13 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW ,
14 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW , where IV and IW
are identity transformations on V and W, respectively.
14 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW , where IV and IW
are identity transformations on V and W, respectively. The transformation S is called
an inverse of T .
14 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW , where IV and IW
are identity transformations on V and W, respectively. The transformation S is called
an inverse of T .
14 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW , where IV and IW
are identity transformations on V and W, respectively. The transformation S is called
an inverse of T .
14 / 15
Invertible linear transformations
Definition: A linear transformation T : V −→ W is invertible if there is a linear
transformation S : W −→ V such that S ◦ T = IV and T ◦ S = IW , where IV and IW
are identity transformations on V and W, respectively. The transformation S is called
an inverse of T .
14 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" #
c
T −1 (c + dx) = .
d −c
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
" #!
a
Also, (T ◦ T −1 )(a + bx) = T = a + (b − a + a)x = a + bx.
b−a
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
" #!
a
Also, (T ◦ T −1 )(a + bx) = T = a + (b − a + a)x = a + bx.
b−a
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
" #!
a
Also, (T ◦ T −1 )(a + bx) = T = a + (b − a + a)x = a + bx.
b−a
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
" #!
a
Also, (T ◦ T −1 )(a + bx) = T = a + (b − a + a)x = a + bx.
b−a
15 / 15
Example " #!
a
• Define T : R2 −→ P1 by T := a + (a + b)x. Then T is invertible and
b
" # " #! " #
c a a
T −1 (c + dx) = . Indeed, (T −1 ◦ T ) = T −1 (a + (a + b)x) = .
d −c b b
" #!
a
Also, (T ◦ T −1 )(a + bx) = T = a + (b − a + a)x = a + bx.
b−a
*** 15 / 15