MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 1

1.7 Linear Independence

Definition 1 (Linear Independence)

(a) An indexed set of vectors {𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 } in ℝ𝑛 is said to be linearly

independent if the vector equation
𝑥1 𝒗𝟏 + 𝑥2 𝒗𝟐 + ⋯ +𝑥𝑝 𝒗𝒑 = 𝟎
has only the trivial solution. 𝑇: ℝ𝑛 → ℝ𝑚

(b) The set {𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 } is said to be linearly dependent if there exist weights For x in ℝ𝑛 , the vector T(x) in ℝ𝑚 is called the image of x (under the action of T ).
𝑐1 , 𝑐2 , ⋯ , 𝑐𝑝 , not all zero, such that The set of all images T(x) is called the range of T.

𝑐1 𝒗𝟏 + 𝑐2 𝒗𝟐 + ⋯ +𝑐𝑝 𝒗𝒑 = 𝟎 Definition 3 (Linear Transformation) A transformation (or mapping) T is

linear if:
Theorem 1 (Linear Independence of Columns of Matrix) The columns
(a) T(u + v) = T(u) + T(v) for all u, v in the domain of T;
of a matrix A are linearly independent if and only if the equation Ax = 0 has only the
(b) T(cu) = cT (u) for all scalars c and all u in the domain of T.
trivial solution.
Theorem 4 (Properties of Linear Transformation) If T is a linear
Theorem 2 (Characterization of Linearly Dependent Sets) An indexed set
transformation, then
𝑺 = {𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 } of two or more vectors is linearly dependent iff at least one of
the vectors in S is a linear combination of the others. In fact, if S is linearly dependent (a) T(0) = 0 (0 are the zero vectors in the domain and codomain)
and 𝒗𝟏 ≠ 𝟎, then some 𝒗𝒋 (with j > 1) is a linear combination of the preceding vectors, (b) T(cu+dv) = cT (u)+dT (v) for all vectors u, v in the domain of T and all scalars
𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒋 . c, d.
(c) T(𝑐1 𝒗𝟏 + 𝑐2 𝒗𝟐 + ⋯ +𝑐𝑝 𝒗𝒑 ) = 𝑐1 T( 𝒗𝟏) + : : : + 𝑐𝑝 T(𝒗𝒑 ) for all vectors
𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 in the domain of T and all scalars 𝑐1 , 𝑐2 , ⋯ , 𝑐𝑝 .
Theorem 3 (Conditions For Linear Dependence)
(a) If a set contains more vectors than there are entries in each vector, then the set
is linearly dependent. That is, any set {𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 } in ℝ𝑛 is linearly Example 1 (Lay p.64)
dependent if p > n.
(b) If a set 𝑆 = {𝒗𝟏 , 𝒗𝟐 , ⋯ , 𝒗𝒑 } in ℝ𝑛 contains the zero vector, then the set is 1 −3 3 3
2
linearly dependent. Let 𝐴 = ( 3 5 ) , 𝒖 = ( ) , 𝒃 = ( 2 ) , 𝒄 = (2) , and define a
−1
−1 7 −5 5
transformation 𝑇: ℝ → ℝ3 by 𝑇(𝒙) = 𝐴𝒙 so that
2
1.8 Introduction to Linear Transformations
1 −3 𝑥 𝑥1 − 3𝑥2
1
Definition 2 (Transformation) A transformation (or function or mapping) 𝑇(𝒙) = 𝐴𝒙 = ( 3 5 ) ( 𝑥2 ) = (3 𝑥1 + 5𝑥2 )
T from ℝ𝑛 to ℝ𝑚 is a rule that assigns to each vector x in ℝ𝑛 a vector T(x) in ℝ𝑚 . −1 7 −𝑥1 + 7𝑥2
The set ℝ𝑛 is called the domain of T, and ℝ𝑚 is called the codomain of T . a. Find 𝑇(𝒖), the image of 𝒖 under the transformation 𝑇 .
b. Find an 𝒙 in ℝ2 whose image under 𝑇 is 𝒃.
The notation 𝑇: ℝ𝑛 → ℝ𝑚 indicates that the domain of T is ℝ𝑛 and the codomain is c. Is there more than one 𝒙 whose image under 𝑇 is 𝒃?
ℝ𝑚 . d. Determine if 𝑐 is in the range of the transformation .
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 2

