Matrix Analysis: Lecture 6

Feng Wei
[email protected]

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 1/9

Linear Mappings and Linear Transformations

Definition 1
Let V,W be two linear spaces over a filed F. A mapping f : V → W is
called linear mapping if

f (kv1 + lv2 ) = k f (v1 ) + l f (v2 ), ∀ k, l ∈ F and ∀ v1 , v2 ∈ V.

In particular, when V = W , we say that f is a linear transformation from V

to itself. In case of W = F, f is said to be a linear function from V to F.
Example 1
Let V be a linear space over a filed F. Define f : V → V by

f (v) = v, ∀ v ∈ V.

We say that f is an identity mapping.

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 2/9

Linear Mappings and Linear Transformations

Example 2
Let V,W be two linear spaces over a filed F. Define f : V → W by

f (v) = 0, ∀ v ∈ V.

We say that f is a zero mapping. As usual, we denote it by 0.

Example 3
Let F = R and V = W = PC[t0 , +∞) be the linear space consisting of
piecewise functions. Define f : PC[t0 , +∞) → PC[t0 , +∞) by
∫ t
v(t) 7→ w(t) = ( f v)(t) = e−(t−τ ) v(τ )d τ .
t0

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 3/9

Linear Mappings and Linear Transformations

Example 4
Let A ∈ Rm×n and define a mapping f : Rn → Rm by

f (v) = Av, ∀ v ∈ Rn .

We usually say that f is a left multiplier. In a similar way, one can define a
right multiplier. How to define it ?

Example 5
Let us take V = R[x]n+1 ,W = R[x]n . Define a mapping D : R[x]n+1 → R[x]n
by
d
D ( f (x)) = f (x), ∀ f (x) ∈ R[x]n+1
dx
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 4/9

Linear Mappings and Linear Transformations

Example 6
Let us take V = R[x]n ,W = R[x]n+1 . Define a mapping I : R[x]n → R[x]n+1
by ∫ x
I ( f (x)) = f (t) dt, ∀ f (x) ∈ R[x]n
0

Example 7
Let π be a plane passing through the origin in R3 and u be a unit normal
vector of π in R3 . Define a mapping σ : R3 → R3 by

σ (v) = v − 2hv, uiu, ∀ v ∈ R3 .

This is a linear transformation reflecting vectors with respect to the plane

π.
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 5/9

 E

π
O G

−→ −→ −→
v = OE, u = OG, σ (v) = OF = v − 2hv, uiu

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 6/9

Basic Facts of Linear Mappings

Let V,W be two linear spaces over a filed F and f : V → W be a linear

mapping. Then
1 f (0) = 0;
2 f (∑si=1 ki vi ) = ki ∑si=1 f (vi ), ki ∈ F, vi ∈ V ;
3 If { v1 , · · · , vr } is a collection of linearly dependent vectors in V1 , then
{ f (v1 ), · · · , f (vr ) } is a collection of linearly dependent vectors in V2 ;
4 If f is a one-to-one or bijective linear mapping, then { v1 , · · · , vr } and
{ f (v1 ), · · · , f (vr ) } have the same linear (in-)dependence.

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 7/9

Basic Facts of Linear Mappings

Example 8
Let us define a projection P : R3 → R2 by

v = [a1 , a2 , a3 ]T ∈ R3 7→ P(v) = [a1 , a2 ]T ∈ R2 .

For a collection of linearly independent vectors

v1 = [1, 1, 1]T , v2 = [1, 1, 0]T , v3 = [1, 0, 0]T

in R3 , its images

P(v1 ) = [1, 1]T , P(v2 ) = [1, 1]T , P(v3 ) = [1, 0]T

is a collection of linearly dependent vectors in R2 .
. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 8/9

Basic Facts of Linear Mappings

. . . . . . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . .

(Beijing Institute of Technology) Matrix Analysis: Lecture 6 9/9