Lecture 5
Lecture 5
Amit Tripathi
Definition
Let V and W be vector spaces over F . A linear transformation
from V into W is a function T : V → W such that
Example
Let A be an m × n matrix over F . Then the map
A : Rn → Rm , X 7→ AX ,
is a linear transformation.
Proof: Let X , Y ∈ Rn be two column vectors and c ∈ R be any
scalar. Then
Example
Let V = R[x] be the real vector space of polynomials in x. Which
of the following maps T : V → V is a linear transformation:
(a) T (f ) = f 2 for any f ∈ V .
(b) T (f ) = g · f for any f ∈ V , and for a fixed g ∈ V .
(c) T (f ) = f + g for any f ∈ V , and for a fixed g ∈ V .
(d) T (f ) = D(f ) where D is the derivative map i.e.
df
D(f (x)) = .
dx
(e) The evaluation function eva for any a ∈ R.
Example
Let V be the vector space of all continuous functions from R into
R. Define T : V → V as
Z x
T (f )(x) = f (t)dt.
0
Lemma
Let V1 , V2 and V3 be vector spaces. Let T : V1 → V2 , and
S : V2 → V3 be linear transformations. Then the composed map
S ◦ T : V1 → V3 , is a linear transformation.
Proof.
Let v , v ′ ∈ V1 and c ∈ R. Then
S ◦ T (cv + v ′ ) = S cT (v ) + T (v ′ )
Example
Consider R2 and rotate by some angle θ around origin
(anticlockwise direction). This defines a map
R θ : R2 → R2 .
Is it a linear transformation?
Example
Example
With respect to the (ordered) standard basis, reflection over x-axis
can be defined as
x x
7→ .
y −y
Does two distinct reflections commute? Does a reflection and a
rotation commute?
Example
For any x = (x1 , x2 , x3 ) ∈ R3 , define T : R3 → R2 as
Example
Let V be a 2 dimensional vector and let B = {α1 , α2 } be a basis.
Let W be any vector space.
Claim: To define a linear transformation T : V → W , it is
sufficient to give two vectors β1 , β2 ∈ W such that
Example
Suppose we have given such vectors β1 , β2 ∈ W .
Let α ∈ V be any vector. Then
α = x1 α1 + x2 α2 .
Define
T (α) := x1 β1 + x2 β2 .
Let α′ ∈ V be another vector such that
α′ = x1′ α1 + x2′ α2 .
and c ∈ F be a scalar.
Example
Then by definition of T
Theorem
Let V be a finite dimensional vector space over F and let
{α1 , · · · , αn } be an ordered basis for V . Let W be a vector space
and let β1 , · · · , βn ∈ W be any vectors. Then there exists a
unique linear transformation
T :V →W
such that
T (αi ) = βi , for i = 1, · · · , n.
Proof.
Existence as a map: We first define T for an arbitrary vector
α ∈ V . Since {αi } form a basis of V , there are unique scalars
c1 , · · · , cn , such that
α = c1 α1 + · · · + cn αn .
Define
T (α) = c1 β1 + · · · + cn βn .
This defines a map
T : V → W.
Is T a linear transformation?
Then
Proof.
Uniqueness: Suppose T ′ be any other linear transformation from
V into W , such that T ′ also satisfies the property
T ′ (αi ) = βi , for i = 1, · · · , n.
Claim T = T ′ .
Let α ∈ V be any arbitrary vector and (as before), and let
α = c1 α1 + · · · + cn αn , be the expression for α in terms of the
basis {αi }. Then
T (α) = T (c1 α1 + · · · + cn αn )
=c1 β1 + · · · + cn βn .
Proof.
Similarly,
T ′ (α) = T ′ (c1 α1 + · · · + cn αn )
=c1 β1 + · · · + cn βn .
Definition
Let T : V → W be a linear transformation. We define the null
space (or the kernel) of T , denoted N(T ), to be the set of all
the vectors α ∈ V such that T (α) = 0.
Definition
The range space (or the image) of T is defined as the set
Lemma
The null space of T is a vector subspace of V . The range of T is a
vector subspace of W .
Definition
If V is finite dimensional, the nullity of T is the dimension of
N(T ), and the rank of T is the dimension of R(T ).
(a) If V is finite dimensional then the nullity of T is finite.
(b) What about rank of T ?
Example
Let V be the vector space of polynomials in x and let
D:V →V
Example
Let V be the vector space of 2 × 2 matrices in F . Define a map
T : V → V , T (A) = A + At .
Example
Let V be the vector space of 2 × 2 matrices over R. Fix a matrix
B ∈ V . Define
Example
Fix positive integers m < n. Let V be an n dimensional vector
space and let {α1 , · · · , αn } be a basis for V . Let W be an m
dimensional vector space and let {β1 , · · · , βn } be a basis for W .
Define a linear transformation T : V → W by setting
(
βi , if i ≤ m
T (αi ) =
0, if m < i ≤ n.
Example
Fix positive integers m ≥ n. Let V be an n dimensional vector
space and let {α1 , · · · , αn } be a basis for V . Let W be an m
dimensional vector space and let {β1 , · · · , βn } be a basis for W .
Define a linear transformation T : V → W by setting
T (αi ) = βi for i = 1, · · · , n.
Proof.
Let α1 , · · · , αm ∈ N(T ) be a basis for the null space of T . These
are independent vectors in V , so we can extend it to a basis
α1 , · · · , αm , · · · , αn of V .
(a) dim(V ) = n, and nullity (T ) = m.
(b) The vectors T (α1 ), · · · , T (αn ) span the range space of T .
(c) In fact, the vectors T (αm+1 ), · · · , T (αn ) span the range
space of T .
(d) To prove the theorem, it is sufficient to show that the vectors
T (αm+1 ), · · · , T (αn ) are linearly independent.
α = c1 α1 + · · · + cm αm . (3)
c1 α1 + · · · + cm αm − cm+1 αm+1 − · · · − cn αn = 0.
Proof.
c1 α1 + · · · + cm αm − cm+1 αm+1 − · · · − cn αn = 0.
Since α1 , · · · , αn are linearly independent, we conclude that
c1 = c2 = · · · = cn = 0.
dim(W ) ≤ dim(V ).
Corollary
N(T ) = 0.
dim(V ) ≤ dim(W ).
Definition
An isomorphism of the vector spaces V and W is a bijective linear
transformation T : V → W . When the isomorphism is clear, we
write
V ∼= W.