 SYNOPSIS- 1

MATRICES
Arthur Caylay (1821 - 1895) an English mathematician created a new mathematical
discipline called matrices in 1858. He used matrices to write simultaneous equations
in an abridged form James Joseph Sylvester (1814 - 1897) another English
mathematician gave the name matrix (Plural - matrices) to a rectangular arrangement
of numbers in rows and columns.
A matrix is a rectangular array of elements. Generally the elements are number.
The elements, are usually denoted by lower case letters a, b, c ....
Symbol of a matrix : To write a matrix, we arrange the numbers in a rectangular array
and enclose the array in brackets as shown below

  or  
Usually capital letters of English language such as A, B, .... etc are used to the
represent matrices.
Order of the matrix : Observe the following arrangements of real numbers.

1 2 a b c
i)   ii)  
3 4 d e f 
In matrix (i) there are two rows and two columns. This is called a 2 by 2 matrix. This
is written as 2 × 2 matrix. There are 2 rows and 3 columns in matrix (ii). It is written
as 2 × 3 matrix.
There may be any number of rows and any number of columns in a matrix. If
there are m rows and n columns in matrix ‘A’ it is called m × n matrix. It is written
as Am × n. This m × n of ‘A’ is called the order of the matrix ‘A’.
If mn numbers or functions are arranged in the form of a rectangular array A,
having m rows and n columns, then A is called a m × n matrix. A m × n matrix is
generally written as

a11 a12 ......a1 j.......a1n 

 
a 21 a 22 ......a 2 j .......a 2n 
................................. 
 
................................. 
A=  
a i1 a i2 ........a ij........a in 
................................. 
 
................................. 
a 
 m1 a m2 ........a mj ........a 
mn 

Note : Compact form of above matrix A is A = [aij]m × n where 1  i  m; 1  j  n .

Types of Matrices :
i) Square Matrix : A matrix is called a square matrix if the number of rows and
columns in the matrix are equal.
 A square matrix having n rows (or columns) is called a square matrix of order n
or an n-square matrix.
In the square matrix [aij]n × n, the line containing elements a11, a22, ....., ann is called
the principal diagonal of [aij]. The elements a11, a22, ...., ann are called the diagonal
elements of square matrix [aij]n × n.

1 4 3
4 6 7 
Example :   is a square matrix, because number of rows and columns are equal.
2 8 8 

1 4
4 6 
  is not a square matrix, because number of rows and columns are not equal.
2 8 

ii) Row Matrix : A matrix is called a row matrix if it contains only one row.
Eg : i) [1 5 4 3] is 1 × 4 row matrix.
ii) [4] is a 1 × 1 row matrix.
iii) Column Matrix : A matrix is called a column matrix if it contains only one column.
1 
4
For example,   is 3 × 1 matrix.
 2 

iv) Zero (or Null) Matrix : A matrix is called a zero matrix if all its elements are zero.
For example, [0 0 0] is a zero matrix of order 1 × 3. A zero matrix is denoted by ‘O’
v) Diagonal Matrix : A square matrix is called a diagonal matrix if all its non-diagonal
elements are zero.

4 0 0 
0 2 0 
For example,   is a 3 × 3 diagonal matrix it is also denoted by, diag[4 –2 6]
0 0 6 

vi) Scalar Matrix : A square matrix is called a Scalar matrix if all its non-diagonal
elements are zero and all diagonal elements equal.

4 0 0 
0 4 0 
For example,   is a scalar matrix.
0 0 4

viii) Unit Matrix : A square matrix is called a unit matrix if all its non-diagonal elements
are zero and all diagonal elements unity.

1 0 
For example,   is a matrix of order 2. This matrix is denoted by I 2.
0 1 

1 0 0 
Similarly, I3  0 1 0 
 
0 0 1 

A unit matrix is also known as an identity matrix.

Remark : Every identity matrix and null square matrix is a scalar matrix and every
scalar matrix is a diagonal matrix.
viii) Triangular Matrix : There are two types of triangular matrices.
a) A square matrix is called an upper triangular matrix if all its elements below
principal diagonal are zero.
Thus, [aij]m × n is an upper triangular matrix if m = n and aij = 0 for i > j.

4 3 7 
0 8 11
For example,   is an upper triangular matrix.
0 0 5 

b) A square matrix is called a lower triangular matrix if all its elements above the
principal diagonal are zero.
Thus, [aij]m × n is a lower triangular matrix if m = n and aij = 0 for i < j.

 2 0 0 
 7 3 0
