Chapter 1.

MATRIX ALGEBRA
Lê Vũ Trường
Email: [email protected]
Department of Mathematics, FPT University
CONTENTS

1. Matrices

2. Special matrices

3. Matrix Addition, Scalar Multiplication, and Transposition

4. Matrix Multiplication (2.3 7e)

5. Elementary row operations

6. Rank of the matrix

7. Matrix Inverses (2.4 7e)

8. Matrix Transformations (2.2 & 2.6 7e)

OBJECTIVES

⋆ Practicing some matrix operations

⋆ Find matrix inverse

⋆ Using matrix transformations to reveal the geometrical meaning of matrix

multiplication and inverse.

⋆ The relationship of matrix algebra to linear equations

DEFINITIONS

Definition. An m × n matrix (or a matrix of size m × n ) is a rectangular array of

numbers with m rows and n columns
 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. .. = (aij )m×n
 
..
.

 . . . 
am1 am2 . . . amn m×n
DEFINITIONS

Definition. An m × n matrix (or a matrix of size m × n ) is a rectangular array of

numbers with m rows and n columns
 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. .. = (aij )m×n
 
..
.

 . . . 
am1 am2 . . . amn m×n

⋆ A is denoted simply as A = (aij )

DEFINITIONS

Definition. An m × n matrix (or a matrix of size m × n ) is a rectangular array of

numbers with m rows and n columns
 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. .. = (aij )m×n
 
..
.

 . . . 
am1 am2 . . . amn m×n

⋆ A is denoted simply as A = (aij )

⋆ m × n size of the matrix A

DEFINITIONS

Definition. An m × n matrix (or a matrix of size m × n ) is a rectangular array of

numbers with m rows and n columns
 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. .. = (aij )m×n
 
..
.

 . . . 
am1 am2 . . . amn m×n

⋆ A is denoted simply as A = (aij )

⋆ m × n size of the matrix A

⋆ The (i, j)−entry of A (denoted by aij ) lies in row i and column j

Example.
Example.

A is a 2 × 3 matrix (or a matrix of size 2 × 3)// 2 rows, 3 columns

Example.

A is a 2 × 3 matrix (or a matrix of size 2 × 3)// 2 rows, 3 columns

 
1 2 3
B= 0 1 2 
2 5 −1
3 × 3 matrix,a square matrix
Example.

A is a 2 × 3 matrix (or a matrix of size 2 × 3)// 2 rows, 3 columns

   
1 2 3 2.00
B= 0 1 2  C =  −3.00 
2 5 −1 1.75

3 × 3 matrix,a square matrix 3 × 1 matrix, column matrix

ZERO MATRIX

Definition. The zero matrix (ma trận không) is a matrix in which all elements are
zero, denoted by 0m×n (or 0 ).
ZERO MATRIX

Definition. The zero matrix (ma trận không) is a matrix in which all elements are
zero, denoted by 0m×n (or 0 ).

Example.  
0 0 0 0
03×4 = 0 0 0 0 
0 0 0 0
SQUARE MATRIX

Definition. An n × n matrix is called a square matrix (ma trận vuông) of size m.

 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. . . .. 
 
 . . . . 
an1 an2 . . . ann

Mn (R) : the set of all n square matrices on R.

SQUARE MATRIX

Definition. An n × n matrix is called a square matrix (ma trận vuông) of size m.

 
a11 a12 . . . a1n
 a21 a22 . . . a2n 
A =  .. .. . . .. 
 
 . . . . 
an1 an2 . . . ann

Mn (R) : the set of all n square matrices on R.

The elements a11 ; a22 ; ...; ann are called the main diagonal (đường chéo chính) of A.
 
2 −3 1
Example. A =  0 4 1 
2 −2 −3
TRIANGULAR MATRICES

⋆ An upper triangular matrix (ma trận tam giác trên) is a square matrix in which
all entries below the main diagonal are zero.
 
−1 0 3  
−2 3
M = 0 4 2 ,N =
0 1
0 0 −5
TRIANGULAR MATRICES

⋆ An upper triangular matrix (ma trận tam giác trên) is a square matrix in which
all entries below the main diagonal are zero.
 
−1 0 3  
−2 3
M = 0 4 2 ,N =
0 1
0 0 −5
⋆ A lower triangular matrix (ma trận tam giác dưới) is a square matrix in which
all entries above the main diagonal are zero.
 
  2 0 0 0
2 0 0  3 1 0 0 
P =  1 0 0 ,Q =   −4

2 0 0 
3 1 0
0 −1 0 5
TRIANGULAR MATRICES

⋆ An upper triangular matrix (ma trận tam giác trên) is a square matrix in which
all entries below the main diagonal are zero.
 
−1 0 3  
−2 3
M = 0 4 2 ,N =
0 1
0 0 −5
⋆ A lower triangular matrix (ma trận tam giác dưới) is a square matrix in which
all entries above the main diagonal are zero.
 
  2 0 0 0
2 0 0  3 1 0 0 
P =  1 0 0 ,Q =   −4

2 0 0 
3 1 0
0 −1 0 5
⋆ Matrix A is called triangular if it is upper or lower triangular
TRIANGULAR MATRICES

⋆ An upper triangular matrix (ma trận tam giác trên) is a square matrix in which
all entries below the main diagonal are zero.
 
−1 0 3  
−2 3
M = 0 4 2 ,N =
0 1
0 0 −5
⋆ A lower triangular matrix (ma trận tam giác dưới) is a square matrix in which
all entries above the main diagonal are zero.
 
  2 0 0 0
2 0 0  3 1 0 0 
P =  1 0 0 ,Q =   −4

2 0 0 
3 1 0
0 −1 0 5
⋆ Matrix A is called triangular if it is upper or lower triangular
TRIANGULAR MATRICES

⋆ An upper triangular matrix (ma trận tam giác trên) is a square matrix in which
all entries below the main diagonal are zero.
 
−1 0 3  
−2 3
M = 0 4 2 ,N =
0 1
0 0 −5
⋆ A lower triangular matrix (ma trận tam giác dưới) is a square matrix in which
all entries above the main diagonal are zero.
 
  2 0 0 0
