Lecture 21
Lecture 21
Ajay Kumar
[email protected]
𝑦
𝑄(𝑋, 𝑌)
𝑃(𝑥, 𝑦)
𝜃
𝜙
𝑂 𝑥
Let the line through O and P makes an angle φ with x-axis (as shown
in figure). Now set OP = OQ = r. Then X = r cos(θ + φ) and
Y = r sin(θ + φ). Using the fact that x = r cos φ, y = r sin φ and
formulas for cos(θ + φ), sin(θ + φ), the result follows. Thus
X cos θ − sin θ x
= .
Y sin θ cos θ y
Linear transformation
1 0
Let A = . Then A reflects vectors along the x-axis. For
0 −1
3 3
example A =
1 −1
𝑦
(3,1)
𝑥
(3, −1)
cos θ − sin θ
Let B = . Then B rotates a vector counterclockwise by
sin θ cos θ
an angle θ.
𝑦
(𝑋, 𝑌)
(𝑥, 𝑦)
𝜃
𝑥
k 0
Let A = . Then A compresses or expand a vector in x-direction
0 1
by a factor k. vectors along the x-axis
𝑦
(1,1) (𝑘, 1)
𝑥
Note that under these transformations, lines get mapped to lines.
More generally linear combinations get mapped to linear
combinations, that is, A(c1 x1 + c2 x2 ) = c1 Ax1 + c2 Ax2 .
Definition
Let V and W be two vector spaces over F. Then a function T : V → W
is called a linear transformation if it satisfy the following conditions:
Example
2 2 x x+y
Let T : R → R be T = . Then T is a linear
y x−y
transformation.
Examples
Theorem
Let V and W be vector spaces, and let T : V → W be a linear
transformation. Then T(0) = 0.
Proof. Since T(0) = T(0 + 0) and T is a linear transformation, we
know that T(0) = T(0 + 0) = T(0) + T(0). Adding inverse −T(0) on
both sides gives T(0) = 0.
Exercise
Show that a linear transformation T : V → W maps a subspace of V to
a subspace of W.
Definition
Let T : V → W be a linear transformation between vector spaces V
and W. Then ker(T) = N (T) = {v : T(v) = 0} is called null space (
kernel) of T and R(T) = {T(v) : v ∈ V} is called the range space of T.
Note that N (T) and R(T) be subspaces of V and W, respectively.
Let V be a vector space with basis B = {v1 , . . . , vn } and W be another
vector space. Then to define a linear transformation from V to W it is
enough define on B.
Theorem
Let V and W be vector spaces over F, and {v1 , . . . , vn } be a basis for
V. Let T : V → W be a linear transformation. Then for any vector
v ∈ V, there exist c1 , . . . , cn ∈ F such that
T(v) = c1 T(v1 ) + · · · + cn T(vn ).
Note that in the above set up R(T) = span{T(v1 ), . . . , T(vn )}.
Examples
Find the range space and null space of the following linear
transformations.
1. Let T : R4 → R3 be a linear transformation given by
a
b a+b
b − c .
c =
T
a+d
d
2. Let A be an m × n matrix. Define f : Rn → Rm by f (x) = Ax.
3. Let g : R3 → R3 defined as g(x1 , x2 , x3 ) = (x1 , x2 , 0).
4. Let D : R2 [x] → R1 [x] be defined as D(a0 + a1 x + a2 x2 ) = a1 + 2a2 x.
Theorem (Rank-Nullity Theorem)
Let V and W be finite dimensional vector spaces. If T : V → W is a
linear transformation, then dim V = dim (R(T)) + dim (N (T)).
Exercise
Define a linear transformation T : R4 [x] → R2 [x] given by
T(p(x)) = p00 (x). Verify rank nullity theorem.