CHAPTER-Three

MATRICES
3.1 Definition of matrix and basic operations

The concept of a Matrix

Definition 3.1 : Definition of a Matrix

Let m, n be natural numbers. An m ×n(read ''m by n'') matrix is a collection of mn numbers
arranged in a rectangular array.
n columns
u+(v+w)=(u+v)+w

m rowsu+v=v=u
Thus,ℜ={(x1, 2− ,xn: i∈ℜforal isuchta 1≤i n}
n
( x 1 , x 2 , − −, x n )

in which each entry, 5x+ y−z=1, of the matrix is a number. An m ×nmatrix has m rows (horizontal
lines) and n columns (vertical lines).

 Remarks

1. The numbers in the above matrix are called the matrix entries and are denoted by

10 x+ 2 y −2 z=5 (which are natural numbers) with 4 x+5 y−2z=18 x=2+3t,y=−4t,z=5+t

The index i is called the row index or row subscript because it gives the position in
the horizontal lines, and j is the column index or column subscript because it gives the

position in the vertical lines. So x=2s,y=3+s,z=−3+4s is the entry which appears in the i th
row and jth
column of the matrix.
2. The plural of matrix is matrices. If each entry of a matrix is a real number / complex
number, then the matrix is called a real/ complex matrix.
 3. An mxn matrix is said to be of order mxn. If m=n, then the matrix is square of order n.

For a square matrix, the entries x=1+t,y=−2+3t,z=4−t are called the main diagonal entries.(2,4,−6)

4. We can abbreviate the above matrix by writing ( 1 , 2,−3 )

Example-1: Consider the matrix

[ ]
0 1 2
3
e √ 2 −1
A= −15
1
−3 0 10
2
Since A has three rows and four columns, we say that A is a 3x4 matrix or A is a matrix of order

3x4. Moreover, 12 ( x−1)+20 ( y−3 ) +14(z−2 )=0⇒6x+10 y+7z=50

P ( 1 ,3 , 2)
Example-2: The following matrices have the indicated orders.
(a) Order: 1x1 (c) Order: 3x3

i j k
|2 −4 4 |
4 −1 −2
= ( 4 , − 1 ,− 2 )
(b) Order: 1x4 (d) Order: 3x2

[ ]
( 2 ,−4 , 4 ) e 1
2 −1
−8 1

The Algebra of Matrices

Equality of matrices

Definition 3.2 : Definition of Equality of Matrices

x−x0 y−y0 z−z0
= =
Two Matrices A= x −x y −y z −z and B=
1 0 1 0 1 0
x1−x0,y1−y0, and z1−z0 are equal, denoted by A=B if and only if
I) they have the same order (m ×n) and

II) a ij=bij , ∀ i, j Such that P0 ( x0 , y 0 , z0 )

That is, two matrices of the same order are said to be equal if their corresponding entries are
equal.

Example-3 Equality of Matrices

Solve for ( 4 ) and W in the following matrix equation:
11 1
, ,0
4

11 1
x= and y =
4 4
Solution:
Because two matrices are equal only if the corresponding entries are equal, we conclude that:
x −2 y −4 3
= =
1 −5 4

x −2 y −4 z +3
= =
1 −5 4

Addition and subtraction of matrices

Definition 3.3: Definition of matrix Addition

Let A= x=2+t,y=4−5t,z=−3+4t be matrices of order mxn, then their sum is an mxn matrix given by
( 2 , 4 ,−3 ) That is, we add the two matrices of the same order by adding their
corresponding entries and the sum of two matrices of different orders is undefined.

Example-4: Addition of Matrices

y− y0 z− z0
v=(3−2, 1−4,1−( 3)=(1,−54)Let A =
B (3,−1,1) A(2,4,−3)
, B= C=
x= x0 , =
b c
Then find a) A+B b) A+C.
Solution:
a) Since A and B have different orders, we have A+B is undefined.

v=(a,b,c) x=5+2t,y=1+8t,z=3−4t
+

b) A+C =
Definition 3.4: Definition of Matrix Subtraction
Let A and B be two Matrices of the same order then the difference of A and B, denoted by A-
B , is defined to be the matrix obtained by subtracting each element of B from the corresponding
elements of A. That is if A=( aij ) m× n∧B=( bij ) m× n then −B=( aij −bij ) m× n .

Example-5: Subtraction of Matrices

