Linear Systems Using Matrices
A linear system contains equations where variables appear only to the first power, without multiplying or dividing other variables, and without radicals. These systems can have one solution, no solutions, or infinitely many solutions.
To solve linear systems, we can convert them into augmented matrices that contain just the coefficients and constants. For example, the system
ax + by = c
dx + ey = f
becomes the matrix
[a b | c]
[d e | f]
We use row operations to transform these matrices:
- Interchange rows
- Multiply a row by a non-zero number
- Replace a row by adding/subtracting another row
- Combine operations to replace a row with itself plus a multiple of another row
💡 The goal is to reach reduced row echelon form, where the left side is an identity matrix, giving you the solution directly.
When solving, you might encounter a row of all zeros. If this row has a non-zero value on the right side, the system has no solutions. If the row is completely zeros, the system has infinitely many solutions, which you'll express in terms of a parameter.
For example, if your final matrix shows x = 4, y = -3, z = 1, that's your unique solution. If you end up with a relationship between variables, you'll have infinitely many solutions.