Skip to main content

Section 2.3 Concepts

Subsection 2.3.1 Reducing matrices

In Discovery guide 2.1, you were led through a strategy to simplify an augmented matrix. Below you will find a step-by-step description of the strategy. But first, it is important to stress that your goal is not to become an expert row reducer — very few people ever need to know how to row reduce a matrix by hand outside of a linear algebra class. Computers are great at row reducing, and should be used to efficiently solve linear systems in the “real world.” Here, we are not interested in learning calculation tricks or short-cuts — we can safely leave those to the experts that program computers to solve linear systems. (Prospective computational experts in the audience of this course can learn such calculation short-cuts in a numerical methods course.)

The choice and order of row operations you use to implement this strategy depends on the augmented matrix you start with, and knowing how to proceed is a skill that you will develop through practise and experience.

Subsection 2.3.2 Solving systems

In the end, we will want to turn our simplified RREF matrix back into a system of equations. When we do this, every leading one corresponds to a leading variable that has a coefficient of \(1\text{,}\) and so is easy to isolate and solve for in terms of the other variables. Another way to think of this is that a leading variable is constrained by the equation in which it appears, and its value depends on the values of the other variables in that equation. On the other hand, every variable that does not have a leading one in its column of the RREF matrix cannot be solved for without going in circles: you cannot solve for variable \(x\) in terms of variables \(y\) and \(z\text{,}\) and then turn around and solve for variable \(y\) in terms of variables \(x\) and \(z\text{.}\) A variable without a leading one becomes a free variable: there are no constraints on its value, and every choice of value for that variable leads to one or more solutions (depending on choices of values for other free variables) for the system similarly to Discovery 1.5.

For a homogeneous system, as in Discovery 2.4, there is no need to work with the full augmented matrix, since no elementary row operation will ever change the column of zeros on the right. Instead, we reduce just the coefficient matrix, making sure to remember that we are dealing with a homogeneous system when it is time to convert back to equations and solve the simplified system.