Linear Transformation Properties Contraction and Dilation Identity Matrix Theorem
Linear Transformation Properties Contraction and Dilation Identity Matrix Theorem
Linear Transformation Properties Contraction and Dilation Identity Matrix Theorem
Week 12 lectures 23
Recall: Linear Independence, Linear Independence of Matrix Columns, Sets of One or Two
Linear Transformation
Properties
Identity matrix
Theorem
https://youtu.be/i8xgM7H4dVQ
https://youtu.be/nsYQPFtMfCg
https://youtu.be/goq4sDnIwCM
https://youtu.be/apGXGIL0zmg
https://youtu.be/QxrgGX0IvLw
Linear Algebra (MTH-435)
These properties for a transformation identify the most important class of transformations
in linear algebra.
Definition
Example 23.1
=L(𝑥1 + 𝑥2 , 𝑦1 + 𝑦2 , 𝑧1 + 𝑧1 )
Linear Algebra (MTH-435)
Hence, L is a linear transformation, which is called a projection. The image of the vector (or
drawing a line through the end point P(a, b, c) of u and perpendicular to 𝑹𝟐 , the x y-plane.
The intersection Q(a, b)of this line with the x y-plane will
23.2 Properties
1. T(0) = 0
Proof
1. By the definition of Linear Transformation we have T(cu) = cT(u) for all u and all
Observe that if a transformation satisfies property 2 for all u, v and c, d, it must be linear
Example 23.2
0 −1 𝑥 −𝑦
T(x) =[ ] [𝑦 ] = [ ]
1 0 𝑥
Linear Algebra (MTH-435)
Solution
0 −1 4 −1
T (u)= [ ][ ] = [ ]
1 0 1 4
0 −1 3 −3
T (v)= [ ][ ] = [ ]
1 0 2 2
0 −1 6 −4
T (u +v)=[ ] [ ] = [ ].
1 0 4 6
Example 23.3
Solution
= -3L(i) + 4L(j) + 2L (k )
= (4,11)
Solution
= 3cu + 3dv
Linear Algebra (MTH-435)
= cT(u) + dT(v)
1 0
The column of matrix 𝐼2 = [ ]
0 1
1 0
are 𝑒1 = [ ] 𝑎𝑛𝑑 𝑒2 = [ ]
0 1
5 −3
𝑇(𝑒1 ) = [−7] 𝑎𝑛𝑑 𝑇(𝑒2 ) = [ 8 ]
2 0
Solution
Linear Algebra (MTH-435)
𝑥1 1 0
[𝑥 ] = 𝑥1 [ ] + 𝑥2 [ ]
2 0 1
𝑥1 1 0
𝑇([𝑥 ]) = 𝑥1 (𝑇 [ ]) + 𝑥2 (𝑇 [ ])
2 0 1
And thus
𝑥1 5 −3
𝑇 ([𝑥 ]) = 𝑥1 [−7] + [ 8 ]
2
2 0
5 −3 𝑥
1
=[−7 8 ] [𝑥 ]
2
2 0
𝐴 = [𝑇(𝑒1 ) 𝑇(𝑒2 )]
23.5 Theorem
Linear Algebra (MTH-435)
in fact A is the from 𝑚 × 𝑛 matrix whose jth column is the vector from 𝑇(𝑒𝑗 ) where 𝑒𝑗 is the
Remark
Week 12 Lecture 24
geometrically
Examples
Applications
Linear Algebra (MTH-435)
−1 0
𝑆. 𝑀 = [ ]
0 1
−1 0
𝑆. 𝑀 = [ ]
0 −1
𝑘 0
𝑆. 𝑀 = [ ]
0 1
1 0
𝑆. 𝑀 = [ ]
0 𝑘
1 𝑘
𝑆. 𝑀 = [ ]
0 1
1 0
𝑆. 𝑀 = [ ]
𝑘 1
Linear Algebra (MTH-435)
Projections:
1 0
𝑆. 𝑀 = [ ]
0 0
0 0
𝑆. 𝑀 = [ ]
0 1
Rotation:
Let 𝑇: 𝑅 2 → 𝑅 2 be the transformation that rotates each point in 𝑅 2 about the origin
𝑐𝑜𝑠 ∅ −𝑠𝑖𝑛 ∅
𝑆. 𝑀 = [ ]
𝑠𝑖𝑛 ∅ 𝑐𝑜𝑠 ∅
Example
𝒖 = (𝟐, 𝟓)
Onto mapping:
Applications
𝒗𝟏 , … , 𝒗𝒑 as signals that go into a system or process and T(𝒗𝟏 ), … , T(𝒗𝒑 ) as the responses of
that system to the signals. The system satisfies the superposition principle if an input is
expressed as a linear combination of such signals; the system’s response is the same linear
Linear Algebra (MTH-435)
is for geometric transformations, such as those performed in computer graphics, where the
a transformation matrix. Linear mappings also are used as a mechanism for describing
Note: You can take help from book which I have recommended you by David C Lay. The