Scribd
Upload
5 views4 pages

Matrix Lecture Guide

The document provides a comprehensive guide on matrix row operations and echelon forms, detailing Elementary Row Operations (swapping, scaling, and pivoting) used to manipulate matrices. It explains Row Echelon Form (REF) and Reduced Row Echelon Form (RREF), outlining the criteria for each and providing examples for clarity. Additionally, it includes a step-by-step conversion example and discusses the inverse of row operations for understanding matrix theory.

Uploaded by

adiyamtsegaye
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
5 views4 pages

Matrix Lecture Guide

The document provides a comprehensive guide on matrix row operations and echelon forms, detailing Elementary Row Operations (swapping, scaling, and pivoting) used to manipulate matrices. It explains Row Echelon Form (REF) and Reduced Row Echelon Form (RREF), outlining the criteria for each and providing examples for clarity. Additionally, it includes a step-by-step conversion example and discusses the inverse of row operations for understanding matrix theory.

Uploaded by

adiyamtsegaye
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

Matrix Row Operations & Echelon Forms

A Comprehensive Lecture Guide

1. Elementary Row Operations (EROs)

To solve systems of equations or simplify matrices, we use three specific moves called
Elementary Row Operations. These do not change the solution of the system.

1. Swapping: Interchanging two rows. Ri ↔ Rj

2. Scaling: Multiplying a row by a non-zero constant k. Ri → kRi

3. Pivoting: Adding a multiple of one row to another row. Rj → Rj + kRi

2. Row Echelon Form (REF)

A matrix is in REF if it looks like a "staircase." It must follow these rules:

1. All zero rows (rows with only zeros) must be at the very bottom.

2. The first non-zero number in a row (called the leading entry) must be to the
right of the leading entry of the row above it.

3. All entries in a column below a leading entry must be zeros.


Example: Matrix in REF

1 2 3

0 1 5

0 0 0

Note: The zero row is at the bottom, and the leading 1 in row 2 is to the right of the
leading 1 in row 1.

3. Reduced Row Echelon Form (RREF)

RREF is the "cleanest" version of a matrix. To be in RREF, a matrix must satisfy all REF
rules PLUS:

1. The leading entry in every non-zero row must be exactly 1.

2. Each leading 1 is the only non-zero entry in its column. (Zeros must be above
and below it).

Example: REF vs. RREF

REF (Not RREF):

1 2 0

0 1 4

Why? The leading 1 in the second row has a '2' above it. In RREF, that '2' must be a '0'.

RREF:
1 0 -8

0 1 4

This is RREF because all leading entries are 1, and they are the only non-zeroes in
their columns.

4. Step-by-Step Conversion Example

Let's convert a matrix from the textbook into REF using row operations.

Start with:

4 2

1 3

Step 1 (Swap): R1 ↔ R2 to get a '1' in the top left.

1 3

4 2

Step 2 (Pivot): R2 → R2 - 4R1 to create a zero under the leading 1.

1 3

0 -10

Step 3 (Scale): R2 → -1/10 R2 to make the leading entry 1.

1 3
This is now in Row Echelon Form (REF).
0 1
5. Inverse Row Operations

Every move you make can be undone. This is crucial for understanding matrix theory.

Operation Inverse (Undo)

Ri ↔ Rj Rj ↔ Ri (Swap them back)

Ri → kRi Ri → (1/k)Ri (Divide by the constant)

Ri → Ri + kRj Ri → Ri - kRj (Subtract the multiple)

You might also like