MAT1320-Linear Algebra

Lecture Notes
Echelon Form of a Matrix

Mehmet E. KÖROĞLU
Spring 2022
Yıldız Technical University, Department of Mathematics
[email protected]
Table of contents

1. Echelon Form of a Matrix

2. Elementary Row (Column) Operations

3. Finding an Inverse using Elementary Row Operations

Mehmet E. KÖROĞLU 1
Echelon Form of a Matrix
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

a) All zero rows, if there are any, appear at the bottom of the
matrix.

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

a) All zero rows, if there are any, appear at the bottom of the
matrix.
b) The first nonzero entry from the left of a nonzero row is a 1.

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

a) All zero rows, if there are any, appear at the bottom of the
matrix.
b) The first nonzero entry from the left of a nonzero row is a 1.
This entry is called a leading one of its row.

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

a) All zero rows, if there are any, appear at the bottom of the
matrix.
b) The first nonzero entry from the left of a nonzero row is a 1.
This entry is called a leading one of its row.
c) For each nonzero row, the leading one appears to the right
and below any leading ones in preceding rows.

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

An m × n matrix A is said to be in reduced row echelon form

(RREF) if it satisfies the following properties:

a) All zero rows, if there are any, appear at the bottom of the
matrix.
b) The first nonzero entry from the left of a nonzero row is a 1.
This entry is called a leading one of its row.
c) For each nonzero row, the leading one appears to the right
and below any leading ones in preceding rows.
d) If a column contains a leading one, then all other entries in
that column are zero.

Mehmet E. KÖROĞLU 2
Echelon Form of a Matrix

• A matrix in reduced row echelon form appears as a staircase

("echelon") pattern of leading ones descending from the upper
left corner of the matrix.

Mehmet E. KÖROĞLU 3
Echelon Form of a Matrix

• A matrix in reduced row echelon form appears as a staircase

("echelon") pattern of leading ones descending from the upper
left corner of the matrix.
• An,m × n matrix satisfying properties a ), b ), and c ) is said to
be in row echelon form (REF). There may be no zero rows.

Mehmet E. KÖROĞLU 3
Echelon Form of a Matrix

• A matrix in reduced row echelon form appears as a staircase

("echelon") pattern of leading ones descending from the upper
left corner of the matrix.
• An,m × n matrix satisfying properties a ), b ), and c ) is said to
be in row echelon form (REF). There may be no zero rows.
• A similar definition can be formulated in the obvious manner
for reduced column echelon form and column echelon form.

Mehmet E. KÖROĞLU 3
Echelon Form of a Matrix

Example
The following are matrices in reduced row echelon form, since they
satisfy properties a ), b ), and d ):

1 0 0 0
 

0 1 0 0
 
,
 
A=

 0 0 1 0 

0 0 0 1

Mehmet E. KÖROĞLU 4
Echelon Form of a Matrix

Example
The following are matrices in reduced row echelon form, since they
satisfy properties a ), b ), and d ):
 
1 0 0 0 −2 4
1 0 0 0
 
0 1 0 0 4 8 
 

 0 1 0 0
   
, 0 0 0 1 7 −2 

A= B=
 
 0 0 1 0 
0 0 0 0 0 0 
   

0 0 0 1  
0 0 0 0 0 0

Mehmet E. KÖROĞLU 4
Echelon Form of a Matrix

Example
The following are matrices in reduced row echelon form, since they
satisfy properties a ), b ), and d ):
 
1 0 0 0 −2 4
1 0 0 0
 
0 1 0 0 4 8 
 

 0 1 0 0
   
, 0 0 0 1 7 −2 

A= B=
 
 0 0 1 0 
0 0 0 0 0 0 
   

0 0 0 1  
0 0 0 0 0 0

and  
1 2 0 0 1
C = 0 0 1 2 3 
 


0 0 0 0 0

Mehmet E. KÖROĞLU 4
Echelon Form of a Matrix