Let A=
x=6+t,y=5+4t,z=1−2t then

(6 , 5 , 1) ( 5 , 1 ,3 ) = ( 4 ,−3 , 5 )
Note that: Two matrices of the same order are said to be conformable for addition and
subtraction. Only conformable matrices can be added or subtracted.

Multiplication of a matrix by scalar

Definition 3.5: Definition of scalar multiplication

Let ( 6 , 5 , 1) be a matrix and b be scalar, and then a scalar multiple of A by b is an mxn

matrix given by: x=5+t,y=1+4t,z=3−2t That is, bA is an mxn matrix obtained from A by multiplying each
of its elements by b.

Example-6: Scalar multiplication

Let A=
⇒r=(5+t)i+(1+4t ) j+3k )+(3−2t) k then find
a) 3A b) -B c) 3A-B

Solution: a)
r=( 5i+ j+3k ) +t ( i+4 j−2k )
b)
v=i+ 4 j−2 k
c)
r 0=( 5,1,3 )=5i+ j+3k
Note:
(1) If A is any matrix and b is any scalar then bA=Ab
(2) -A represent the scalar product (-1) A.
Algebra of matrices
Definition 3.6: Definition of Matrix multiplication

Let i+4 j−2 k be an mxn matrix and ( 5 , 1 ,3 ) is an nxp matrix, then the product AB is an mxp

matrix given by ( x , y , z ) where

v=( a,b,c )
P0 ( x0 , y 0 , z0 )

t∈ℜ element of AB is obtained by multiplying each element of the i th row of A

That is, the
(denoted by Ai) in to the corresponding element of the j th column of B (denoted by Bj ) and
adding the products or equivalently, the ij th element of AB is the dot product of the i th row
( x , y , z )=( x 0 +ta, y 0 +tb, z 0 +tc )
vector of A by the jth column vector of B and hence

Example-7: Finding the Product of two Matrices

r 0 =( x 0 , y 0 ,z 0 )
Let then find the product AB.
Solution:
First note that the product AB is defined because A has order 3x2, and will take the form.

r=( x, y ,z )
To find tv=(ta,tb ,tc ) (the entry in the first row and first column of the product) we take the dot product of
the first row of A and the first column of B That is,
 c 11 =A 1 . B =[ −1 3 ]
1
[ ]
−3
−4
=(−1 ) (−3 ) +3 (−4 )=3−12=−9

P0 ( x0 ,y0 ,z0 )
Similarly, to find we tare the dot product of the first row of A and the second column of B
1 2 3
cosα= , cosβ= ,and cos γ=
√14 √14 √ 14

and hence ( )
1
√ 14 ( )
2
√ 14 ( )
3
⇒α=cos−1 ≈740 ,β=cos−1 ≈580 and γ=cos−1 ≈370
√ 14

‖a‖=√12+22+32=√14
a =( 1 , 2 , 3 )
Continuing this pattern produces the following results.

a⋅i a a a
cos α= = 1 , cos β= 2 , and cos γ = 3
‖a‖‖i‖ ‖a‖ ‖a‖ ‖a‖

cos α ,cos β ,and cos γ

[0 , π ]
α , β , and γ v=0
Thus the product is

v . v=0
Properties of Matrix Operations
We begin by listing several properties of matrix addition and scalar multiplication
Theorem 3.7 : Properties of Matrix Addition and scalar multiplication.
Let A, B, C be an mxn matrices and c and d be scalars, then the following properties are true.
π
1. θ = 2 -------------------------- commutative property of Addition

2. cos θ < 0 Associative property of Addition

3. cos θ >0

4. 0≤θ≤π

5. θ=60 u . v ---------------------------Distributive property

0
6. u =0 or v= 0 v=(v1,v2,v3)u=(u1,u2,u3)

Theorem 3.8: Properties of zero Matrices

Let A be an mxn matrix and c be a scalar then

a) ( k+l ) u=ku+lu k(u+v)=ku+kv

b) k ( lu ) = ( kl ) u

c) u+ (−u ) =0

Theorem 3.9: Properties of Matrix Multiplication

Let A,B and C be matrices with orders such that the given matrix products are defined and b is a
scalar, then the following properties are true.
v=( v 1 , v 2 , v 3 )
---------------------Associative property of multiplication

b) yz ----------------Left distributive property

c) xz ---------------Right distributive property

d) xy