1.9 The Matrix of a Linear Transformation

Solution :
1 −3 5
2 Theorem 5 Let 𝑇: ℝ𝑛 → ℝ𝑚 be a linear transformation. Then there exists a
a. Compute 𝑇(𝒖) = 𝐴𝒖 = ( 3 5 ) ( ) =(1)
−1 unique matrix A such that
−1 7 9
T(x) = Ax for all x in ℝ𝑛
b. Solve 𝑇(𝒙) = 𝒃 for 𝒙. That is, solve 𝐴𝒙 = 𝒃, or
In fact, A is the m×n matrix whose jth column is the vector T(ej), where ej is the
1 −3 𝑥 3 jth column of the identity matrix in ℝ𝑛 :
1
(3 5 ) (𝑥 ) = ( 2 ) (1)
−1 7
2
−5 A = [T(e1) ⋯ T(en)]

Row reduce the augmented matrix: This matrix A is called the standard matrix for the linear transformation T.
1 −3 3 −3𝑅1+𝑅2 𝑡ℎ𝑒𝑛 𝑅1+𝑅3 1 −3 3
(3 5 | 2 )→ (0 14 |−7)
−1 7 −5 0 4 −2
Example 2 (Lay p.72)
𝑅2
𝑡ℎ𝑒𝑛−4𝑅2 +𝑅3 1 −3 3 3𝑅2 +𝑅1 1 0 1.5
14
→ (0 1 |−0.5) → (0 1 |−0.5) (2) Let 𝑇: ℝ2 → ℝ2 be the transformation that rotates each point in ℝ2 about the origin
0 0 0 0 0 0 through an angle 𝜑, with counterclockwise rotation for a positive angle. We could
show geometrically that such a transformation is linear. Find the standard matrix 𝐴 of
1.5 ) this transformation.
Hence 𝑥1 = 1.5 , 𝑥2 = −0.5 and 𝒙 = ( . The image of this 𝒙 under T
−0.5
is the given vector 𝒃. Solution :

c. Any 𝒙 whose image under 𝑇 is 𝒃 must satisfy equation (1). From (2), it is clear 1 cos 𝜑 0 −sin 𝜑
Since ( ) rotates into ( sin 𝜑 ) and ( ) rotates into ( ).
that equation (1) has a unique solution. So there is exactly one 𝒙 whose image is 0 1 cos 𝜑
𝒃.
cos 𝜑 −sin 𝜑
d. The vector 𝒄 is in the range of 𝑇 if 𝒄 is the image of some 𝒙 in ℝ2 , that is, if 𝒄 = 𝐴 = ( sin 𝜑 )
cos 𝜑
𝑇(𝒙) for some 𝒙. This is just another way of asking if the system 𝐴𝒙 = 𝒄 is
consistent. To find the answer, row reduce the augmented matrix:
1 −3 3 −3𝑅1+𝑅2 𝑡ℎ𝑒𝑛 𝑅1+𝑅3 1 −3 3
(3 5 |2) → (0 14 |−7)
−1 7 5 0 4 8
𝑅3
𝑡ℎ𝑒𝑛 𝑅2 ↔𝑅3 1 −3 3 −14𝑅2+𝑅3 1 0 1.5
4
→ (0 1 | 2 ) → (0 1 | 2 )
0 14 −7 0 0 −35

The third equation, 0 = 35, shows that the system is inconsistent. So 𝒄 is not in
the range of 𝑇 .
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 3

4 Special Transformations : Reflections

Reflections, Contraction and Expansions, Shears, Projections.
Trasformation Image of the Unit Square Standard
Reflections Matrix
Trasformation Image of the Unit Square Standard
Matrix

−1 0
Reflection through ( )
the origin 0 −1
Reflection through
the 𝑥1-axis (1 0 )
0 −1

Contraction and Expansions

Reflection through (−1 0) Trasformation Image of the Unit Square Standard
0 1
the 𝑥2-axis Matrix

Horizontal contraction
and expansion (𝑘 0)
0 1

Reflection through (0 1)
the line 𝑥1 = 𝑥2 1 0

Vertical contraction (1 0 )
and expansion 0 𝑘

0 −1
Reflection through ( )
the line 𝑥2 = −𝑥1 −1 0

Shears
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 4

Trasformation Image of the Unit Square Standard Definition 4 (One-To-One) A mapping 𝑇: ℝ𝑛 → ℝ𝑚 is said to be one-to-one
Matrix if each b in ℝ is the image of at most one x in ℝ𝑛 .
𝑚

Horizontal shear
(1 𝑘 )
0 1

Vertical shear (1 0)
𝑘 1 Definition 5 (Onto) A mapping 𝑇: ℝ𝑛 → ℝ𝑚 is said to be onto if each b in ℝ𝑚
is the image of at least one x in ℝ𝑛 .

Projections
Trasformation Image of the Unit Square Standard
Matrix

Projection onto
the 𝑥1-axis (1 0) Theorem 6 Let 𝑇: ℝ𝑛 → ℝ𝑚 be a linear transformation. Then T is one-to-one if
0 0
and only if the equation 𝑇(𝒙) = 𝟎 has only the trivial solution.

Theorem 7 Let 𝑇: ℝ𝑛 → ℝ𝑚 be a linear transformation and let A be the

standard matrix for T. Then:
(a) T maps ℝ𝑛 onto ℝ𝑚 if and only if the columns of A span ℝ𝑚 ;
(b) T is one-to-one if and only if the columns of A are linearly independent.
Projection onto (0 0)
the 𝑥2-axis 0 1
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 5

Examples Example 3
Example 1 1 0 2 −1
Let 𝑒1 = ( ) , 𝑒2 = ( ) , 𝑦1 = ( ) , 𝑦2 = ( ) ,
Determine if the vectors are linearly independent. 0 1 5 6

5 7 9 Let 𝑇: ℝ2 → ℝ2 be a linear transformation that maps 𝑒1 into 𝑦1and mpas 𝑒2 into 𝑦2.
(a) (0) , ( 2 ) , ( 4 ) 5 𝑥1
Find the images of ( ) and (𝑥 ).
0 −6 −8 −3 2

3 −4 10 7 −4
(b) Columns vectors of the matrix (−5 −3 −7 −11 15 ) .
4 3 5 2 1
8 −7 23 4 15

Example 4
Let T be a linear transformation from ℝ2 to ℝ3 satisfying the following conditions:
Example 2
Identify the domain and codomain of the matrix transformations given by the 3 0
1 −1
following matrices, and determine whether the transformations are ono-to-one and 𝑇 ( ) = ( 1 ) and 𝑇 ( ) = (−4)
onto. 2 1
−5 2
1 2 1 1
𝐴=( 1 2 0 1) Find the standard matrix A of T. Is T one-to-one? onto?
0 2 1 2
1 −2 2 −2
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 6

Exercises (c) The columns of any 4×5 matrix are linearly dependent.
Exercise 1
0 −3 9
Determine if the columns vectors of the matrix ( 2 1 −7 ) are linearly
−1 4 −5
1 −4 −2
independent.

(d) If x and y are linearly independent, and if {𝒙, 𝒚, 𝒛} is linearly dependent, then
𝒛 is in 𝑠𝑝𝑎𝑛 {𝒙, 𝒚} .

Exercise 2 Exercise 3
Mark each statement True or False. Justify each answer.
Identify the domain and codomain of the matrix transformations given by the
(a) The columns of a matrix A are linearly independent if the equation Ax = 0 has following matrices, and determine whether the transformations are ono-to-one and
only the trivial solution. onto.

1 2 1
(a) ( )
1 2 2

(b) If S is a linearly dependent set, then each vector is a linear combination of the
other vectors in S.
 MATH2111 Matrix Algebra and Applications Tutorial Notes 4 (Linear Independence and Linear Transformation) Page | 7

1 0 2 −2 (b) If A is a 3×5 matrix and T is a transformation defined by T(𝒙) = A𝒙, then the
3 1 4 −6 domain of T is ℝ3 .
(b) 0 2 −4 1
−1 3 5 2
(0 3 7 1 )

(c) If A is an m×n matrix, then the range of the transformation 𝒙 → A𝒙 is ℝ𝑚

Exercise 4

Mark each statement True or False. Justify each answer.

(a) A linear transformation is a special type of function.