CITY COLLEGE OF CALAMBA

ALG 101

ALGEBRA
ALG
101

REVIEWER
ALG
101

MATRICES AND
SYSTEMS OF LINEAR
EQUATIONS
TRANSFORMING SYSTEMS OF EQUATIONS INTO AUGMENTED
MATRIX

What is the corresponding augmented matrix of the system

of linear equation below?

1 −2 3 9
0 1 3 5
0 0 1 2
ALG 101 Linear Algebra
Systems of Linear Equations

Augmented Matrices and Elementary Row Operations

a11 a12  a1n b1 
a  ➢ the rectangular array form
 21 a22    a2 n b2 
     
➢The rectangular array of all the
  numerical coefficients and the constant
am1 am 2  amn bm 
term of the general form of the linear
systems is called augmented matrix
for the system.

ALG 101 Linear Algebra

Systems of Linear Equations

Augmented Matrices and Elementary Row Operations

a11x1 + a12x2 +    + a1n xn = b1
a21x1 + a22x2 +    + a2n xn = b2
➢ the general form of a linear system
   
am1x1 + am2 x2 +    + am nxn = bm

a11 a12  a1n b1 

a a22    a2 n b2 
 21 ➢ the rectangular array form
     
 
am1 am 2  amn bm 

ALG 101 Linear Algebra

Systems of Linear Equations
Augmented Matrices and Elementary Row Operations
For example, the augmented matrix for the system of equations

ALG 101 Linear Algebra

Systems of Linear Equations
Example 1.3 Write the augmented matrix form of the linear systems below:

x − 2 y + 3z = 9  1 −2 3 9 
 − 1 3 0 − 4
1.) − x + 3 y = −4  
2 x − 5 y + 5 z = 17  2 − 5 5 17 

x2 + x3 − 2 x4 = −3 0 1 1 −2 −3 
1 −1 
2.) x1 + 2 x2 − x3 =2  2 0 2 
2 x1 + 4 x2 + x3 − 3x4 = −2 2 4 1 −3 −2
 
x1 − 4 x2 − 7 x3 − x4 = −19 1 −4 −7 −1 − 19

ALG 101 Linear Algebra

Systems of Linear Equations

Determine the linear systems that corresponds to the augmented matrix

1 −1 3
.
5 6 −4

ALG 101 Linear Algebra

Systems of Linear Equations
Example 1.3 Write the augmented matrix form of the linear systems below:
x − 2 y + 3z = 9 1 −2 3 9
consistent/one
4.) y + 3z = 5 0 
1 3 5 unique solution

z=2  0 0 1 2 
x1 − 3 x 2 + x 3 = 1 1 − 3 1 1
4  4  inconsistent/
5 .) x 2 − x3 = 0 0 1 − 5 0 no solution
5 0 0 
− 2
 0
0 = −2

ALG 101 Linear Algebra

Systems of Linear Equations
Example 1.3 Write the augmented matrix form of the linear systems below:

x1 −3x3 =−1 1 0 −3 − 1
consistent/
0 −1 
6.) x2 − x3 =0  1 0 infinitely
many
0=0 0 0 0 0  solutions

ALG 101 Linear Algebra

ROW ECHELON FORM AND REDUCED
ROW – ECHELON FORM
 Solve for the unknowns using the elementary row operations.

Row-Echelon Form 1 𝑎 𝑏 𝑑
1) All rows consisting entirely of zeros 0 1 𝑐 𝑒
occur at the bottom of the matrix.
2) For each row that does not consist
0 0 0 0
entirely of zeros, the first nonzero
entry is 1 (called a leading 1). 1 𝑎 𝑏 𝑑
3) For each nonzero row, the leading 0 1 𝑐 𝑒
one appears to the right and below
any leading ones in preceding rows. 0 0 1 𝑓
Note: a, b,c,d,e, and f are real numbers.
ALG 101 Linear Algebra
 Solve for the unknowns using the elementary row operations.

Row-Echelon Form
Example 1.4. The following matrices are in row-echelon form:

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

ALG 101 Linear Algebra

 Solve for the unknowns using the elementary row operations.

Reduced Row-Echelon Form 1 0 0 𝑑

1) All rows consisting entirely of zeros 0 1 0 𝑒
occur at the bottom of the matrix.
2) For each row that does not consist entirely
0 0 0 0
of zeros, the first nonzero entry is 1
(called a leading 1).
1 0 0 𝑎
3) For each nonzero row, the leading one
appears to the right and below any leading 0 1 0 𝑏
ones in preceding rows. 0 0 1 𝑐
4) If a column contains a leading one, then
all other entries in that column are zero.
ALG 101 Linear Algebra
 Solve for the unknowns using the elementary row operations.

Reduced Row-Echelon Form

Example 1.5. The following matrices are in reduced row-echelon form:
1 0 0 1 1 0 0
    0 0