Definition 3.10: Identity matrix

A special type of square matrix of order n that has 1's on the main diagonal and 0's elsewhere is

called the identity matrix of order n and it is denoted byk>0 .

That is, |k|

kv
It serves as the identity for matrix multiplication.
For instance, if n=1, 2, or 3,we have

v −w
Theorem 3.11: Properties of the identity Matrix
If A is a matrix of order mxn, then

a) −w

b) v−w
c) If m=n then − v
Example-8:

Let
v+w=v+w
a)
w +v v + w

b)
v+ w
Types of Matrices: Square, identity, scalar, diagonal, triangular, symmetric, and
Skew symmetric matrices

1) Row Matrix: A matrix which has only one row. It is a 1xn matrix, where n is arbitrary
natural number. It is also called a row vector

Example-1: (-1 0 0 4) is a row matrix with order 1x4.

(1 -2 -3) is a 1x3 row matrix.
2) Column Matrix: A matrix which has one column. It is also called a column vector.
 Example-2:
v − u= v + ( − u ) is a 3 by 1 column matrix.
3) Zero matrix: is a matrix of arbitrary size in which all the entries are zero. It is also called
null matrix and denoted by O.
Example-3: The following are null matrices

n
ℜ
−u=(−u1 ,−u2 ,−u3 ,...,−un ) −uu ℜn
4) A square matrix: Is a matrix where the number of rows is equal to the number of columns.
It is an u=(u ,u ,u ,...,u ) matrix; where n0=( 0,0,0,... ,0)
1 2 3 n

n
Example 4:
ℜ
Square matrix of square matrix of
n
Order ℜ order ku=(ku1,ku2,ku3,. .,kun)

Let ku be a square matrix of order n, then

a) The entries u+v=( u1 +v 1 ,u2+v 2, ,...,un+v n ) are called main diagonal entries of A.
b) The sum of the main diagonal entries of A is called the trace of A and it is denoted by

u+ v That is,
u1 =v 1 ,u 2=v 2 , .. . ,u n=v n
Example-5: Find the trace of the following matrix

n
ℜ
Solution: (a)
v=( v 1 , v 2 , v3 ,. . . , vn )
 u= ( u 1 , u2 , u3 , .. . , un )
(b)

5) Diagonal Matrix: Is a square matrix in which all entries that are not on the main diagonal are
zero.
Example-6: The following are Diagonal matrices

(a)
( a 1 , a2 , a 3 )
5
(c)
ℜ
6) Scalar Matrix: Is a diagonal matrix whose main diagonal elements are equal. That is, if
a1 ,a2 , and a3 is a square matrix such that

a1 ,a2 , and a3 Where c is a scalar, then A is called scalar matrix.

Example-7:
( a1 ,a2 ,a3)
7) Identity Matrix: Is a diagonal matrix in which all the main diagonal elements are equal to 1.
It is also called a unit matrix.

Example-8: ℜ
1 ℜ are unit matrices of order 1,2 and 3 respectively
8) Upper triangular Matrix: Is a square matrix in which all the elements below the main

diagonal are zero. That is, if ℜ n is a square matrix such that n =2

then A is said to be upper triangular matrix.
 Example-9:

n=1 are upper triangular matrices of order 3 and 4

respectively.
9) Lower triangular matrix: Is a square matrix whose entries above the main diagonal are 0.

1
Example-10:
ℜ are lower triangular matrices of order 3

and 4 respectively.

Definition 3.12: The Transpose of a Matrix

Let A=[ aij ]be an m ×n matrix. Then the transpose of A , denoted by At (and sometimes by A ' ¿,
is the matrix obtained interchanging rows and columns to produce the n × m matrix
t
At =[ a ij ] =[ a ji ] .

Example-11: The Transpose of a matrix

(a)
a 1 , a2 , and a 3

(c)
(a1,a2,a3 ,.. .,an)
 5
Solution: (a)
ℜ
5
ℜ
(c)

Theorem 3.13: Properties of Transposes

Let A and B be matrices with orders such that the given matrix operations are defined and c is a
scalar, then the following properties are true

(a) ( a 1 , a2 , a 3 )

(b) u= ( u 1 , u2 , u3 , . . . , un )

(c) v = ( v 1 , v 2 , v3 , . . . , vn )

(d) ℜn

(e)
u1=v1 ,u2=v2 ,...,un=vn

Definition 3.14: A matrix A is said to be symmetric if it is equal to its transpose. That is, if A t
=A then A is called symmetric matrix.

Note: A symmetric matrix is necessarily a square matrix

Example-12: Let
u+v then since A=At we have A is symmetric
Definition 3.15: A square matrix a is said to be skew-symmetric if At = -A
 Let
u+v= ( u1 +v 1 , u2+v 2 , , . .. , un+v n )
Example-13:

Elementary Row/column Operations

1 2 3  4 5 6  1  2 1 
A   4 5 6  and B  1 2 3 , C   2 1  2 ,
 
 0 0 1  0 0 1  3 1  1
Consider the matrices
  2 4  2 1  2 1  1  2 1 
D   2 1  2 E   3 1  1  and F   0 7  4 
 3 1  1   2 1  2  2 1  2

Observe that:
I) B is obtained from A by interchanging the first and second rows of A
II) D is obtained from C by multiplying the first row of C by -2
III) F is obtained from matrix E by replacing the second row of E by a new row
This is made up by multiplying the first row by -3 and adding to the second row of E.
Such operations on rows of a matrix as described above in (i),(ii) and (iii) are called elementary
row operations. These operations will be very useful in finding inverse of a matrix and solving
systems of linear equations.
Similarly, elementary column operations can be defined. Hence we have the following
definition
Definition 3.16: An elementary operation on a matrix is either elementary row operation or
elementary column operation and is of the following three types.
Type I: The interchange of any two rows or (columns)
Type II: The multiplication of any row or (column) by a non zero number
Type III: The addition of a multiple of one row (or column) to another row (or column)

Notations: We shall use the following notations for the three types of elementary operations.
Ri  R j (C i  C j )
1. The interchange of ith and jth rows (columns) is denoted by
 2. The multiplication of the i th row (column) by a none zero number k is denoted by
k ( u+ v )=ku +kv
3. The addition of k times the j th row (column) to ith row (column) is denoted by
Ri  Ri  KR j (C  C i  kC j )

Definition 3.17 : Row Equivalent and column Equivalent Matrices

Two matrices are said to be row-equivalent or (column equivalent) if one can be obtained from
the other by a finite sequence of elementary row or (column) operations. That is,
row
A (ai j )mxn (bi j )mxn,
a) is row equivalent to B denoted by A  B, if B is attainable
from A by successive operations of finitely many elementary row operations on A.
column
A (ai j ) mxn B (bi j )mxn,  B, if B is
is column equivalent to denoted by A
b)
attainable from A by successive operations of finitely many elementary column operations on A.

Example-1
 1 2 0 1 3 3 
A   3  1 2  , B  1 4 3 
  2 3  2 1 3 4
Let then show that
1 2 0
row row
A  0  7 2 (b) B  I 3
 0 0 0 
(a)
Solution:
(a)  1 2 0  1 2 0 
  R2   3 R  R  
A  3  1 2     1 2  
 0 7 2
  3 3  2    2 3  2 


 1 3 3  1 3 3  1 3 3 
B  1 4 3       0 1 0   R3 
  R2  R2  R3 R3  R1
  0 1 0
 
1 3 4 1 3 4  0 0 1
(b)

1 0 3  1 0 0 
      0 1 0       0 1 0 

R1  R1  3 R2  R1  R1  3 R3

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

Elementary Matrices
Definition 3.18: Definition of Elementary Matrix
Let A be an nxn matrix such that A can be Obtained from In by a single elementary
row /column operation then A is called an elementary matrix.

Example-2: Elementary Matrices and Non elementary Matrices

Which of the following matrices are elementary? For those that are describe the corresponding
elementary row operation.
1 0 0 0 
 1 0 0 0 1 0 0 
A I n (b) B   0  4 0 (c ) C   
0 0 1 0 
 0 0 1  
(a)  0 0 0 0

1 0 0  1 0 0 
1 0 0
D   (e) E   0 0 1  ( f ) F   0 2 0  1 0 
 0 1 0  0 1 0  0 0  1
( g ) G  
(d)  4 1
Solution:

(a) Since
A  I n can be obtained from itself by multiplying any one of its rows by 1.

1  1 R1
(i.e. I n  R   A) we' ve I n is elementary matrix.

(b) Since B can be obtained from

I 3 by multiplying the second row of

I 3 by  4 we have I 3  R2 
 4 R2
  B and hence B is an elementary matrix.

