MATRIX ALGEBRA Chapter 1

CHAPTER 1 (10 HOURS)

1.1 Definition of a matrix

1.2 Identity Matrix, Diagonal Matrix, Symmetric Matrix
1.3 Sums and Scalar Multiples
1.4 Matrix Multiplication
1.5 Properties of Matrix Multiplication
1.6 Transpose of a Matrix
Addition sections
2.5 Rank of matrix
2.6 Inverse matrix
1.1 DEFINITION OF A MATRIX
An mxn matrix is rectangular array of numbers

(m x n): size of the matrix

A = [aij] // aij is called (i, j)-entry
1.1 DEFINITION OF A MATRIX

Dimension = order = size

Number of rows followed by the number
of columns
Example. Matrix has 3 rows and 2
columns → 3x2 matrix (three by two
matrix)

Element = entry

Row by row
EXAMPLES
An 2x3 matrix // 2 rows, 3 columns
Read: two by three matrix
(1,3)-entry
7 -3 1/2 a[1,3] = 1/2
A= a13 = ½
3 -5 0 Read: a_one_three entry

Read: row by row

Seven minus three 1 half / three minus 5 zero
 DIAGONAL OF A SQUARE
MATRICE

The main diagonal of a matrix

consists of those elements that lie on
the diagonal that runs from top left to
bottom right.

If the matrix is A, then its main

diagonal are the elements who's row
number and column number are equal,
ajj.

The other diagonal of a matrix is not

important and does not have a name.
MATRIX CLASSIFICATION

1. By shape: rectangular; square; row; column

2. By value of entries: zero; identity; scalar
3. By characteristics: diagonal; triangular; symmetric
TYPES OF
MATRICES
 1.2 SUM AND SCALAR MULTIPLES
 Equality
 Addition
 Subtraction
 Scalar Multiplication (scalar multiples)
 EQUALITY

Ex. Consider 4 matrices:

A= ( )
1 2
3 4 ()1
; B=( 1 3 ) ; C= ; and D=
3 ( )
1 2
x 4
Discuss the possibility of equality between these matrices.
 QUICK CHECK
Given

discuss the possibility that A = B, B = C, A = C

ADDITION AND SUBTRACTION

Addition A + B = [aij + bij] The same size

matrices
Subtraction A – B = [aij – bij]

Example:
A)

B)
SCALAR MULTIPLICATION

2 A=2 ×
( 1 2
−3 5
=
)(
2 4
− 6 10 )
A=
1 2
(
−3 5 )
− A= (− 1 ) A=
( −1 −2
3 −5 )
B=
( 12 4 8
0 10 2 ) (
=2×
6 2 4
0 5 1 )
 PROPERTIES

Example. Simplify:
2 ( A+ 3C ) −3 ( 2 C − B ) − 3 [ 2 ( 2 A + B −4 C ) − 4 ( A − 2C ) ]

where A, B, and C are all matrices of the same size.

Ans: 2A-
3B
DATA REPRESENTATION

day 1
addition
subtraction

day 1 + day 2?

day 1 – day 2?

day 2 Scalar multiplication 2(day 1)?

1.4 MATRIX MULTIPLICATION

Am  n . Bn  p = Cm  p //suitable size

The entry cij = (row i of A).(column j of B)

 1 2 1.1+2.1
3 4 1 2 
  1 0  1 2   
 0  1    -1 -2 -1 0 
  2 0   1 2 1 0   -2 0 2 -4 
   
APPLICATION

2 gift sets: A&B.

4 stores

different prices

Find the best choice?
peanuts soda hot dogs
set A 8 5 12 
Matrix
set B 15 7 13

selling price store 1 store 2 store 3 store 4

peanuts 2 2.5 2 2.5
soda 2.5 2 2.75 2

Matrix

hot dogs 3 3 2.5 3

 A SIMPLE APPLICATION

set A
peanuts
8
soda
5
hot dogs
12
A=
[
8 5 12
15 7 13 ]
set B 15 7 13
row ×col=set ×item

selling price store 1 store 2 store 3 store 4

peanuts 2 2.5 2 2.5
soda 2.5 2 2.75 2
hot dogs 3 3 2.5 3

[ ]
2 2.5 2 2.5
B= 2.5 2 2.75 2
3 3 2.5 3
dimension :item× store
 APPLICATION
Price
Quantity

[ ]
2 2.5 2 2.5
[
A = 8 5 12
15 7 13 ] B= 2.5 2 2.75 2
3 3 2.5 3
row ×col=set ×item
dimension : item× store

Quantity × Price=A × B=
[ 64.5 ? ? ?
? ? ? ? ]
Dimension :? ×?

store 1 store 2 store 3 store 4

set A 64.5 66 59.75 66
set B 86.5 87.5 81.75 90.5
QUICK CHECK
 Perform the calculation:

[ ]()
6 3 1 x1
1 4 − 2 × x 2 =0
4 −1 5 x3
WHY NO DIVISION
 1.5 PROPERTIES OF MATRIX MULTIPLICATION