For example,   is a lower triangular matrix.
 9 6 8 

 WORKSHEET- 1

1. If a matrix has 24 elements, what are the possible dimensions (order) it can
have? What, if it has 13 elements?
2. Construct a 2 × 2 matrix A = [aij] whose element aij is given by

 i + 2j 
2
|2i  3j| i
i) aij = ii) aij = iii) a ij = j
2 2
3. If A = [aij] be a matrix of order m × n, then write A in the expanded form
i) m = 1, n = 2 ii) m = 3, n = 3
4. If a matrix has 12 elements, what are the possible orders it can have ? What, if it
has 11 elements ?

3i  j
5. Construct a m × n matrix A = [aij] whose element aij is given by aij = , m = 2, n = 3.
2
6. What is the order of the matrix given below.

 7 1 9 11
 2 3 8 15  write the elements a , a , a , a , a for the matrix.
A =  12 21 24 31 34
 1 7 12 6 

3i + j
7. Construct m × n matrix A = [aij] whose element aij given by aij = , m = 3, n = 4.
2

 i + j
2
8. Construct a 3 × 4 matrix A = [aij], where elements aij is given by .
2
 SYNOPSIS - 2
1) Comparable Matrices : Two matrices are called comparable if the matrices are of same
order. Thus, the matrices [aij]m × n and [bij]p × q are comparable if (i) m = p and (ii) n = q.

1 4 5   3 6 8
For example, the matrices   and   are comparable.
6 9 7   2 5 7 
2) Equal Matrices : Two matrices are called equal if the matrices are of same order
and their corresponding elements are equal.
Thus, the matrices [aij]m × n and [bij]p × q are equal if
i) m = p ii) n = q and iii) aij = bij  i, j

a b 4  0 3 y 
For example, the matrices   and   are equal if a = 0, b = 3, y = 4, c = 6,
c x 6  6 7 z 
x = 7, z = 6.
Remark : Equal matrices are always comparable matrices but comparable matrices
may not be equal matrices.
3) Negative of a Matrix : The negative of a matrix A = [aij] is the matrix [–aij] and is
denoted by – A.

4 3 7   4 3 7 
For Example, if A =   , then –A =  .
 6 8 4   6 8 4 

 WORKSHEET- 2
a + b 2  6 2
If  =
ab   5 8
1. . Find the values of a and b.
 5

2x + y x  y  10 1

2. Find the values of x, y, z if  = .
 x z x + y + z   2 8 

2a + 5 b + 7  1 2 
3. Find the values of a, b, c, d if  = .
3c  8 3d + 9  1 3 

2a + b a  2b   4 3 
4. Find the values of a, b, c, d if  = .
5c  d 4c + 3d  11 24 

x + y + z  9 
  5
5. Find the values of x, y, z if  x + z  =  .
 y + z   7 
2x  3y zw 3  1 2 3 
6. Find the value of x, y, z, w if  =
 1 x + 4y 3z + 4w  1 6 29 

 x + 3 z + 4 2y  7   0 6 3y  2 
7. 
If 4X + 6 a  1  
0  =  2x 3 2c + 2  obtain the values of a, b, c, x, y and z.

 b  3 3b z + 2c  2b + 4 21 0 
 x  2y 5y  20 10 
If  =
a  2b   b 30 
8. , find a + x.
 6
 SYNOPSIS - 3
Addition of matrices : If A and B are two matrices of the same order, then their sum A +
B is defined and is a matrix obtained by adding the corresponding elements of A and B.
In other words, if A = [aij]m × n, and B = [bij]m × n are matrices of same order, then A + B
is defined and is given by A + B = [cij]m × n, where cij = aij + bij.

2 3 6  0 6 8 
For example, if A    and B =   , then
4 0 9  7 0 8 

2  0 3  6 6  8   2 9 14 
A+B=   .
4  7 0  0 9  8  11 0 17 

1 4 
If C =   , then neither A + C nor B + C is defined.
2 3 
Remark. If two matrices are not of the same order, their sum is not defined.
Example 1 : Evaluate A + B, if defined, for the given matrices A and B :

1 4 3  6 8 3  3 4  3 
i) A =   , B=   ii) A =   , B=  
6 8 9  3 3 16  6 8  4 

sin2   cos 2   cos 2   sin2  

iii) A =  , B =  
 1 sec 2    0 tan2  

1 4 3  6 8 3 
Sol : i) A =   , B=   , A and B are of same order.
6 8 9  3 3 16 
 A + B is defined.
1  6 4  8 3  3  7 12 6 
 A + B = 6  3 8  3 9  16   9 5 25 
   

3 4  3 
ii) A =   , B =   A and B are of different orders.
6 8  4 
 A + B is not defined.
sin2   cos 2   cos2   sin2  
iii) A =  , B =   A and B are of same order.
 1 sec 2    0  tan2 
 A + B is defined.

sin2   cos 2   cos2   sin2   1 1

 A+B=   
 1 0 sec2   tan2   1 1 
Difference of matrices : If A and B are two matrices of the same order, then their
different A – B is defined and is a matrix obtained by subtracting the elements of B
from the corresponding elements of A.

4 3   3 8 43 38   1 5 
6 8  11 7  6  11 8  7   
For example, if A =   and B =   , then A – B =   =  5 1  .
9 15   6 8   9  6 15  8   3 7 
 Remark : By definition A – B is same as the matrix A + (–B).
Properties of Addition :
i) Commutative law of addition : If A and B are matrices of same order, then A + B = B + A.
Proof : A = [aij]m × n and B = [bij]m × n
Now, A + B = [aij] + [bij] = [aij + bij] (By using definition of addition of matrices)
= [bij + aij] = [bij] + [aij] = B + A
 A+B=B+A
ii) Associative law of addition : If A, B and C are matrices of same order, then
(A + B) + C = A + (B + C).
Proof : A = [aij]m × n, B = [bij]m × n, C = [cij]m × n
Now (A + B) + C = ([aij] + [bij]) + [cij]
= [aij + bij] + [cij] (By definition of addition of matrices)
= [(aij + bij) + cij] (By definition of addition of matrices)

= [aij + (bij + cij)]= [aij] + [bij + cij]  a , b

ij ij  R
= [aij] + ([bij] + [cij]) = A + (B + C)
 (A + B) + C = A + (B + C).
iii) Existence of additive identity. If A is any matrix then A + O = A = O + A.
Here ‘O’ is the zero matrix of same order as that of A.
Proof : A = [aij]m × n and O = [0]m × n
 A + O = [aij] + [0] = [aij + 0] = [aij] = A
Also O + A = [0] + [aij] = [0 + aij] = [aij] = A
 A + O = A = O + A.
Remark : The zero matrix is called the additive identity for the matrices.
iv) Existence of additive inverse : If A is any matrix, then A + (–A) = O = (–A) + A.
Proof : A = [aij]m × n
 –A = [–aij]m × n
Now, A + (–A) = [aij] + [–aij] = [aij + (–aij)] = [0] = O
Also (–A) + A = [–aij] + [aij] = [–aij + aij] = [0] = O
 A + (–A) = O = (–A) + A.
Remark : The matrix ‘– A’ is called the additive inverse of the matrix A.
Cancellation laws in Addition :
Theorem : If A, B, C are matrices of same order then
i) A + B = A + C  B = C (Left cancellation law)
ii) B + A = C + A  B=C (Right cancellation law)
Proof : i) We have A + B = A + C
 (–A) + (A + B) = (–A) + (A + C)
 (–A + A) + B = (–A + A) + C (By associative law of addition)
 0+B=0+C ( ‘–A’ is the additive inverse of A)
 B=C ( 0 is the additive identity)
 WORKSHEET - 3
4 7   3 8 8 11
1. If A =  , B =  7 2  , C = 6 1  , then show that
6 5     
i) A + B = B + A ii) (A + B) + C = A + (B + C)
iii) A + O = O + A iv) A + (–A) = (–A) + A = O.

1 4   1 2
3 2   
2. If A =   and B =  0 5 , then find the matrix X for which A + B – X = 0.
2 5   3 1 

1 3
3. If A =   find (i) –A ii) A + (–A). What do you notice ?
2 4

 x  y 2 2  3 2 2  6 0 0
Find the values of x and y if  + =
x 6  1 0 1  5 2x + y 5 
 
4. .
 4

x + y + z 1  8 
     
5. Find the values of x, y and z from the following equation  x + y  +  3  =  8  .
 y + z   7  10 
     

2 3 1  1 2 1
6. If A =   and B =   , then find the matrix X such that A + B – X.
 6 1 5   0 1 3 
What is the order of matrix X?
 7 15 8 
 1 10 9  , find the additive inverse of A.
7. If A = 
 2 2 10 

 3 5 
8. Given P =   . Find i) the matrix Q satisfying P + Q = 0.
 4 2 