2 0 0  3 1 0 0 
P =  1 0 0 ,Q =   −4

2 0 0 
3 1 0
0 −1 0 5
⋆ Matrix A is called triangular if it is upper or lower triangular
DIAGONAL MATRIX

A diagonal matrix (ma trận đường chéo) is a square matrix with zero entries except
possibly on the main diagonal.
 
a11 0 . . . 0
 0 a22 . . . 0 
A =  .. .. . . .  = diag(a11 , a22 , . . . , ann )
 
 . . . .. 
0 0 . . . ann
DIAGONAL MATRIX

A diagonal matrix (ma trận đường chéo) is a square matrix with zero entries except
possibly on the main diagonal.
 
a11 0 . . . 0
 0 a22 . . . 0 
A =  .. .. . . .  = diag(a11 , a22 , . . . , ann )
 
 . . . .. 
0 0 . . . ann

Example.  
−1 0 0
A =  0 0 0  = diag(−1, 0, 5)
0 0 5
IDENTITY MATRIX

The square matrix  

1 0 ··· 0
 0 1 ··· 0 
In =  .... . . ..
 
.

 . . . 
0 0 ··· 1
is known as the identity matrix (ma trận đơn vị) of dimension n.
IDENTITY MATRIX

The square matrix  

1 0 ··· 0
 0 1 ··· 0 
In =  .... . . ..
 
.

 . . . 
0 0 ··· 1
is known as the identity matrix (ma trận đơn vị) of dimension n.

 
  1 0 0
1 0
Example. I2 = , I3 =  0 1 0  , . . .
0 1
0 0 1
EQUAL MATRIX
Two matrices A = (aij ) and B = (bij ).

A, B have the same size
A=B⇔
aij = bij , ∀i, j
EQUAL MATRIX
Two matrices A = (aij ) and B = (bij ).

A, B have the same size
A=B⇔
aij = bij , ∀i, j
     
a b 1 2 −1 1 0
Example. Given A = ,B = ,C = , discuss the
c d 3 0 1 −1 2
possibility that A = B, B = C, A = C.
EQUAL MATRIX
Two matrices A = (aij ) and B = (bij ).

A, B have the same size
A=B⇔
aij = bij , ∀i, j
     
a b 1 2 −1 1 0
Example. Given A = ,B = ,C = , discuss the
c d 3 0 1 −1 2
possibility that A = B, B = C, A = C.

Example. Find x, y, z, t to

   
1 x−1 y 1 0 −1
=
z −3 5 2 −3 1 − 2t
EQUAL MATRIX
Two matrices A = (aij ) and B = (bij ).

A, B have the same size
A=B⇔
aij = bij , ∀i, j
     
a b 1 2 −1 1 0
Example. Given A = ,B = ,C = , discuss the
c d 3 0 1 −1 2
possibility that A = B, B = C, A = C.

Example. Find x, y, z, t to

    
 x=1
1 x−1 y 1 0 −1 y = −1

= ⇔
z −3 5 2 −3 1 − 2t 
 z=2
t = −2

TRANSPOSE

⋆ If A = (aij ) is any m × n matrix, the transpose of A, written AT , is an n × m

matrix defined by AT = (aji ).
TRANSPOSE

⋆ If A = (aij ) is any m × n matrix, the transpose of A, written AT , is an n × m

matrix defined by AT = (aji ).

⋆ The row i of A is the column i of AT

TRANSPOSE

⋆ If A = (aij ) is any m × n matrix, the transpose of A, written AT , is an n × m

matrix defined by AT = (aji ).

⋆ The row i of A is the column i of AT

⋆ The column j of A is the row j of AT

TRANSPOSE

⋆ If A = (aij ) is any m × n matrix, the transpose of A, written AT , is an n × m

matrix defined by AT = (aji ).

⋆ The row i of A is the column i of AT

⋆ The column j of A is the row j of AT

Example.

  1 6 0
1 −1 4 5  −1 −8 4 
A =  6 −8 0 1  =⇒ AT =  
 4 0 −3 
0 4 −3 6
5 1 6
SYMMETRIC MATRIX - SKEW SYMMETRIC MATRIX

⋆ If AT = A, then A is a symmetric matrix (ma trận đối xứng).

SYMMETRIC MATRIX - SKEW SYMMETRIC MATRIX

⋆ If AT = A, then A is a symmetric matrix (ma trận đối xứng).

⋆ If AT = −A, then A is a skew symmetric matrix (ma trận phản đối xứng ).
SYMMETRIC MATRIX - SKEW SYMMETRIC MATRIX

⋆ If AT = A, then A is a symmetric matrix (ma trận đối xứng).

⋆ If AT = −A, then A is a skew symmetric matrix (ma trận phản đối xứng ).
SYMMETRIC MATRIX - SKEW SYMMETRIC MATRIX

⋆ If AT = A, then A is a symmetric matrix (ma trận đối xứng).

⋆ If AT = −A, then A is a skew symmetric matrix (ma trận phản đối xứng ).

Example.
 
1 2 −2
⋆ A= 2 4 5  is a symmetric matrix.
−2 5 6
 
0 −2 1
⋆ B= 2 0 −3  is a skew symmetric matrix.
−1 3 0
SCALAR MULTIPLICATION (PHÉP NHÂN VÔ HƯỚNG)

⋆ If A = [aij ], that is
kA = [kaij ]

⋆ kA = 0 → (either k = 0 or A = 0 )

⋆ (k = 0 or A = 0) → kA = 0

 
3 4 1
Example. Let A = . Then
0 1 −3
SCALAR MULTIPLICATION (PHÉP NHÂN VÔ HƯỚNG)

⋆ If A = [aij ], that is
kA = [kaij ]

⋆ kA = 0 → (either k = 0 or A = 0 )

⋆ (k = 0 or A = 0) → kA = 0

 
3 4 1
Example. Let A = . Then
0 1 −3
 
