From Wikibooks, open books for an open world
This exercise is recommended for all readers.
This exercise is recommended for all readers.
This exercise is recommended for all readers.
Problem 3
Find each solution set by using Gauss-Jordan reduction,
then reading off the parametrization.
2
x
+
y
−
z
=
1
4
x
−
y
=
3
{\displaystyle {\begin{array}{*{3}{rc}r}2x&+&y&-&z&=&1\\4x&-&y&&&=&3\end{array}}}
x
−
z
=
1
y
+
2
z
−
w
=
3
x
+
2
y
+
3
z
−
w
=
7
{\displaystyle {\begin{array}{*{4}{rc}r}x&&&-&z&&&=&1\\&&y&+&2z&-&w&=&3\\x&+&2y&+&3z&-&w&=&7\end{array}}}
x
−
y
+
z
=
0
y
+
w
=
0
3
x
−
2
y
+
3
z
+
w
=
0
−
y
−
w
=
0
{\displaystyle {\begin{array}{*{4}{rc}r}x&-&y&+&z&&&=&0\\&&y&&&+&w&=&0\\3x&-&2y&+&3z&+&w&=&0\\&&-y&&&-&w&=&0\end{array}}}
a
+
2
b
+
3
c
+
d
−
e
=
1
3
a
−
b
+
c
+
d
+
e
=
3
{\displaystyle {\begin{array}{*{5}{rc}r}a&+&2b&+&3c&+&d&-&e&=&1\\3a&-&b&+&c&+&d&+&e&=&3\end{array}}}
Answer
For the "Gauss" halves, see the answers to
Problem I.2.5 .
The "Jordan" half goes this way.
→
−
(
1
/
3
)
ρ
2
(
1
/
2
)
ρ
1
(
1
1
/
2
−
1
/
2
1
/
2
0
1
−
2
/
3
−
1
/
3
)
→
−
(
1
/
2
)
ρ
2
+
ρ
1
(
1
0
−
1
/
6
2
/
3
0
1
−
2
/
3
−
1
/
3
)
{\displaystyle {\xrightarrow[{-(1/3)\rho _{2}}]{(1/2)\rho _{1}}}\left({\begin{array}{*{3}{c}|c}1&1/2&-1/2&1/2\\0&1&-2/3&-1/3\end{array}}\right){\xrightarrow[{}]{-(1/2)\rho _{2}+\rho _{1}}}\left({\begin{array}{*{3}{c}|c}1&0&-1/6&2/3\\0&1&-2/3&-1/3\end{array}}\right)}
The solution set is this
{
(
2
/
3
−
1
/
3
0
)
+
(
1
/
6
2
/
3
1
)
z
|
z
∈
R
}
{\displaystyle \{{\begin{pmatrix}2/3\\-1/3\\0\end{pmatrix}}+{\begin{pmatrix}1/6\\2/3\\1\end{pmatrix}}z\,{\big |}\,z\in \mathbb {R} \}}
The second half is
→
ρ
3
+
ρ
2
(
1
0
−
1
0
1
0
1
2
0
3
0
0
0
1
0
)
{\displaystyle {\xrightarrow[{}]{\rho _{3}+\rho _{2}}}\left({\begin{array}{*{4}{c}|c}1&0&-1&0&1\\0&1&2&0&3\\0&0&0&1&0\end{array}}\right)}
so the solution is this.
{
(
1
3
0
0
)
+
(
1
−
2
1
0
)
z
|
z
∈
R
}
{\displaystyle \{{\begin{pmatrix}1\\3\\0\\0\end{pmatrix}}+{\begin{pmatrix}1\\-2\\1\\0\end{pmatrix}}z\,{\big |}\,z\in \mathbb {R} \}}
This Jordan half
→
ρ
2
+
ρ
1
(
1
0
1
1
0
0
1
0
1
0
0
0
0
0
0
0
0
0
0
0
)
{\displaystyle {\xrightarrow[{}]{\rho _{2}+\rho _{1}}}\left({\begin{array}{*{4}{c}|c}1&0&1&1&0\\0&1&0&1&0\\0&0&0&0&0\\0&0&0&0&0\end{array}}\right)}
gives
{
(
0
0
0
0
)
+
(
−
1
0
1
0
)
z
+
(
−
1
−
1
0
1
)
w
|
z
,
w
∈
R
}
{\displaystyle \{{\begin{pmatrix}0\\0\\0\\0\end{pmatrix}}+{\begin{pmatrix}-1\\0\\1\\0\end{pmatrix}}z+{\begin{pmatrix}-1\\-1\\0\\1\end{pmatrix}}w\,{\big |}\,z,w\in \mathbb {R} \}}
(of course, the zero vector could be omitted from the description).
The "Jordan" half
→
−
(
1
/
7
)
ρ
2
(
1
2
3
1
−
1
1
0
1
8
/
7
2
/
7
−
4
/
7
0
)
→
−
2
ρ
2
+
ρ
1
(
1
0
5
/
7
3
/
7
1
/
7
1
0
1
8
/
7
2
/
7
−
4
/
7
0
)
{\displaystyle {\xrightarrow[{}]{-(1/7)\rho _{2}}}\left({\begin{array}{*{5}{c}|c}1&2&3&1&-1&1\\0&1&8/7&2/7&-4/7&0\end{array}}\right){\xrightarrow[{}]{-2\rho _{2}+\rho _{1}}}\left({\begin{array}{*{5}{c}|c}1&0&5/7&3/7&1/7&1\\0&1&8/7&2/7&-4/7&0\end{array}}\right)}
ends with this solution set.
{
(
1
0
0
0
0
)
+
(
−
5
/
7
−
8
/
7
1
0
0
)
c
+
(
−
3
/
7
−
2
/
7
0
1
0
)
d
+
(
−
1
/
7
4
/
7
0
0
1
)
e
|
c
,
d
,
e
∈
R
}
{\displaystyle \{{\begin{pmatrix}1\\0\\0\\0\\0\end{pmatrix}}+{\begin{pmatrix}-5/7\\-8/7\\1\\0\\0\end{pmatrix}}c+{\begin{pmatrix}-3/7\\-2/7\\0\\1\\0\end{pmatrix}}d+{\begin{pmatrix}-1/7\\4/7\\0\\0\\1\end{pmatrix}}e\,{\big |}\,c,d,e\in \mathbb {R} \}}
Problem 4
Give two distinct echelon form versions of this matrix.
(
2
1
1
3
6
4
1
2
1
5
1
5
)
{\displaystyle {\begin{pmatrix}2&1&1&3\\6&4&1&2\\1&5&1&5\end{pmatrix}}}
Answer
Routine Gauss' method gives one:
→
−
(
1
/
2
)
ρ
1
+
ρ
3
−
3
ρ
1
+
ρ
2
(
2
1
1
3
0
1
−
2
−
7
0
9
/
2
1
/
2
7
/
2
)
→
−
(
9
/
2
)
ρ
2
+
ρ
3
(
2
1
1
3
0
1
−
2
−
7
0
0
19
/
2
35
)
{\displaystyle {\xrightarrow[{-(1/2)\rho _{1}+\rho _{3}}]{-3\rho _{1}+\rho _{2}}}{\begin{pmatrix}2&1&1&3\\0&1&-2&-7\\0&9/2&1/2&7/2\end{pmatrix}}{\xrightarrow[{}]{-(9/2)\rho _{2}+\rho _{3}}}{\begin{pmatrix}2&1&1&3\\0&1&-2&-7\\0&0&19/2&35\end{pmatrix}}}
and any cosmetic change, like multiplying the bottom row by
2
{\displaystyle 2}
,
(
2
1
1
3
0
1
−
2
−
7
0
0
19
70
)
{\displaystyle {\begin{pmatrix}2&1&1&3\\0&1&-2&-7\\0&0&19&70\end{pmatrix}}}
gives another.
This exercise is recommended for all readers.
Problem 5
List the reduced echelon forms possible for each size.
2
×
2
{\displaystyle 2\!\times \!2}
2
×
3
{\displaystyle 2\!\times \!3}
3
×
2
{\displaystyle 3\!\times \!2}
3
×
3
{\displaystyle 3\!\times \!3}
Answer
In the cases listed below, we take
a
,
b
∈
R
{\displaystyle a,b\in \mathbb {R} }
.
Thus, some canonical forms
listed below actually include infinitely many cases.
In particular, they includes the cases
a
=
0
{\displaystyle a=0}
and
b
=
0
{\displaystyle b=0}
.
(
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0\\0&0\end{pmatrix}}}
,
(
1
a
0
0
)
{\displaystyle {\begin{pmatrix}1&a\\0&0\end{pmatrix}}}
,
(
0
1
0
0
)
{\displaystyle {\begin{pmatrix}0&1\\0&0\end{pmatrix}}}
,
(
1
0
0
1
)
{\displaystyle {\begin{pmatrix}1&0\\0&1\end{pmatrix}}}
(
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0&0\\0&0&0\end{pmatrix}}}
,
(
1
a
b
0
0
0
)
{\displaystyle {\begin{pmatrix}1&a&b\\0&0&0\end{pmatrix}}}
,
(
0
1
a
0
0
0
)
{\displaystyle {\begin{pmatrix}0&1&a\\0&0&0\end{pmatrix}}}
,
(
0
0
1
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0&1\\0&0&0\end{pmatrix}}}
,
(
1
0
a
0
1
b
)
{\displaystyle {\begin{pmatrix}1&0&a\\0&1&b\end{pmatrix}}}
,
(
1
a
0
0
0
1
)
{\displaystyle {\begin{pmatrix}1&a&0\\0&0&1\end{pmatrix}}}
,
(
0
1
0
0
0
1
)
{\displaystyle {\begin{pmatrix}0&1&0\\0&0&1\end{pmatrix}}}
(
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0\\0&0\\0&0\end{pmatrix}}}
,
(
1
a
0
0
0
0
)
{\displaystyle {\begin{pmatrix}1&a\\0&0\\0&0\end{pmatrix}}}
,
(
0
1
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&1\\0&0\\0&0\end{pmatrix}}}
,
(
1
0
0
1
0
0
)
{\displaystyle {\begin{pmatrix}1&0\\0&1\\0&0\end{pmatrix}}}
(
0
0
0
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0&0\\0&0&0\\0&0&0\end{pmatrix}}}
,
(
1
a
b
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}1&a&b\\0&0&0\\0&0&0\end{pmatrix}}}
,
(
0
1
a
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&1&a\\0&0&0\\0&0&0\end{pmatrix}}}
,
(
0
0
1
0
0
0
0
0
0
)
{\displaystyle {\begin{pmatrix}0&0&1\\0&0&0\\0&0&0\end{pmatrix}}}
,
(
1
0
a
0
1
b
0
0
0
)
{\displaystyle {\begin{pmatrix}1&0&a\\0&1&b\\0&0&0\end{pmatrix}}}
,
(
1
a
0
0
0
1
0
0
0
)
{\displaystyle {\begin{pmatrix}1&a&0\\0&0&1\\0&0&0\end{pmatrix}}}
,
(
0
1
0
0
0
1
0
0
0
)
{\displaystyle {\begin{pmatrix}0&1&0\\0&0&1\\0&0&0\end{pmatrix}}}
,
(
1
0
0
0
1
0
0
0
1
)
{\displaystyle {\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}}}
This exercise is recommended for all readers.
Problem 6
What results from applying Gauss-Jordan reduction to a
nonsingular matrix?
Answer
A nonsingular homogeneous linear system has a unique solution.
So a nonsingular matrix must reduce to a (square)
matrix that is all
0
{\displaystyle 0}
's
except for
1
{\displaystyle 1}
's down the upper-left to lower-right diagonal, e.g.,
(
1
0
0
1
)
,
or
(
1
0
0
0
1
0
0
0
1
)
,
etc.
{\displaystyle {\begin{pmatrix}1&0\\0&1\\\end{pmatrix}},\quad {\text{or}}\quad {\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}},\quad {\text{etc.}}}
Problem 7
The proof of Lemma 4 contains a reference to the
i
≠
j
{\displaystyle i\neq j}
condition on the row pivoting operation.
The definition of row operations has an
i
≠
j
{\displaystyle i\neq j}
condition on
the swap operation
ρ
i
↔
ρ
j
{\displaystyle \rho _{i}\leftrightarrow \rho _{j}}
.
Show that in
A
→
ρ
i
↔
ρ
j
→
ρ
i
↔
ρ
j
A
{\displaystyle A{\xrightarrow[{}]{\rho _{i}\leftrightarrow \rho _{j}}}\;{\xrightarrow[{}]{\rho _{i}\leftrightarrow \rho _{j}}}A}
this condition is not needed.
Write down a
2
×
2
{\displaystyle 2\!\times \!2}
matrix with nonzero entries,
and show that the
−
1
⋅
ρ
1
+
ρ
1
{\displaystyle -1\cdot \rho _{1}+\rho _{1}}
operation is not
reversed by
1
⋅
ρ
1
+
ρ
1
{\displaystyle 1\cdot \rho _{1}+\rho _{1}}
.
Expand the proof of that lemma to make explicit exactly where
the
i
≠
j
{\displaystyle i\neq j}
condition on pivoting is used.
Answer
The
ρ
i
↔
ρ
i
{\displaystyle \rho _{i}\leftrightarrow \rho _{i}}
operation does not
change
A
{\displaystyle A}
.
For instance,
(
1
2
3
4
)
→
−
ρ
1
+
ρ
1
(
0
0
3
4
)
→
ρ
1
+
ρ
1
(
0
0
3
4
)
{\displaystyle {\begin{pmatrix}1&2\\3&4\end{pmatrix}}{\xrightarrow[{}]{-\rho _{1}+\rho _{1}}}{\begin{pmatrix}0&0\\3&4\end{pmatrix}}{\xrightarrow[{}]{\rho _{1}+\rho _{1}}}{\begin{pmatrix}0&0\\3&4\end{pmatrix}}}
leaves the matrix changed.
If
i
≠
j
{\displaystyle i\neq j}
then
(
⋮
a
i
,
1
⋯
a
i
,
n
⋮
a
j
,
1
⋯
a
j
,
n
⋮
)
→
k
ρ
i
+
ρ
j
(
⋮
a
i
,
1
⋯
a
i
,
n
⋮
k
a
i
,
1
+
a
j
,
1
⋯
k
a
i
,
n
+
a
j
,
n
⋮
)
→
−
k
ρ
i
+
ρ
j
(
⋮
a
i
,
1
⋯
a
i
,
n
⋮
−
k
a
i
,
1
+
k
a
i
,
1
+
a
j
,
1
⋯
−
k
a
i
,
n
+
k
a
i
,
n
+
a
j
,
n
⋮
)
{\displaystyle {\begin{array}{rcl}{\begin{pmatrix}\vdots \\a_{i,1}&\cdots &a_{i,n}\\\vdots \\a_{j,1}&\cdots &a_{j,n}\\\vdots \end{pmatrix}}&{\xrightarrow[{}]{k\rho _{i}+\rho _{j}}}&{\begin{pmatrix}\vdots \\a_{i,1}&\cdots &a_{i,n}\\\vdots \\ka_{i,1}+a_{j,1}&\cdots &ka_{i,n}+a_{j,n}\\\vdots \end{pmatrix}}\\&{\xrightarrow[{}]{-k\rho _{i}+\rho _{j}}}&{\begin{pmatrix}\vdots \\a_{i,1}&\cdots &a_{i,n}\\\vdots \\-ka_{i,1}+ka_{i,1}+a_{j,1}&\cdots &-ka_{i,n}+ka_{i,n}+a_{j,n}\\\vdots \end{pmatrix}}\end{array}}}
does indeed give
A
{\displaystyle A}
back.
(Of course, if
i
=
j
{\displaystyle i=j}
then the third matrix would have entries of the
form
−
k
(
k
a
i
,
j
+
a
i
,
j
)
+
k
a
i
,
j
+
a
i
,
j
{\displaystyle -k(ka_{i,j}+a_{i,j})+ka_{i,j}+a_{i,j}}
.)