ii) the matrix R satisfying P + R = I.

 SYNOPSIS - 4
Multiplication of a matrix by a Scalar :
If A is a matrix of order m × n and k be a scalar (any complex number), then the
scalar multiple kA of A by k is defined to be a m × n matrix whose elements are
obtained by multiplying the every elements of A by k.
In other words, if A = [aij]m × n, then kA = [cij]m × n, where cij = kaij.

4 7 3 
For example, if A =   and k = 7,
2 6 8 

 4 7 3  7  4  7  7  7  3   28 49 21
then kA = 7  2 6 8    7 2 7 6 7 8   14 42 56  .
          
 If A1, A2, ....., Ak be all m × n matrices, then for numbers 1 ,  2 , .....,  k , the matrix

1 A1   2 A 2  ....   k A k
is called a linear combination of the matrices A1, A2, ....., Ak.

3 8 11 1 6 15 
Example 1 : If A =   and B =   , find 7A + 5B.
 6 3 8  3 8 17 

3 8 11 1 6 15  7  3  7  8  7 11   5 1 5  6  5 15 

 5 = 7 6 7 3 
Sol : 7A + 5B = 7  
6 3 8 

3 8 17       7  8   5  3  5  8  5 17 
 21 56 77   5 30 75   21  5 56  30 77  75  26 26 152
=     =   
42 21 56  15 40 85  42  15 21  40 56  85  57 61 141

1 3  1 8 4
Example 2 : Express 4     as a single matrix.
1 4  2  4 8 

1
 4   4 12  4 2
1
1 3  1 8 4   4 1 4  3    2 8 2
 
 = 4 1 4  4    1  =  
4 16  2 4 
4
Sol :   
1 4  2  4 8     4 1
 8  
 2 2 

4  4 12  2  0 10 
=   =  
 4  2 16  4 2 20 
Properties of Scalar Multiplication :
If A and B are matrices of the same order and k, l are numbers, then
i) k(A + B) = kA + kB ii) (k + l)A = kA + lA
iii) k(lA) = (kl)A iv) 1A = A.
Proof : A = [aij]m × n and B = [bij]m × n
i) k(A + B) = k( [aij] + [bij])
= k[aij + bij] (By addition of matrices)
= [k(aij + bij)] (By definition of scalar multiplication)
= [kaij + kbij] = [kaij] + [kbij]
= k[aij] + k[bij] = kA + kB
 k(A + B) = kA + kB.
ii) (k + l)A = (k + l)[aij] = [(k + l)(aij)] (By definition of scalar multiplication)
= [kaij+ laij] = [kaij] + [laij] = k[aij] + l[aij] = kA + lA
 (k + l)A = kA + lA
iii) k(lA) = k(l[aij]) = k[laij] (By definition of scalar multiplication)
= [k(laij)] = [(kl)aij] (By definition of scalar multiplication)
= (kl)[aij] = (kl)A
 k(lA) = (kl)A
iv) 1A = 1[aij] = [1.aij] = [aij] = A
 1A = A.
Multiplication of two Matrices :
Let A and B matrices of orders m × n and n × p respectively. The product AB of
matrices A and B is defined only if the number of columns of A is equal to the
number of rows of B. The product AB will be a m × p matrix.
A = [aik]m × n B = [bkj]n × p

Columns in A = Rows in B
Order of AB is m × p

The ijth element of AB matrix is obtained by adding the products of the elements of
ith row of A by the corresponding elements of the jth column of B.
In other words, if A = [aik]m × n and B = [bkj]n × p, then the matrix.
AB = [cij]m × p, where cij = ai1 b1j + ai2 b2j + ... + ain bnj, 1  i  m, 1  j  p .
Note :
1) In the product AB, A is called the pre-factor of AB and B, the post-factor of AB.
2) In practical problems, the product AB is found by following the steps given below :
i) Underline the first row of A and the first column of B. Multiply the elements of
first row of A by the corresponding elements of first column of B and add the products.
This gives (1, 1)th elements of AB.
ii) The (1, 2)th element of AB is obtained by adding the products of the elements of
first row of A and the elements of second column of B. Similarly, (1, 3)th, ....., (1, p)th
elements of AB are found out.
iii) Now we begin with the second row of A. The (2, 1)th element of AB is obtained by
adding the products of the elements of second row of A and the corresponding elements
of first column of B. Similarly, we find the (2, 2)th, ....., (2, p)th element of AB.
iv) The same procedure is adopted for other rows of A.

 a11 a12   b11 b12 b13 

