www.sakshieducation.

com

MATRICES
Synopsis

1. A matrix is an arrangement of real or complex numbers into rows and

columns so that all the rows (columns) contain equal no. of elements.
2. If a matrix consists of ‘m’ rows and ‘n’ columns, then it is said to be of
order m × n.

o m
3. A matrix of order n × n is said to be a square matrix of order n.

n . c
i o
4. A matrix (aij)m×n is said to be a null matrix if aij = 0 for all i and j.

at
5. Two matrices of the same order are said to be equal if the corresponding

c
elements in the matrices are all equal.

6.

d u
A matrix (aij)n×n is a diagonal matrix if aij = 0 for all i ≠ j.

7.

i e
A matrix (aij)n×n is a scalar matrix if aij=0 for all i ≠ j and aij=k (constant) for

h
s
i=j

8.

a k
A matrix (aij)n×n is said to be a unit matrix of order n, denoted by In if aij=1,

s
.
when i= j and aij = 0 when i ≠ j

w
1 0 0

w
1 0  
Ex: I2 =  , I3 =  0 1 0 
0 1

w
 0 0 1 

9. If A = (aij)m×n, B = (bij)m×n, then A + B = (aij + bij)m×n

10. Matrix addition is commutative and associative
n 
11. If A = (aij)m×n, B = (bij)n×p, then AB =  ∑ a ik b kj 
 k =1  m× p

12. Matrix multiplication is not commutative but associative

www.sakshieducation.com
 www.sakshieducation.com

13. If A is a matrix of order m × n, then AIn = ImA = A(AI = IA = A)

14. If AB = CA = I, then B = C

15. If A = (aij)m×n, then AT = (aji)n×m

16. (KA)T = KAT, (A + B)T = AT + BT, (AB)T = BT.AT
17. A(B + C) = AB + AC, (A + B)C = AC + BC

m
18. i) A square matrix is said to be “non-singular” if detA ≠ 0
ii) A square matrix is said to be “singular” if detA = 0

. co
n
19. If AB = 0, where A and B are non-zero square matrices, then both A and B

i o
are singular.

at
20. A minor of any element in a square matrix is determinant of the matrix

u c
obtained by omitting the row and column in which the element is present.

d
In (aij)n×n, the cofactor of aij is (-1)i+j × (minor of aij).

e
21.
22.

h i
In a square matrix, the sum of the products of the elements of any row

k s
(column) and the corresponding cofactors is equal to the determinant of the

a
matrix.
23.

. s
In a square matrix, the sum of the products of the elements of any row

w
(column) and the corresponding cofactors of any other row (column) is

w
always zero.

w
24.
25.
If A is any square matrix, then A adjA = adjA. A = detA. I
If A is any square matrix and there exists a matrix B such that AB = BA = I,
then B is called the inverse of A and denoted by A-1.
26. AA-1 = A-1A = I.
adjA
27. If A is non-singular, then A-1 = (or) adjA = |A|A-1
det A

www.sakshieducation.com
 www.sakshieducation.com

a b  -1 1  d −b
28. If A =  , then A =  
c d ad − bc  − c a 

29. ( A −1 ) −1 = A , ( AB) −1 = B −1 . A −1 , ( A−1 ) T = ( AT ) −1 ; ( ABC....) −1 =..... C −1B −1A −1 .

Theorem: Matrix multiplication is associative. i.e. if conformability is assured for

the matrices A, B and C, then (AB)C = A(BC).

Sol. Proof:

o m
Let A = (a ij )m×n , B = (b jk )n×p , C = (ckl )p×q

n . c
i o
at
n
AB = (dik )m×p , where d ik = ∑ a ijb jk

c
j=1

d u
p
(AB)C = (fil ) m×q , where fil = ∑ d ik c kl

i e
k =1

s h
p
BC = (g il ) n×q , where gil = ∑ b jk ckl

a k
k =1

s
n

.
A(BC) = (h il ) m×q , where h il = ∑ a ijg jl
j=1

w
p p  n 

w
fil = ∑ dik ckl = ∑  ∑ a ijb jk  ckl

k =1  j=1

k =1 

w
n  p  n
= ∑ a ij  ∑ b jk ckl  = ∑ a ijh jl = h il
j=1  k =1  j=1

(AB)C = A(BC)

www.sakshieducation.com
 www.sakshieducation.com

Theorem: Matrix multiplication is distributive over matrix addition i.e. if

conformability is assured for the matrices A, B and C, then

i) A (B + C) = AB + AC

ii) (B + C) A = BA + CA

Sol. Proof:

o m
c
Let A = (aij)m×n, B = (bjk)n×p, C = (cjk)n×p

B + C = (d jk )n×p , where d jk = b jk + c jk

n .
i o
at
n
A(B + C) = (x ik )m×p , where x ik = ∑ a ijd jk

c
j=1

n
AB = (fik )m×p , where fik = ∑ a ijb jk

d u
i e
j=1

h
n

s
AC = (g ik ) m×p , where g ik = ∑ a ijc jk

k
j=1

