THEORY SUMMARY

I. WHAT IS MATRIX
Generally, any rectangular array of numbers surrounded by a pair of brackets is called a
matrix (plural matrices), and the individual numbers constituting the array are called entries
or elements
Example

[ ]
1 7 0 3
B= [ ] [
1 2
3 4
C=
7 3 4
1 5 6 ]
D= 2 4 6 0
5 1 9 2

 A matrix is being made up of rows and columns. A matrix of order m× n has m rows
and n columns
Example A generally matrix B of order 3 ×2 would be written

[ ]
7 1
A= 3 5
4 6

 We denote matrices by capital letters in bold type (that is A, B, C,…) and their
elements by the corresponding lower-case letter in ordinary type (aij which occurs in
row i and column j)
Example Referring to the matrix A above, we see that
a12 = 1 (row 1 and column 2 of A)
a31 = 4 (row 3 and column 1 of A)

II. ADDITION AND SUBTRACTION

 To add (or subtract) two matrices of the same size, we simply add (or subtract) their
corresponding elements.
Example

[ ] [ ] []
A=
7 5
2 1
B=
−6 2
1 −9
C=
5
4

A+ B=¿ [ ] B – A=¿ [
−1 −10 ]
1 7 −13 −3
A+C is impossible
3 −8

Notes We can only add (or subtract) two matrices when they are the same order and
correlative.
ZERO MATRIX
 A zero matrix is written 0
  There are lots of zero matrices so we use the single symbol 0 for all
Example

[ ][ ]
0
0 0 0 0 0 0
[ ]
[ 0] 0 0 0
0 0 0
0 0 0 0 0 0
0 0 0 0 0 0
0

 The role played by the matrix 0 in matrix algebra is therefore similar to that of the
number 0 in ordinary arithmetic.
Example A – A=0
A+0= A

III. SCALAR MULTIPLICATION

 Follows from our definitions of matrix addition and scalar multiplication that
k ( A+ B )=kA+ kB
For any m× n matrices A and B, and scalar k
k ( lA )= ( kl ) A
For scalars k and l
Example

[ ] [ ]
1 −2 0 −1
A= 3 5 B= 2 7
0 4 1 6

[ ] [ ][ ]
2 −4 1 −3 2 −6
2 A= 6 10 2 ( A +B )=2 5 12 = 10 24
0 8 1 10 2 20

IV. MATRIX MULTIPLICATION

 To multiply matrices, we must have the number of columns in the first matrix
equal to the number of lines in the second matrix.
A B
m× s s ×n

Equal so can
multiply

answer is m× n
 Example

[ ] [ ]
5 2 1 2 3
A= [
2 3 4
1 0 0 ]
B= 6 0 C= 4 5 6
0 1 7 8 9

A × B=
[ 225 82 ] B ×C is impossible
 Multiplication in matrix is not always commutative
Example
A=
[
1 −1
2 1
B=
] [ ]
1 3
1 2

A × B=[ ] B × A=[
5 1]
0 1 7 2
3 8

 So AB≠ BA
V. MATRIX INVERSION
IDENTITY MATRIX
 The n × n identity matrix is the n × n matrix in which the elements in the main
diagonal equal to 1 while the other elements equal to 0
Example

[ ]
1 0 0
I 2=
1 0
0 1[ ] I 3= 0 1 0
0 0 1
 For an n × n matrix A , the inverse of A (if existence) denoted by A−1, is the n × n
matrix so that
−1 −1
A × A = A A=A n ×n

Notes

 I n is reversible and I −1
n =I n.

 If A has 1 row or 1 column of zero, then A not is invertible.

−1
 A × A =1
HOW TO FIND THE INVERSE MATRIX
 Method 1 Elementary transformations
 Method 2 Determinant
1. Method 1
Elementary transformations on the row

E1 Swap two rows

A di → dk A '
→
 E2 Multiply 1 row by the number (α ≠ 0), A d i → →
d αi A ' '

E3 Add row i with, A d i → d i +α d k A ' ' '

→

or A d i → μ d i + λ d k A ' ' '

→
Then,
A A , A'' A , A ' ' ' A
'

Let A be a square matrix of order n

(Step 1) Create [ A|I n ]
(Step 2) [ A|I n ] elementary transformations [ R A|B ]
→
 If R A =I n then B= A−1
 If R A ≠ I n then A is not invertible

Example

[ ]
E= 1 2
3 6

[ A|I ]=[ 1 2|1 0 ]

3 60 1

Elementary transformations

[ | ]
1 2 1 0 d → d −3 d 1 2 1 0
3 60 1 2 →
2 1
0 0 −3 1 [ | ]
 R A ≠ I then A is not invertible
2. Method 2
DETERMINANT
 The matrix A= [ ]
a b
c d
is invertible if and only if ad−bc ≠ 0

 Futhermore, the inverse of A is

1
ad−bc −c a [
d −b
]
 If the matrix has a non-zero determinant, it is said to be non-singular, otherwise it is
said to be singular.

Find det ( A)
 If det ( A)=0 → A is not invertible (stop)
 If det ( A) 0→ is invertible. Find A−1 as follows
 [ ]
A11 A 21 A 31
−1 1
A = A A 22 A 32
det ⁡( A) 12
A13 A23 A 33

 The adjugate matrix  The adjoint matrix

[ ] [ ]
A 11 A12 A13 A 11 A21 A 31
A 21 A22 A23 A 12 A22 A 32
A 31 A32 A33 A 13 A23 A 33
Example

[ ]
1 2 −1
A= 2 3 −2
3 1 3

Det ( A )=−6 ≠0

[ ]
−11 −7 1

[ ]
11 7 −1 6 6 6
−1 −1
A = 12 6 0 = −2 −1 0
6
−7 −5 1 7 5 −1
6 6 6

BIG NOTES
 If there is one row or column equal to 0 => no inversion
 Identity matrix inverse of itself
 The inverse matrix must be a square matrix.
VI. SOLVE A SYSTEM OF LINEAR EQUATIONS USING THE
MATRIX METHOD

{ [ ][][]
a11 x +a12 y+ a13 z=b1 a11 a12 a 13 x b1
a2 1 x + a2 2 y +a 23 z=b 2 ⟺ a 21 a22 a 23 × y = b2
a3 1 x +a 3 2 y +a 33 z=b 3 a 31 a32 a 33 z b3

Ax=b
−1
x= A b
Example

{ x+ y =36 ⟺ 1 1 × x = 36
2 x +4 y=100 2 4 y [ ][][ ]
100
 [ ]
−1
2
−1 1
det ( A )=2 ≠ 0→ A =
2 −2 1[
4 −1
= ] −1
2
1
2

[ ][
−1
2
 x=
−1
1
2 × 36 = 22
100 14 ][ ]
2

CRAMER'S RULE

Ax=b
det ⁡( A i)
det ( A ) ≠ 0 → xi =
det ⁡( A)
Where Ai is the n × n matrix found by replacing the ith column of A by the right-
hand-size vector b
Example Reffering to the above example, we have

A1 =
[ 100 4]
36 1
A=
[ 12 100
2
36
]
det ( A 1 ) 44
det ( A ) ≠ 0 → x1= = =22
det ( A ) 2

det ( A 2 ) 28
det ( A ) ≠ 0 → x2= = =14
det ( A ) 2