Gagessionemininah to
transform the
matrix linear system
augmented
a
of
into row echelon form row
reducing
Solve the last unknown Back
for
substitute
row reducing
Strategy for
Move from left to right in
columns
all entries below leading
changing
to zeros
I 0 3 2
Kid lo
3 I 2 5 it
We solved by backsubstitution Suppose
we continue to apply row operations
I 0 3 2
1 0 0 4 RARER
J
0 1 7 4
10 1 7 11
o 1 2
0 0 I 2
I 0 0 4
9 LIE
We see that x 4 is the solution
y 3
2 2
matrix is in reduced echelon
The final row
form A matrix is in echele
reducedrow
it is in echelon and all
if row
form
entries above and below the leading 1s
are zeros Solving a system of linear
equations by transforming them to
reduced row echelon
form by elementary
row ops is called Gauss Jordan
Elimination
Rant
The rant of a matrix A is the number
of leading 1 s in row echelon
any
matrix obtained by
row reducing A
what is the rank
e
of A
1
g 2 4 I 0 5
Row reduce
1 2 I 3 1
12
If I 5
fo
o
o
o
3
3
6 3 Re ZR
6 3
Rz R R
Rz
Fj j
O O 2 1
Bra Rn
o o ra ra's
there are 2
leading 1 s so the rank of A
is 2
Suppose A is the augmented matrix of
a linear system in vars Xi Xu We
need Set xz
parameters sit s
Xy t
X I 2s Xz 3t It 2s I at 37 2 25 t
Xz S
X3 It Lt
Xy t
solution
is a
for any real numbers St
Suppose a system of m eqs in n variable
is consisted and the rank
of the augmented
matrix is r
1 The solution set has n r parameters
2
It ran there are
infinitely many
solutions
3
If there
unique solution
ran is a