Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
8 views

Lecture 10

Uploaded by

rajkaran3765
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Lecture 10

Uploaded by

rajkaran3765
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Lecture 10

Linear Transformation

Definition 1. Let V and W be vector spaces over field F. A map T : V → W is said to be a linear map
(or linear transformation) if for ∀ α ∈ F and ∀ v1 , v2 ∈ V we have:
(i) T (v1 + v2 ) = T (v1 ) + T (v2 ), (ii) T (αv) = αT (v).

Example 2. 1. The map T : V → W defined by T (v) = 0 for all v ∈ V , is linear (the zero map).
2. The map T : V → V defined by T (v) = v for all v ∈ V , is linear (the identity map).
3. Let m ≤ n. Then a map T : Rm → Rn , defined by T (x1 , x2 , . . . , xm ) = (x1 , . . . , xm , 0, . . . , 0), (n − m)
zeroes, is linear (the inclusion map).
4. Let m ≥ n. Then a map T : Rm → Rn defined by T (x1 , x2 , . . . , xm ) = (x1 , x2 , . . . , xn ), is linear (the
projection map).
5. A map T : R2 → R2 defined by T (x1 , x2 ) = (x1 , −x2 ), is linear (reflection along x-axis).
6. A map Tθ : R2 → R2 defined by Tθ (x, y) = (x cos θ + y sin θ, −x sin θ + y cos θ), is linear (rotation about
origin with angle θ.
7. Let A be a matrix of order m × n. Then A defines a linear map TA : Rn → Rm defined by TA (x) = Ax.
d
8. Let D : R[x] → R[x] defined by D(f (x)) = dx
f (x). Then D is linear (differentiation map).

Proposition 3. Let T : V → W be a linear map. Then


(i) T (0) = 0; (ii) T (−v) = −T (v); (iii) T (v1 − v2 ) = T (v1 ) − T (v2 ).

Definition 4. Let T : V → W be a linear map. Then the null space (or kernel) of T = {v ∈ V : T (v) =
0}, denoted as ker(T ) and Range space (or Image) of T = {T (v) : v ∈ V } denoted as Range(T ).

Example 5. 1. If T : V −→ W is the zero map, then ker(T ) = V and Range(T ) = {0}.


2. If T : V −→ V is the identity map, then ker(T ) = {0} and Range(T ) = V .
d
3. If T : Pn (R) −→ Pn (R) defined by T (f (x)) = dx
(f (x)), then ker(T ) contains all constant polynomials
and Range(T ) = Pn−1 (R).

Theorem 6. Let T : V → W be a linear map. Then ker(T ) and Range(T ) are subspaces of V and W
respectively. (Prove it yourself!)

1
Definition 7. The dimension of null space Ker(T ) is called the nullity of T and the dimension of the
range space Range(T ) of T is called the rank of T .

Theorem 8. Let V be a finite-dimensional vector space over the field F and let {v1 , . . . , vn } be a basis
for V . Let W be a vector space over the same field F and let w1 , w2 , . . . , wn be any vectors in W . Then
there is precisely one linear transformation T from V to W such that T (vi ) = wi ∀i = 1, . . . , n, and it is
given by T (v) = α1 T (v1 ) + · · · + αn T (vn ), where v = α1 v1 + · · · + αn vn and α1 , α2 , . . . , αn ∈ F.

Theorem 9. Let T : V → W be a linear map and B = {v1 , v2 , . . . , vn } be a basis for V . Then the T is
completely determined by its images on basis elements and Range(T ) = L({T (v1 ), T (v2 ), . . ., T (vn )}).

Proof: Let v ∈ V. Then v = α1 v1 + · · · + αn vn for some αi ∈ F and i = 1, . . . , n. The map T is


linear, T (v) = T (α1 v1 + · · · + αn vn ) = α1 T (v1 ) + · · · + αn T (vn ), that is, image of any vector is a linear
combination of images of basis vectors. Thus, Range(T ) = {T (v) : v ∈ V } = {α1 T (v1 ) + · · · + αn T (vn ) :
v1 , v2 , . . . , vn ∈ B, α1 , α2 , . . . , αn ∈ F} = L({T (v1 ), T (v2 ), . . ., T (vn )}).

Corollary 10. (Riesz Representation Theorem) Let T : Rn −→ R be a linear map. Then there
exist a ∈ Rn such that T (x) = at x.

Proof: Let x = (x1 , . . . , xn ) ∈ Rn . Let {e1 , . . . , en } be the standard basis of Rn . Then T (x) =
T ( ni=1 xi ei ) = ni=1 xi T (ei ). Let T (ei ) = ai . Thus T (x) = aT x, where a = (a1 , . . . , an ).
P P


Example 11. Let T : R3 → R3 defined by T (x, y, z) = (x + y − z, x − y + z, y − z). The null


space of T is {(x, y, z) : x + y − z = 0, x − y + z = 0, y − z = 0} which is the solution space of a
homogeneous system of linear equations. Thus, ker(T ) = {(x, y, z) : x = 0, y = z, z ∈ R} = {(0, t, t) :
t ∈ R} = L({(0, 1, 1)}). Thus basis of ker(T) is {(0, 1, 1)} (as non-zero singleton is independent) so
that Nullity(T ) = 1. Range(T ) = L({T (e1 ), T (e2 ), T (e3 )}) = L({(1, 1, 0), (1, −1, 1), (−1, 1, −1)}) =
L({(1, 1, 0), (1, −1, 1)}) = {α(1, 1, 0) + β(1, −1, 1) | α, β ∈ R} = {(α + β, α − β, β) | α, β ∈ R}. Note that
Range of T is linear span of {(1, 1, 0), (1, −1, 1)} which is linearly independent so that Rank(T ) is 2.

You might also like