Example
The matrices that follow are not in reduced row echelon form.
(Why not?)
 
1 2 0 4
D= 0 0 0 0 ,
 

0 0 1 −3

Mehmet E. KÖROĞLU 5
Echelon Form of a Matrix

Example
The matrices that follow are not in reduced row echelon form.
(Why not?)
   
1 2 0 4 1 0 3 4
D= 0 0 0 0 , E =  0 2 −2 5 
   
 

0 0 1 −3 0 0 1 2

Mehmet E. KÖROĞLU 5
Echelon Form of a Matrix

Example
The matrices that follow are not in reduced row echelon form.
(Why not?)
   
1 2 0 4 1 0 3 4
D= 0 0 0 0 , E =  0 2 −2 5 
   
 

0 0 1 −3 0 0 1 2

1 0 3 4
 

0 1 −2 5 
 
,

F =

 0 1 2 2 
0 0 0 0

Mehmet E. KÖROĞLU 5
Echelon Form of a Matrix

Example
The matrices that follow are not in reduced row echelon form.
(Why not?)
   
1 2 0 4 1 0 3 4
D= 0 0 0 0 , E =  0 2 −2 5 
   
 

0 0 1 −3 0 0 1 2

1 0 3 4 1 2 3 4
   

0 1 −2 5  0 1 −2 5 
   
,
 
F = G = 

 0 1 2 2 

 0 0 1 2 
0 0 0 0 0 0 0 0

Mehmet E. KÖROĞLU 5
Echelon Form of a Matrix

Example
The following are matrices in row echelon form.
 
1 5 0 2 −2 4
0 1 0 3 4 8 
 

 
H= 0 0 0 1 7 −2  ,
 

0 0 0 0 0 0 
 

 
0 0 0 0 0 0

Mehmet E. KÖROĞLU 6
Echelon Form of a Matrix

Example
The following are matrices in row echelon form.
 
1 5 0 2 −2 4
1 0 0 0
 
0 1 0 3 4 8 
 

0 1 0 0
   
0 0 0 1 7 −2  ,
 
H= I=
  
 0 0 1 0 
0 0 0 0 0 0 
   

 
0 0 0 1
0 0 0 0 0 0

Mehmet E. KÖROĞLU 6
Echelon Form of a Matrix

Example
The following are matrices in row echelon form.
 
1 5 0 2 −2 4
1 0 0 0
 
0 1 0 3 4 8 
 

0 1 0 0
   
0 0 0 1 7 −2  ,
 
H= I=
  
 0 0 1 0 
0 0 0 0 0 0 
   

 
0 0 0 1
0 0 0 0 0 0

Note: We shall now show that every matrix can be put into row
(column) echelon form, or into reduced row (column) echelon
form, by means of certain row (column) operations.

Mehmet E. KÖROĞLU 6
Elementary Row (Column)
Operations
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.
3. Type III: Add a multiple of one row (column) to another.

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.
3. Type III: Add a multiple of one row (column) to another.
We now introduce the following notation for elementary row and
elementary column operations on matrices:

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.
3. Type III: Add a multiple of one row (column) to another.
We now introduce the following notation for elementary row and
elementary column operations on matrices:
• Interchange rows (columns) i and j, Type I: ri ↔ rj
(ci ↔ cj )

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.
3. Type III: Add a multiple of one row (column) to another.
We now introduce the following notation for elementary row and
elementary column operations on matrices:
• Interchange rows (columns) i and j, Type I: ri ↔ rj
(ci ↔ cj )
• Replace row (column) i by k times row (column ) i, Type II:
kri → ri (kci → ci )

Mehmet E. KÖROĞLU 7
Elementary Row (Column) Operations

An elementary row (column) operation on a matrix A is any one of

the following operations:
1. Type I: Interchange any two rows (columns).
2. Type II: Multiply a row (column) by a nonzero number.
3. Type III: Add a multiple of one row (column) to another.
We now introduce the following notation for elementary row and
elementary column operations on matrices:
• Interchange rows (columns) i and j, Type I: ri ↔ rj
(ci ↔ cj )
• Replace row (column) i by k times row (column ) i, Type II:
kri → ri (kci → ci )
• Replace row (column) j by k times row (column) i + row
(column) j, Type III: kri + rj → rj (kci + cj → cj )
Mehmet E. KÖROĞLU 7
Echelon Form of a Matrix

Example 
0 0 1 2
Let A = 
 2 3 0 −2  .
 

3 3 6 −9

Mehmet E. KÖROĞLU 8
Echelon Form of a Matrix

Example 
0 0 1 2
Let A =  2 3 0 −2  .
 

3 3 6 −9
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ↔r3 

0 0 1 2

Mehmet E. KÖROĞLU 8
Echelon Form of a Matrix

Example 
0 0 1 2
Let A =  2 3 0 −2  .
 

3 3 6 −9
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ↔r3 

0 0 1 2

Multiplying the third row of A by 13 , we obtain

 
0 0 1 2
2 3 0
 
C = A 1 r3 →r3 = −2 
3  
1 1 2 −3
Mehmet E. KÖROĞLU 8
Echelon Form of a Matrix

Adding (−2) times row 2 of A to row 3 of A, we obtain

 
0 0 1 2
= 2 3 0 −2 
 
D = A−2r2 +r3 →r3 

−1 −3 6 −5

Mehmet E. KÖROĞLU 9
Echelon Form of a Matrix

Adding (−2) times row 2 of A to row 3 of A, we obtain

 
0 0 1 2
= 2 3 0 −2 
 
D = A−2r2 +r3 →r3 

−1 −3 6 −5

Observe that in obtaining D from A, row 2 of A did not change.

Mehmet E. KÖROĞLU 9
Echelon Form of a Matrix

Adding (−2) times row 2 of A to row 3 of A, we obtain

 
0 0 1 2
= 2 3 0 −2 
 
D = A−2r2 +r3 →r3 

−1 −3 6 −5

Observe that in obtaining D from A, row 2 of A did not change.

Note: An m × n matrix B is said to be row (column) equivalent to
an m × n matrix A if B can be produced by applying a finite
sequence of elementary row (column) operations to A.

Mehmet E. KÖROĞLU 9
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3

Mehmet E. KÖROĞLU 10
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3
If we add 2 times row 3 of A to its second row, we obtain
 
1 2 4 3
=  4 −3 7 8 
 
B = A2r3 +r2 →r2 

1 −2 2 3

Mehmet E. KÖROĞLU 10
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3
If we add 2 times row 3 of A to its second row, we obtain
 
1 2 4 3
=  4 −3 7 8 
 
B = A2r3 +r2 →r2 

1 −2 2 3

so B is row equivalent to A.

Mehmet E. KÖROĞLU 10
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3
If we add 2 times row 3 of A to its second row, we obtain
 
1 2 4 3
=  4 −3 7 8 
 
B = A2r3 +r2 →r2 

1 −2 2 3

so B is row equivalent to A. Multiplying row 1 of B by 2, we obtain

 
2 4 8 6
=  4 −3 7 8 
 
C = B2r1 →r1 

1 −2 2 3

Mehmet E. KÖROĞLU 10
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3
If we add 2 times row 3 of A to its second row, we obtain
 
1 2 4 3
=  4 −3 7 8 
 
B = A2r3 +r2 →r2 

1 −2 2 3

so B is row equivalent to A. Multiplying row 1 of B by 2, we obtain

 
2 4 8 6
=  4 −3 7 8 
 
C = B2r1 →r1 

1 −2 2 3

so C is row equivalent to B.

Mehmet E. KÖROĞLU 10
 Example 
1 2 4 3
Let A =  2 1 3 2 
 
 
1 −2 2 3
If we add 2 times row 3 of A to its second row, we obtain
 
1 2 4 3
=  4 −3 7 8 
 
B = A2r3 +r2 →r2 

1 −2 2 3

so B is row equivalent to A. Multiplying row 1 of B by 2, we obtain

 
2 4 8 6
=  4 −3 7 8 
 
C = B2r1 →r1 

1 −2 2 3

so C is row equivalent to B. It then follows that C is row

equivalent to A, since we obtained C by applying two successive
Mehmet E. KÖROĞLU 10
elementary row operations to A.
Echelon Form of a Matrix

Theorem
Every nonzero m × n matrix A = [aij ] is row (column) equivalent
to a matrix in row (column) echelon form.

Mehmet E. KÖROĞLU 11
Echelon Form of a Matrix

Theorem
Every nonzero m × n matrix A = [aij ] is row (column) equivalent
to a matrix in row (column) echelon form.

Theorem
The RREF of a matrix is unique.

Mehmet E. KÖROĞLU 11
Echelon Form of a Matrix

Theorem
Every nonzero m × n matrix A = [aij ] is row (column) equivalent
to a matrix in row (column) echelon form.

Theorem
The RREF of a matrix is unique.

Note: In any matrix, the first column with a nonzero entry is

called the pivot column; the first nonzero entry in the pivot column
is called the pivot.

Mehmet E. KÖROĞLU 11
Echelon Form of a Matrix

Theorem
Every nonzero m × n matrix A = [aij ] is row (column) equivalent
to a matrix in row (column) echelon form.

Theorem
The RREF of a matrix is unique.

Note: In any matrix, the first column with a nonzero entry is

called the pivot column; the first nonzero entry in the pivot column
is called the pivot.
Example 
0 0 1 2
Let A =  2 3 0 −2 
 . Find REF and RREF of A.
 

3 3 6 −9

Mehmet E. KÖROĞLU 11
Echelon Form of a Matrix

Theorem
Every nonzero m × n matrix A = [aij ] is row (column) equivalent
to a matrix in row (column) echelon form.

Theorem
The RREF of a matrix is unique.

Note: In any matrix, the first column with a nonzero entry is

called the pivot column; the first nonzero entry in the pivot column
is called the pivot.
Example 
0 0 1 2
Let A =  2 3 0 −2 
 . Find REF and RREF of A.
 

3 3 6 −9

Mehmet E. KÖROĞLU 11
 Example (cont.)
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ←→r3 

0 0 1 2

Mehmet E. KÖROĞLU 12
 Example (cont.)
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ←→r3 

0 0 1 2

Multiplying the first row of B by 13 , we obtain

 
1 1 2 −3
=  2 3 0 −2 
 
C = B 1 r1 →r1 
3 
0 0 1 2

Mehmet E. KÖROĞLU 12
 Example (cont.)
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ←→r3 

0 0 1 2

Multiplying the first row of B by 13 , we obtain

 
1 1 2 −3
=  2 3 0 −2 
 
C = B 1 r1 →r1 
3 
0 0 1 2

Adding (−2) times row 1 of C to row 2 of C , we obtain

 
1 1 2 −3
=  0 1 −4 4 
 
D = C−2r1 +r2 →r2 

0 0 1 2
Mehmet E. KÖROĞLU | {z } 12
REF
 Example (cont.)
Interchanging rows 1 and 3 of A, we obtain
 
3 3 6 −9
=  2 3 0 −2 
 
B = Ar1 ←→r3 

0 0 1 2

Multiplying the first row of B by 13 , we obtain

 
1 1 2 −3
=  2 3 0 −2 
 
C = B 1 r1 →r1 
3 
0 0 1 2

Adding (−2) times row 1 of C to row 2 of C , we obtain

 
1 1 2 −3
=  0 1 −4 4 
 
D = C−2r1 +r2 →r2 

0 0 1 2
Mehmet E. KÖROĞLU | {z } 12
REF
 Example (cont.)
Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of
D to row 2 of D, we obtain
 
