Class Notes (1,100,000)
CA (630,000)
UTSG (50,000)
MAT (4,000)
MAT224H1 (100)
Lecture

Linear Transformations, and thier properties


Department
Mathematics
Course Code
MAT224H1
Professor
Martin, Burda

This preview shows pages 1-2. to view the full 6 pages of the document.
Tuesday18/01/2011, Lecture notes byY. Burda
1Linear Transformations
In the previous twolectures wehavefound the abstractions of notions of
numbers and vectors in Rn.The abstractions were elements of afield and
vectors in an abstract vector space respectively.In this lecture weare going
to find the rightabstraction of the notion of amatrix.
When weare solving asystem of linear equations Ax =bwearen’t
interested in the matrix Aitself, weare only interested in what is the result
of multiplying this matrix byavector x.Let’s formalize this situation alittle
bit:
Given an m×nmatrix Alet fA:RnRmbeafunction that takesin
avector xand outputs the result of multiplying it bymatrix A:
fA(x)=Ax for all xRn
For instance if A=(1 2
3 4)then f(x
y)=(1 2
3 4) (x
y)=x+2y
3x+4y.
Of course not everyfunction from Rnto Rmis of suchform. For instance
every function whichis of theform fAfor some matrix Asatisfies fA(x+y)=
fA(x)+fA(y)for all vectors x, yRn(indeed: A(x+y)=Ax +Ay).
Similarly every suchfunction satisfies fA(λx)=λfA(x)for all λRand
xRn.
It turns out that every function that satisfies these twoproperties is of
the form fAfor some matrix A:
Theorem. Suppose f:RnRmsatisfies
f(x+y)=f(x)+f(y)for allx, yRn
f(λx)=λf(x)for allλR,xRn
Then thereexists amatrix Asuch that f(x)=Ax for allxRn.
Moreover, the matrix Ais the matrix whose columns aref(e1),...,f(en),
wheree1,...,enarethe standardbasis vectors for Rn:e1=1
.
.
.
0,...,en=
0
.
.
.
1
1
www.notesolution.com

Only pages 1-2 are available for preview. Some parts have been intentionally blurred.

Proof. Let x=x1
.
.
.
xn=x1e1+. . . xnen.
Then f(x)=f(x1e1+. . . +xnen)=x1f(e1)+. . . +xnf(en)(here weused
the twoproperties that fsatisfies). If f(e1)=a1,1
.
.
.
am,1,...,f(en)=an,1
.
.
.
an,m ,
then f(x)=x1a1,1
.
.
.
am,1+. . . +xnan,1
.
.
.
an,m =a1,1... an,1
.
.
.....
.
.
a1,m ... an,m x1
.
.
.
xn,i.e. f(x)=
Ax for the matrix A=a1,1... a1,n
.
.
.....
.
.
am,1... am,n whose columns are f(e1),...,f(en).
So instead of speaking of m×nmatrices, wecan speak of functions from
Rnto Rmsatisfying f(x+y)=f(x)+f(y)and f(λx)=λf(x).
For instance let fbethe function from R2to R2that rotates anypoint
in theplane around the origin by30 degrees counterclockwise. The condition
f(x+y)=f(x)+f(y)can beverified geometrically: fpreserves shapes of
parallelograms and parallelogramsis what weuse to add twovectors in the
plane. Similarly the second condition is very easy to verify: the result of
scaling avector and then rotating it is the same as the result of first rotating
it and then scaling.
Thus the rotation function fis given bymultiplication byamatrix whose
columns are f(1
0)andf(0
1). Using some simple geometry wecan find that
f(1
0)=(cos 30
sin 30)and f(0
1)=sin 30
cos 30and thus f(x
y)=cos 30sin 30
sin 30cos 30(x
y)for
anypoint (x
y)in the plane.
This description of matrices as functions satisfying some conditions gen-
eralizes easily to abstract vector spaces:
Definition. Alinear transformation ffrom vector spaceVover afield K
to avector spaceWover the same field is afunction f:VWsatisfying
f(v1+v2)=f(v1)+f(v2)for allv1,v2V
f(λv)=λf (v)for allλK,vV
There are plentyof importantexamples of lineartransformations:
1. Multiplication bymatrix
f:KnKm,f(v)=Av for some fixed m×nmatrix Awith coeffi-
cients in K
2
www.notesolution.com
You're Reading a Preview

Unlock to view full version