a
AB + AC = (yik ) m×p , where yik = f ik + gik

. s
n n
x ik = ∑ a ijd jk = ∑ a ij (b jk + c jk )

w
j=1 j=1

w
n n
= ∑ a ijb jk + ∑ a ijc jk = fik + g ik = yik

w
j=1 j=1

∴ A(B + C) = AB + AC

Similarly we can prove that

(B + C) = BA + CA.

www.sakshieducation.com
 www.sakshieducation.com

Theorem: If A is any matrix, then (AT)T = A.

Sol. Let A = (aij)m × n

A T = (a ′ji )n×m , where a ′ji = a ij

(A T )T = (a ′′ji ) m×n , where a ′′ij = a ji

a ′′ij = a ′ji = a ij

m
∴ (A T )T = A

. co
Theorem: If A and B are two matrices o same type, then (A + B)T = AT + BT.

i on
c at
Proof:

u
Let A = (a ij )m×n , B = (bij ) m×n

A + B = (cij )m×n , where cij = a ij + bij

i e d
(A + B) = (c′ji ) n×m , c′ji = cij
T

s h
a k
A T = (a ′ji )n×m , where a ′ji = a ij

s
.
BT = (b′ji )n×m , where, b′kj = b jk

w
A T + BT = (d ji )n×m , where d ji = a ′ji + b′ji

w
c′ji = cij = a ij + bij = a ′ji + b′ji = d ji

w
∴ (A + B)T = A T + BT

www.sakshieducation.com
 www.sakshieducation.com

Theorem: If A and B are two matrices for which conformability for multiplication
is assured, then (AB)T = BTAT.

Sol. Proof: Let A = (a ij )m×n , B = (b ji ) n×p

n
AB = (cik )m×p , where cik = ∑ a ijb jk
j=1

m
(AB)T = (c′ki ) p×m , where c′ki = cik

co
A T = (a ′ji ) n×m , where a ′ji = a ij

BT = (b′kj ) p×n , where b′kj = b jk

n .
i o
n
BT ⋅ A T = (d ki ) p×m , where d ki = ∑ b′kja ′ji

at
j=1

c
n n
c′ki = cik = ∑ a ijb ji = ∑ b′kja ′ji d ki

u
j=1 j=1

∴ (AB)T = BT A T

i e d
s h
Theorem: If A and B are two invertible matrices of same type then AB is also

k
invertible and (AB)–1 = B–1A–1.

. s a
Sol. Proof: A is invertible matrix ⇒ A–1 exists and AA–1 = A–1A = I.

w
B is an invertible matrix ⇒ B–1 exists and

w
w
BB–1 = B–1B = I

Now (AB)(B−1A −1 ) = A(BB−1 )A −1

= AIA −1 = AA −1 = I
(B−1A −1 )(AB) = B−1 (A −1A)B ∴ AB is invertible and
= B−1IB = B−1B = I
∴ (AB)(B−1A −1 ) = (B−1A −1 ) = (B−1A −1 )(AB) = 1

(AB)−1 = B−1A −1 .

www.sakshieducation.com
 www.sakshieducation.com

Theorem: If A is an invertible matrix then AT is also invertible and (AT)–1 = (A–1)T.

Sol. Proof: A is invertible matrix ⇒ A–1 exists and AA–1 = A–1A = I

(AA −1 )T = (A −1A)T = IT
⇒ (A −1 )T A T = A T (A −1 )T = I
⇒ By def . (A T ) −1 = (A −1 )T

Theorem: If A is a non-singular matrix then A is invertible and A −1 =

AdjA

o m
c
.

.
det A

 a1

on
b1 c1 

i
Proof: Let A = a 2 c 2  be a non-singular matrix.

at
Sol. b2
 a 3 b3 c3 

∴ det A ≠ 0.

u c
 A1 A 2 A3 

i e d
h
AdjA =  B1 B2 B3 

s
 C1 C2 C3 

s a k
.
 a1 b1 c1   A1 A 2 A3 
A ⋅ AdjA = a 2 b2 c 2   B1 B2 B3 

w
 a 3 b3 c3   C1 C 2 C3 

w w  a1A1 + b1B1 + c1C1 a1A 2 + b1B2 + c1C 2

= a 2 A1 + b 2 B1 + c2C1 a 2 A 2 + b2 B2 + c2 C2
 a 3A1 + b3B1 + c3C1 a 3A 2 + b3 B2 + c3C2
a1A 3 + b1B3 + c1C3 
a 2 A 3 + b 2 B3 + c 2C3 
a 3A 3 + b3B3 + c3C3 

det A 0 0  1 0 0 

= 0 det A 0  = det A 0 1 0 

 0 0 det A  0 0 1 

= det A I

www.sakshieducation.com
 www.sakshieducation.com

AdjA
∴ A⋅ =I
det A

AdjA
Similarly we can prove that A ⋅ =I
det A

AdjA
∴ A−1 =
det A

o m
n . c
i o
c at
d u
h i e
k s
. s a
w w
w

www.sakshieducation.com