6 8 2
⋆ 2A = .
0 2 −6
SCALAR MULTIPLICATION (PHÉP NHÂN VÔ HƯỚNG)

⋆ If A = [aij ], that is
kA = [kaij ]

⋆ kA = 0 → (either k = 0 or A = 0 )

⋆ (k = 0 or A = 0) → kA = 0

 
3 4 1
Example. Let A = . Then
0 1 −3
   
6 8 2 −3 −4 −1
⋆ 2A = . ⋆ −A = .
0 2 −6 0 −1 3
MATRIX ADDITION OF SAME SIZE MATRICES

If A = (aij ) and B = (bij ), this take the form

A ± B = (aij ± bij )m×n

Example.
   
−1 0 2 2 0 2
⋆ +
2 3 −4 5 −3 1
MATRIX ADDITION OF SAME SIZE MATRICES

If A = (aij ) and B = (bij ), this take the form

A ± B = (aij ± bij )m×n

Example.
     
−1 0 2 2 0 2 1 0 4
⋆ + =
2 3 −4 5 −3 1 7 0 −3
MATRIX ADDITION OF SAME SIZE MATRICES

If A = (aij ) and B = (bij ), this take the form

A ± B = (aij ± bij )m×n

Example.
     
−1 0 2 2 0 2 1 0 4
⋆ + =
2 3 −4 5 −3 1 7 0 −3
   
−1 0 2 2 0 2
⋆ −
2 3 −4 5 −3 1
MATRIX ADDITION OF SAME SIZE MATRICES

If A = (aij ) and B = (bij ), this take the form

A ± B = (aij ± bij )m×n

Example.
     
−1 0 2 2 0 2 1 0 4
⋆ + =
2 3 −4 5 −3 1 7 0 −3
     
−1 0 2 2 0 2 −3 0 0
⋆ − =
2 3 −4 5 −3 1 −3 6 −5
Example.
 
1 −2  T
9 2 −1
5 4 0 −2
−8 8 4
−2 4
Example.
   
1 −2  T 5 −10
9 2 −1
5 4 0 −2 =  20 0 
−8 8 4
−2 4 −10 20
Example.
     
1 −2  T 5 −10 18 −16
9 2 −1
5 4 0 −2 =  20 0  − 4 16 
−8 8 4
−2 4 −10 20 −2 8
Example.
     
1 −2  T 5 −10 18 −16
9 2 −1
5 4 0 −2 =  20 0  − 4 16 
−8 8 4
−2 4 −10 20 −2 8
 
−13 6
=  16 −16 
−8 12
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

4. For each A there is an n × m matrix, −A, such that A + (−A) = 0

PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

4. For each A there is an n × m matrix, −A, such that A + (−A) = 0

5. k(A + B) = kA + kB.
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

4. For each A there is an n × m matrix, −A, such that A + (−A) = 0

5. k(A + B) = kA + kB.

6. (k + p)A = kA + pA.
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

4. For each A there is an n × m matrix, −A, such that A + (−A) = 0

5. k(A + B) = kA + kB.

6. (k + p)A = kA + pA.

7. (kp)A = k(pA).
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then
1. A + B = B + A (commutative law: giao hoán)

2. A + (B + C) = (A + B) + C (associative law: kết hợp)

3. There is an n × m matrix 0 , such that 0 + A = A for each A.

4. For each A there is an n × m matrix, −A, such that A + (−A) = 0

5. k(A + B) = kA + kB.

6. (k + p)A = kA + pA.

7. (kp)A = k(pA).

8. 1A = A.
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then

T
9. AT = A
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then

T
9. AT = A

10. (A + B)T = AT + B T
PROPERTIES
Let A, B and C denote arbitrary n × m matrices where n and m are fixed. Let k and p
denote arbitrary real numbers. Then

T
9. AT = A

10. (A + B)T = AT + B T

11. (kA)T = kAT

Exercise. Find A such that:
  T  
T 1 2 1 −1
2A + =
3 4 2 3
DOT PRODUCT (TÍCH VÔ HƯỚNG)

Example.  

3
1 2 3 ·  2  = 1 × 3 + 2 × 2 + 3 × 1 = 10
1
MATRIX MULTIPLICATION

Suppose A = [aij ] is an m × k matrix and B = [bij ] is an k × n matrix, then the

product AB = [cij ] is an m × n matrix whose the (i, j)-entry is the dot product of row
i of A and column j of B
MATRIX MULTIPLICATION

Suppose A = [aij ] is an m × k matrix and B = [bij ] is an k × n matrix, then the

product AB = [cij ] is an m × n matrix whose the (i, j)-entry is the dot product of row
i of A and column j of B

cij = (row i of A).(column j of B) = ai1 b1j + ai2 b2j + · · · aik bkj

MATRIX MULTIPLICATION

Suppose A = [aij ] is an m × k matrix and B = [bij ] is an k × n matrix, then the

product AB = [cij ] is an m × n matrix whose the (i, j)-entry is the dot product of row
i of A and column j of B

cij = (row i of A).(column j of B) = ai1 b1j + ai2 b2j + · · · aik bkj

  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 c11 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 c11 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3

c11
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 c11 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3

 

1
c11 = 2 −1 4  3 
2
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 c11 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3

 

1
c11 = 2 −1 4  3  = 2 × 1 + (−1) × 3 + 4 × 2 = 7
2
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1 . Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 c711 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3

 

1
c11 = 2 −1 4  3  = 2 × 1 + (−1) × 3 + 4 × 2 = 7
2
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 7 c12 c13
AB = 0 1  =
4 1 0 c21 c22 c23
2 4 3

c12
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3

 
 1 −2
 2  
2 −1 4  7 c12 c13
AB = 3 0 1  =
4 1 0 c21 c22 c23
2 4 3
 

−2
c12 = 2 −1 4  0 
4
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3

 
 1 −2 2
  
2 −1 4  7 c12 c13
AB = 3 0 1  =
4 1 0 c21 c22 c23
2 4 3
 

−2
c12 = 2 −1 4  0  = 2 × (−2) + (−1) × 0 + 4 × 4 = 12
4
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3

 
 1 −2 2
  