(c) Since C is obtained by multiplying the fourth row of I 4 by 0 we have C is not

elementary matrix. Note that, row multiplication must be anon zero constant.
(d) D is not elementary because it is not square marix.
 R2  R3
(e) Since I 3     E we've E is elementary.
(f) This matrix is not elementary because two elementary row operations are required to

obtain it from
I3 .
R2  4 R1  R2
(g) Since I 2       G we have G is elementary.

Note Elementary Matrices are useful because they enable us to use matrix multiplication to
perform elementary row/ column operations.
Example-3: Elementary Matrices and Elementary Row Operations
0 1 0  1 0 0  1 0 0 
E1  1 0 0 , E 2   0 1 2 0 and E3   2 1 0 
   
 0 0 1   0 0 1  0 0 1
Let
 0 2 1 1 0  4 1   1 0 1
A1  1  3 6  , A2   0 2 6  4 and A3    2  2
    3
 3 2  1  0 1 3 1   0 4 5 
Let
Then
1  3 6 
E1 A1   0 2 1
 3 2  1
(a) , this product matrix is a matrix obtained by interchanging the first two
I
rows of A. And E1 is an elementary matrix in which the first two rows of 3 has been
interchanged.
1 0  4 1 
E 2 A2  0 1 3  2 
 0 1 3 1 
(b)
I
Here, E 2 is an elementary matrix in which the second row of 3 has been multiplied by
1
2 and
R 1 R
A  2 2 2  E 2 A2

1 0  1
E3 A3   0  2 1 I 3  R2 
2 R1  R2
  E3 and
 0 4 5  R2  2 R1  R2
(c) Here, A3       E3 A3
Definition 3.19: Let A, B be an mxn matrices. We say that A is equivalent to B, denoted by

A B , if B can be attainable from A by successive application of finitely many elementary row

or column operations.

1
Theorem 3.20 : (Elementary matrices are Invertible.) If E is an elementary matrix, then E
exists and is an elementary matrix.
Example-5:
0 1 0   1 0 0 1 0 0 
 
E1  1 0 0 , E 2   0 1 0  and E3   0 1 0  then
 0 0 1   2 0 1  0 0 12 
Let
1 0 0  1 0 0 
E 1
1
 E1 , E 1
2   0 1 0  and E 1
3   0 1 0 
 2 0 1  0 0 2

Row reduced echelon form of a Matrix

1. Row-Echelon Matrix

Definition 3.21 : Definition of Row-Echelon Form of a Matrix

A matrix is said to be in row-echelon form if
1. All the non-zero rows, if any, precede all zero rows, if any. That is, all rows
Consisting entirely of zeros occur at the bottom of the matrix.
2. In any non-zero row after the first row, the number of zeros preceding the first non-
Zero elements is greater than the number of such zeros in the preceding row.
That is, the first non-zero entry of row i+1 is to the right of the first non-zero entry
of row i.
3. The first non-zero entry in each non-zero row is 1. This entry is called a pivot or
a leading 1.

Example-1: Determine whether the given matrix is in row-echelon form or not.

  1 2  1 4 0 1 0 5 
(a)  0 1 0 3 (b)  0 0 1 3 
 
 0 0 1  2  0 0 0 0

1 2  3 4  1 2  1 2 
 0 2 1  1 (d )  0 0 0 0 
 
 0 0 1  3  0 1 1  4
(c)
Solution: The matrices shown in parts (a) and (b) are in row-echelon form, while the matrices
shown in parts (c) and (d) are not in row-echelon form.

Definition 3.22 : Definition of Reduced Row-Echelon Form of a matrix.

A matrix M in row-echelon form is in reduced row-echelon form if the first non-zero element in
each non-zero row is the only non-zero element in its column.
That is, M is in reduced row-echelon form if M is in row-echelon form and if every column that
has a leading 1 has zeros in every position above and below its leading 1.

Example-2: The following matrices are in reduced row-echelon

(a)
( k+m ) u=ku+mu
Theorem 3.23: Let A be an mxn matrix, then A is row equivalent to an mxn reduced row-
echelon form of a matrix.

 0 2 1 4 
A  3 2 0 2 
 3 3 3 4
Example- 3 Let then find the unique reduced row-echelon matrix that is row
equivalent to the matrix A.

3 2 0 2  1 2 3 0 2 3 
 
   0 2  1 4   
