UNIT – 1 Linear Algebra

LECTURE-1
(Matrices)
Introduction and Types
 Matrices
(Introduction)

Definition:
A matrix is a set or group of numbers arranged in a square
or rectangular array enclosed by two brackets
Column-1 Column-2 Column-3

1 2 4  Row-1

Example: 4  1 5
  Row-2
3 3 3 Row-3

Order of the Matrix: No. of rows X No. of Columns

Note: Every Matrix has a unique order
Some Examples:
3x3 is the order of
matrix 2x4 matrix 1x2 matrix
1 2 4 
4  1 5
 
1 1 3  3
0 0 3 2 
1  1
3 3 3  

A matrix is denoted by a bold capital letter and the elements

within the matrix are denoted by lower case letters e.g.
matrix [A] with elements aij or A=[aij]mxn

Note: Element 𝑎1 2 is at the position of intersection or first row and second

column.
 TYPES OF MATRICES
1. Column matrix or Column vector
If in a matrix number of rows may be any positive
integer but the number of column is always 1, is known
as Column matrix. A = [aij]1×n
Some Examples:
 a11 
1   a21 
 4 1  
   3  
2   am1 
2. Row matrix or Row vector

If in a matrix number of columns may be any positive

integer but the number of row is always 1, is known as
Row matrix. A = [aij]m×1
Some Examples:

0 3 5 2 1 1 6

a11 a12 a13  a1n 

3. Rectangular matrix
In Rectangular matrix number of rows is not equal to
the number of columns.

Some Examples:

1 1 
3 7  1 1 1 0 0 
   2 0 3 3 0
7  7    2x5
 
7 6  mn
4x2
4. Square matrix
The number of rows is equal to the number of columns
then matrix is known as Square matrix.
A= [aij]mxn where, m = n (a square matrix A has an
order of m)
Some Examples:
1 1 1 1 1
9 9 0
3 0  
  6 6 1
2x2 3x3

The principal or main diagonal of a square matrix is

composed of all elements aij for which i=j
5. Diagonal matrix
A square matrix where all the elements are zero except
those on the main diagonal, is Diagonal matrix.
A = [aij] when i ≠ j
3 0 0 0
1 0 0 0 
0 2 0   3 0 0
  0 0 5 0
0 0 1  
0 0 0 9

or we can define it as aij = 0 for i = j

6. Unit or Identity matrix
A diagonal matrix with ones on the main diagonal, is called
Unit matrix. A = [aij]m×n where,
Unit matrix is represented by I.
Some Examples:
1 0 0 0
0 1 0 0 1 0 

0 0 0 1 

0 1
  
0 0 0 1

or we can define it as aij = 0 for all i = j

aij = 1 for all i = j
7. Null (zero) matrix
If all elements in a matrix are zero then it is known as
Null matrix. A = [aij] mxn where, aij = 0
Some Examples:
Null matrix is represented by O.
0  0 0 0
0  0
   0 0
0 3x1
0 0 0 3x3

aij  0 For all i and j

8. Triangular matrix
A square matrix whose elements above or below the
main diagonal are all zero, is Triangular matrix.

Some Examples:

1 0 0  1 0 0  1 8 9
 2 1 0  2 1 0 0 1 6 
     
5 2 3 5 2 3 0 0 3
8a. Upper triangular matrix
A square matrix whose elements below the main
diagonal are all zero, is Upper Triangular matrix.
Some Examples:
1 7 4 4
1 8 7 0
0 1 8   1 7 4
  0 0 7 8
0 0 3  
0 0 0 3

or we can define it as aij = 0 for all i > j

8b. Lower triangular matrix
A square matrix whose elements above the main diagonal
are all zero, is Triangular matrix.
Some Examples:

1 0 0 
 2 1 0
 
5 2 3

or we can define it as aij = 0 for all i < j

9. Scalar matrix
A diagonal matrix whose main diagonal elements are equal
to the same scalar number, is known as Scalar matrix.
A = [aij]mxn where, a i j = { 0 , i ≠ j ; k , i = j } where k is a constant.

(A scalar is defined as a single number or constant)

Some Examples: 6 0 0 0
0 6 0 0
 
0 0 6 0
 
0 0 0 6

or we can define it as aij = 0 for all i = j

aij = c for all i = j
10. Singular and Non-Singular Matrices:
 EQUALITY OF MATRICES
Two matrices are said to be equal only when their all
corresponding elements are equal, Order of equal matrices
should be same.

1 0 0
2 1 0
A= 
5 2 3

1 0 0
2 1 0
B=  
 3 A=B
5 2 
Some properties of equality:

• If A = B, then B = A for all A and B

• If A = B, and B = C,
then A = C for all A, B and C

1 0 0  b11 b12 b13 

A=  2 1 0 B= 
  b21 b22 b23 
5 2 3 b31 b32 b33 

If A = B then All elements of A are equal to the

corresponding elements of B.
ADDITION AND SUBTRACTION OF MATRICES
The sum or difference of two matrices A and B, of
the same size yields a matrix C of the same size.
Matrices of different sizes cannot be added or
subtracted
Matrix addition and subtraction satisfy the following
laws
 7 3  1  1 5 6  8 8 5
 2  5 6     4  2 3    2  7 9 
     
A B C
2x3 2x3 2x3

6 4 2 1 2 0 5 2 2 
3 2 7  1 0 8  2 2  1
     
A+0=0+A=A
A + (-A) = 0
(where –A is the matrix composed of –aij as elements)
 SCALAR MULTIPLICATION OF MATRICES

Matrix can be multiplied by a scalar (constant or single

element) and the result gives us a new matrix with every
element multiplied by that scalar. Let k be a scalar
quantity; then kA = Ak
3  1
2 1 
Ex. If k=4 and A
2  3
 
4 1 

3  1 3  1 12  4 
2 1  2 1  8 4 
4   4   
2  3 2  3  8  12
     
 4 1   4 1  16 4 
Properties of scalar multiplication with matrix:

• k (A + B) = kA + kB
• (k + g)A = kA + gA
• k(AB) = (kA)B = A(k)B
• k(gA) = (kg)A
Example-1:

Solution
:
 MULTIPLICATION OF MATRICES

The product of two matrices is another matrix.

Two matrices A and B must be conformable for

multiplication to be possible i.e. the number of columns of
A must equal the number of rows of B

Example. A x B = C
(1x3) (3x1) (1x1)
 B x A = Not possible!
(2x1) (4x2)

A x B = Not possible!
(6x2) (6x3)

A x B = C
(2x3) (3x2) (2x2)
 31 21
 
63 57
Remember also:
IA = A

1 0 31 21 31 21

0 1  63 57  
    63 57
Assuming that matrices A, B and C are conformable
for the operations indicated, the following are true:
1. AI = IA = A
2. A(BC) = (AB)C = ABC (associative law)
3. A(B+C) = AB + AC (first distributive law)
4. (A+B)C = AC + BC (second distributive law)
Caution!
1. AB not generally equal to BA, BA may not be
conformable
2. If AB = 0, neither A nor B necessarily = 0
3. If AB = AC, B not necessarily = C
 1 1  2 3  0 0
If AB = 0, 0 0  2  3  0 0
neither A nor B necessarily = 0     
Example-1

Solution:
Example-2
Solution: