Linear transformations

Definition. Let

and

A linear transformation
in
to each
in
a)
b)
If

be vector spaces.
of into
is a function assigning a unique vector
such that :

, for every
, for every
and every scalar
, the linear transformation

Example 1. Let
.

is also called a linear operator on

be defined by

,
(

a).
)
(

b).
Thus

.
is linear transformation.

Example 2. Let
transformation?

be defined by

a).

. Is

and
.

Since
transformation.

, we conclude that

is not a linear

Definition. The linear transformation

1).

defined by

2).

defined by

is called projection,
is called dilation,

a linear

3).

defined by

is called contraction,

4).

defined by

5).

defined by

is called reflection,

Example 3. Let
Show that

defined by

is linear transformation.

Solution. Let
Then

] is called rotation.

and

be vectors in

and let
]

and
[
Hence

is linear transformation.

Example 3. Let
Is

defined by

a linear transformation?

Solution. Let

and

be vectors in

Then

and if
[

Hence

.
is a scalar

is linear transformation

Theorem 1. If

is a linear transformation, then

is a scalar.

For any vectors

in

Theorem 2. Let

and any scalars

is linear transformation. Then

a).
b).

Definition. A linear transformation

all
in
implies
is one-to-one if for all

Example 3. Let
determine whether

is said to be one-to-one if for

An equivalent statement is that
implies
.

be defined by
is one-to-one, we let

. To

Then
we have

.
Adding these equations, we obtain
Hence,

and

is not one-to-one.

, similarly

is one-to-one.

Example 4. Let

Since

or

is linear transformation defined by

but

(1,3), we conclude that

Definition. Let

is a linear transformation. The kernel of ,

is the subset of
consisting of all vectors such that

Example 5. Let

The vector
To find

is linear transformation defined by

is in

since

we must determine all

That is, we seek

in

so that

so that

However,
Thus
, so
any real number. Hence,
consists of all vectors in
where is any real number.
Theorem 3. If
subspace of
Example 6. Let

Then

is a basis for

and can be
of the form
,

is a linear transformation. Then

is a

is linear transformation defined by

and dim(

Theorem 4. A linear transformation

{ }

)=1
is one-to-one if and only if

Definition. Let
be a linear transformation, then the range of ,
denoted by
is the set of vectors in W that are images, under , of
vectors . Thus a vector
is in
if and only if there exists some vector
in such that
If
, we say that is onto. That is, is
onto if and only if, given any
in , there is a vector in such that
.

Theorem 5. If
subspace of

is a linear transformation then

Theorem 6. If
is a linear transformation of an
vector space
into vector space , then

is a

dimensional

.
Example 7.

Let

is linear transformation defined by

[
Is

][

onto?

Solution. a) Given any

[ ]
in

, where

are any real numbers, can we find

[
so that

? We seek solution to the linear system

][

[ ]

Use the elimination method we have, that

{
Thus the solution exists only when

. Hence

is not onto.

That is, exist values

for which is no vector

in

such that

[ ]
b). To find a basis for
[

, we note that
][

]=

[ ]

[ ]

[ ].

This means that vectors

[ ], [ ], [ ] spans

. That is,

is the subspace of

The first two vectors are linearly independent, the third vector is the sum of first
two. Therefore, the first two vectors form a basis for
, and
dim(

)=2. Therefore, we have