SYSTEMS OF

MATH 111 - Linear Algebra

LINEAR
EQUATIONS

Ms. Ariane M. Villanueva

 LEARNING
OBJECTIVES
• Determine the size of a matrix and write an
augmented and/or coefficient matrix from a
system of linear equations
• Use matrices and Gaussian elimination with
back-substitution to solve a system of linear
equations
 MATRIX

• It is a rectangular array of numbers, symbols,

or expressions, arranged in rows and columns.
• The horizontal and vertical lines of entries in a
matrix are called rows and columns,
respectively.
• A matrix with m rows and n columns is called
an 𝒎 𝒙 𝒏 matrix or 𝒎 − 𝒃𝒚 − 𝒏 matrix.
 2 4 6 8
𝑎= 1 3 5 7
3 6 9 3
0 1 4 7

𝑺𝒐𝒖𝒓𝒄𝒆: 𝑳𝒖𝒎𝒆𝒏 𝑳𝒆𝒂𝒓𝒏𝒊𝒏𝒈 − 𝑩𝒐𝒖𝒏𝒅𝒍𝒆𝒔𝒔 𝑨𝒍𝒈𝒆𝒃𝒓𝒂

 DIMENSIONS OF
MATRIX
• The dimensions of a matrix are the number of
rows by the number of columns.
2 4 6 8
1 3 7 2 1 3 5 7
4 𝐴= 𝐽 = 11
5 4 0 3 6 9 3
3
0 1 4 7
 DIMENSIONS OF
MATRIX
• The dimensions of a matrix are the number of
rows by the number of columns.
2 4 6 8
1 3 7 2 1 3 5 7
4 𝐴= 𝐽 = 11
5 4 0 3 6 9 3
3
0 1 4 7

𝟑𝒙𝟏 𝑨𝟐𝒙𝟑 𝑱𝟏𝒙𝟏 𝟒𝒙𝟒

COEFFICIENT VS. AUGMENTED
𝑥 − 4𝑦 + 3𝑧 = 5
𝒍𝒊𝒏𝒆𝒂𝒓 𝒔𝒚𝒔𝒕𝒆𝒎 −𝑥 + 3𝑦 − 𝑧 = −3

MATH 111 - Linear Algebra

2𝑥 − 4𝑧 = 6

1 −4 3 1 −4 3 5
−1 3 −1 −1 3 −1 −3
2 0 −4 2 0 −4 6
𝒄𝒐𝒆𝒇𝒇𝒊𝒄𝒊𝒆𝒏𝒕 𝒎𝒂𝒕𝒓𝒊𝒙 𝒂𝒖𝒈𝒎𝒆𝒏𝒕𝒆𝒅 𝒎𝒂𝒕𝒓𝒊𝒙
 GAUSSIAN ELIMINATION i s a l s o
known as row reduction. It helps

MATH 111 - Linear Algebra

to put a matrix in row echelon
form. This method is named after
Carl Friedrich Gauss
(1777–1855).
 ROW-ECHELON FORM
1. Any rows consisting entirely of zeros
occur at the bottom of the matrix.
2. For each row that does not consist
entirely of zeros, the first nonzero entry

MATH 111 - Linear Algebra

is 1 (called a leading 1).
3. For two successive (nonzero) rows, the
leading 1 in the higher row is farther to
the left than the leading 1 in the lower
row. 𝟏 2 −1 4
𝟎 𝟏 0 3
𝟎 𝟎 𝟏 −1
ELEMENTARY ROW OPERATIONS

I. Interchange two rows

II. Multiply a row by a non-zero

MATH 111 - Linear Algebra

constant
III.Add a multiple of row to another
row
 Case I
Interchange two rows

MATH 111 - Linear Algebra

1 0 0 𝟏 𝟎 𝟎
0 0 1 → 𝟎 𝟏 𝟎 𝑹𝟐 ↔ 𝑹𝟑
0 1 0 𝟎 𝟎 𝟏
 Case II
Multiply a row by a non-zero constant

MATH 111 - Linear Algebra

1 0 0 𝟏 𝟎 𝟎
𝟏
0 −5 0 → 𝟎 𝟏 𝟎 −
𝟓
𝑹𝟐 → 𝑹𝟐
0 0 1 𝟎 𝟎 𝟏
 Case III