2 −1 4  7 12c12 c13
AB = 3 0 1  =
4 1 0 c21 c22 c23
2 4 3
 

−2
c12 = 2 −1 4  0  = 2 × (−2) + (−1) × 0 + 4 × 4 = 12
4
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3

 
  1 −2 2  
2 −1 4  3 7 12 15
AB = 0 1  =
4 1 0 7 −8 c23
2 4 3

c23
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3


 1 −2 2
  
2 −1 4  7 12 15
AB = 3 0 1  =
4 1 0 7 −8 c23
2 4 3
 

2
c23 = 4 1 0  1  = 4 × 2 + 1 × 1 + 0 × 3 = 9
3
  
  1 −2 2
2 −1 4
Example. Give A = ;B =  3 0 1  Find AB và BA?
4 1 0
2 4 3


 1 −2 2
  
2 −1 4  7 12 15
AB = 3 0 1  =
4 1 0 7 −8 c923
2 4 3
 

2
c23 = 4 1 0  1  = 4 × 2 + 1 × 1 + 0 × 3 = 9
3
    
2 3 5 8 9
Exercise. Compute AB if A =  1 4 7  and B =  7 2 .
0 1 8 6 1
    
2 3 5 8 9
Exercise. Compute AB if A =  1 4 7  and B =  7 2 .
0 1 8 6 1

Solution.
    
2 3 5 8 9 2·8+3·7+5·6 2·9+3·2+5·1
C = AB =  1 4 7   7 2  =  1 · 8 + 4 · 7 + 7 · 6 1 · 9 + 4 · 2 + 7 · 1 
0 1 8 6 1 0·8+1·7+8·6 0·9+1·2+8·1
 
67 29
=  78 24 
55 10

Does BA exist?
THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general
THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general

3. A(BC) = (AB)C.
THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general

3. A(BC) = (AB)C.

4. A(B + C) = AB + AC
THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general

3. A(BC) = (AB)C.

4. A(B + C) = AB + AC

5. (B + C)A = BA + CA
THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general

3. A(BC) = (AB)C.

4. A(B + C) = AB + AC

5. (B + C)A = BA + CA

6. a(AB) = (aA)B = A(aB).

THEOREM

Assume that a is any scalar, and that A, B, and C are matrices of sizes such that the
indicated matrix products are defined. Then:

1. IA = A and AI = A where I denotes an identity matrix.

2. AB ̸= BA, in general

3. A(BC) = (AB)C.

4. A(B + C) = AB + AC

5. (B + C)A = BA + CA

6. a(AB) = (aA)B = A(aB).

7. (AB)T = B T AT .
kth POWER OF A

For a square matrix A and positive integer k, the k th power of A is defined by

multiplying this matrix by itself repeatedly; that is

Ak = AA · · · A}
| {z
k times

where there are k copies of the matrix A.

kth POWER OF A

For a square matrix A and positive integer k, the k th power of A is defined by

multiplying this matrix by itself repeatedly; that is

Ak = AA · · · A}
| {z
k times

where there are k copies of the matrix A.

 
1 3
Example. For A = . Calculate A2 and A3
0 1
kth POWER OF A

For a square matrix A and positive integer k, the k th power of A is defined by

multiplying this matrix by itself repeatedly; that is

Ak = AA · · · A}
| {z
k times

where there are k copies of the matrix A.

 
1 3
Example. For A = . Calculate A2 and A3
0 1

Solution.     
2 1 3 1 3 1 6
A = AA = =
0 1 0 1 0 1
    
3 2 1 6 1 3 1 9
A =A A= =
0 1 0 1 0 1
ROW-ECHELON MATRIX

A row-echelon matrix has 3 properties


0 1 ∗ ∗ ∗ ∗ ∗

⋆ All the zero rows are at the bottom
 0 0 0 1 ∗ ∗ ∗ 
 
⋆ The first nonzero entry from the left in each
 
 0 0 0 0 1 ∗ ∗ 
nonzero row is a 1, called the leading 1 for that
 
 0 0 0 0 0 0 1 
 
row
0 0 0 0 0 0 0
⋆ Each leading 1 is to the right of all leading 1’s
in the rows above it
ROW-ECHELON MATRIX
The row-echelon matrix has the “staircase” form
ROW-ECHELON MATRIX
A REDUCED ROW-ECHELON MATRIX

A reduced row-echelon matrix (ma trận bậc thang theo dòng thu gọn) has the
properties
⋆ It is a row-echelon matrix
⋆ Each leading 1 is the only nonzero entry in its column
REDUCED ROW- ECHELON MATRIX
Example. Find x, y so that the matrix
 
1 x y
0 x 1

a) is row-echelon matrix

b) is reduced row-echelon matrix

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

⋆ (Row Swap) Exchange any two rows: di ↔ dj

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

⋆ (Row Swap) Exchange any two rows: di ↔ dj

⋆ (Scalar Multiplication) Multiply any row by a constant: di := αdi , α ̸= 0

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

⋆ (Row Swap) Exchange any two rows: di ↔ dj

⋆ (Scalar Multiplication) Multiply any row by a constant: di := αdi , α ̸= 0

⋆ (Row Sum) Add a multiple of one row to another row: di := di + βdj , β ̸= 0

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

⋆ (Row Swap) Exchange any two rows: di ↔ dj

⋆ (Scalar Multiplication) Multiply any row by a constant: di := αdi , α ̸= 0

⋆ (Row Sum) Add a multiple of one row to another row: di := di + βdj , β ̸= 0

ELEMENTARY ROW OPERATIONS

The three elementary row operations are:

⋆ (Row Swap) Exchange any two rows: di ↔ dj

⋆ (Scalar Multiplication) Multiply any row by a constant: di := αdi , α ̸= 0

⋆ (Row Sum) Add a multiple of one row to another row: di := di + βdj , β ̸= 0

Example. Use elementary row operations to transform A to B.

   
2 1 −1 1 −2 3
A =  1 −2 3 ;B =  0 1 −7/5  .
3 −1 2 0 0 0
GAUSSIAN ALGORITHM