For example, let A = a  and B = b b23  .
 21 a 22   21 b22
Here the product AB is defined, because the number of columns (= 2) of A equals the
number of rows (=2) of B. In this case,

a a12   b11 b12 b13 *  a11b11  a12b21 a11b12  a12b22 a11b13  a12b23 
AB   11
a 21 a 22  b
 21 b22 b23 
 = a b  a b
 21 11 22 21 a 21b12  a 22b22 a 21b13  a 22b23 

6 9  2 6 0 
To take another example, let A =   and B =  .
2 3  7 9 8 
The product AB is defined, because no. of columns (= 2) of A is equal to no. of rows (=
2) of B. The order of product AB is 2 × 3.

6 9 2 6 0 6  2   9  7  6  6   9  9  6  0   9  8  
Here, AB = 2 3 7 9 8 = 2 2  3 7 2 6  3 9 2 0  3 8 
                
12  63 36  81 0  72 75 117 72 
=   =  
 4  21 12  27 0  24  25 39 24 
For the above matrices, the products BA is not defined, because no. of columns (= 3)
of B is not equal to no. of rows (= 2) of A.
 WORKSHEET - 4
x 2   x   2 
1. Solve the matrix equation :  2   3   =   .
y  2y   9 

4 4 7   3 2 1 
2. Find X and Y if 2X + Y =   and X – 2Y =  .
7 3 4   1 1 2 
3. Find the mattrix AB, if defined, when :
1  2  1 
i) A =   , B =   ii) A =   , B = [2 4]
2  4  2 

1 1  6 7 
iii) A = [2 4], B = [1 2] iv) A =   , B=  
 0 5 9 8

 7 8  7 8
1 5 7   9 8  9 8 1 5 7 
v) A = 
0 6 8 , B =   vi) A =  , B =  .
  6 5 6 5 0 6 8 

4. Assume that Y, W and P are matrices of order 3 × k, n × 3 and p × k respectively.

Find the restrictions on n, p, k so that PY + WY is defined.
5. If A = [aij]n × n is a diagonal matrix, then A is also expressed as A = diag[a 11 a22 ... ann].
If A = diag[2 9 4], B = diag[–3 7 6], find A + B, A – B, 7A + 2B and 9A – 11B.
 cosθ sinθ   sinθ cosθ 
6. Simplify cosθ   + sinθ  .
  sinθ cosθ  cosθ sinθ 

 4 1 9 
3 2 8
7. If A =   , then show that AI = A = IA.
 7 5 11
8. Three shopkeepers, Ashok, Ramesh and Ravi, go to a store to buy stationery.
Ashok purchases 12 dozen notebooks, 5 dozen pens, 6 dozen pencils. Ramesh
purchases 10 dozen notebooks, 6 dozen pens and 7 dozen pencils. Ravi purchase
11 dozen notebooks, 13 dozen pens and 8 dozen pencils. A notebook costs 40
paise, a pen costs Rs 1.25 and a pencil costs 35 paise. Use matrix multiplication
to calculate individual’s bill.

 SYNOPSIS - 5
Positive Integral Powers of Matrices :
Let A be a m × n matrix. By definition of matrix multiplication, the product AA is
defined only when m = n.
 AA is defined, if A is a square matrix.
The product AA is denoted by A2.
If A is a n-square matrix, than A2 is also a n-square matrix.
 AA2 and A2 are both defined and we also have
AA2 = A(AA) = (AA)A = A2A
 AA2 = A2 A = AAA
We write AAA as A3.
 Similarly, we have An = AAA .... n times, n  N .
A square matrix A is said to be an idempotent matrix if A2 = A.
A square matrix A is said to be an involutory matrix if A2 = I.
Matrix Polynomical :
Let A be a square matrix of order n. An expression of the form a0Am + a1Am – 1 + .... + am
In, where a0, a1, ...., am are scalars, is called a matrix polynomical.
If f(x) = 0 x m  1x m1  2 x m2  ....   m , then for a square matrix A of order n, we
define f(A) = 0 A m  1A m 1  ...   mIn .

12 22 
Example 1 : If A =  2  , find A2.
3 42 

12 22  1 4 
Sol : A =  2 2 =  
3 4  9 16 

1 4  1 4   1 1  4  9  1 4   4 16    37 68 
 A2 = AA = 9 16 9 16 = 9 1  16 9 9 4  16 16  = 153 292 .
              

