Scribd
Upload
127 views8 pages

Linear Transformations

The document defines and discusses properties of linear transformations between vector spaces. Some key points are: - A linear transformation between vector spaces V and W satisfies additivity and homogeneity. - The kernel (null space) of a linear transformation T is the set of vectors mapped to 0, which forms a subspace. - The range (column space) of T is the set of outputs, which also forms a subspace. - A linear transformation T is one-to-one if its kernel is {0} and onto if its range is the entire codomain W. - An invertible linear transformation that is both one-to-one and onto is called an isomorphism.

Uploaded by

Emmaculate Ongum
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
127 views8 pages

Linear Transformations

The document defines and discusses properties of linear transformations between vector spaces. Some key points are: - A linear transformation between vector spaces V and W satisfies additivity and homogeneity. - The kernel (null space) of a linear transformation T is the set of vectors mapped to 0, which forms a subspace. - The range (column space) of T is the set of outputs, which also forms a subspace. - A linear transformation T is one-to-one if its kernel is {0} and onto if its range is the entire codomain W. - An invertible linear transformation that is both one-to-one and onto is called an isomorphism.

Uploaded by

Emmaculate Ongum
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/ 8

General linear transformations

Definition: Let V , W be two vector spaces. A function


T : V → W is called a linear transformation from V to W if the
following hold for all vectors u, v in V and for all scalars k.
(i) T (u + v ) = T (u) + T (v ) (additivity)
(ii) T (ku) = kT (u) (homogeneity)
If V and W are the same, we call a linear transformation from V
to V a linear operator.
Theorem: A function T : V → W is a linear transformation if and
only if for all vectors v1 , v2 in V and for all scalars k1 , k2 we have

T (k1 v1 + k2 v2 ) = k1 T (v1 ) + k2 T (v2 )


General linear transformations

Theorem (basic properties of linear transformations): If T is a


linear transformation then
a) T (~0) = ~0
b) T (−v ) = −T (v )
c) T (u − v ) = T (u) − T (v )

Theorem: If T : V → W is a linear transformation,


S = {v1 , v2 , . . . , vn } is a basis in V , then for any vector v in V we
can evaluate T (v ) by

T (v ) = c1 T (v1 ) + c2 T (v2 ) + . . . + cn T (vn )

where v = c1 v1 + c2 v2 + . . . + cn vn .
Kernel and range of a linear transformation
Definition: Let T : V → W is a linear transformation.
The set of all vectors v in V for which T (v ) = ~0 is called the
kernel of T .
We denote the kernel of T by ker(T ).
The set of all outputs (images) T (v ) of vectors in V via the
transformation T is called the range of T .
We denote the range of T by R(T ).
Theorem: If T : V → W is a linear transformation, then ker(T ) is
a subspace of V , while R(T ) is a subspace of W .
Definition: If V and W are finite dimensional vector spaces and
T : V → W is a linear transformation, then we call
dim ker(T ) = nullity of T
dim R(T ) = rank of T
Theorem: If V and W are finite dimensional vector spaces and
T : V → W is a linear transformation, then
rank (T ) + nullity (T ) = dim(V )
One-to-one and onto functions

Definition (one-to-one function): A function f : X → Y is called


one-to-one if to distinct inputs it assigns distinct outputs.
More precisely, f is 1-1 means: if x1 6= x2 then f (x1 ) 6= f (x2 ). This
is logically equivalent to saying that if f (x1 ) = f (x2 ) then x1 = x2 .

Definition (onto function): A function f : X → Y is called onto if


every element in Y is an output of f .
More precisely, f is onto if for every y in Y there is at least one x
in X such that f (x) = y .

Linear transformations are functions, so being one-to-one or onto


applies (makes sense) for them as well.
Isomorphism
Theorem: A linear transformation T : V → W is one-to-one if and
only if ker(T ) = {~0}.
Theorem: Let T : V → V be a linear operator, where V is a finite
dimensional vector space.
The following statements are equivalent.
a) T is one-to-one
b) ker(T ) = {~0}
c) T is onto.

Definition: A linear transformation T : V → W which is


one-to-one and onto is called an isomorphism.
Two vector spaces V and W are called isomorphic if there is an
isomorphism T : V → W .
Examples: Pn−1 is isomorphic to Rn . M2×2 (R) is isomorphic to R4 .
Theorem: Every n dimensional vector space is isomorphic to Rn .
The matrix for a linear transformation: definition
We have:
 An n-dimensional vector space V with a basis
B = {u1 , u2 , . . . , un }.
 An m-dimensional vector space W with a basis B 0 .
 A linear transformation T : V → W .
Definition: The matrix for T relative to the bases B and B 0 is the
m × n matrix [T ]B 0 ,B defined by
 
[T ]B 0 ,B = [T (u1 )]B 0 | [T (u2 )]B 0 | . . . | [T (un )]B 0

Relative to these bases, we can think of the linear transformation


T as simply the multiplication transformation from Rn to Rm by
the matrix [T ]B 0 ,B . More precisely, we have the following relation:
 
T (x) B 0 = [T ]B 0 ,B · [x]B
The matrix for a linear transformation: properties

In class we have learned the following.


Theorem: If T : V → V is a linear operator and if B is a basis for
V , then the following are equivalent:
(a) T is one-to-one.
(b) [T ]B,B is invertible.
Moreover, if these conditions hold, then

[T −1 ]B,B = [T ]−1
B,B

But in fact much more is true: given any linear transformation T


from a vector space V to another vector space W , the matrix for
T in two chosen basis [T ]B 0 ,B completely encodes whether the
transformation is one-to-one, onto or an isomorphism.
The matrix for a linear transformation: more properties
Let V be an n-dimensional vector space with a basis B and let W
be an m-dimensonal vector space with a basis B 0 . Let T : V → W
be a linear transformation.
Theorem: The following are equivalent:
(a) T is one-to-one.
(b) The null space of [T ]B,B is {~0}.
(c) nullity [T ]B 0 ,B = 0.
Theorem: The following are equivalent:
(a) T is onto.
(b) The column space of [T ]B,B is Rm .
(c) rank [T ]B 0 ,B = dim(W ).
Theorem: The following are equivalent:
(a) T is an isomorphism
(b) dim(V ) = dim(W ) and [T ]B 0 ,B is invertible.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy