0% found this document useful (0 votes)
29 views38 pages

Row Operations in Linear Algebra

The document discusses row operations on matrices and how to get a matrix into reduced row echelon form. It also covers the different types of solution sets that can arise from solving systems of linear equations, including unique solutions, no solutions, and infinite families of solutions. Key steps include row-reducing the augmented matrix using elementary row operations and analyzing the reduced row echelon form to determine the type of solution set.

Uploaded by

Jeanelyn Belonio
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views38 pages

Row Operations in Linear Algebra

The document discusses row operations on matrices and how to get a matrix into reduced row echelon form. It also covers the different types of solution sets that can arise from solving systems of linear equations, including unique solutions, no solutions, and infinite families of solutions. Key steps include row-reducing the augmented matrix using elementary row operations and analyzing the reduced row echelon form to determine the type of solution set.

Uploaded by

Jeanelyn Belonio
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ROW OPERATIONS

REDUCED ROW ECHELON


TYPES OF SOLUTION SETS
ROW OPERATIONS
The following three operations will transform an m x n matrix into a
different matrix of the same size, and each is known as row operation.

Swap the locations of two rows.

Multiply each entry of a single row by a nonzero


quantity.

Multiply each entry of one row by some quantity,


and add these values to the entries in the same
columns of a second row. Leave the first row the
same after this operation, but replace the second
row by the new values.
1. Swap the locations of two rows.
Symbolic shorthand: Ri Rj
Example:

1 7 8 −1 5 7 8 5
R2 R1 5 7 8 5 1 7 8 −1
2 −1 3 4 2 −1 3 4
R1 R3 2 −1 3 4 1 1 0 6
5 2 −2 3 5 2 −2 3
1 1 0 6 2 −1 3 4
2. Multiply each entry of a single row by
a nonzero quantity.
Example:

-3R1 5 −1 −15 3
−1 3 −1 3
2 −1 3 4 2 −1 3 4
3R2 5 2 −2 3 15 6 −6 9
1 1 0 6 1 1 0 6
3. Multiply each entry of one row by some quantity and add
these values to the entries in the same columns of a second
row. Leave the first row the same after this operation but
replace the second row by the new values.

Example:

1 2 2 4 1 2 2 4
-1R1+R2 0 1 1 1 −1 −1 −1 1
2 6 5 6 2 6 5 6
REDUCED
ROW-ECHELON
FORM
OBJECTIVES:
At the end of the lesson, you will be able to:

1. define echelon form;


2. identify row-echelon and reduced
row-echelon form; and
3. find the solutions of a given system
of linear equations by getting its
reduced row-echelon form.
WHAT IS ECHELON FORM?

“ECHELON” is a military term that


refers to a specific type of
formation.

It is a “STAIR-STEP PATTERN” formed


by the nonzero elements of a matrix.
EXAMPLE:
ECHELON FORM OF A MATRIX
Echelon form means that the matrix is in
one of the two states:

Row-Echelon Form (REF)


Reduced Row-Echelon Form (RREF)
ECHELON FORM OF A MATRIX
The “LEADING ENTRY” of a row is the first non-
zero entry in that row.
“PIVOT”
REDUCED ROW-ECHELON FORM OF A
MATRIX
PROPERTIES:
1. Any rows of all zeros are
below any other nonzero
rows.
2. For each row that does not
consist entirely of zeros, the
first nonzero entry is equal
to 1 (called the leading 1).
3. All entries in a column
ABOVE and BELOW a ZERO ROW
leading entry are zeros. PIVOT COLUMN
Difference between Row-Echelon Form
and Reduced Row-Echelon Form

A= B=

Reduced
Row-Echelon Form Row-Echelon Form
- All entries in a column BELOW - All entries in a column ABOVE and
the leading entry are zeros. BELOW the leading entry are zeros.
ROW – REDUCING A MATRIX
1. Begin with the first nonzero column. This is a
pivot column and the pivot position is at the top.
2. If necessary, swap rows to get a nonzero
entry into the pivot position.
3. Scale the row to make the pivot equal 1, then
use the “replacement” row operation to get
zeros above and below the pivot.
4. Move to the next pivot column and repeat the
process.
EXAMPLE 1:
Find the solutions of the following system of linear equations:

First, form the augmented matrix


𝑨𝒖𝒈𝒎𝒆𝒏𝒕𝒆𝒅
EXAMPLE 1: 𝑴𝒂𝒕𝒓𝒊𝒙

1. Find the pivot R1 R2


position.
2. Swap (if necessary)
to get a nonzero
pivot.
3. Scale the row to
make the pivot 1,
then get zeros
above and below 2R2 + R1
the pivot.
4. Move to the next
pivot column and
-2R2 + R3
repeat this process.
EXAMPLE 1:
1. Find the pivot
position.
2. Swap (if necessary)
𝟏
to get a nonzero − R3
𝟓
pivot.
3. Scale the row to
make the pivot 1,
then get zeros -5R3 + R1
above and below
the pivot. -3R3 + R2
4. Move to the next
pivot column and
repeat this process.
EXAMPLE 1:
1. Find the pivot
position. RREF
2. Swap (if necessary)
to get a nonzero
pivot.
3. Scale the row to
make the pivot 1,
then get zeros
So, we have determined the entire solution set,
above and below
the pivot.
4. Move to the next
pivot column and
repeat this process.
EXAMPLE 2:
Find the solutions of the following system of linear equations:

LINEAR ALGEBRA DEFINED


𝑨𝒖𝒈𝒎𝒆𝒏𝒕𝒆𝒅
𝑴𝒂𝒕𝒓𝒊𝒙
EXAMPLE 2:

2R1 + R2

𝟏
R2
𝟑

-5R2 + R1
EXAMPLE 2:

𝒙 = −𝟖
𝒚 = 3

So, we have determined the entire solution set,


TYPES OF
SOLUTION SETS
OBJECTIVES:
At the end of the lesson, you will be able to:

1. determine the parts of the matrix needed


in identifying the types of solution sets;
2. classify a linear system according to its
type of solution sets; and

3. explain the process in finding the solution


sets of a linear system.
TYPES OF SOLUTION SETS

There are three types of solution sets:


1. Consistent and Independent
- one/ unique solution

2. Inconsistent - no solution

3. Consistent and Dependent


- infinite solutions
TYPES OF SOLUTION SETS (TWO VARIABLES)

Augmented Matrix
RREF
TYPES OF SOLUTION SETS (TWO VARIABLES)

where
CONSISTENT SYSTEMS
Definition:
A system of linear equations is consistent if it has at least one
solution. Otherwise, the system is called inconsistent.
Remember:
A row of only zero entries is called a zero row and the leftmost
nonzero entry of a nonzero row is a leading 1. A column containing
a leading 1 will be called a pivot column. The number of nonzero
rows will be denoted by r, which is also equal to the number of
leading 1's and the number of pivot columns.
EXAMPLE:
Reduced row-echelon form notation of a 5 x 9 matrix
CONSISTENT SYSTEMS WITH UNIQUE
SOLUTIONS

Let r be the number of nonzero rows


and n be the number of variables.

r=n
DESCRIBING INFINITE SOLUTION SETS
System of m = 4 equations in n = 7 variables
Augmenting
and
RREF
DESCRIBING INFINITE SOLUTION SETS
Independent or
Free Variables

Dependent
Variables

Therefore, the system is


consistent and has infinite
solutions.
RECOGNIZING CONSISTENCY OF A
LINEAR SYSTEM

A system has no solution if the equations are inconsistent,


they are contradictory.
CONSISTENT SYSTEMS, r and n

FREE VARIABLES FOR CONSISTENT


SYSTEMS
COUNTING FREE VARIABLES

Augmenting
and
RREF
COUNTING FREE VARIABLES

Augmenting
and
RREF
COUNTING FREE VARIABLES

Augmenting
and
RREF
COUNTING FREE VARIABLES

Augmenting
and
RREF
THE END
SEE YOU ON MONDAY ☺

You might also like