1. A, B, C are nxn matrices;
2. I is the identity matrix and 0 is the zero matrix.
SOME REMARKS
1. AB =AC B=C

2. AB = 0 A = 0 or B = 0
3. (AB)T = BTAT (see transpose)
Example:

A, B, C are
singular matrices
TERMS

In view of the general rule AB not equal BA, the terms premultiply
and postmultiply are often used to specify the order of
multiplication.
In the product A.B,
 the matrix B is said to be premultiplied by A,
 and A to be postmultiplied by B.
Or in brief left and right multiplied
 1.6 TRANSPOSE OF A MATRIX
The transpose of an mxn matrix [aij] is an nxm matrix [aji]
Notation: AT
Remember: row column
1.6 TRANSPOSE OF A MATRIX

A square matrix A symmetric matrix

A transposed
matrix

A diagonal matrix
2.5 RANK OF THE MATRIX


Row echelon matrix

Reduced row echelon matrix

Rank of a matrix
ROW ECHELON MATRIX
REDUCED ROW-ECHELON FORM
  zero rows

EXAMPLE R.E.F  leading nonzero

 right distributed

[ ] [ ] [ ]
1 22 3 1 −2 3 5 0 0 0 0
A= 0 0 1 B= 0 10 3 6 1 −2 3 5
C=
0 1 −3 0 0 1 −3 0 1 3 6
0 0 1 −3

[ ] [ ] [ ]
1 −2 3 5
10 − 2 3 5 1 −2 3 5
0 1 3 6
D= E= 0 3 3 6 F= 0 1 3 6
0 0 1 −3
0 0 6 −3 0 0 1 −3
0 0 0 0
 ELEMENTARY ROW OPERATIONS (ROW REDUCTION)

1. Interchange two rows

2. Multiply one row by a nonzero number
3. Add a multiple of one row to a different row

3 E.R.O
MATRIX A R.E.F
Every matrix can be brought to row-echelon form by a
sequence of elementary row operations.
EXAMPLE

[ ]
0 2 3
Let the matrix A given as A= 2 − 3 5
−1 2 0

Complete the diagram below

r 2 → r 2 +2 r 1 r 3 → r 3 −2 r 2
r 3 ← →r 1
A1 A2 A3
A
ROW REDUCTION ALGORITHM
PIVOT
EXAMPLE
 2 6  2 2
Carry the matrix   2  3 11 4 
 
 3 11 3 0 
A) to row-echelon matrix
B) to reduced row-echelon matrix
 EXAMPLE
 2 6  2 2  r  1 r  1 3  1 1  rr  rr 32rr  1 3  1 1 
1 1
2 2 1

  2  3 11 4  2   2  3 11 4    0 3 9 6 3 3 1

     
 3 11 3 0   3 11 3 0   0 2 6  3

 1 3  1 1  r   2 r r
1
r2  r2 1 3  1 1  r   1r
3 3
1 3  1 1
 0 1 3 2    0 1 3 2  7  0 1 3 2
3 3 2 3

     
 0 2 6  3  0 0 0  7   0 0 0 1 
row-echelon
matrix
But not
reduced yet
 EXAMPLE

 1 3  1 1  rr  rr r2 r
2 2 3  1 3  1 0  r   3r r  1 0  10 0 
 0 1 3 2  1 1 3
 0 1 3 0   0 1 3 0
1 2 1

     
 0 0 0 1   0 0 0 1   0 0 0 1 

reduced row-echelon ma
 THE RANK OF A MATRIX

The rank of the matrix A, rank(A), is the number of leading ones

in the reduced row-echelon form of A.

 1 0 * 0
 0 1 * 0 rank(A)=2 r(A)=2
 
 0 0 0 0 
The rank of matrix A is the number of leading 1s in any row-
echelon matrix to which A can be carried by row operations.

The rank of matrix A is the number of non-zero rows in any

row-echelon matrix to which A can be carried by row
operations.
EXAMPLE
EXAMPLE
Determine the rank of the matrix
EXAMPLE
Determine all value(s) m such that r(A)=3 where

Conclusion ???
PROPERTIES
2.6 THE INVERSE OF A MATRIX
 REMARK
 Not all square matrices are invertible.
 There are many nonzero matrices that are not invertible
 An invertible matrix is said to be nonsingular.
 A square matrix with no inverse is called a singular
matrix.
EXAMPLE
THE INVERSE OF 2X2 MATRICES

determinant of A, denoted by
det(A)
PROPERTIES
(Cancellation Laws) Let A be an invertible matrix.

If A and B are invertible n ×n matrices

THEOREM 2.4.4
EXAMPLE
EXISTENCE OF INVERSE MATRIX
For an nxn matrix A, the following statements below are
equivalent.
AN ALGORITHM FOR FINDING A –1
 EXAMPLE
Use the inversion algorithm to find the inverse of the matrix
EXAMPLE

[A | I n]  [I n |A-1]

A-1
EXAMPLE
USING CALCULATOR - 580FX
Follow this link:
https://support.casio.com/global/vi/fx/manual/fx-580VNX
_VI/using_calculation_modes/matrix_calculations/