Scribd
Upload
527 views10 pages

Linear Algebra and Numerical Analysis

This document defines and discusses several concepts relating to linear transformations between vector spaces, including nullity, rank, one-to-one and onto mappings, bijections, isomorphisms, and the rank-nullity theorem. It proves that a linear transformation T is one-to-one if and only if its nullspace is {0} and that the rank of T plus its nullity equals the dimension of its domain vector space. It also proves that the inverse of a bijective linear transformation is linear.

Uploaded by

Dinesh Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
527 views10 pages

Linear Algebra and Numerical Analysis

This document defines and discusses several concepts relating to linear transformations between vector spaces, including nullity, rank, one-to-one and onto mappings, bijections, isomorphisms, and the rank-nullity theorem. It proves that a linear transformation T is one-to-one if and only if its nullspace is {0} and that the rank of T plus its nullity equals the dimension of its domain vector space. It also proves that the inverse of a bijective linear transformation is linear.

Uploaded by

Dinesh Reddy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Definition: If T : V W be a linear transformation, then we

define
1. Nullity of T = dim N(T ).
2. Rank of T = dim R(T ).
Definition: A f : X Y is called one-one if
f (x1 ) = f (x2 ) x1 = x2 . f is called onto if for every y Y ,
there exists x X such that f (x) = y . If f is one-one and onto,
then it is called bijective.
Theorem: A linear transformation T : V W is one-one if and
only if N(T ) = {0}.
Proof: Assume that T is one-one. Let T (x) = 0. Then
T (x) = T (0) x = 0 N(T ) = {0}.

Conversely, suppose N(T ) = {0}. Let T (x1 ) = T (x2 ). Then


T (x1 ) T (x2 ) = 0 T (x1 x2 ) = 0 x1 x2 N(T ).
Since N(T ) = {0}, x1 = x2 T is one-one.
Recall: Let f : X Y is bijective if and only if there exists
g : Y X such that g f = idX and f g = idY . The map g is
usually denoted by f 1 .
Theorem: Let T : V W be a bijective linear transformation.
Then T 1 : W V is linear.
Proof: Let w1 , w2 W . Then there exists v1 , v2 V such that
T (v1 ) = w1 and T (v2 ) = w2 . Therefore T (v1 + v2 ) =
w1 + w2 T 1 (w1 + w2 ) = v1 + v2 = T 1 (w1 ) + T 1 (w2 ).
Similarly one can show that T 1 (w1 ) = T 1 (w1 ).

Definition: A bijective linear transformation is called an


isomorphism.
Example: Let T : R2 R2 be defined by
T (x1 , x2 ) = (x1 x2 , 2x1 + x2 ). Then T is an isomorphism.
Solution: Suppose T (x1 , x2 ) = (0, 0). Then x1 = x2 and
2x1 = x2 . This implies that x1 = x2 = 0. Therefore T is one-one.
T (1, 0) = (1, 2) and T (0, 1) = (1, 1) (1, 2), (1, 1) R(T ).
Since they are linearly independent R(T ) = R2 . Therefore T is an
isomorphism.
Example: Let {u1 , . . . , un } be an ordered basis of V over F.
Define T : V Fn by T (1 v1 + + n vn ) = (1 , . . . , n ).
Prove that T is an isomorphism.

Let V and W be finite dimensional vector spaces and T : V W


a bijective linear transformation. Let A and B denote ordered
bases of V and W respectively.
Then there exists a linear transformation T 1 such that
T 1 T = idV and T T 1 = idW . From the correspondance
between the linear transformation and matrices, it follows that the
1 ]A = ([T ]B )1 .
matrix [T ]B
A is invertible and [T
B
A

Let T : V W be a linear transformation and {v1 , . . . , vn } be a


basis of V . If w R(T ), then there exists v V such that
T (v ) = w , i.e., w = T (1 v1 + + n vn ) for some i0 s in F
w span({T (v1 ), . . . , T (vn )})
R(T ) = span({T (v1 ), . . . , T (vn )}).
Can you find an onto map T : R R2 ?
Can you find a one-one map T : R2 R?
What are all linear maps from R to R?
Exercise: Let {v1 , . . . , vn } be a basis of V and T : V W be a
linear transformation. Prove that T is one-one if and only if
{T (v1 ), . . . , T (vn )} is linearly independent in W .
Exercise: T : V W is an isomorphism if and only if for every
basis {v1 , . . . , vn } of V , the set {T (v1 ), . . . , T (vn )} is a basis of
W.

RANK-NULLITY THEOREM
Theorem: Let V be an n-dimensional vector space and
T : V W be a linear transformation. Then
Rank(T ) + Nullity(T ) = n.
Proof: We need to show that dim R(T ) + dim N(T ) = dim V . For
this, we will produce a basis of V consisting of a basis of N(T )
and inverse images of a basis of R(T ).
Let {v1 , . . . , vk } be a basis of N(T ), for some k 0. Note that if
T is one-one, then k = 0 which means the set is empty.
Also, if T is the zero map, then N(T ) = V and R(T ) = {0}. This
implies that k = n and hence the theorem is true.
Assume that T is not the zero map. Extend the basis of N(T ) to
a basis of V , say {v1 , . . . , vk , vk+1 , . . . , vn }.

RANK-NULLITY THEOREM
If we prove that {T (vk+1 ), . . . , T (vn )} is a basis of R(T ), then the
theorem is proved.
Let w R(T ). Then there exists a v V such that T (v ) = w .
Let v = 1 v1 + + n vn . Then
T (v ) = 1 T (v1 ) + + k T (vk ) + k+1 T (vk+1 ) + + n T (vn )
= k+1 T (vk+1 ) + + n T (vn )
Span({T (vk+1 ), . . . , T (vn )}).
Therefore R(T ) = Span({T (vk+1 ), . . . , T (vn )}).
Suppose k+1 T (vk+1 ) + + n T (vn ) = 0.
T (k+1 vk+1 + + n vn ) = 0.
k+1 vk+1 + + n vn N(T ).

RANK-NULLITY THEOREM

1 v1 + + k vk k+1 vk+1 n vn = 0.
i = 0 for all i = 1, . . . , n
{T (vk+1 ), . . . , T (vn )} is linearly independent.
dim R(T ) = n k = dim V dim N(T ).

Some interesting consequences


1. There does not exists a one-one map T : R2 R (more
generally from Rm to Rn for any m > n).
2. There does not exists an onto map T : R R2 (more
generally from Rm to Rn for any m < n).
3. If dim V = dim W and T : V W , then T is one-one if and
only if T is onto.
Definition: Two vector spaces V and W are isomorphic if
there exists an isomorphism T : V W .
Example 1: T : Pn Rn+1 defined by
T (a0 + a1 X + + an X n ) = (a0 , . . . , an ) is an isomorphism.
Example 2: T : Rn Rn defined by
T (a1 , . . . , an ) = (a1 , a1 + a2 , . . . , a1 + + an ) is an isomorphism.

We have seen that if T : V W is an isomorphism, then


dim V = dim.
Is the converse true? i.e., if dim V = dim W , are they isomorphic?
Let B1 = {v1 , . . . , vn } be a basis of V and B2 = {w1 , . . . , wn } be a
basis of W . Define T : V W by
T (1 v1 + + n vn ) = 1 w1 + + n wn .
Since B1 and B2 spans V and W respectively, T is onto. Since B1
and B2 are linearly independent, T is one-one. Therefore T is an
isomorphism.
Theorem: V and W are isomorphic if and only if dim V = dim W .

You might also like