Theorem. Every matrix can be brought to (reduced) row-echelon form by a series of

elementary row operations

⋆ Step 1. If all row are zeros, stop

GAUSSIAN ALGORITHM

Theorem. Every matrix can be brought to (reduced) row-echelon form by a series of

elementary row operations

⋆ Step 1. If all row are zeros, stop

⋆ Step 2. Otherwise, find the first column from the left containing a nonzero
entry (call it a) and move the row containing a to the top position
GAUSSIAN ALGORITHM

Theorem. Every matrix can be brought to (reduced) row-echelon form by a series of

elementary row operations

⋆ Step 1. If all row are zeros, stop

⋆ Step 2. Otherwise, find the first column from the left containing a nonzero
entry (call it a) and move the row containing a to the top position

⋆ Step 3. Multiply that row by 1/a to creat the leading 1

GAUSSIAN ALGORITHM

Theorem. Every matrix can be brought to (reduced) row-echelon form by a series of

elementary row operations

⋆ Step 1. If all row are zeros, stop

⋆ Step 2. Otherwise, find the first column from the left containing a nonzero
entry (call it a) and move the row containing a to the top position

⋆ Step 3. Multiply that row by 1/a to creat the leading 1

⋆ Step 4. By subtracting multiples of that row from the rows below it, make each
entry below the leading 1 zero
GAUSSIAN ALGORITHM

Theorem. Every matrix can be brought to (reduced) row-echelon form by a series of

elementary row operations

⋆ Step 1. If all row are zeros, stop

⋆ Step 2. Otherwise, find the first column from the left containing a nonzero
entry (call it a) and move the row containing a to the top position

⋆ Step 3. Multiply that row by 1/a to creat the leading 1

⋆ Step 4. By subtracting multiples of that row from the rows below it, make each
entry below the leading 1 zero

⋆ Step 5. Repeat step 1-4 on the matrix consisting of the remaining rows
Example. Carry the matrix
 
2 6 −2 2
A =  −2 −3 11 4 
3 11 3 0

⋆ to row-echelon matrix
⋆ to reduced row-echelon matrix
Solution.
 
2 6 −2 2
 −2 −3 11 4 
3 11 3 0
Solution.
   
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1
 −2 −3 11 4  −− −−→  −2 −3 11 4 
3 11 3 0 3 11 3 0
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
 
r2 → 13 r2
1 3 −1 1
−−−−→ 0 1  3 2 
0 2 6 −3
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
   
r2 → 13 r2
1 3 −1 1 1 3 −1 1
r3 →r3 −2r2
−−−−→ 0 1  3 2  −−−−−−→  0 1 3 2 
0 2 6 −3 0 0 0 −7
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
   
r2 → 13 r2
1 3 −1 1 1 3 −1 1
r3 →r3 −2r2
−−−−→  0 1 3 2  −− −−−−→  0 1 3 2 
0 2 6 −3 0 0 0 −7
 
r3 →− 17 r3
1 3 −1 1
−−−−−→ 0 1  3 2  row-echelon matrix
0 0 0 1
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
   
r2 → 13 r2
1 3 −1 1 1 3 −1 1
r3 →r3 −2r2
−−−−→  0 1 3 2  −− −−−−→  0 1 3 2 
0 2 6 −3 0 0 0 −7
 
r3 →− 17 r3
1 3 −1 1
−−−−−→ 0 1  3 2  row-echelon matrix
0 0 0 1
 
1 3 −1 1
 0 1 3 2 
0 0 0 1
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
   
r2 → 13 r2
1 3 −1 1 1 3 −1 1
r3 →r3 −2r2
−−−−→  0 1 3 2  −− −−−−→  0 1 3 2 
0 2 6 −3 0 0 0 −7
 
r3 →− 17 r3
1 3 −1 1
−−−−−→ 0 1  3 2  row-echelon matrix
0 0 0 1
   
1 3 −1 1 r1 →r1 −r3 1 3 −1 0
r →r2 −2r3
 0 1 3 2  −−2−−− −−→  0 1 3 0 
0 0 0 1 0 0 0 1
Solution.
     
2 6 −2 2 1
r1 → 2 r1
1 3 −1 1 r2 →r2 +2r1 1 3 −1 1
r →r3 −3r1
 −2 −3 11 4  −− −−→  −2 −3 11 4  −−3−−− −−→  0 3 9 6 
3 11 3 0 3 11 3 0 0 2 6 −3
   
r2 → 13 r2
1 3 −1 1 1 3 −1 1
r3 →r3 −2r2
−−−−→  0 1 3 2  −− −−−−→  0 1 3 2 
0 2 6 −3 0 0 0 −7
 
r3 →− 17 r3
1 3 −1 1
−−−−−→ 0 1  3 2  row-echelon matrix
0 0 0 1
     
1 3 −1 1 r1 →r1 −r3 1 3 −1 0 1 0 −10 0
r →r2 −2r3 r1 →r1 −3r2
 0 1 3 2  −−2−−− −−→  0 1 3 0  −− −−−−→  0 1 3 0 
0 0 0 1 0 0 0 1 0 0 0 1
reduced row-echelon matrix
RANK OF THE MATRIX

⋆ The reduced row-echelon form of a matrix A is uniquely determined by A,

but the row-echelon form of A is not unique

⋆ The number r of leading 1’s is the same in each of the different row-echelon
matrices

⋆ As r depends only on A and not on the row-echelon forms, it is called the rank of
the matrix A, and written rank(A) = r
Example. If the a matrix A has the row-echelon matrix is

then rank(A) = 4
Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8
Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8

Solution. The reduction of A to row - echelon form is

Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8

Solution. The reduction of A to row - echelon form is

 
1 1 −1 4
A=  2 1 3 0 
0 1 −5 8
Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8

Solution. The reduction of A to row - echelon form is

   
1 1 −1 4 1 1 −1 4
A=  2 1 3 0  → 0 −1 5 −8 
0 1 −5 8 0 1 −5 8
Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8

