Notes on Solving Systems of Equations and Matrices
Elimination and substitution strategies for systems
The goal of elimination is to find a variable with coefficients that are equal in magnitude but opposite in sign, so adding the equations cancels that variable.
When you have two equations with the same sign for one variable and opposite sign coefficients for the other, decide which variable to eliminate by agreement (e.g., voting among options).
General idea: multiply one equation by a constant so that the chosen variable has opposite coefficients in the two equations, then add (or subtract) the equations to eliminate that variable.
Worked example (elimination) to solve for (c, d)
Given a system with an elimination path leading to
First equation:
Second equation (after appropriate operation, e.g., multiply by -2 and add): the elimination yields a relation on c alone:
so
Substitute back into the first equation to solve for d:
becomes
so
Therefore, the ordered pair (c, d) = (alphabetical order by variable name: c, d).
Substitution method (illustrative path and decimal handling)
When solving by substitution, you may have a variable already isolated (e.g., in a solved-for form like ).
To avoid decimals, you can clear them by multiplying both sides of the equation, and/or the entire system, by a common multiple (e.g., 10 if necessary) to obtain integer coefficients.
Example setup:
From a system: and
Substituting y into the second equation gives: → → , which is a contradiction.
Conclusion: no solution (the two lines are parallel and never meet).
Alternative method: clear decimals first, then substitute; either way, you can conclude whether there is a unique solution, no solution, or infinitely many solutions depending on whether the equations intersect, are parallel, or are the same line.
No solution vs. infinitely many solutions vs. a unique solution
No solution: the system corresponds to two parallel lines; there is no ordered pair that satisfies both equations.
Infinitely many solutions: the two equations represent the same line (one equation is a multiple of the other); every point on the line is a solution. This yields a whole line of ordered pairs (e.g., all (c, d) satisfying a single linear relation).
Unique solution: the two lines intersect at a single point; that point is the solution to the system.
Introducing matrices for systems
Quick definitions
A matrix is a rectangular array of numbers in rows and columns.
Dimensions: a matrix with r rows and s columns is called an r×s matrix.
Example dimensions:
A matrix with 2 rows and 3 columns is a 2×3 matrix.
A matrix with 3 rows and 2 columns is a 3×2 matrix.
Each entry is called an element (or entry).
Augmented matrices
A system of linear equations can be written as an augmented matrix, grouping the coefficients of the variables and the constants on the right of a dividing line (optional dotted line visualization).
Example: the system
becomes the augmented matrix
which is often written more compactly as
Another example from the video:
System: and
Augmented form:
A fully solved system (when the left-hand side forms the identity matrix) yields the solution directly from the right-hand side, e.g.
implies
Reduced Row Echelon Form (RREF)
The left-hand side of an augmented matrix is in reduced row echelon form if:
The leading entry (the first 1 from the left, in each nonzero row) of every nonzero row is 1, and that 1 is the only nonzero entry in its column.
Each leading 1 is the only nonzero in its column (zeros above and below).
The leading 1s move to the right as you move down the rows (staircase pattern).
When an augmented matrix is in RREF, the solution to the system is immediately read off from the rightmost column for each variable.
Note: In two variables, solving by matrices is still possible with Gauss–Jordan elimination, but for simple two-equation-two-variable systems, substitution or elimination is often quicker by hand. Matrices shine as the system grows (e.g., three equations and three variables or more).
Row operations (the Gauss–Jordan toolkit)
We may perform these operations on rows (which do not change the solution set):
Swap two rows.
Multiply a row by a nonzero scalar.
Add a multiple of one row to another row (Rowi ← Rowi + k·Row_j).
These are the algebraic steps used to transform a system's augmented matrix into RREF.
It helps to keep a running log of row operations to avoid mistakes and to understand the path to the solution.
Worked matrix example (Gauss–Jordan elimination)
Start with the matrix from the video:
Left side:
Right side (constants):
Combined augmented form:
Step 1: Make the leading entry in the first row a 1 by multiplying Row 1 by -1:
Row 1 → -1·Row 1 gives ; Row 2 stays .
Step 2: Eliminate the entry below the leading 1 in column 1 by Row2 ← Row2 − 3·Row1:
Row2 becomes
Step 3: Normalize Row 2 to make the pivot 1: Row2 ← (1/24)·Row2:
Row2 becomes
Step 4: Eliminate the entry above the pivot in column 2 by Row1 ← Row1 + 5·Row2:
Row1 becomes
Resulting RREF:
Read off the solution:
Notes and study tips from the lecture
The matrix approach is especially valuable as the number of equations and variables grows (e.g., three equations and three variables).
For two equations and two variables, many students prefer substitution or elimination for speed, but practice with matrices builds fluency for larger systems.
The instructor emphasized collaboration for the heavier matrix sections (e.g., section 3.4) and suggested teamwork to divide up hard problems.
The Gauss–Jordan method is connected to the identity matrix: if the left side becomes the identity, the right side gives the solution directly (as in the example with x = 2, y = 5).
The identity matrix and the concept of the main diagonal (the entries from the upper-left to the lower-right) were discussed as part of recognizing when a matrix is in reduced row echelon form.
Practical takeaways for exams and assignments
Expect to identify whether a system has a unique solution, no solution, or infinitely many solutions by examining the equations (intersections vs. parallelism vs. dependence).
Be comfortable converting a system to an augmented matrix and performing row operations to reach RREF.
For larger systems, matrices are often the preferred method; practice with several examples to build speed and accuracy.
Use study groups to tackle the more time-consuming matrix problems; explaining steps to peers reinforces understanding.
Quick reference: common examples from the notes
Elimination leading to a single-variable equation: if you obtain , then and substituting back gives the other variable.
Substitution leading to inconsistency:
Same-line (dependent) case: two equations representing the same line yield infinitely many solutions along that line, not a single point.
Matrix example to RREF: converting
to RREF gives the solution, or shows that the system is inconsistent or dependent depending on the resulting form.
Final note from the lecture
Quizzes and office hours: quizzing serves as a practical study guide for exams; the instructor offered office hours to help with questions and stressed collaborative problem solving.
The material covered includes polynomials, factoring, Pythagorean theorem applications, and the matrix-based approach to systems, all of which are relevant for upcoming assessments.