2 1  0 4
Example 2 : If A =   ,B=   , find 3A2 – 2B.
3 2   1 7 

2 1 2 1  4  3 2  2   1 4 
Sol : A2 = 3 2  3 2  =   =  
    6  6 3  4  12 1 

 1 4   0 4  3 12  0 8   3 20 
 3A2 – 2B = 3   2 =     =  
  3   2 14 
12 1   1 7  36 38 11
Properties of Multiplication :
i) Matrix multiplication is not commutative in general. For matrices A and B we
need not have AB = BA.
For example, if :
a) A and B are 2 × 3 and 3 × 4 matrices, then AB is a 2 × 4 matrix where as BA is not defined.
b) A and B are 2 × 3 and 3 × 2 matrices, then AB is a 2 × 2 matrix and BA is a 3 × 3 matrix.
c) A and B are 2 × 2 matrices, then both AB and BA are 2 × 2 matrices. Even in this
case, we may not have AB = BA.
ii) Associative law of multiplicaiton. If A, B and C be matrices of the type m × n, n × p
and p × q respectively, then (AB)C = A(BC).
Proof : A = [aij]m × n, B = [bjk]n × p and C = [ckl]p × q.
 The matrices (AB)C and A(BC) are both defined and are of order m × q each.
Let AB = [uik]m × p and BC = [vjl]n × q.
n
 uik  a
j 1
ij b jk , 1  i  m, 1  k  p ------------- (1)

p
and v jl  b
k 1
jk c kl , 1  j  n, 1  l  q ------------- (2)

For 1  i  m, 1  l  q , (i, l)th element of (AB)C

 p p
 n 
=  uik c kl   a ij b jk  c kl [By (1)]
k 1 k 1  j 1 

n  p  n

=  ij   b jk c kl  
a a ij v jl [By (2)]
j 1 k 1  j 1

= (i, l)th element of A(BC).

 (AB)C = A(BC).
iii) Matrix multiplication is distributive with respect to addtion
a) If A, B and C are matrices of the type m × n, n × p and n × p respectively,
then A(B + C) = AB + AC.
b) If A, B and C are matrices of the type m × n, m × n and n × p respectively,
then (A + B ) C = AC + BC
Proof : a) Let A = [aij]m × n, B = [bjk]n × p and C = [cjk]n × p.
 The matrices A(B + C) and AB + AC are both defined and are of order m × p each.
We have B + C = [bjk]n × p + [cjk]n × p = [bjk + cjk]n × p
n

For 1  i  m, 1  k  p, (i, k)th element of A(B + C) =  a b

j1
ij jk  c jk 

n n n

=  a b
j1
ij jk  a ijc jk   a b
j1
ij jk   a ij c jk = (i, k)th element of AB + (i, k)th element of AC
j1

= (i, k)th element of AB + AC (By definition of matrices)

 A(B + C) = AB + AC.
b) Similarly we can prove (A + B)C = AC + BC.
iv) The product of non-zero matrices may be a zero matrix. For matrices A and B, it
may be possible that AB = O and neither A nor B a zero matrix.

2 1  1 2
For example, let A =   and B =  .
0 0   2 4 

2 1   1 2  2 1  1 2 2  2  1 4   0 0 
Here A  0, B  0 and AB      = 0 1  0 2 0 2  0 4  = 
 0 0   2 4           0 0 = O

 WORKSHEET - 5
1. If A is a square matrix such that A2 = A, then find the value of (I + A)3 – 7A.
2. i) If A and B are two matrices such that A + B and AB are both defined, show that
A and B are square matrices of same order.
ii) If A and B are two matrices such that AB and BA are both defined and order of
A be m×n, show that order of B is n × m.

 β 
3. If A =   is such that A2 = I, then show that 2 + βγ  1 = 0 .
 γ  

1 1 2 1 
4. If A =   ,B=   , verify that (A + B)2  A2 + 2AB + B2.
2 3  1 0 
 2 1  1 6  4 6 
5. If A =   , B=   , C=   , verify that (AB)C = A(BC).
3 4  3 4  3 5 

2 1  3 4 
3 7   
6. If A = [1 3 4]. B =   , C = 5 6  , verify that A(B + C) = AB + AC.
6 8  1 0 

 2 3
7. Let A =   and f(x) = x2 – 4x + 7, show that f(A) = 0. Using this result, find A5.
 1 2 

 1 
 0  tan  
Let A =  2
8.  and I, the indetity matrix of order 2.
1
 tan  
0
 2 

