Full Assignment
Full Assignment
Full Assignment
1
Linear Transformation
(a):T(ku) = kT(u)……(1)
(b): T(u + v) = T(u) + T(v)…….(2)
Matrix Transformations:
we will introduce a special class of functions that arise from matrix multiplication.
Such functions, called “Matrix Transformations,” are fundamental in the study of
linear algebra and have important applications in physics, engineering, social
sciences, and various branches of mathematics.
DEFINITION: If f is a function with domain Rn and codomain R m, then we say
that f is a transformation from Rn to Rm or that f maps from Rn to Rm.
we denote this by writing f : R n→Rm In the special case where m = n, a
transformation is sometimes called an operator on Rn.
THEOREM 1.8.2
T : Rn→ Rm is a matrix transformation if and only if the following
relationships hold for all vectors u and v in Rn and for every scalar k:
Proof:
If T is a matrix transformation, then properties (i) and (ii) follow respectively from
2
parts (c) and (b) of Theorem 1.8.1.
Conversely, assume that properties (i) and (ii) hold. We must show that there exists
an m × n matrix A such that:
T (x) = Ax … (10)
TA (k1u1 + k2u2 +···+ krur) = k1TA(u1) + k2TA(u2) +···+ krTA (ur)………. (10)
for every vector x in Rn. Recall that the derivation of Formula (10) used only the
additivity and homogeneity properties of TA. Since we are assuming that T has
those properties, it must be true that:
T (k1u1 + k2u2 +···+ kr ur) = k1T (u1) + k2T (u2) +···+ krT (u r) …………… (12)
for all scalars k1, k2,... ,kr and all vectors u1, u2,..., ur in Rn.
where e1, e2,... , en are the standard basis vectors for Rn.
It follows from Theorem 1.3.1 that Ax is a linear combination of the columns of A
in which the successive coefficients are the entries x1, x2,...,xn of x. That is,
Ax = x1T (e1) + x2T (e2) +···+ xnT (en) Using Formula-------- (10)
which completes the proof. The additivity and homogeneity properties in Theorem
1.8.2 are called linearity conditions, and a transformation that satisfies these
conditions is called a linear transformation.
3
EXAMPLE: A Matrix Transformation from R3 to R2
T (1,0,0) = (3,5) R3
= 3(1,0) + 5(0,1)
= (3,5) T (x1, x2, x3) = T (1,0,0)
T (x1, x2, x3) = T (0,1,0)
T (0,1,0) = (-4, 5) T (x1, x2, x3) = T (0,0,1)
=-4(1,0) + 5(0,1)
= (-4,5)
R2
T (0,0,1) = (9 , -3)
= T (1,0)
=9(1,0) -3(0,1)
= T (0,1)
= (9 , -3)
[ ]
❑
4
Composition Of Matrix Transformation
DEFINITION : If T1: U →V and T2: V →We are linear transformations, then the
composition of T2 with T1, denoted by T2 ◦ T1 (which is read “T2 circle T1”), is the
function defined by the formula:
where u is a vector in U.
THEOREM 8.2.3
Proof:
If T1: U →V and T2: V →W are linear transformations, then (T2 ◦ T1): U →W is
also a linear transformation. Proof If u and v are vectors in U and c is a scalar, then
it follows from (1) and the linearity of T1 and T2 that
(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)
And
(T2 ◦ T1)(cu) = T2(T1(cu))
= T2(cT1(u))
= cT2(T1(u))
= c(T2 ◦ T1)(u)
5
EXAMPLE: Prove that the composition S ◦ T is a linear transformation.
Is the composition of linear transformations a linear transformation? If so, what is
its matrix?
Let R2 T→ R 3 and R3→s R 2 be two linear What is its source vector space? What is its
target vector space?
SOLUTION:
We need to check that S ◦T respect addition and also scalar multiplication and
Prove that the composition S ◦ T is a linear transformation.
Here the first condition of linear matrix composition:
(T2 ◦ T1) (u + v) = (T2 ◦ T1)(u) + (T2 ◦ T1)(v)-----------(1)
First, note for any x , y ∈ R 2 , we have:
S ◦ T (x + y)= S(T(x + y))
= S(T(x)) + S(T(y))
= S ◦ T(x) + S ◦ T(y)
S ◦ T (x + y) = S ◦ T(x) + S ◦ T(y) Hence proved that:
L.H.S=R.H.S
Here, the second and third equal signs come from the linearity of T and S,
respectively. Note that for any x ∈ R 2 and any scalar k, we have
S ◦ T(k x) = S(T(k x))
= S(k T(x))
6
= k S(T(x))
= k S ◦ T(x)
S ◦ T(k x) = k S ◦ T(x) ) Hence proved that:
L.H.S=R.H.S
S ◦ T also respects scalar multiplication. The second and third equal signs again are
justified by the linearity of T and S, respectively. So S ◦T respects both addition
and scalar multiplication are satisfied , so it is linear.
SOLUTION:
Let T1: P1 →P2 and T2: P2 →P2 be the linear transformations given by the
formulas
T1(p(x)) = x p(x) and T2(p(x)) = P (2x + 4)
7
transformation:
In particular, if p(x) = c0 + c1x, then
(T2 ◦ T1) (p(x)) = (T2 ◦ T1)(c0 + c1x)
= (2x + 4)(c0 + c1(2x + 4))
= c0(2x + 4) + c1(2x + 4)2
(T2 ◦ T1) (p(x)) = c0(2x + 4) + c1(2x + 4)2 L.H.S=R.H.S
Both conditions are satisfied it is composition of linear matrix.
Let p = p(x) = c0 + c1x +···+ cnxn be a polynomial in Pn, and define the
transformation T : Pn →Pn+1 by T(p) = T(p(x)) = x p (x) = c0x + c1x2 +···+ cnxn+1
SOLUTION:
T(p) = T(p(x)) = x p (x) = c0x + c1x2 +···+ cnxn+1
This transformation is linear because for any scalar k and any polynomials P1 and
P2 in Pn we have
T(kP) = T(kP(x))
= x(kP(x)
= k(xP(x)
= k T(p)
8
T(kP) = k T(p) L.H. S = R.H.S
9
EXAMPLE: Transformations on Matrix Spaces
Let Mnn be the vector space of n × n matrices. In each part determine whether the
transformation is linear.
(a) T1(A) = AT
(b)T2(A) = det(A)
Solution:
(a) T1(A) = AT
T(ku) = kT(u)……(1)
Now put the values in this condition for check it is linear transformation or not
T1(kA) = (kA)T
= kAT
= kT1(A)
L.H.S = R.H.S
Now, we will check second condition :
T1(A + B) = (A + B)T
= AT + BT
10
= T1(A) + T1(B)
L.H. S= R.H.S
SOLUTION:
T(ku) = kT(u)……(1)
Thus, T2 is not homogeneous and hence not linear if n > 1. Note that
additivity also fails because we showed in Example 1 of Section 2.3 that
det(A + B) and det(A) + det(B) are not generally equal. Both conditions are
not satisfied.
11