1
1  R2
R1  3 R1
A  R    0 2  1 4
 3 3 3 4  3 3 3 4
 
 1 2 3 0 2 3  1 2 3 0 2 3 
   0 2  1 4   2     0 1  1 2 2 
1
R  2 R2
 R3  3 R
1  R3

 0 1 3 2  0 1 3 2

1 0 1 3  2 3 
      0 1 21 2 
2
R1  R2  R1
3
1 0 1 3  2 3 
2
 0 0 7 2 0  R3  R

7 3 0 1 1 2 
 2 
R3   R2  R3  0 0 1 0

1 0 0  2 3 
      0 1 0 2
1
R1   3
R3  R1

 0 0 1 0 
R2  12 R3  R2

1 0 0  2 3 
0 1 0 2 .
 
 0 0 1 0

Thus the reduced row-echelon matrix which is equivalent to A is

Inverse of a matrix

Definition 3.24: Definition of an inverse of a matrix

An ℜn matrix A is invertible (or nonsingular) if there exists an u matrix B such that

−u is the identity matrix of order n. The matrix B is called the

(multiplicative) inverse of A. A matrix that doesn't have an inverse is called noninvertible (or
singular). The inverse of a matrix A is donated by A−u=(−u1,−u2,−u3,. ,−un)

Example-14:
Find the inverse of the following matrices

(a) ℜn
Solution:

(a) To find the inverse of A. We try to solve the matrix equation v −u= v + ( −u )
 v−u=( v 1−u1 ,v 2−u2 ,v3 −u3 ,...,v n−un )
y=( y1 , y 2 , y3 , .. . , y n )
Now, by equation the corresponding entries, we obtain the following two systems of linear
equations.

ℜ n y1 ,y2, y3 ,...,yn
x =( x1 , x 2 , x3 , . . . , x 15 )

x1
x2
Therefore, the inverse of A is

4
(b) Suppose ℜ be the inverse of B then ℜ 3 v=(v1,v2,v3,. ,vn)But,
ℜ4

w=( w1 ,w2 ,w3 ,...,wn )

3
ℜ
v=( x , y ,h,s,b ) s=( s1 ,s2,s3,...,s10)
s 1 , s2 , s3 , . . . , s10

x1 ,x 2 , x3 ,...,x 6 =v1 ,v2 ,v3,.. .,v6

 Infact, one can check that v=( x 1 ,x 2 ,x 3 ,x4 ,x5 ,x 6, v1 ,v 2 ,v 3 ,...,v 6 ,t )
Theorem 3.25: Uniqueness of an Inverses Matrix
If A is an invertible matrix, then its inverse is unique

Theorem 3.26: Properties of Inverse Matrices

Let A be an invertible matrix, K  N and C is a scalar then the following are true
1 1
(a) ( A )  A
k 1 1 1
(b) ( A )  A A    A
1
K factors
1 1 1
(c) (cA)  c A ; c 0
( A t )  1 ( A  1 ) t
(d)

Theorem 3.27: The inverse of a product

Let A and B be invertible matrices of order n, then AB is invertible and
1 1 1
(AB)  B A

Theorem 3.28 : Cancellation Properties

Let C be an invertible matrix, then the following properties hold.

(a) If AC  BC , then A  B ------------- Right cancellation property

(b) If CA  CB, then A  B ------------- Left cancellation property

Elementary Matrices and Non singularity

Recall that an elementary matrix is nonsingular as the inverse of the elementary operation
Ri  R j , Ri  CRi and Ri  CR j  Ri are Ri  R j , Ri  1
c Ri and
Ri  Ri  CR j respective ly.
 I
Theorem 3.29: Let A be an nxn matrix then A is row-equivalent to n if and only if A is
nonsingular

Corollary: A property of Invertible Matrices

A square matrix A of order n is invertible if and only if it can be written as a product of
elementary matrices.

I
Corollary: Let A be an nxn matrix. If A can be reduced to n by a sequence of elementary row

operations, then the same sequence of elementary row operations performed on

I n produces

A 1.
Example-5: Finding the Inverse of a matrix
 1 1 0 
A   1 0  3  then find its inverse .
  6 2 3

Solution
We begin by adjoining the identity matrix to A to form the matrix
   2  3  1
A    3  3  1 
1

  2  4  1
, A is invertible and its inverse is

Therefore