cos sin 
Show that I + A = (I – A)  .
 sin cos 

 SYNOPSIS - 6
Transpose of a Matrix :
Let A be a matrix of order m × n. The n × m matrix obtained from A by interchanging
its rows and columns is called the transpose of A and is denoted by A’ or by AT.
Thus, if A = [a ij ] m × n , then transpose of A, A’ = [b ji ] n × m , where b ji = a ij ,
1  i  m and1  j  n .
 The (j, i)th elements of A’ is equal to (i, j)th element of A.

2 5 9
2 3 6 8  3 3 8 
5 3 7 4  
For example, let A =   . The transpose of A is the 4 × 3 matrix 6 7 2 .
9 8 2 1   
8 4 1 

The rows (respectively columns) of A’ are the columns (respectively rows) of the matrix A.
Example : Find the transpose of the following matrices :

5 
9  2 3  5 8 7 6 
i) [1 2 6] ii)   iii)   iv)  
0   0 8  2 3 1 0 

1 
  
Sol : i) Let A = [1 2 6]  A  1 2 6  2

6 

5 
9   5 
ii) Let A =    A    9   5 9 0 
0   
0 
 5 2
5 8  7 6   8 3
5 8 7 6  
iii) Let A =    A    
 2 3 1 0   2 3 1 0   7 1
 
 6 0 

2 3  2 3   2 0 
iv) Let A =    A     
0 8   0 8  3 8 
Properties of Transpose :

i)  A   A , where A is any matrix.

Proof : Let A be m × n matrix.
 A’ is a n × m matrix.

  A is a m × n matrix.  A and  A   are of same order.

For 1  i  m, 1  j  n, (i, j)th element of  A   = (j, i)th element of A’ = (i, j)th element of A.

  A   A.
ii) (A + B)’ = A’ + B’, where A and B are matrices of the same order.
Sol : Let A = [aij]m × n, B = [bij]m × n
 A + B is a matrix of order m × n.
 (A + B)’ is a matrix of order n × m.
A’ and B’ is a matrix of order n × m each.
 A’ + B’ is a matrix of order n × m.
 (A + B)’ and A’ + B’ are of same order.
For 1  i  m, 1  j  n,
(j, i)th element of (A + B)’ = (i, j)th element of A + B
= (i, j)th element of A + (i, j)th element of B
= (j, i)th element of A’ + (j, i)th element of B’
= (j, i)th element of A’ + B’
 (A + B)’ = A’ + B’
iii) (kA)’ = kA’, where A is any matrix and k is any number.
Proof : A = [aij]m × n  kA = k[aij] = [kaij].
For 1  i  m, 1  j  n,
(j, i)th element of (kA)’ = (i, j)th element of kA
= k × (i, j)th element of A
= k × (j, i)th element of A’
= (j, i)th element of kA’
 (kA)’ = kA’.
iv) (AB)’ = B’A’, where A and B are matrices for which AB is defined.
Proof : Let A = [aij]m × n, B = [bji]n × p.
 Order of AB = m × p and order of (AB)’ = p × m.
Order of A’ = n × m and order of B’ = p × n
 Order of B’A’ = p × m
 (AB)’ and B’A’ are of same order.
 Let A’ = [cji]n × m and B’ = [dkj]p × n
 cji = aij and dkj = bjk
For 1  i  m, 1  k  p, (k, i)th element of (AB)’ = (i, k)th element of AB
n n n

= a
j1
ij b jk  c
j1
ji d kj  d
j 1
kj c ji = (k, i)th element of B’A’..  (AB)’ = B’A’.

Remark : Property (iv) is known as the reversal law for the transpose of the product.
Symmetric Matrix : A square matrix A = [aij] is said to be a symmetric matrix if its (i, j)th
element is the same as its (j, i)th element i.e., aij = aji  i, j .

3 5 9 
5 6 7 
For example, A =   is a symmetric matrix, because a12 = a21 = 5, a13 = a31 = 9,
9 7 11
a23 = a32 = 7. In a symmetric matrix, there is no restriction of elements on the principal
diagonal. The following matrices are symmetric matrices.

4 3 6 9
 5 6 9 3 5 2 5 
4 1   6 0 5  
1 5  ,  , 6 2 10 7  .
   9 5 3   
9 5 7 0 

Theorem. A necessary and sufficient condition for the matrix A to be symmetric is

that A’ = A.
Proof : A is a symmetric matrix.
 A is a square matrix and (i, j)th element of A = (j, i)th element of A for all i, j.
 A is a square matrix and (i, j)th element of A = (i, j)th element of A’ for all i, j.
 A = A’ i.e., A’ = A.