Add a multiple of row to another row

MATH 111 - Linear Algebra

1 0 0 𝟏 𝟎 𝟎
0 1 0 → 𝟎 𝟏 𝟎 −𝟗 𝑹𝟏 + 𝑹𝟑 → 𝑹𝟑
9 0 1 𝟎 𝟎 𝟏
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION

𝑥 − 2𝑦 + 3𝑧 = 9
−𝑥 + 3𝑦 = −4
2𝑥 − 5𝑦 + 5𝑧 = 17

MATH 111 - Linear Algebra

GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION

𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17

MATH 111 - Linear Algebra

𝟏 𝑹𝟏 + 𝑹𝟐 → 𝑹𝟐

1 −2 3 9
−1 3 0 −4
2 −5 5 17
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17

MATH 111 - Linear Algebra

−𝟐 𝑹 𝟏 + 𝑹 𝟑 → 𝑹 𝟑

1 −2 3 9
0 1 3 5
2 −5 5 17
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17

1 −2 3 9

MATH 111 - Linear Algebra

0 1 3 5
0 −1 −1 −1

𝟏 𝑹𝟐 + 𝑹𝟑 → 𝑹𝟑

1 −2 3 9
0 1 3 5
0 −1 −1 −1
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17

1 −2 3 9 1 −2 3 9

MATH 111 - Linear Algebra

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

𝟏
𝑹𝟑 → 𝑹𝟑
𝟐

1 −2 3 9
0 1 3 5
0 0 2 4
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17

1 −2 3 9 1 −2 3 9 1 −2 3 9

MATH 111 - Linear Algebra

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

x − 2y + 3z = 9
𝑦 + 3𝑧 = 5
𝑧=2
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION

x − 2y + 3z = 9
𝑦 + 3𝑧 = 5
𝑧=2

MATH 111 - Linear Algebra

𝒛=𝟐 𝑦 + 3𝑧 = 5 x − 2y + 3z = 9
𝑦 + 3(2) = 5 x − 2(−1) + 3(2) = 9
𝑦+6=5 x+2+6=9
𝑦 =5−6 x=9−2−6
𝒚 = −𝟏 𝐱=𝟏

One Solution
 2𝑥 − 𝑦 + 𝑧 = 1 2
TRY!
3𝑥 + 2𝑦 − 4𝑧 = 4
−6𝑥 + 3𝑦 − 3𝑧 = 2
 2𝑥 − 𝑦 + 𝑧 = 1 2
TRY!
3𝑥 + 2𝑦 − 4𝑧 = 4
−6𝑥 + 3𝑦 − 3𝑧 = 2
𝟏
𝑹𝟏 → 𝑹𝟏
𝟐
2 −1 1 1
3 2 −4 4
−6 3 −3 2

−𝟑 𝑹 𝟏 + 𝑹 𝟐 → 𝑹 𝟐
1 1 1
1 −
2 2 2
3 2 −4 4
−6 3 −3 2
 2𝑥 − 𝑦 + 𝑧 = 1 2
TRY!
3𝑥 + 2𝑦 − 4𝑧 = 4
−6𝑥 + 3𝑦 − 3𝑧 = 2
1 1 1 𝟔 𝑹𝟏 + 𝑹𝟑 → 𝑹𝟑
1 −
2 2 2
7 11 5
0 −
2 2 2
−6 3 −3 2
1 1 1
1 −
2 2 2
7 11 5
0 −
2 2 2
0 0 0 5 No Solution
 LEARNING
OBJECTIVES
• Use matrices and Gauss-Jordan elimination to
solve a system of linear equations
• Solve a homogeneous system of linear
equations
 GAUSS-JORDAN ELIMINATION
continues where Gaussian left off.

MATH 111 - Linear Algebra

It puts a matrix in reduced row
echelon form. Carl Friedrich
Gauss (1777–1855) and
Wilhelm Jordan (1842-1899).
 REDUCED
ROW-ECHELON FORM
• A matrix in row-echelon form is in
reduced row-echelon form when every

MATH 111 - Linear Algebra

column that has a leading 1 has zeros
in every position above and below its
leading 1.