1. 0 1 0 2 3. 0 1 0 5.  
0 0 1 3 0 0 1 0 0
1 2 0 0 1 0 1 − 2 0 1
0 

2. 0 0 1 2 3  4. 
0 0 1 3
0 0 0 0 0
0 0 0 0 0  
0 0 0 0 0

ALG 101 Linear Algebra

 Drills. Determine whether the following matrices are in row-echelon
form (REF) or in reduced row-echelon form (RREF).

1 2 0 4  RREF 1 2 0 0 1 RREF

1. 0 0 0 0   
3. 0 0 1 2 3
0 0 1 − 3 1 1 REF
0 0 0 0 0 5.  
0 1
1 0 3 4
0 1 −2 
5  Neither 1 0 3 −1 RREF
2.   
0 1 2 2 4. 0 1 − 4 2 
  0 0 0 0 
0 0 0 0

ALG 101 Linear Algebra

ROW OPERATIONS
➢ To solve a system that is not in row-echelon form, first
change it to an equivalent system that is in row-echelon
form by using the operations below:

1) Interchange two equations.

2) Multiply an equation by a nonzero constant.
3) Add a multiple of an equation to another equation.

ELEMENTARY ROW OPERATIONS

ALG 101 Linear Algebra
Systems of Linear Equations

➢ Rewriting a system of linear equations in row-echelon form

usually involves a chain of equivalent systems, each of
which is obtained by using one of the three basic operations.
This process is called Gaussian Elimination, after the
German mathematician Carl Friedrich Gauss (1777–1855).

ALG 101 Linear Algebra

Systems of Linear Equations

Gaussian Elimination
1. Write the augmented matrix of the system of linear
equations.
2. Use elementary row operations to rewrite the
augmented matrix in row-echelon form.
3. Write the system of linear equations corresponding to
the matrix in row-echelon form, and use back-
substitution to find the solution.

ALG 101 Linear Algebra

Systems of Linear Equations (Gaussian Elimination)
Since the rows of an augmented matrix correspond to the
equations in the associated system, the three operations in
transforming linear systems to row-echelon form
correspond to the following operations on the rows of the
augmented matrix:
1. Interchange two rows. (Ri Rj)
2. Multiply a row by a nonzero constant. (cRi)
3. Add a multiple of a row to another row. (cRi + Rj)

These are called elementary row operations on a matrix.

ALG 101 Linear Algebra

 Solve for the unknowns using Gauss-Jordan Elimination.
𝑥+𝑦−𝑧 =7
ቐ𝑥 − 𝑦 + 2𝑧 = 3
2𝑥 + 𝑦 + 𝑧 = 9

ALG 101 Linear Algebra

 Solve for the unknowns using Gauss-Jordan Elimination.
𝑥+𝑦−𝑧 =7
ቐ𝑥 − 𝑦 + 2𝑧 = 3
2𝑥 + 𝑦 + 𝑧 = 9

ALG 101 Linear Algebra

 Solve for the unknowns using Gauss-Jordan Elimination.

x1 + x2 + 2 x3 = 9
2 x1 + 4 x2 − 3 x3 = 1
3 x1 + 6 x2 − 5 x3 = 0

ALG 101 Linear Algebra

 Solve for the unknowns using the elementary row operations.

ALG 101 Linear Algebra

 Solve the following system using Gauss-Jordan Elimination.

ALG 101 Linear Algebra

 Solve the following system using Gauss-Jordan Elimination.

ALG 101 Linear Algebra

 Solve for the unknowns using the elementary row operations.

Row-Echelon Form
Note: A matrix in row echelon form has zeros below each leading 1, whereas a matrix in
reduced row echelon form has zeros below and above each leading 1. Thus, with
any real numbers substituted for the *'s, all matrices of the following types are in row
echelon form:
1 * * *
1 * * * 0 
1 * *
0 1 * 
* 3.  0 1 * * * * * * * *
1.  0 0 0 0 0 
0 *    0 0 1 * * * * * *
0 1 1 * * * 0 0 0 0
  0  4. 0 0 0 0 1 * * * * *
0 0 0 1 1 * *
2.   
0 0 1 * 0 0 0 0 0 1 * * * *
  
0 0 0 0 0 0 0 0 0 0 0 0 1 *

ALG 101 Linear Algebra
 Solve for the unknowns using the elementary row operations.

Reduced Row-Echelon Form

All matrices of the following types are in reduced row echelon form:
1 0 0 0 1 0 0 * 1 0 * * 0 1 * 0 0 0 * * 0 *
0  0  0  0 0 0 1 0 0 * * 0 * 
1 0 0 1 0 * 1 * * 
1.  2.  3.  4. 0 0 0 0 1 0 * * 0 *
0 0 1 0 0 0 1 * 0 0 0 0  
      0 0 0 0 0 1 * * 0 *
0 0 0 1 0 0 0 0 0 0 0 0  0 0 0 0 0 0 0 0 1 * 

ALG 101 Linear Algebra