Skew - Symmetric Matrix : A square matrix A = [aij] is said to be a skew symmetric
matrix if its (i, j)th element is the negative of its (j, i)th element i.e., a ij = –aji  i, j.

 0 9 6 
 9 0 8 
For example, A =   is a skew-symmetric matrix, because
 6 8 0 

a12 = –a21 = 9, a13 = –a31 = –6, a23 = –a23 = 8, a11 = –a11 = 0, a22 = –a22 = 0, a33 = –a33 = 0.
In a skew -symmetric matrix, we have aij = –aji  i, j.
In particular aii = –aii  i.  2aii = 0  i. i.e., aii = 0  i.
 All the elements on the principal diagonal must be zero.
The following matrices are skew-symmetric matrices.

0 2 3 7 
5  
0 2 0 9 8 
6
 0 5   6 
0 17   
 5 0  ,  , 3 9 0 5 
   5 17 0   
 7 8 5 0 
Theorem I. A necessary and sufficient condition for a matrix A to be skew-symmetric
is that A’ = –A.
Proof : A is a skew-symmetric matrix.
 A is a square matrix and (i, j)th elements of A = –(j, i)th elements of A for all i, j.
  A is a square matrix and (i, j)th elements of A = –(i, j)th element of A’ for all i, j.
 A = – A’ i.e., A’ = – A.
2 4 
Example : If A =   , show that : i) A + A’ is symmetric ii) A – A’ is skew-symmetric
5 6 

2 4   2 4   2 5 
Proof : We have A =  .  A      4 6
5 6  5 6   

2 4  2 5 

4 9   4 9   4 9 
i) A + A’ =     = 9 12  . Now, 9 12  9 12
5 6   4 6       
 A + A’ is symmetric.

2 4  2 5  0 1 0 1  0 1  0 1

ii) A – A’ =      . Now,       
5 6   4 6   1 0  1 0   1 0  1 0 
 A – A’ is skew-symmetric.
Theorem II. Prove that every square matrix is uniquely expressible as the sum of a
symmetric matrix and a skew-symmetric matrix.
Sol : Let A be a square matrix.

A  A A  A   A  A A  A A  A
 A=   
2 2 2 2

 A  A   A  A  A   A  A  A A  A

Now,      

 2  2 2 2 2

 A   A  
 A  A    A  A   A  A A  A
and       
 2  2 2 2 2

A  A A  A
 is symmetric and is skew-symmetric.
2 2
 A is expressible as the sum of symmetric and skew-symmetric matrices.
Uniqueness : Let A = P + Q, where P is symmetric and Q is skew-symmetric, P’ = P, Q’ = –Q
 A’ = (P + Q)’ = P’ + Q’ = P + (–Q) = P – Q.
A  A A  A
Solving, we get P  and Q =
2 2
A  A A  A
 Representation of A as the sum of and is unique.
2 2
Remark : The result of this theorem enable us to express a square matrix as the
sum of a symmetric matrix and a skew-symmetric matrix.
A  A  A  A A  A
If A is any square matrix, then A =  . Here is a symmetric matrix
2 2 2
A  A
and is a skew-symmetric matrix.
2
 WORKSHEET - 6

2 1  9 0
1. If A =   and B =   , then verify that :
3 5  6 8 
i) (A’)’ = A ii) (A + B)’ = A’ + B’ iii) (kA)’ = kA’ iv) (AB)’ = B’A’
2. Verify that (AB)’ = B’A’, where

3
1 2 3 1 0 1
i) A =   , B = 1 5 7  ii) A =   ,B=  .
 2  4 1  2 1 3 

0 a b
1 1
3. Find  A + A  and  A  A  , when A =  a 0 c  .
2 2
  b c 0 

4 3 7 
 6 5 8 
4. Express   as the sum of a symmetric matrix and a skew-symmetric
1 2 6 
matrix.
5. If A and B are symmetric matrices of the same order, then show that AB is
symmetric if and only if A and B commute i.e., AB = BA.

 0 2y z 
 
6. Find the values of x, y, z if the matrix A =  x y z  obeys the law A’A = I.
 x  y z 

1 2 2 
7. If 2 1 2 is a matrix such that AA’ = 9I3, then find the values of a and b.
 a 2 b 

0 1 2 
2 3 0 
8. If   , verify that (A2)’ = (A’)2.
1 1 0 