1 1 0 −7
=  0 1 0 12 
 
E =D 4r3 +r2 →r2

−2r3 +r1 →r1

0 0 1 2

Mehmet E. KÖROĞLU 13
 Example (cont.)
Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of
D to row 2 of D, we obtain
 
1 1 0 −7
=  0 1 0 12 
 
E =D 4r3 +r2 →r2

−2r3 +r1 →r1

0 0 1 2

Adding (−1) times row 2 of E to row 1 of E , we obtain

 
1 0 0 −19
= 0 1 0 12 
 
F = E−r2 +r1 →r1 

0 0 1 2
| {z }
RREF

Mehmet E. KÖROĞLU 13
 Example (cont.)
Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of
D to row 2 of D, we obtain
 
1 1 0 −7
=  0 1 0 12 
 
E =D 4r3 +r2 →r2

−2r3 +r1 →r1

0 0 1 2

Adding (−1) times row 2 of E to row 1 of E , we obtain

 
1 0 0 −19
= 0 1 0 12 
 
F = E−r2 +r1 →r1 

0 0 1 2
| {z }
RREF

Note: The number of nonzero rows in the REF or RREF of a

matrix A is called the rank of A and denoted by rank (A) .
Mehmet E. KÖROĞLU 13
 Example (cont.)
Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of
D to row 2 of D, we obtain
 
1 1 0 −7
=  0 1 0 12 
 
E =D 4r3 +r2 →r2

−2r3 +r1 →r1

0 0 1 2

Adding (−1) times row 2 of E to row 1 of E , we obtain

 
1 0 0 −19
= 0 1 0 12 
 
F = E−r2 +r1 →r1 

0 0 1 2
| {z }
RREF

Note: The number of nonzero rows in the REF or RREF of a

matrix A is called the rank of A and denoted by rank (A) . The
rank of matrix A given in the previous example is 3.
Mehmet E. KÖROĞLU 13
Finding an Inverse using Elementary
Row Operations
Finding an Inverse using Elementary Row Operations

• If the inverse of a matrix A exists, then there is a series of

elementary row operations that reduces A to the identity
matrix.

Mehmet E. KÖROĞLU 14
Finding an Inverse using Elementary Row Operations

• If the inverse of a matrix A exists, then there is a series of

elementary row operations that reduces A to the identity
matrix.
• Suppose the required elementary row operations are (in
order) E1 , E2 , . . . , En , then

En . . . E2 E1 A = I

which means that En . . . E2 E1 = A−1 .

Mehmet E. KÖROĞLU 14
Finding an Inverse using Elementary Row Operations

• If the inverse of a matrix A exists, then there is a series of

elementary row operations that reduces A to the identity
matrix.
• Suppose the required elementary row operations are (in
order) E1 , E2 , . . . , En , then

En . . . E2 E1 A = I

which means that En . . . E2 E1 = A−1 .

• Furthermore, because

En . . . E2 E1 I = En . . . E2 E1

we can use the following technique:

Mehmet E. KÖROĞLU 14
Finding an Inverse using Elementary Row Operations

• Write A and I side-by-side.

Mehmet E. KÖROĞLU 15
Finding an Inverse using Elementary Row Operations

• Write A and I side-by-side.

• Then apply the same row operations to both A and I until A
is reduced to the identity matrix.

Mehmet E. KÖROĞLU 15
Finding an Inverse using Elementary Row Operations

• Write A and I side-by-side.

• Then apply the same row operations to both A and I until A
is reduced to the identity matrix.
• At the same time, the identity matrix will be "reduced" to the
inverse matrix.

A I
E1 A E1 I
E2 E1 A E2 E1 I
En . . . E2 E1 A En . . . E2 E1 I
| {z } | {z }
reduced to I A−1

Mehmet E. KÖROĞLU 15
Finding an Inverse using Elementary Row Operations

• Write A and I side-by-side.