Solution. The reduction of A to row - echelon form is

     
1 1 −1 4 1 1 −1 4 1 1 −1 4
A=  2 1 3 0  → 0 −1 5 −8  →  0 1 −5 8 
0 1 −5 8 0 1 −5 8 0 0 0 0
Example. Compute the rank of
 
1 1 −1 4
A= 2 1 3 0 
0 1 −5 8

Solution. The reduction of A to row - echelon form is

     
1 1 −1 4 1 1 −1 4 1 1 −1 4
A=  2 1 3 0  → 0 −1 5 −8  →  0 1 −5 8 
0 1 −5 8 0 1 −5 8 0 0 0 0

Because this row - echelon matrix has two leading 1 ’s, rank(A) = 2.
Exercise. Determine the rank of matrix
 
  1 2 3 4
1 2 −1  2 4 6 9 
B= 2 4 −3  C=  3 6

9 11 
3 −1 0
4 8 14 10
  1 2 3
1 2 0 1  4 5 6 
D= 2 5 1 3  E=  7

8 9 
5 12 2 7
10 11 12
INVERTIBLE MATRIX

If A is a square matrix, a matrix B is called an inverse (nghich đảo) of A if and only if

AB = I and BA = I

A matrix A that has an inverse is called an invertible matrix (ma trận khả nghịch).
INVERTIBLE MATRIX

If A is a square matrix, a matrix B is called an inverse (nghich đảo) of A if and only if

AB = I and BA = I

A matrix A that has an inverse is called an invertible matrix (ma trận khả nghịch).
The inverse of A is denoted by A−1 .

AA−1 = A−1 A = In
INVERTIBLE MATRIX

If A is a square matrix, a matrix B is called an inverse (nghich đảo) of A if and only if

AB = I and BA = I

A matrix A that has an inverse is called an invertible matrix (ma trận khả nghịch).
The inverse of A is denoted by A−1 .

AA−1 = A−1 A = In
    
−1 1 0 1
Example. Show that B = is an inverse of A = .
1 0 1 1
    
−1 1 0 1
Example. Show that B = is an inverse of A = .
1 0 1 1

Solution. Compute AB and BA

         
0 1 −1 1 1 0 −1 1 0 1 1 0
AB = = BA = =
1 1 1 0 0 1 1 0 1 1 0 1

Hence AB = I = BA, so B is indeed an inverse of A.

THE INVERSE OF AN 2 × 2 MATRIX

Consider the matrix  

a b
A=
c d
The determinant of A is det(A) = ad − bc
 
d −b
The adjugate matrix (ma trận liên hợp) of A is defined by adj A =
−c a
 
−1 1 1 d −b
A = adj A =
det(A) det(A) −c a
THE INVERSE OF AN 2 × 2 MATRIX

Consider the matrix  

a b
A=
c d
The determinant of A is det(A) = ad − bc
 
d −b
The adjugate matrix (ma trận liên hợp) of A is defined by adj A =
−c a
 
−1 1 1 d −b
A = adj A =
det(A) det(A) −c a

     
3 2 1 −1 −2 1 2
Example. A = =⇒ A−1 = =
−1 −1 −1 1 3 −1 −3
Exercise. Find the inverse of the following matrices
   
4 3 −2 1
a) A = b) B =
6 5 7 5
   
1 2 a 2
c) C = d) D =
4 8 1 a
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.

3. If A and B are invertible, so is AB, and (AB)−1 = B −1 A−1 .

THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.

3. If A and B are invertible, so is AB, and (AB)−1 = B −1 A−1 .

4. If A1 , A2 , . . . , Ak are all invertible, so is their product A1 A2 . . . Ak , and

(A1 A2 . . . Ak )−1 = A−1 −1 −1
k . . . A2 A1 .
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.

3. If A and B are invertible, so is AB, and (AB)−1 = B −1 A−1 .

4. If A1 , A2 , . . . , Ak are all invertible, so is their product A1 A2 . . . Ak , and

(A1 A2 . . . Ak )−1 = A−1 −1 −1
k . . . A2 A1 .

−1 k
5. If A is invertible, so is Ak for any k ≥ 1, and Ak = (A−1 ) .
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.

3. If A and B are invertible, so is AB, and (AB)−1 = B −1 A−1 .

4. If A1 , A2 , . . . , Ak are all invertible, so is their product A1 A2 . . . Ak , and

(A1 A2 . . . Ak )−1 = A−1 −1 −1
k . . . A2 A1 .

−1 k
5. If A is invertible, so is Ak for any k ≥ 1, and Ak = (A−1 ) .

1 −1
6. If A is invertible and k ̸= 0 is a number, then aA is invertible and (kA)−1 = A .
k
THEOREM
All the following matrices are square matrices of the same size.

1. I is invertible and I −1 = I.
−1
2. If A is invertible, so A−1 , and (A−1 ) = A.

3. If A and B are invertible, so is AB, and (AB)−1 = B −1 A−1 .

4. If A1 , A2 , . . . , Ak are all invertible, so is their product A1 A2 . . . Ak , and

(A1 A2 . . . Ak )−1 = A−1 −1 −1
k . . . A2 A1 .

−1 k
5. If A is invertible, so is Ak for any k ≥ 1, and Ak = (A−1 ) .

1 −1
6. If A is invertible and k ̸= 0 is a number, then aA is invertible and (kA)−1 = A .
k

−1 T
7. If A is invertible, so is its transpose AT , and AT = (A−1 ) .
FIND AN INVERSE MATRIX BY USING ELEMENTARY ROW
OPERATIONS

φ1 φp
(A | In ) −→ (A1 | B1 ) → . . . −→ In | A−1

Example. Find the inverse of the following matrix

 
1 −1 0
A= 1 0 −1 
−6 2 3
  
1 −1 0 1 0 0
(A | I3 ) =  1 0 −1 0 1 0 
−6 2 3 0 0 1
    
1 −1 0 1 0 0 1 −1 0 1 0 0
r2 →r2 −r1
(A | I3 ) =  1 0 −1 0 1 0  −− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +6r1
−6 2 3 0 0 1 0 −4 3 6 0 1
    