𝟏 𝟎 𝟎 5
𝟎 𝟏 𝟎 3
𝟎 𝟎 𝟏 0
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17

1 −2 3 9 1 −2 3 9 1 −2 3 9

MATH 111 - Linear Algebra

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

x − 2y + 3z = 9
𝑦 + 3𝑧 = 5
𝑧=2
 GAUSS-JORDAN ELIMINATION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17 0 −1 −1 −1

1 −2 3 9 1 −2 3 9

MATH 111 - Linear Algebra

0 1 3 5 0 1 3 5
0 0 2 4 0 0 1 2

𝟐 𝑹𝟐 + 𝑹𝟏 → 𝑹𝟏

1 −2 3 9
0 1 3 5
0 0 1 2
 GAUSS-JORDAN ELIMINATION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17 0 −1 −1 −1

1 −2 3 9 1 −2 3 9 1 0 9 19

MATH 111 - Linear Algebra

0 1 3 5 0 1 3 5 0 1 3 5
0 0 2 4 0 0 1 2 0 0 1 2

−𝟑 𝑹 𝟑 + 𝑹 𝟐 → 𝑹 𝟐

1 0 9 19
0 1 3 5
0 0 1 2
 GAUSS-JORDAN ELIMINATION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17 0 −1 −1 −1

1 −2 3 9 1 −2 3 9 1 0 9 19 1 0 9 19

MATH 111 - Linear Algebra

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

−𝟗 𝑹 𝟑 + 𝑹 𝟏 → 𝑹 𝟏

1 0 9 19
0 1 0 −1
0 0 1 2
 GAUSS-JORDAN ELIMINATION
𝑥 − 2𝑦 + 3𝑧 = 9 1 −2 3 9 1 −2 3 9 1 −2 3 9
−𝑥 + 3𝑦 = −4 −1 3 0 −4 0 1 3 5 0 1 3 5
2𝑥 − 5𝑦 + 5𝑧 = 17 2 −5 5 17 2 −5 5 17 0 −1 −1 −1

1 −2 3 9 1 −2 3 9 1 0 9 19 1 0 9 19

MATH 111 - Linear Algebra

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

1 0 0 1 𝐱=𝟏
0 1 0 −1 𝒚 = −𝟏
0 0 1 2 𝒛=𝟐
One Solution
GAUSSIAN ELIMINATION WITH BACK-SUBSTITUTION

x − 2y + 3z = 9
𝑦 + 3𝑧 = 5
𝑧=2

MATH 111 - Linear Algebra

𝒛=𝟐 𝑦 + 3𝑧 = 5 x − 2y + 3z = 9
𝑦 + 3(2) = 5 x − 2(−1) + 3(2) = 9
𝑦+6=5 x+2+6=9
𝑦 =5−6 x=9−2−6
𝒚 = −𝟏 𝐱=𝟏

One Solution
 𝑥 − 𝑦 + 2𝑧 = −3 2
TRY!
4𝑥 + 4𝑦 − 2𝑧 = 1
−2𝑥 + 2𝑦 − 4𝑧 = 6
 𝑥 − 𝑦 + 2𝑧 = −3 2
TRY!
4𝑥 + 4𝑦 − 2𝑧 = 1
−2𝑥 + 2𝑦 − 4𝑧 = 6
−𝟒 𝑹 𝟏 + 𝑹 𝟐 → 𝑹 𝟐
1 −1 2 −3
4 4 −2 1
−2 2 −4 6

𝟐 𝑹𝟏 + 𝑹𝟑 → 𝑹𝟑
1 −1 2 −3
0 8 − 10 13
−2 2 −4 6
 𝑥 − 𝑦 + 2𝑧 = −3 2
TRY!
4𝑥 + 4𝑦 − 2𝑧 = 1
−2𝑥 + 2𝑦 − 4𝑧 = 6

1 −1 2 −3
0 8 − 10 13
0 0 0 0

Infinite Solutions
 HOMOGENEOUS SYSTEMS

OF LINEAR EQUATIONS

• Systems of linear equations in which each of

the constant terms is zero are called
homogeneous.
 HOMOGENEOUS SYSTEMS

OF LINEAR EQUATIONS

• Every homogeneous system of linear equations

is consistent. Moreover, if the system has
fewer equations than variables, then it must
have infinite solutions.