0% found this document useful (0 votes)
3 views8 pages

Simple Row Operations

The document explains the concept of row operations used to solve matrices representing linear systems. It details three main operations: switching rows, multiplying a row by a constant, and adding one row to another. Examples are provided to illustrate how these operations can be applied to manipulate matrices without changing their values.

Uploaded by

vitorpacheco1208
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)
3 views8 pages

Simple Row Operations

The document explains the concept of row operations used to solve matrices representing linear systems. It details three main operations: switching rows, multiplying a row by a constant, and adding one row to another. Examples are provided to illustrate how these operations can be applied to manipulate matrices without changing their values.

Uploaded by

vitorpacheco1208
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
You are on page 1/ 8

Simple row operations

So now that we know how to transfer a system of equations into a matrix,


how do we actually go about “solving” the matrix?

That’s where row operations come in. Once we have a linear system
represented as a matrix or an augmented matrix, we can use row
operations to manipulate and simplify the matrix. Eventually, we’ll be able
to get the matrix into a form where the solution to the system just reveals
itself in the matrix.

Here are the row operations we need to understand in order to be able to


simplify matrices:

1. How to switch rows in the matrix

2. How to multiply (or divide) a row by a constant

3. How to add one row to (or subtract one row from) another

Switching two rows

You can switch any two rows in a matrix without changing the value of the
matrix. In this matrix, we’ll switch rows 1 and 2, which we write as R1 ↔ R2.

[1 −6 | 0] [3 2 | 7]
3 2 | 7 1 −6 | 0

32
Keep in mind that you can also make multiple row switches. For instance,
in this 3 × 3 matrix, you could first switch the second row with the third row,
R2 ↔ R3,

7 3 4 7 3 4
1 6 1 → 2 2 3
2 2 3 1 6 1

and then switch the first row with the second row, R1 ↔ R2.

7 3 4 2 2 3
2 2 3 → 7 3 4
1 6 1 1 6 1

Realize that it’s okay to switch rows in a matrix, since a matrix just
represents a linear system. It’s no different than rewriting the system

3x + 2y = 7

x − 6y = 0

as

x − 6y = 0

3x + 2y = 7

Switching the order of the equations in a list of equations representing a


linear system is all that you’re doing when you switch two rows in a matrix.

Example

Write the new matrix after R3 ↔ R2.

33
2 3 −1 | 11
1 7 4 | 6
0 −1 −8 | −3

The operation described by R3 ↔ R2 is switching row 2 with row 3. Nothing


will happen to row 1. The matrix after R3 ↔ R2 is

2 3 −1 | 11
0 −1 −8 | −3
1 7 4 | 6

Multiplying a row by a constant

You can multiply any row in a matrix by any non-zero constant without
changing the value of the matrix. We often call this value a scalar because
it “scales” the values in the row. For instance, if we multiply through the
first row of this matrix by 2, we don’t actually change the value of the
matrix.

[1 −6 | 0] [ 1 0 ] [1 −6 | 0 ]
3 2 | 7 2⋅3 2⋅2 | 2⋅7 6 4 | 14
→ →
−6 |

How can it be true that multiplying a row by a constant doesn’t change the
value of the matrix? Aren’t the entires in the matrix now different?

34
Remember that a row in a matrix represents a linear equation. For
instance, the matrix

[1 −6 | 0 ]
6 4 | 14

could represent this linear system:

6x + 4y = 14

x − 6y = 0

But given 6x + 4y = 14, we know we can divide through the equation by 2,


and it doesn’t change the value of the equation. Dividing through by 2
would just give us 3x + 2y = 7.

So in the same way, we can divide the 2 back out of the matrix, undoing
the operation from before,

[1 −6 | 0 ] [ 1 [1 −6 | 0]
1 1 1

]
6 4 | 14 ⋅6 ⋅4 | ⋅ 14 3 2 | 7
→ 2 2 2 →
−6 | 0

and the matrix still has the same value.

Keep in mind that you’re not limited to multiplying only one row of a
matrix by a non-zero constant. You can multiply as many rows as you like
by a constant, and the constants don’t even have to be the same.

For example, we can multiply the first row of the matrix by 2 (which we
write as 2R1 → R1), and multiply the second row of the matrix by 3 (which
we write as 3R2 → R2),

35
[1 −6 | 0] [3 ⋅ 1 3 ⋅ −6 | 3 ⋅ 0] [3 −18 | 0 ]
3 2 | 7 2⋅3 2⋅2 | 2⋅7 6 4 | 14
→ →

and we still won’t have changed the value of the matrix, since those
constants could be divided right back out again.

Example

Write the new matrix after 3R1 ↔ 2R3.

2 3 −1 | 11
1 7 4 | 6
0 −1 −8 | −3

The operation described by 3R1 ↔ 2R3 is multiplying row 1 by a constant of


3, multiplying row 3 by a constant of 2, and then switching those two rows.
Nothing will happen to row 2. The matrix after 3R1 is

6 9 −3 | 33
1 7 4 | 6
0 −1 −8 | −3

The matrix after 2R3 is

6 9 −3 | 33
1 7 4 | 6
0 −2 −16 | −6

The matrix after 3R1 ↔ 2R3 is

36
0 −2 −16 | −6
1 7 4 | 6
6 9 −3 | 33

Adding a row to another row

It’s also acceptable to add one row to another. Keep in mind though that
this doesn’t consolidate two rows into one. Instead, we replace a row with
the sum of itself and another row. For instance, in this matrix,

[1 −6 | 0]
3 2 | 7

we could replace the first row with the sum of the first and second rows,
R1 + R2 → R1. When we perform that operation, we’re replacing the entries
in row 1, but row 2 stays the same.

[ 1 0 ] [1 −6 | 0]
3+1 2−6 | 7+0 4 −4 | 7

−6 |

Of course, you can also replace a row with the difference of itself and
another row. But subtracting a row from another is the same as adding the
row, multiplied by −1, so because we know we can add rows, it’s logical
that we can also subtract rows.

Example

37
Write the new matrix after R1 + 4R3 → R1.

2 3 −1 | 11
1 7 4 | 6
0 −1 −8 | −3

The operation described by R1 + 4R3 → R1 is multiplying row 3 by a constant


of 4, adding that resulting row to row 1, and using that result to replace
row 1. The row R3 is

[0 −1 −8 | −3]

So 4R3 would be

[4(0) 4(−1) 4(−8) | 4(−3)]

[0 −4 −32 | −12]

Then because R1 = [2 3 −1 | 11], R1 + 4R3 is

[2 + 0 3 + (−4) −1 + (−32) | 11 + (−12)]

[2 −1 −33 | −1]

The matrix after R1 + 4R3 → R1, which is replacing row 1 with this row we just
found, is

2 −1 −33 | −1
1 7 4 | 6
0 −1 −8 | −3

38
39

You might also like