1 −1 0 1 0 0 1 −1 0 1 0 0
r2 →r2 −r1
(A | I3 ) =  1 0 −1 0 1 0  −− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +6r1
−6 2 3 0 0 1  0 −4 3 6 0 1
1 0 −1 0 1 0
r1 →r1 +r2
−− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +4r2
0 0 −1 2 4 1
    
1 −1 0 1 0 0 1 −1 0 1 0 0
r2 →r2 −r1
(A | I3 ) =  1 0 −1 0 1 0  −− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +6r1
−6 2 3 0 0 1  0 −4 3 6 0 1
1 0 −1 0 1 0
r1 →r1 +r2
−− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +4r2
 0 0 −1 2 4 1 
1 0 −1 0 1 0
r3 →−r3
−− −−→  0 1 −1 −1 1 0 
0 0 1 −2 −4 −1
    
1 −1 0 1 0 0 1 −1 0 1 0 0
r2 →r2 −r1
(A | I3 ) =  1 0 −1 0 1 0  −− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +6r1
−6 2 3 0 0 1  0 −4 3 6 0 1
1 0 −1 0 1 0
r1 →r1 +r2
−− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +4r2
 0 0 −1 2 4 1 
1 0 −1 0 1 0
r3 →−r3
−− −−→  0 1 −1 −1 1 0 
 0 0 1 −2 −4 −1
1 0 0 −2 −3 −1
r1 →r1 +r3
−− −−−−→  0 1 0 −3 −3 −1 
r2 →r2 +r3
0 0 1 −2 −4 −1
    
1 −1 0 1 0 0 1 −1 0 1 0 0
r2 →r2 −r1
(A | I3 ) =  1 0 −1 0 1 0  −− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +6r1
−6 2 3 0 0 1  0 −4 3 6 0 1
1 0 −1 0 1 0
r1 →r1 +r2
−− −−−−→  0 1 −1 −1 1 0 
r3 →r3 +4r2
 0 0 −1 2 4 1 
1 0 −1 0 1 0
r3 →−r3
−− −−→  0 1 −1 −1 1 0 
 0 0 1 −2 −4 −1
1 0 0 −2 −3 −1
r1 →r1 +r3
−− −−−−→  0 1 0 −3 −3 −1 
r2 →r2 +r3
0 0 1 −2 −4 −1
 
−2 −3 −1
A−1 =  −3 −3 −1 
−2 −4 −1
MATRIX EQUATIONS

Let A, A′ ∈ Mn (R) be invertible and B ∈ Mn×p (R), C ∈ Mm×n (R), D ∈ Mn (R). Then

1. AX = B ⇐⇒ X = A−1 B
MATRIX EQUATIONS

Let A, A′ ∈ Mn (R) be invertible and B ∈ Mn×p (R), C ∈ Mm×n (R), D ∈ Mn (R). Then

1. AX = B ⇐⇒ X = A−1 B

2. XA = C ⇐⇒ X = CA−1
MATRIX EQUATIONS

Let A, A′ ∈ Mn (R) be invertible and B ∈ Mn×p (R), C ∈ Mm×n (R), D ∈ Mn (R). Then

1. AX = B ⇐⇒ X = A−1 B

2. XA = C ⇐⇒ X = CA−1

3. AXA′ = D ⇐⇒ X = A−1 DA′−1

Example.
   
3 1 −2 3
1. Solve the equation X=
5 2 2 5
Example.
   
3 1 −2 3
1. Solve the equation X=
5 2 2 5
   
3 1 −2 3
2. Solve the equation X =
5 2 2 5
Example.
   
3 1 −2 3
1. Solve the equation X=
5 2 2 5
   
3 1 −2 3
2. Solve the equation X =
5 2 2 5
   
1 1 1   1 −2
3 2
3. Solve the equation  1 2 2 X = 3 1 
3 3
1 2 3 2 −1
LINEAR TRANSFORMATION

A transformation T : Rn → Rm is called a linear transformation (biến đổi tuyến

tính) if it satisfies the following two conditions for all vectors x and y in Rn and all
scalars a:
LINEAR TRANSFORMATION

A transformation T : Rn → Rm is called a linear transformation (biến đổi tuyến

tính) if it satisfies the following two conditions for all vectors x and y in Rn and all
scalars a:

1. T (x + y) = T (x) + T (y)
LINEAR TRANSFORMATION

A transformation T : Rn → Rm is called a linear transformation (biến đổi tuyến

tính) if it satisfies the following two conditions for all vectors x and y in Rn and all
scalars a:

1. T (x + y) = T (x) + T (y)

2. T (ax) = aT (x)
LINEAR TRANSFORMATION

A transformation T : Rn → Rm is called a linear transformation (biến đổi tuyến

tính) if it satisfies the following two conditions for all vectors x and y in Rn and all
scalars a:

1. T (x + y) = T (x) + T (y)

2. T (ax) = aT (x)
LINEAR TRANSFORMATION

A transformation T : Rn → Rm is called a linear transformation (biến đổi tuyến

tính) if it satisfies the following two conditions for all vectors x and y in Rn and all
scalars a:

1. T (x + y) = T (x) + T (y)

2. T (ax) = aT (x)

Theorem. If T : Rn → Rm is a linear transformation, then for each k = 1, 2, . . .

T (a1 x1 + a2 x2 + · · · + ak xk ) = a1 T (x1 ) + a2 T (x2 ) + . . . + ak T (xk )

for all scalars ai and all vectors xi in Rn .

    
1 2
Example. If T : R2 → R2 is a linear transformation, T = and
      1 −3
1 5 4
T = , find T .
−2 1 3
    
1 2
Example. If T : R2 → R2 is a linear transformation, T = and
      1 −3
1 5 4
T = , find T .
−2 1 3
     
4 1 1
Solution. Write z = ,x = , and y = .
3 1 −2
    
1 2
Example. If T : R2 → R2 is a linear transformation, T = and
      1 −3
1 5 4
T = , find T .
−2 1 3
     
