Linear Algebra Chapter 6 Linear Transformations 大葉大學 資訊工程系 黃鈴玲 6.1 Introduction to Linear Transformations Definition Let U and V be vector spaces.
Download ReportTranscript Linear Algebra Chapter 6 Linear Transformations 大葉大學 資訊工程系 黃鈴玲 6.1 Introduction to Linear Transformations Definition Let U and V be vector spaces.
Linear Algebra
Chapter 6
Linear Transformations
大葉大學 資訊工程系
黃鈴玲
6.1 Introduction to Linear Transformations
Definition
Let U and V be vector spaces. A transformation T: U → V is a
mapping that assigns to each vector u in U a unique vector v in V.
Definition
Let U and V be vector spaces. Let u and v be vectors in U and let
c be a scalar. A transformation T: U → V is said to be linear if
T(u + v) = T(u) + T(v) and T(cu) = cT(u).
U
V
Ch6_2
Example 1
Prove that the following transformation T: R2 → R2 is linear.
T(x, y) = (x - y, 3x)
Solution
“+”: Let (x1, y1) and (x2, y2) R2. Then
T((x1, y1) + (x2, y2)) = T(x1 + x2, y1 + y2)
= (x1 + x2 - y1 - y2, 3x1 + 3x2)
= (x1 - y1, 3x1) + (x2 - y2, 3x2)
= T(x1, y1) + T(x2, y2)
“”: Let c be a scalar.
T(c(x1, y1)) = T(cx1, c y1) = (cx1 - cx2, 3cx1)
= c (x1 - y1, 3x1)
= cT(x1, y1)
Thus T is linear.
Note A linear transformation T: U → U is called a linear operator.
Ch6_3
Example 2
Show that the following transformation T: R3 → R2 is not linear.
T(x, y, z) = (xy, z)
Solution
“+”: Let (x1, y1, z1) and (x2, y2, z2) R3. Then
T((x1, y1, z1) + (x2, y2, z2))
= T(x1 + x2 , y1 + y2 , z1 + z2)
= ((x1 + x2)(y1 + y2), z1 + z2)
and T(x1, y1, z1) + T(x2, y2, z2) = (x1y1, z1) + (x2y2, z2)
Thus, in general
T((x1, y1, z1) + (x2, y2, z2)) T(x1, y1, z1) + T(x2, y2, z2).
T is not linear.
Ch6_4
Example 3
Let Pn be the vector space of real polynomial functions of degree
n. Show that the following transformation T: P2 → P1 is linear.
T(ax2 + bx + c) = (a + b)x + c
Solution
“+”: Let ax 2 + bx + c and px 2 + qx + r P2. Then
T ((ax2 + bx + c) + ( px2 + qx + r )) T ((a + p) x 2 + (b + q) x + (c + r ))
( a + p + b + q ) x + (c + r ) ( a + b ) x + c + ( p + q ) x + r
T (ax2 + bx + c) + T ( px2 + qx + r )
“”: Let k be a scalar.
T (k (ax2 + bx + c)) T (kax2 + kbx + kc) k ((a + c) x + c)
kT (ax2 + bx + c)
Therefore , T is a linear transformation.
隨堂作業:11
Ch6_5
Example 4
Let D be the operation of taking the derivation. (D is he same as
d
d
. It is a more appropriate notation in this context than
.)
dx
dx
D can be interpreted as a mapping of Pn into itself.
For example,
D(4 x 3 - 3x 2 + 2 x + 1) 12 x 2 - 6 x + 2
Let f and g be elements of Pn and c be a scalar. The following
properties of the derivative imply that D is a linear operator.
D(f + g) = Df + Dg
D(cf) = cD(f)
Ch6_6
Matrix transformations
Every matrix defines a transformation. Furthermore it turns out
that every such transformation is linear.
1 3 - 2
For example, consider the matrix A
and the
1
x
0 4
column vector x y of R3.
z
This matrix defines a transformation T(x)=Ax of R3 into R2, using
matrix multiplication as follows.
x
1 3 - 2 x + 3 y - 2 z
Tx
y
0
4
1
4
y
+
z
z
e.g.,
1
1
T 2
11
3
- 2
8
and T 4
17
1
Ch6_7
Theorem 6.1
Let A be an mn matrix. Let x be an element of Rn, interpreted as a
column matrix. The transformation T: RnRm, defined by
T(x)=Ax, is linear. Such a linear transformation is called a matrix
transformation.
Proof
(transformation)
A : mn matrix, x : n1 matrix, Ax : m1 matrix
T(x)=Ax defines a transformation from Rn to Rm.
(linear)
Let x, y Rn, and c R.
T(x+y)=A(x+y) = Ax+Ay =T(x) +T(y )
T(cx)=A(cx) = cAx = cT(x)
T is linear.
Ch6_8
Example 5
Consider the linear transformation T defined by the following
matrix A. Find the image of an arbitrary vector under T, and use
this result to determine the image of the given vector x.
1
A 0
1
- 1
2
3
5
x
-1
Solution
(1) A is a 32 matrix T : R2R3,
1
x
and T 0
y
1
-1
x- y
x
2 2 y
y
3
x
+
3
y
6
5
(2) Letting x = 5, y = –1 we get T - 2
-1
2
Ch6_9
Composition of Linear Transformations
Let U, V and W be vector spaces and T1: U V, T2: V W be
linear transformations between these spaces. These two
transformations can be combined into a single composition
transformation T: U W as follows.
Let u be a vector in U. Then T(u) = T2(T1(u)).
This composite transformation is denoted by T = T2。T1.
T1
U
V
T1(u)
T2
W
T2(T1(u))
u
T = T2。T1
Ch6_10
Example 6
Find the composite T2。T1 of the transformations T1(x, y) = (3x,
x+y) and T2(x, y) = (2x, -y). Determine the image of (2, -3).
Solution
We get
T2。T1 (x, y) = T2(T1 (x, y)) = T2( 3x, x+y) = (6x, -x-y).
The image of (2, -3) is (12, 1).
隨堂作業:16
Ch6_11
Theorem 6.2
The composite of two linear transformations is itself a linear
transformation.
Proof
Let U, V and W be vector spaces and T1: U V, T2: V W be
linear transformations. Let u, v U and cR.
T2。T1(u+v) = T2(T1(u+v)) = T2(T1(u) +T1(v))
=T2(T1(u)) +T2(T1(v)) = T2。T1(u) + T2。T1(v)
T2。T1(cu) = T2(T1(cu)) = T2(cT1(u)) = cT2(T1(u)) = cT2。T1(u)
Thus T2。T1 is linear.
Ch6_12
Composition of Matrix Transformations
Let T1: Rn → Rm and T2: Rm → Rs be matrix transformations
defined by T1(x) = A1x and T2(x) = A2x. We shall now see that T2。
T1 is defined by the product matrix A2A1.
T2。T1(x) = T2(T1(x)) = T2(A1x) = A2A1x
Note. If T1(x) = A1x and T2(x) = A2x, then T2。T1(x) = A2A1x.
We can extend the results:
Let T1 , …, Tn be a sequence of linear mappings on Rp , …, Rs
defined by the matrices A1, …, An. The composite T = Tn。…。T1,
is given by the matrix product An…A1.
Ch6_13
Example 7
Let T1(x) = A1x and T2(x) = A2x be defined by the following
matrices A1 and A2. Let T = T2。T1. Find the image of the vector
x under T.
1
3
0
1
1
2
A
x 4
A1
2
0
4 2 0
4
2
Solution
T is defined by the product matrix A2A1. We get
A2 A1 1 - 2 3 0 - 1 - 5 - 4 - 1
0 4 2 0 12
0 - 4
4
Thus
1 - 23
5
4
1
T (x)
4
0 - 4 2 4
12
隨堂作業:15(a)
Ch6_14
Homework
Exercise 6.1:
11, 15, 16, 22, 27
Exercise 27:
Let det be a transformation of M22 R defined by det(A) = |A|.
Is det a linear transformation?
Ch6_15
6.2 Matrix Transformations,
Computer Graphics, and Fractals
Any linear transformation T: Rn Rm can be defined by a matrix.
Matrix Representation
Let T: Rn → Rm be a linear transformation. {e1, e2, …, en} be the
standard basis of Rn, and u be an arbitrary vector in Rn.
1
0
a1
e1 , , e n u
0
1
an
Express u in terms of the basis, u = a1e1+a2e2+ … + anen.
Ch6_16
Since T is a linear transformation,
T(u) = T(a1e1+ a2e2 + … + anen)
= T(a1e1) + T(a2e2) + …+ T(anen)
= a1T(e1) + a2T(e2) + …+ anT(en)
a1
[T (e1 ) T (e 2 ) T (e n )]
an
Thus the linear transformation T is defined by the matrix
A = [ T(e1) … T(en) ].
A is called the standard matrix of T.
Ch6_17
Example 1
Determine the standard matrix of T x 2 x + y .
y
3y
Solution
Find T(e1) and T(e2):
1 2
T
0 0
and
0 1
T
1 3
Thus the standard matrix is
2 1
A
0
3
T can be written as a matrix transformation:
x 2 1 x
T
y
y
0
3
隨堂作業:11(a)
Ch6_18
6.3 Kernel and Range
There are two further vector spaces called kernel and range that are
associated with every linear transformation.
Theorem 6.5
Let T: U → V be a linear transformation. Let 0U and 0V be the zero
vectors of U and V. Then
T(0U) = 0V
That is, a linear transformation maps a zero vector into zero vector.
Proof
Let u be a vector in U and let T(u) = v.
Let 0 be the zero scalar. Since 0u = 0U and 0v = 0V and T is linear,
we get
T(0U) = T(0u) = 0T(u) = 0v = 0V
Ch6_19
Definition
Let T: U → V be a linear transformation.
The set of vectors in U that are mapped into the zero vector of V
is called the kernel of T. The kernel is denoted ker(T).
The set of vectors in V that are the images of vectors in U is
called the range of T. The range is denoted range(T).
Figure 6.12
Ch6_20
Theorem 6.6
Let T: U → V be a linear transformation.
(a) The kernel of T is a subspace of U.
(b) The range of T is a subspace of V.
Proof
(a) T(0U) = 0V ker(T) is nonempty.
(ker(T) is a subspace of U)
“+”: Choose u1, u2 ker(T)
T(u1) = 0 and T(u2) = 0. T(u1+u2) = T(u1) + T(u2) =0
u1+u2 ker(T)
“”: Let c be a scalar
T(cu1) = cT(u1) = 0
cu1 ker(T)
Ch6_21
Proof of Theorem 6.6(b)
(b) T(0U) = 0V range(T) is nonempty.
(range(T) is a subspace of V)
“+”: Choose v1, v2 range(T)
w1, w2U s.t. T(w1) = v1 and T(w2) = v2
T(w1+w2) = T(w1) + T(w2) = v1+v2
v1+v2 range(T)
“”: Let c be a scalar
T(cw1) = cT(w1) = cv1
cv1 range(T)
Ch6_22
Example 1
Find the kernel and range of the linear operator
T(x, y, z) = (x, y, 0)
Solution
Since the operator T maps R3 into R3, the kernel and range will
both be subspaces of R3.
Kernel: ker(T) is the subset that is mapped into (0, 0, 0).
T(x, y, z) = (x, y, 0)
= (0, 0, 0), if x = 0, y = 0
Thus ker(T) = {(0, 0, z) | zR}.
Range: The range of T is the set of all vectors of the form (x, y, 0).
range(T) = {(x, y, 0) | x,yR}
隨堂作業:5(b)
Ch6_23
T(x, y, z) = (x, y, 0)
T projects all vectors onto the xy plane.
T is an example of a projection
operator.
projection
Figure 6.13 f(x, y, z) = (x, y, 0)
Ch6_24
Theorem 6.7
Let T: Rn → Rm be defined by T(u) = Au. The range of T is
spanned by the column vectors of A.
Proof
Let v be a vector in the range. There exist a vector u such that T(u)
= v. Express u in terms of the standard basis of Rn.
u = a1e1 + … + anen
Thus
v = T(a1e1 + … + anen) = a1T(e1) + … + anT(en)
Therefore, the column vectors of A, namely, T(e1), …, T(en), span
the range of T.
Ch6_25
Example 2
Determine the kernel and the range of the transformation defined
by the following matrix.
1 2 3
Solution
A 0 - 1 1
1 1 4
A is a 3 3 matrix. Thus A defines a linear operator T: R3→R3.
T(x) = Ax
Kernel: The kernel will consist of all vector x = (x1, x2, x3) in R3
such that T(x) = 0.
Thus
1 2 3 x1 0
0 - 1 1 x 0
2
1 1 4 x3 0
x1 + 2 x2 + 3 x3 0
- x2 + x3 0
x + x + 4x 0
3
1 2
- 5
x r 1
1
The kernel is the set of vectors of the form (-5r, r, r).
ker(T) = {r(-5, 1, 1) | rR}
Ch6_26
Range: The range is spanned by the column vectors of A.
1 0 1 1 0 1 1 0 1 1 0 1
At 2 -1 1 0 -1 -1 0 1 1 0 1 1
3
1
4
0
1
1
0 1 1
0 0 0
{(1, 0, 1), (0, 1, 1)} spans the range of T.
The range of T is
range(T) = {(s, t, s + t) | s, t R}
隨堂作業:7(a)
Ch6_27
Theorem 6.8
Let T: U → V be a linear transformation. Then
dim ker(T) + dim range(T) = dim domain(T)
Note. Let T(x)=Ax be a matrix transformation. Then
dim range(T) = dim of the column space of A = rank(A)
Example 3 Find the dimensions of the kernel and range of the
linear transformation T defined by the matrix.
1 0 3
A 0 1 5
0 0 0
Solution
A is in reduced echelon form
rank(A) = 2 dim range(T) = 2.
domain(T) = R3
dim domain(T) = 3 dim ker(T) = 1.
Ch6_28
Terminology
Definition
The kernel of a linear mapping T is often called the null space.
Dim ker(T) is called the nullity, and dim range(T) is called the
rank of the transformation. Therefore, Theorem 6.8 is often
referred to as the rank/nullity theorem and written in the
following form:
Rank(T) + nullity(T) = dim domain(T)
Ch6_29
Terminology
Definition
A transformation T is said to be one-to-one if each element in the
range of T corresponds to just one element in the domain of T.
This means that T is one-to-one if T(u) = T(v) implies that u = v.
T is one-to-one
T is not one-to-one
Figure 6.15
Ch6_30
Theorem 6.9
A linear transformation T is one-to-one if and only if the kernel is
the zero vector.
Proof
() The kernel consists of all the vectors that are mapped into
zero. Since T is one-to-one, the kernel must consist of a single
vector. However we know that the zero vector must be in the
kernel. Thus the kernel is the zero vector.
() Conversely, let us assume that kernel is the zero vector. Let
u and v be vectors such that T(u) = T(v).
T(u) – T(v) = 0 → T(u – v) = 0
Thus u – v is in the kernel. But the kernel is the zero vector.
Therefore
u–v=0 u=v
The transformation is thus one-to-one.
Ch6_31
Theorem 6.10
The transformation T: Rn→Rn, defined by T(x) = Ax, is one-toone if and only if A is nonsingular.
Proof
() Let T be one-to-one.
ker(T) = 0
(by Thm 7.5)
dim range(T) = n
(by Thm 7.4, the rank/nullity theorem)
the n columns of A are l.i. (by Thm 7.3)
rank(A) = n and |A| 0.
() Assume |A| 0.
rank(A) = n, the n columns of A are l.i.
dim range(T) = n.
ker(T) = 0
T is one-to-one.
Ch6_32
Example 4
Determine whether the linear transformations TA and TB defined
by the following matrices are one-to-one.
2 0 - 1
1 - 2 5 7
(a) A 0 1 9 8 (b) B 3 4 2
0 7 5
0 0 1 3
Solution
(a) TA: R4→R3, thus dim domain(TA) = 4.
rank(A) = 3 dim range(TA) = 3 dim ker(TA) = 1
the kernel is not the zero vector
TA is not one-to-one.
(b) |B| = – 9 0.
The matrix B is nonsingular,
Therefore, the mapping TB is one-to-one.
隨堂作業:8(a)
Ch6_33
Theorem 6.11
Let T: U → V be a one-to-one linear transformation. If the set
{u1, …, un} is linear independent in U, then {T(u1), …, T(un)} is
linear independent in V. That is,
one-to-one linear transformations preserve linear independence.
Proof Consider the identity
a1T (u1 ) + + anT (u n ) 0
(1)
for scalar a1, …, an. Since T is linear, this may be written
T (a1u1 + + anu n ) 0
T is one-to-one; thus the kernel is the zero vector. Therefore,
a1u1 + + anu n 0
But the set {u1, …, un} is linear independent. Thus
a1 0, , an 0
Returning to identity (1), this means that {T(u1), …, T(un)} is
linear independent.
Ch6_34
Homework
Exercise 6.3:
5, 7, 8, 7, 11, 12, 19, 22
Ch6_35
6.4 Transformations and Systems of
Linear Equations
Linear transformations and the concepts of kernel and range play
an important role in the analyses of systems of linear equations.
visualize the set of solutions
e.g., The following system of linear equations:
Ax = y,
where A is a mn matrix
Let T: Rn Rm be the linear transformation defined by A.
i.e., T(x) = Ax
The system of linear equations Ax = y can now be written
T(x) = y
The set of solutions is thus the set of vectors in Rn that are
mapped by T into the vector y.
If y range(T), then the system has no solution.
Ch6_36
Figure 6.16
Ch6_37
Theorem 6.12
The set of solutions to a homogeneous system of m linear
equations in n variables, Ax = 0, is a subspace of Rn.
Proof
Let T be the linear transformation of Rn into Rm defined by A.
The set of solutions is the set of vectors in Rn that are mapped by
T into the zero vectors.
The set of solutions is the kernel of the transformation and is thus
a subspace.
Ch6_38
Example 1
(1) Solve the following homogeneous system of linear equations.
(2) Interpret the set of solutions as a subspace.
(3) Sketch the subspace of solutions.
x1 + 2 x2 + 3 x3 0
- x2 + x3 0
x1 + x2 + 4 x3 0
Solution
(1) Using Gauss-Jordan elimination we get
1 2 3 0 1 2 3 0 1 2 3 0 1 0 5 0
0 - 1 1 0 0 - 1 1 0 0 1 - 1 0 0 1 - 1 0
1 1 4 0 0 - 1 1 0 0 - 1 1 0 0 0 0 0
Thus
x1 + 5 x3 0
x1 -5 x3
x 2 - x3 0
x 2 x3
x1 -5r
x2 r
x r
3
Ch6_39
(2) The set of solutions is X = {r(–5, 1, 1) | r R}.
X is a one-dimensional subspace of R3 with basis ( –5, 1, 1).
(3) X is the kernel of the transformation defined by the matrix:
1 2 3
0 -1 1
1
1 4
Figure 6.17
Ch6_40
Nonhomogeneous Equations
Let Ax = y (y0) be a nonhomogeneous system of m linear
equation in n variables.
Is the set of solutions a subspace of Rn?
Check “+”:
Let x1 and x2 be solutions. Thus
Ax1 = y and Ax2 = y.
A(x1 + x2) = Ax1 + Ax2 = 2y y
So the set of solutions is not closed under addition, it is not a
subspace.
But it can be obtained by sliding a certain subspace.?
Ch6_41
Theorem 6.13
Let Ax = y be a nonhomogeneous system of m linear equation in
n variables. Let x1 be a particular solution. Every other solution
can be written in the form x = z + x1, where z is an element of the
kernel of the transformation T defined by A.
The solution is unique if the kernel consists of the zero vector
only.
Proof
x1 is a solution. Thus Ax1 = y.
Let x be an arbitrary solution. Thus Ax = y.
Ax1 = Ax Ax – Ax1 = 0 A(x – x1) = 0 T(x – x1) = 0
Thus x – x1 ker(T); call it z.
We can write
x = z + x1
Note that the solution is unique if the only value of z is 0,
i.e., if ker(T) = {0}; .
Ch6_42
T(x) = Ax
Set of solutions to Ax = y
Figure 6.18
Ch6_43
Example 2
Solve the following system of linear equations. Sketch the set of
solutions.
x1 + 2 x2 + 3 x3 11
- x2 + x3 -2
Solution
x1 + x2 + 4 x3 9
Using Gauss-Jordan elimination, we get
1 2 3 11 1 2 3 11 1 2 3 11 1 0 5 7
0 - 1 1 - 2 0 - 1 1 - 2 0 1 - 1 2 0 1 - 1 2
1 1 4 9 0 - 1 1 - 2 0 - 1 1 - 2 0 0 0 0
x1 -5r + 7
Thus x1 + 5 x3 7
x1 -5 x3 + 7
x2 r + 2
x2 - x3 2
x2 x3 + 2
x r
3
Ch6_44
The solutions are vectors of the form
( –5r + 7, r + 2, r) = r(–5, 1, 1) + (7, 2, 0)
arbitrary solution
to Ax = y
element of kernel
a particular solution
to Ax = y
The set of solutions can be represented geometrically by sliding the
kernel, namely the line defined by the vector ( –5, 1, 1), in the
direction and distance defined by the vector (7, 2, 0).
Figure 6.19
Ch6_45
補充
Note that
x1 5s
x1 + 5 x3 7
x 2 - s + 17 / 5
x 2 - x3 2
x -s + 7 / 5
3
(another general solution)
The solutions are vectors of the form
( 5s, -s + 17/5, -s+7/5) = s(5, -1, -1) + (0, 17/5, 7/5)
arbitrary solution
to Ax = y
element of kernel
another particular solution
to Ax = y
The set of solutions also can be represented geometrically by sliding
the kernel, namely the line defined by the vector ( –5, 1, 1), in the
direction and distance defined by the vector (0, 17/5, 7/5).
Note. The particular solution is not unique in general.
Ch6_46
Homework
Exercise 6.4:
1, 7, 10
Ch6_47
6.5 Coordinate Vectors
In this section we will find how we can use vectors in Rn,
called coordinate vectors, to describe vectors in
any real finite-dimensional vector space.
All finite-dimensional vector spaces are in some
mathematical sense “the same” as Rn.
Ch6_48
Definition
Let U be a vector space with basis B = {u1, …, un}and let u be a
vector in U. We know that there exist unique scalars a1, …, an,
such that
u = a1u1 + … + anun
a1
The column vectors u B is called the coordinated vector
an
of u relative to this basis.
The scalars a1, …, an are called the coordinates of u relative to
this basis.
Ch6_49
Example 1
Find the coordinate vectors of u = (4, 5) relative to the following
bases B and B’ of R2: (a) The standard basis, B ={(1, 0), (0, 1)}
and (b) B’ = {(2, 1), (-1, 1)}
Solution
4
(a) (4, 5) = 4(1, 0)+5(0, 1)
uB
5
(b) Let (4, 5) = a1(2, 1) + a2(-1, 1)
Thus
(4, 5) (2a1 - a2 , a1 + a2 )
2a1 - a2 4
a1 + a2 5
a1 3
a 2 2
u B ' 3 .
2
Ch6_50
These coordinate vectors have geometrical interpretation.
Denote the basis vectors as follows.
u1 = (1, 0), u2 = (0, 1) and u’1 = (2, 1), u’2 = (-1, 1)
We can write
u = 4u1 + 5u2, u = 3u’1 + 2u’2
u = 4u1 + 5u2
u = 3u’1 + 2u’2
Figure 6.20
隨堂作業:6
Ch6_51
Example 2
Find the coordinate vectors of u = 5x2 + x – 3 relative to the
following bases B and B’ of P2.
(a) The standard basis, B = {x2, x, 1}
(b) B’ = {x2 – x + 1, 3x2 – 1, 2x2 + x – 2}
Solution
(a) Let 5 x 2 + x - 3 5( x 2 ) + ( x) - 3(1)
5
Thus u B 1.
- 3
(b) Let 5x2 + x - 3 a1 ( x2 - x +1) + a2 (3x2 -1) + a3 (2x2 + x - 2)
Thus
5x2 + x - 3 (a1 + 3a2 + 2a3 ) x2 + (-a1 + a3 ) x + (a1 - a2 - 2a3 )
Ch6_52
Comparing coefficients leads to the following system of equations
a1 + 3a2 + 2a3 5
+ a3 1
- a1
a - a - 2 a -3
3
1 2
This system has the unique solution
a1 2, a2 -1, a3 3
2
Thus uB - 1.
3
Ch6_53
Note
In general, a system of linear equations has to be solved to
find a coordinate vector relative to another basis.
However, coordinate vectors can be easily computed
relative to an orthonormal basis.
Remind:
If B = {u1, …, un} is an orthonormal basis for a vector space
U, then an arbitrary vector v in U can be expressed
v = (vu1)u1 + (vu2)u2 + … + (vun)un.
Thus the coordinate vector is
v u1
v B .
v u n
Ch6_54
Example 3
Find the coordinate vectors of v = (2, -5, 10) relative to the
orthonormal basis
3 4
4 3
B {(1, 0, 0), (0, , ), (0, , - )}
5 5
5 5
Solution
We get
2
Thus v B 5.
- 10
(2, - 5, 10) (1, 0, 0) 2
3 4
(2, - 5, 10) (0, , ) 5
5 5
4 3
(2, - 5, 10) (0, , - ) -10
5 5
隨堂作業:13
Ch6_55
Change of Basis
Let B = {u1, …, un} and B’ = {u1’, …, un’} be bases for a vector
space U. A vector u in U will have coordinate vectors uB and uB’
relative to these bases.
Let the coordinate vectors of u1, …, un relative to the basis B’ =
{u1’, …, un’} be (u1)B’ … (un)B’.
The matrix P = [(u1)B’ … (un)B’] is called the transition matrix
from the basis B to the basis B’.
Theorem 6.14
uB’ = PuB
Ch6_56
Example 4
Consider the bases B = {(1, 2), (3, -1)} and B’ = {(1, 0), (0, 1)}
of R2. If u is a vector such that uB = 3 , find uB’.
4
Solution
We express the vectors of B in terms of the vector of B’ to get the
transition matrix.
(1, 2) = 1(1, 0) + 2(0, 1)
(3, -1) = 3(1, 0) – 1(0, 1)
1
3
The coordinate vectors of (1, 2) and (3, -1) are and .
2
- 1
The transition matrix P is thus
1 3
P
2 - 1
We get
1 3 3 15
隨堂作業:16
u B'
4 2
2
1
Ch6_57
Theorem 6.15
Let B and B’ be bases for a vector space U and P be the
transition matrix from B to B’. Then P is invertible and the
transition matrix from B’ to B is P–1.
Proof Let u be a vector in U having column coordinate vectors
uB and uB’ relative to the bases B and B’. P is given to be the
transition matrix from B to B’; let Q be the transition matrix from
B’ to B. Then we know that
uB’ = PuB and uB = QuB’
Combine these equations in two ways.
We get
uB’ = PQuB’ and uB = QPuB
Since these results hold for all values of uB and uB’,
we have that
PQ = QP = I
Thus Q = P–1.
Ch6_58
Example 5
Consider the bases B = {(1, 2), (3, -1)} and B’ = {(3, 1), (5, 2)}
of R2. Find the transition matrix from B to B’. If u is a vector
such that uB = 2 , find uB’.
1
Solution Let the standard basis S = {(1, 0), (0, 1)} as an
intermediate basis. The transition matrix P from B to S and the
transition matrix P’ from B’ to S are P 1 3 and P' 3 5
2
-1
2
1
The transition matrix from S to B’ will be (P’)–1. The transition
matrix from B to B’ is (P’)–1P. Thus the transition matrix from B
to B’ is
-1
3 5 1 3 2 - 5 1 3 - 8 11
1 2 2 - 1 - 1 3 2 - 1 5 - 6
This gives
- 8 11 2 - 5
隨堂作業:23
u B
5 - 6 1 4
Ch6_59
Isomorphisms
Definition
Let T be a one-to-one, linear transformation of U onto W. T is
called an isomorphism. U and W are called isomorphic vector
spaces.
Theorem 6.16
Let U be a real vector space with basis {u1, …, un}. Let u be an
a1
arbitrary element of U with coordinate vector relative to
a
n
this basis. The following transformation T is an isomorphism
of
U onto Rn.
a
1
n
T (u)
a
Ch6_60
Examples:
(1) P2 is isomorphic to R3.
(2) M22 is isomorphic to R4.
Homework
Exercise 6.5:
6, 12, 13, 16, 23
Ch6_61
6.6 Matrix Representations of Linear
Transformations
In this section we introduce a way of representing a linear
transformation between general vector spaces by a matrix.
Theorem 6.17
Let T: U → V be a linear transformation. Let {u1, …, un} be a
basis for U. T is defined by its effect on the base vectors, namely
by T(u1), …, T(un). The range of T is spanned by {T(u1), …,
T(un)}.
Thus, defining a linear transformation on a basis defines it on the
whole domain.
Ch6_62
Example 1
Consider the linear transformation T: R3 → R2 defined as follows
on basis vectors of R3. Find T(1, -2, 3).
T(1, 0, 0) = (3, -1), T(0, 1, 0) = (2, 1), T(0, 0, 1) = (3, 0)
Solution
Since T is defined on basis vectors of R3, it is defined on the
whole space.
To find T(1, -2, 3), express the vector (1, -2, 3) as a linear
combination of the basis vectors and use the linearity of T.
T(1, -2, 3) = T(1(1, 0, 0) – 2(0, 1, 0) + 3(0, 0, 1))
= 1T(1, 0, 0) – 2T(0, 1, 0) + 3T(0, 0, 1)
= 1(3, -1) – 2(2, 1) + 3(3, 0)
= (8, –3)
隨堂作業:1
Ch6_63
Theorem 6.18
Let U and V be vector spaces with bases B = {u1, …, un} and B’
= {v1, …, vm} and T: U → V a linear transformation.
If u is a vector in U with image T(u) having coordinate vectors a
and b relative to these bases, then
b = Aa
where A = [T(u1)B’, …, T(un)B’].
The matrix A thus defines a transformation of coordinate vectors
of U in the “same way” as T transformations the vectors of U.
A is called the matrix representation of T
(or matrix of T) with respect to the bases B and B’.
T
u ‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ T (u)
Coordinate
mapping
a‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ ‧ b
Figure 6.21
A
Ch6_64
Example 2
Let T: U → V be a linear transformation. T is defined relative to
bases B = {u1, u2, u3} and B’ = {v1, v2} of U and V as follows.
T(u1) = 2v1 – v2
T(u2) = 3v1 + 2v2
T(u3) = v1 – 4v2
Find the matrix representation of T with respect to these bases
and use this matrix to determine the image of the vector
u = 3u1 + 2u2 – u3.
Solution The coordinate vectors of T(u1), T(u2), and T(u3) are
2 3
1
- 1, 2, and - 4
These vectors make up the columns of the matrix of T.
1
2 3
A
1
2
4
Ch6_65
Let us find the image of the vector u = 3u1 + 2u2 – u3 using this
3
matrix. The coordinate vector of u is a = 2 . We get
- 1
3
1 11
2 3
Aa
2
5
- 1 2 - 4
- 1
11
T(u) has coordinate vector . Thus T(u) = 11v1 + 5v2.
5
隨堂作業:8
Ch6_66
Example 3
Consider the linear transformation T: R3 → R2, defined by T(x, y,
z) = (x + y, 2z). Find the matrix of T with respect to the basis {u1,
u2, u3} and {u1’, u2’} of R3 and R2, where
u1 = (1, 1, 0), u2 = (0, 1, 4), u3 = (1, 2, 3)
and u1’ = (1, 0), u2’ = (0, 2)
Use this matrix to find the image of the vector u = (2, 3, 5).
Solution We find the effect of T on the basis vectors of R3.
T(u1) = T(1, 1, 0) = (2, 0) = 2(1, 0) + 0(0, 2) = 2u1’ + 0u2’
T(u2) =T(0, 1, 4) = (1, 8) = 1(1, 0) + 4(0, 2) = 1u1’ + 4u2’
T(u3) =T(1, 2, 3) = (3, 6) = 3(1, 0) + 3(0, 2) = 3u1’ + 3u2’
2
The coordinate vectors of T(u1), T(u2), and T(u3) are thus ,
0
1
3
4 , and 3 . These vectors form the columns of the matrix
2 1 3
of T.
A
0 4 3
Ch6_67
Let us now use A to find the images of the vectors u = (2, 3, 5).
We determine the coordinate vector of u. It can be shown that
u = (2, 3, 5) = 3(1, 1, 0) + (0, 1, 4) – (1, 2, 3)
= 3u1 + 2u2 + (– 1)u3
3
The coordinate vector of u is thus a = 2 . The coordinate
- 1
vector of T(u) is
3
2 1 3 5
b Aa
2
0 4 3 - 1 5
Therefore, T(u) = 5u1’ + 5u2’ = 5(1, 0) + 5(0, 2) = (5, 10).
We can check this result directly using the definition T(x, y, z) =
(x + y, 2z). For u = (2, 3, 5), this gives
T(u) = T(2, 3, 5) = (2 + 3, 2 5) = (5, 10)
Ch6_68
隨堂作業:11
Importance of Matrix Representations
Every real finite-dimensional vector space is isomorphic
to Rn.
The fact that every linear transformation can now be
represented by a matrix means that all the theoretical
mathematics of these vector spaces and their linear
transformations can be undertaken in terms of the vector
spaces Rn and matrices.
The elements of Rn and matrices can be manipulated on
computers.
Ch6_69
Example 4
Consider the linear transformation T: P2 → P1, defined by T(ax2 +
bx + c) = (a + b)x – c. Find the matrix of T with respect to the
basis {u1, u2, u3} and {u1’, u2’} of P2 and P1, where
u1 = x2, u2 = x, u3 = 1 and u’1 = x, u’2 = 1
Use this matrix to find the image of u = 3x2 + 2x – 1 .
Solution Consider the effect of T on each basis vectors of P2.
T(u1) = T(x2) = x = 1x + 0(1) = 1u1’ + 0u2’
T(u2) = T(x) = x = 1x + 0(1) = 1u1’ + 0u2’
T(u3) = T(1) = –1 = 0x + (-1)(1) = 0u1’ + (–1)u2’
1
2
The coordinate vectors of T(x ), T(x), and T(1) are thus
,
0
1 , and 0 . The matrix of T is thus
-1
0
1 1 0
A
0 0 - 1
Ch6_70
Let us now use T to find the images of u = 3x2 + 2x – 1. The
3
coordinate vector of u relative to the basis {x2, x, 1} is a = 2
- 1
We get
3
1 1 0 5
b Aa
2
0 0 - 1 - 1 1
Therefore T(u) = 5u1’ + 1u2’ = 5x + 1.
ax2 + bx + c‧
‧ ‧ ‧ ‧
‧ ‧ ‧ ‧ ‧
Figure 6.22
a
b
c
T
‧
‧
A
‧ ‧ ‧ ‧
( a + b) x - c
‧ ‧ ‧ ‧
1 1 0
0 0 - 1
a + b
-c
Ch6_71
Example 5
Let D d be the operation of taking the derivative. D is a linear
dx
operator on P2. Find the matrix of D with respect to the basis
{x2, x, 1} of P2.
Solution We examine the effect of D on the basis vectors.
D( x 2 ) 2 x 0 x 2 + 2 x + 1(1)
D( x) 1 0 x 2 + 0 x + 0(1)
D(1) 0 0 x 2 + 0 x + 0(1)
The matrix of D is thus
0 0 0
A 2 0 0
0 1 0
The matrix A defines a linear operator on R3 that is analogous to
D on P2. We have
0 0 0 a 0
D(ax 2 + bx + c) 2ax + b and 2 0 0 b 2a
0 1 0 c b
Ch6_72
ax2 + bx + c‧
‧ ‧ ‧ ‧
D
‧
‧ ‧ ‧ ‧
‧ ‧ ‧
A
0 0 0
2 0 0
0 1 0
‧ ‧ ‧ ‧ ‧
a
b
c
2ax + b
‧ ‧
0
2a
b
Figure 6.23
Ch6_73
Relations between Matrix
Representations
The matrix representation of a linear transformation
depends upon the bases selected.
Now we discuss how matrix representations of linear
operators relative to different bases are related.
We shall find that the matrix representations of a
linear operator relative to two bases are similar
matrices.
Ch6_74
Theorem 6.19
Let U be a vector space with bases B and B’. Let P be the
transition matrix from B’ to B. If T is a linear operator on U,
having matrix A with respect to the first basis and A’ with respect
to the second basis, then
A’ = P–1AP
U
u ‧
U
‧ ‧ ‧ ‧
T
‧
T (u)
‧ ‧ ‧ ‧
B
B
a‧
‧ ‧ ‧ ‧
‧
A
‧ ‧ ‧ ‧
b
U
u ‧
U
‧
‧
‧
‧
T
‧
‧
‧
T (u)
‧
‧
B’
a'‧
B’
‧
‧
‧
‧
‧
A'
‧
‧
‧
‧
b'
Ch6_75
Theorem 6.19
Let U be a vector space with bases B and B’. Let P be the
transition matrix from B’ to B. If T is a linear operator on U,
having matrix A with respect to the first basis and A’ with respect
to the second basis, then
A’ = P–1AP
Proof Consider a vector u in U. Let its coordinate vectors
relative to B and B’ be a and a’. The coordinate vectors of T(u)
are Aa and A’a’. Since P is the transition matrix from B’ to B, we
know that
a = Pa’ and Aa = P(A’a’)
The second equation may be written P–1Aa = A’a’
Substituting a = Pa’ into the equation gives P–1APa’ = A’a’
The effect of the matrices P–1AP and A’ as transformations on an
arbitrary coordinate vector a’ is the same. Thus these matrices
are equal.
Ch6_76
Example 6
Consider the linear operator T(x, y) = (2x, x + y) on R2. Find the
matrix of T with respect to the basis B = {(1, 0), (0, 1)} on R2.
Use the transformation A’ = P–1AP to determine the matrix A’
with respect to the basis B’ = {(-2, 3), (1, -1)}.
Solution The effect of T on the vectors of the standard basis is
T(1, 0) = (2, 1) = 2(1, 0) + 1(0, 1)
T(0, 1) = (0, 1) = 0(1, 0) + 1(0, 1)
2 0
The matrix of T relative to the standard basis is A
1 1
Write the vectors of B’ in terms of those of B.
(-2, 3) = -2(1, 0) + 3(0, 1)
(1, -1) = 1(1, 0) – 1(0, 1)
The transition matrix is P - 2 1
隨堂作業:19
3
1
Therefore
-1
-2
1 2 0 - 2
1 1 1 2 0 - 2 1 - 3 2
A P -1 AP
3 - 1 1 1 3 - 1 3 2 1 1 3 - 1 - 10 6
Ch6_77
Diagonal Matrix Representation of a
Linear Operator
How to find a diagonal matrix representation of a linear
operator T, if one exists.
Note A’=P-1AP.
Suppose A has eigenvalues l1, l2, …, ln, with n
corresponding, linearly independent eigenvectors
v1, v2, …, vn. If P=[v1 v2 … vn], then
A’ =
0
l1
0
ln
The coordinate vectors of B’ relative to B are the
eigenvectors v1, v2, …, vn.
Ch6_78
Example 7
Consider the linear operator T(x, y) = (3x+ y, x + 3y) on R2. Find
a diagonal matrix representation of T. Determine the basis for this
representation and transformation and give a geometrical
interpretation of T.
Solution
Let us start by finding the matrix representation A relative to the
standard basis B = {(1, 0), (0, 1)} of R2. We get
T(1, 0) = (3, 1) = 3(1, 0) + 1(0, 1)
T(0, 1) = (1, 3) = 1(1, 0) + 3(0, 1)
The coordinate vectors of T(1, 0) and T(0, 1) relative to B are
3
1 The matrix representation of T relative to the
1, and 3.
standard basis B is thus
3 1
A
1 3
Ch6_79
A has the following eigenvalues and eigenvectors.
1
- 1
l1 4, v1 r ; l2 2, v 2 s
1
1
The following matrix A’ is thus a diagonal matrix representation
of T.
l1 0 4 0
A
0
l
0
2
2
Now we find the basis B’ that gives this representation A’.
Observe that A is a symmetric matrix. Select unit orthogonal
eigenvectors for the coordinate vectors of B’ relative to B.
The transition matrix from B to B’ will then be orthogonal,
and the geometry will be preserved.
Ch6_80
1 1
1 1
,
)}
Let B' {( , ), (2 2
2 2
Note that B’ is obtained from the basis B by rotation through p/4.
Geometrical interpretation:
B: defines xy coordinate system
B’: defines x’y’ coordinate system
T is a scaling in the x’y’ coordinate
system, with factor 4 in the x’ direction
and factor 2 in the y’ direction.
T maps the square PQRO
into the rectangle P’Q’R’O.
隨堂作業:29(a)
Figure 6.24
Ch6_81
Homework
Exercise 6.6:
1, 4, 8, 11, 17, 19, 29
Ch6_82