Systems of Linear Equations
Gauss-Jordan Elimination
1. Continues the reduction process in Gaussian Elimination until a
reduced row-echelon form is obtained.
2. Consider the resulting equation that is in row-echelon form
x1 + x2 + 2 x3 = 9 1 1 2 9 
2 x1 + 4 x2 − 3x3 = 1  0 1 − 4 − 10 
 
3x1 + 6 x2 − 5 x3 = 0 0 0 1 3 
3. Continue the reduction process until a reduced row-echelon form is
obtained.
ALG 101 Linear Algebra
Systems of Linear Equations (Gauss-Jordan Elimination)
Solution:
x1 + x2 + 2 x3 = 9 Augmented 1 1 2 9 
x2 − 4 x3 = −10
Matrix 0 1 − 4 − 10
 
x3 = 3 0 0 1 3 

-R2 + R1 R1 1 0 6 19 
0 1 − 4 − 10
 
0 0 1 3 
ALG 101 Linear Algebra
Systems of Linear Equations (Gauss-Jordan Elimination)
Solution:
-R2 + R1 R1 1 0 6 19 
0 1 − 4 − 10
 
0 0 1 3 
4R3 + R2 R2 1 0 6 19
0 1 0 2 
 
0 0 1 3 
ALG 101 Linear Algebra
Systems of Linear Equations (Gauss-Jordan Elimination)
Solution: 4R3 + R2 R2 1 0 6 19
0 1 0 2 
 
0 0 1 3 
-6R3 + R1 R1 1 0 0 1 
0 1 0 2  reduced
  row-echelon
form
0 0 1 3
Clearly, x1 = 1, x2 = 2, and x3 = 3
ALG 101 Linear Algebra
 3.1 Introduction to Determinants
Definition
The determinant of a 2  2 matrix A is denoted |A| and is given
by
a11 a12
= a11a22 − a12 a21
a21 a22
Observe that the determinant of a 2  2 matrix is given by the
different of the products of the two diagonals of the matrix.
The notation det(A) is also used for the determinant of A.
Example 1

A=  2 4 
− 3 1
det( A) = 2 4 = (2 1) − (4  (−3)) = 2 + 12 = 14
−3 1
Ch03_34
Definition
Let A be a square matrix.
The minor of the element aij is denoted Mij and is the determinant
of the matrix that remains after deleting row i and column j of A.
The cofactor of aij is denoted Cij and is given by
Cij = (–1)i+j Mij
Note that Cij = Mij or −Mij .

Ch03_35
 Example 2
Determine the minors and cofactors of the elements a11 and a32 of
the following matrix A.
1 0 3
A =  4 − 1 2
0 − 2 1
Solution
1 0 3
Minor of a11 : M 11 = 4 − 1 2 = − 1 2 = (−11) − (2  (−2)) = 3
0 −2 1 − 2 1
1+1
Cofactor of a11 : C11 = (−1) M 11 = (−1) (3) = 32

1 0 3
Minor of a32 : M 32 = 4 −1 2 = 1 3 = (1 2) − (3  4) = −10
0 −2 1 4 2
3+ 2
Cofactor of a32 : C32 = (−1) M 32 = (−1) (−10) = 10
5

Ch03_36
Definition
The determinant of a square matrix is the sum of the products of
the elements of the first row and their cofactors.
If A is 3  3, A = a11C11 + a12 C12 + a13C13
If A is 4  4, A = a11C11 + a12 C12 + a13C13 + a14 C14

If A is n  n, A = a11C11 + a12 C12 + a13C13 +  + a1nC1n
These equations are called cofactor expansions of |A|.

Ch03_37
 Example 3
Evaluate the determinant of the following matrix A.
 1 2 − 1
A = 3 0 1
4 2 1
Solution
A = a11C11 + a12C12 + a13C13
2 0 1 3 3 1 4 3 0
= 1(−1) + 2(−1) + (−1)(−1)
2 1 4 1 4 2
= [(0 1) − (1 2)] − 2[(3 1) − (1 4)] − [(3  2) − (0  4)]
= −2 + 2 − 6
= −6

Ch03_38
Computing Determinants of 2  2 and 3  3
Matrices
A=  a11 a12 
a21 a22   A = a11a 22 − a12 a 21

 a11 a12 a13   a11 a12 a13  a11 a12

A = a21 a22 a23   a21 a22 a23  a21 a22
a a33  a a33  a31 a32
 31 a32  31 a32
 A = a11 a22 a33 + a12 a23 a31 + a13 a21 a32
(diagonal products from left to right)
− a13 a22 a31 − a11 a23 a32 − a12 a21 a33
(diagonal products from right to left)

Ch03_39
 INVERTIBLE OR NOT

2 −1
−3 1

Ch03_40
 INVERTIBLE OR NOT

6 −2
−3 1

Ch03_41
 INVERTIBLE OR NOT

1 −2 3
3 5 2
−1 3 −4

Ch03_42