4 1 1
Solution. Write z = ,x = , and y = .
3 1 −2

⋆ We want to find numbers a and b such that z = ax + by.

    
1 2
Example. If T : R2 → R2 is a linear transformation, T = and
      1 −3
1 5 4
T = , find T .
−2 1 3
     
4 1 1
Solution. Write z = ,x = , and y = .
3 1 −2

⋆ We want to find numbers a and b such that z = ax + by.

11 1 11 1
⋆ The solution is, a = and b = , so z = x + y.
3 3 3 3
    
1 2
Example. If T : R2 → R2 is a linear transformation, T = and
      1 −3
1 5 4
T = , find T .
−2 1 3
     
4 1 1
Solution. Write z = ,x = , and y = .
3 1 −2

⋆ We want to find numbers a and b such that z = ax + by.

11 1 11 1
⋆ The solution is, a = and b = , so z = x + y.
3 3 3 3
Thus
       
11 1 11 1 11 2 1 5 1 27
T (z) = T x+ y = T (x) + T (y) = + =
3 3 3 3 3 −3 3 1 3 −32
ROTATIONS

Let
Rθ : R2 −→ R2
denote the transformation that rotates any vector counterclockwise about the origin
through an angle of θ.
ROTATIONS

Let
Rθ : R2 −→ R2
denote the transformation that rotates any vector counterclockwise about the origin
through an angle of θ.

Theorem. The rotation Rθ : R2 −→ R2 is a linear transformation, and is induced by

the matrix
 
cos θ − sin θ
.
sin θ cos θ
Example. We denote by Rπ : R2 −→ R2 counterclockwise rotation about the origin
through an angle of π.
Example. We denote by Rπ : R2 −→ R2 counterclockwise rotation about the origin
through an angle of π. We see that
      
a −1 0 a −a
Rπ = =
b 0 −1 b −b

so Rπ is a matrix transformation
REFLECTION IN THE LINE

Let
Qm : R2 −→ R2
denote reflection in the line y = mx.
REFLECTION IN THE LINE

Let
Qm : R2 −→ R2
denote reflection in the line y = mx.

Theorem. The transformation Qm : R2 −→ R2 , reflection in the line y = mx, is a

linear transformation and is induced by the matrix
 
1 1 − m2 2m
1 + m2 2m m2 − 1
Example. We denote by Qm : R2 −→ R2 reflection in the line y = x.
Example. We denote by Qm : R2 −→ R2 reflection in the line y = x. We see that
      
a 0 1 a b
Qm = =
b 1 0 b a

so Qm is a matrix transformation
PROJECTION ON THE LINE

Let
Pm : R2 −→ R2
denote projection on the line y = mx.
PROJECTION ON THE LINE

Let
Pm : R2 −→ R2
denote projection on the line y = mx.

Theorem. The transformation Pm : R2 −→ R2 , projection on the line y = mx, is a

linear transformation and is induced by the matrix
 
1 1 m
1 + m2 m m2
  
−5
Example. Let Pm : R2 −→ R2 be projection on the line x − 2y = 0. Find Pm .
6
  
−5
Example. Let Pm : R2 −→ R2 be projection on the line x − 2y = 0. Find Pm .
6

Solution. We have
      
−5 0.8 0.4 −5 −1.6
Pm = =
6 0.4 0.2 6 −0.8
Thank you for your attention.
      
1 4 −1 1 1 3 −4
Prob 1. Let A = ,B = and C = . Compute the
2 3 3 2 −1 2 1
matrix

a) 2A − B T b) AB c) BA d) AC
e) CC T . f) C T C g) A3 h) B 2 AT

Prob 2. Suppose that A and B are n × n matrices. Simplify the expression

a) (A + B)2 − (A − B)2
b) A(BC − CD) + A(C − B)D − AB(C − D)
   
3 1 2 0 5 2 1
Prob 3. Let A =  4 8 0  and B =  1 8 0 −6 . Compute AB
0 1 2 1 4 3 7
Prob 4. Find the inverse of each of the following matrices.
 
  1 −1 2
1 5
a) b)  −5 7 −11 
2 −1
−2 3 −5

 
1 −1 3
Prob 5. Given A−1 =  2 0 5 . Find a matrix X such that
−1 1 0
   
1 1 −1 2  
1 2 −1
a) AX =  −1  b) AX =  0 1 1  c) XA =
3 1 1
3 1 0 0
Prob 6. Find A when
   
−1 1 2 −1 2 1
a) (3A) = b) (I + 2A) =
0 −2 3 2
 
−1 T 1 4
c) (A − 2I) = −2
3 11

Prob 7. Find A−1 if

a) A2 − 6A + 5I = 0 b) A2 + 3A − I = 0 c) A4 = I

 101
−1 3
Prob 8. Compute
0 1
Prob 9. Solve for X
   
1 2 1 −1
a) X=
2 3 3 3
b) ABXC = B T
c) AX T BC = B where A, B and C are n × n invertible matrices.

Prob 10. Find the (2, 1)-entry of the product

 
 4  2 1
1 2 0 1 
 0 2 3 2 
2 5 1 
 5

1 0 
4 −1 2 3
0 4 3
Prob 11. Compute the rank of each of the following matrices.
   
1 1 2 1 1 −1 3
a)  3 −1 1  b)  −1 4 5 −2 
−1 3 4 1 6 3 4

Prob 12. Determine the values of m such that the rank of the matrix is 2.
   
1 −1 0 1 2 1 4
a) 2
 3 5  b)  2 1 1 5 
1 2 m −3 6 1 m

 
m 1 3
Prob 13. Find all values of m for which the matrix is invertible  1 3 2 
1 4 5
Prob 14. Let T : R2 → R2 be a linear transformation, and assume that T (1, 2) =
(−1, 1) and T (0, 3) = (−3, 3).

a) Compute T (11, −5) b) Compute T (1, 11) c) Find the matrix of T

Prob 15.Let T : R2 → R2 be a linear transformation such that the matrix of T is


1 2
. Find T (3, 2)
−1 3