• Then apply the same row operations to both A and I until A
is reduced to the identity matrix.
• At the same time, the identity matrix will be "reduced" to the
inverse matrix.

A I
E1 A E1 I
E2 E1 A E2 E1 I
En . . . E2 E1 A En . . . E2 E1 I
| {z } | {z }
reduced to I A−1

Here is the fully worked out example:

Mehmet E. KÖROĞLU 15
 Example 
3 3 6
Let A =  2 3 0  . By using elementary row operations, find
 

0 0 1
the inverse of the A.

Mehmet E. KÖROĞLU 16
 Example 
3 3 6
Let A =  2 3 0  . By using elementary row operations, find
 

0 0 1
the inverse of the A.
 
3 3 6 1 0 0
 2 3 0 0 1 0 
 
B = [A|I3 ] =  
0 0 1 0 0 1

Mehmet E. KÖROĞLU 16
 Example 
3 3 6
Let A =  2 3 0  . By using elementary row operations, find
 

0 0 1
the inverse of the A.
 
3 3 6 1 0 0
 2 3 0 0 1 0 
 
B = [A|I3 ] =  
0 0 1 0 0 1

Multiplying the first row of B by 13 , we obtain

 
1 1 2 1
3 0 0
 2 3 0 0 1 0 
 
C = B 1 r1 →r1 =
3 
0 0 1 0 0 1

Mehmet E. KÖROĞLU 16
 Example (cont.)
Adding (−2) times row 1 of C to row 2 of C , we obtain
 
1 1 2 1
30 0
 0 1 −4 1 0 
−2
 
D = C−2r1 +r2 →r2  3 
0 0 1 0 0 1

Mehmet E. KÖROĞLU 17
 Example (cont.)
Adding (−2) times row 1 of C to row 2 of C , we obtain
 
1 1 2 1
3 0 0
 0 1 −4 1 0 
−2
 
D = C−2r1 +r2 →r2  3 
0 0 1 0 0 1

Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of

D to row 2 of D, we obtain
 
1 1 0 1
30 −2
= 0 1 0 −2
1 4 
 
E =D 4r3 +r2 →r2

3
−2r3 +r1 →r1

0 0 1 0 0 1

Mehmet E. KÖROĞLU 17
 Example (cont.)
Adding (−2) times row 1 of C to row 2 of C , we obtain
 
1 1 2 1
3 0 0
 0 1 −4 1 0 
−2
 
D = C−2r1 +r2 →r2  3 
0 0 1 0 0 1

Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of

D to row 2 of D, we obtain
 
1 1 0 1
30 −2
= 0 1 0 −2
1 4 
 
E =D 4r3 +r2 →r2

3
−2r3 +r1 →r1

0 0 1 0 0 1

Adding (−1) times row 2 of E to row 1 of E , we obtain

 
1 0 0 1 −1 −6
 0 1 0 1 4 
−2
 
E = 3
−r2 +r1 →r1

Mehmet E. KÖROĞLU 0 0 1 0 0 1 17
 Example (cont.)
Adding (−2) times row 1 of C to row 2 of C , we obtain
 
1 1 2 1
3 0 0
 0 1 −4 1 0 
−2
 
D = C−2r1 +r2 →r2  3 
0 0 1 0 0 1

Adding (−2) times row 3 of D to row 1 of D and 4 times row 3 of

D to row 2 of D, we obtain
 
1 1 0 1
30 −2
= 0 1 0 −2
1 4 
 
E =D 4r3 +r2 →r2

3
−2r3 +r1 →r1

0 0 1 0 0 1

Adding (−1) times row 2 of E to row 1 of E , we obtain

   
1 0 0 1 −1 −6 1 −1 −6
−1
 0 1 0 1 , A = 
4  1 .
4 
−2 −2
   
E = 3

3
−r2 +r1 →r1
Mehmet E. KÖROĞLU 0 0 1 0 0 1 0 0 1 17
 ?

Mehmet E. KÖROĞLU 17