40.1: Linear Systems
( \newcommand{\kernel}{\mathrm{null}\,}\)
In this course, we learned how to represent linear systems which basically consists of equations added sums of multiple numbers in the form:
b=a1x1+a2x2+a3x3+…amxm
Systems of linear equations are multiple equations of the above form with basically the same unknowns but different values of a and b.
b1=a11x1+a12x2+a13x3+…a1nxn
b2=a21x1+a22x2+a23x3+…a2nxn
b3=a31x1+a32x2+a33x3+…a3nxn
⋮
bm=am1x1+am2x2+am3x3+…amnxn
The above equations can be represented in matrix form as follows:
[b1b2b3⋮bm]=[a11a12a13a1na21a22a23…a2na31a32a33a3n⋮⋱⋮am1am2am3amn][x1x2x3⋮xn]
Which can also be represented in “augmented” form as follows:
[a11a12a13a1na21a22a23…a2na31a32a33a3n⋮⋱⋮am1am2am3amn|b1b2b3⋮bm]
The above systems can be modified into equivelent systems using combinations of the following operators.
- Multiply any row of a matrix by a constant
- Add the contents of one row by another row.
- Swap any two rows.
Often the 1st and 2nd operator can be combined where a row is multipled by a constanet and then added (or subtracted) from another row.
Consider the matrix A=[1302]. What operators can you use to put the above equation into it’s reduced row echelon form?