Definition 5.2 A transformation is called a linear transformation
for all vectors
and
in the vector space
and for any scalar
we have
(T preserves vector addition)
(T preserves scalar multiplication)
Proposition 5.3 Let and
be vector spaces and
and
be vectors in
. Let
be a linear transformation, then we have the following:
where
is the zero vector
Proposition 5.4
Let and
be vector spaces. Let
be a linear tranformation and
be vectors in the vector space
such that
where k’s are scalars. This means that the vector
is the linear combination of the
vectors. Then
Definition 5.5 Let be a linear transform (map). The set of all vectors v in V that are transformed to the zero vector in W is called the kernel of T, denoted by ker(T). It is the set of vectors v in V such that T(v)=0
Proposition 5.6 Let be a linear transformation (mapping) between the vector spaces V and W. Then the kernel of T is a subspace of the vector space V.
Definition 5.7 Let be a linear transform. Then ker(T) is also called the null space of T and the dimension of ker(T) is called the nullity of T which is denoted by nullity(T)
Definition 5.8 Let be a linear transform. the range(image) of the linear transform is set of all the output vectors w in W for which there are input vectors v in V such that
Definition 5.9: range(T)= {T(v)|v in V}
Proposition 5.10 Let V and W be vector spaces and be a linear transformation. The range of image of the transformation T is a subspace of the arrival vector space W
Proposition 5.12 Let be a linear transformation from an n dimensional vector space
to a vector space
. Then rank(T)+nullity(T)=n
Proposition 5.13 Let be a linear transformation given by
. Then range(T) is the column space of A
Inverse Linear Transformations
Definition 5.14 Let be a linear transform, u and v be in the domain V. The transform T is one-to-one
Definition 5.15 T is one-to-one T(u) = T(v) implies u=v
Proposition 5.16 Let be a linear transformation between the vector spaces
and
. Then T is one-to-one
ker(T)={O}
Definition 5.18 Let be a linear transform. The transform T is onto
for every w in the arrival vector space W there exists at least one v in the start vector space V such that w = T(v)
Proposition 5.19 A linear transformation is onto
range(T)=W
Proposition 5.20 Let be a linear transformation. Then T is onto
rank(T) = dim(W)
Proposition 5.21 If is a linear transformation and dim(V) = dim(W) then T is a one-to-one transformation
T is onto.
Proposition 5.22 If is a linear transformation and dim(V)=dim(W) then T is both one-to-one and onto
ker(T)= {0}
Proposition 5.23 Let be a bijective linear transform. The inverse transformation
is defined as
. If T has an inverse transform, we refer to T as being invertible. To be invertible, T must be both one-to-one and onto
Proposition 5.24 Let be a linear transform which is both one-to-one and onto. Then the inverse transform
is also linear.
Definition 5.25 If the linear transformation is invertible then we say that the vector spaces
and
are isomorphic. Such a transformation T is called an isomorphism.
Defi