MATH 323 Lecture 16

From Notes
Jump to navigation Jump to search

« previous | Tuesday, October 23, 2012 | next »


Linear Transformations

Let L:V→W be a linear transformation for all vi∈V and αi∈ℝ:

  1. L(0→V)=0→W
  2. L(∑i=1nαivi)=∑i=1nαiL(vi)
  3. L(−v→)=−L(v→)

In general, linear transformations are of the form

LA(x→)=Ax→.

Transdimensional Transformations

If LA is a transformation from ℝn to ℝm, then A will be a m×n matrix.

Let L(x→)=x1+x2 be a linear transformation from 2D space to 1D space.

L(αx→+βy→)=L([αx1+βy1αx2+βy2])=αx1+βy1+αx2+βy2=α(x1+x2)+β(y1+y2)=αL(x→)+βL(y→)

The following transformation is not linear because it fails on (1) above:

M(x→)=x12+x22


Identity Transformation

I:V→V such that I(v→)=v→.


Image and Kernel

Giver L:V→W,

kernel
Set of vectors in V such that L(v)=0
Very analogous to null space of a matrix.
image
Written L(V)
Set of vectors in W such that w=L(v) for some vector in V
Subspace of V will have image contained in L(V)


Theorem 4.1.1

Let L:V→W be a linear transformation, and S⊆V be a subspace. Then

  1. The kernel of L is a subspace of V
  2. L(S) is a subspace of W. In particular, L(V) is a subspace of W


Example

Let L:ℝ3→ℝ2 be defined as follows:

L(x→)=(x1+x2x2+x3)

Kernel is {x→|L(x→)=0→}.

x1+x2=x2+x3=0, therefore ⟨a,−a,a⟩ is the kernel of L.

For a subspace S=Span(e→1,e→2)=⟨a,0b⟩, The image L(S)=⟨a+0,0+b⟩=ℝ2.


Matrix Representations of Linear Transformations

Let A be a m×n matrix, and LA:ℝn→ℝm. Then LA(x→)=Ax→

A is called the standard matrix representation of L.

Theorem 4.2.1

If L is a linear transformation mapping ℝn into ℝm, there is a m×n matrix A such that L(x→)=Ax→ for each x∈ℝn. In fact, the jth column vector of A is given by

a→j=L(e→j) for j=1,…,n

Example

L(x→)=(x1+x2x2+x3). Find the standard matrix representation.

  • a→1=L(e→1)=(1+00+0)=(10)
  • a→2=L(e→2)=(0+11+0)=(11)
  • a→3=L(e→3)=(0+00+1)=(01)

So A=(a1,a2,a3)=(110011)