- #1
QuantumP7
- 68
- 0
I'm reading Charles G. Cullens' "Matrices and Linear Transformations" and have a question about one of the examples. Don't worry- I'm self-studying this.
This is the section about matrix equivalence- both row and column equivalence. It says "Theorem 1.30 If a sequence of elementary operations on A applied to:
[tex]\begin{bmatrix} A & I \\ I & 0 \end{bmatrix}[/tex] yields
[tex]\begin{bmatrix} B & P \\ Q & 0 \end{bmatrix}[/tex] then PAQ = B." This example works with this theorem.
So, it has an example A = [tex]\begin{bmatrix} 1 & 2 & -1 & 2 \\ -2 & -5 & 3 & 0 \\ 1 & 0 & 1 & 10 \end{bmatrix}[/tex]
with A being augmented: [tex]\begin{bmatrix} 1 & 2 & -1 & 2 & 1 & 0 & 0 \\ -2 & -5 & 3 & 0 & 0 & 1 & 0\\ 1 & 0 & 1 & 10 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & & & \\ 0 & 1 & 0 & 0 & & &\\ 0 & 0 & 1 & 0 & & &\\ 0 & 0 & 0 & 1 & & &\end{bmatrix}[/tex]
Where the 3 x 3 identity matrix is for P and the 4 x 4 matrix is for Q. I understand the elementary row operations to obtain P, which turns out to be:
[tex]\begin{bmatrix} 1 & 0 & 0 \\ -2 & -1 & 0 \\ -5 & -2 & 1 \end{bmatrix}[/tex]
. This is just transforming A and P into a row-reduced echelon form.
What I do not understand is the algorithm for obtaining Q (which turns out to be:
[tex]\begin{bmatrix} 1 & -2 & -1 & -10 \\ 0 & 1 & 1 & 4 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}[/tex] )
How is this Q obtained? Are we trying to reduce the matrix for Q to a column reduced echelon form? If so, what exactly is column reduced echelon form? The book lists steps for obtaining Q, but does not explain them. Here are the steps:
(-2[tex]C_{1} + C_{2}[/tex])
([tex]C_{1} + C_{3}[/tex])
(-2[tex]C_{1} + C_{4}[/tex])
then
([tex]C_{2} + C_{3}[/tex])
(4[tex]C_{2} + C_4}[/tex])
Homework Statement
This is the section about matrix equivalence- both row and column equivalence. It says "Theorem 1.30 If a sequence of elementary operations on A applied to:
[tex]\begin{bmatrix} A & I \\ I & 0 \end{bmatrix}[/tex] yields
[tex]\begin{bmatrix} B & P \\ Q & 0 \end{bmatrix}[/tex] then PAQ = B." This example works with this theorem.
So, it has an example A = [tex]\begin{bmatrix} 1 & 2 & -1 & 2 \\ -2 & -5 & 3 & 0 \\ 1 & 0 & 1 & 10 \end{bmatrix}[/tex]
with A being augmented: [tex]\begin{bmatrix} 1 & 2 & -1 & 2 & 1 & 0 & 0 \\ -2 & -5 & 3 & 0 & 0 & 1 & 0\\ 1 & 0 & 1 & 10 & 0 & 0 & 1 \\ 1 & 0 & 0 & 0 & & & \\ 0 & 1 & 0 & 0 & & &\\ 0 & 0 & 1 & 0 & & &\\ 0 & 0 & 0 & 1 & & &\end{bmatrix}[/tex]
Where the 3 x 3 identity matrix is for P and the 4 x 4 matrix is for Q. I understand the elementary row operations to obtain P, which turns out to be:
[tex]\begin{bmatrix} 1 & 0 & 0 \\ -2 & -1 & 0 \\ -5 & -2 & 1 \end{bmatrix}[/tex]
. This is just transforming A and P into a row-reduced echelon form.
What I do not understand is the algorithm for obtaining Q (which turns out to be:
[tex]\begin{bmatrix} 1 & -2 & -1 & -10 \\ 0 & 1 & 1 & 4 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{bmatrix}[/tex] )
How is this Q obtained? Are we trying to reduce the matrix for Q to a column reduced echelon form? If so, what exactly is column reduced echelon form? The book lists steps for obtaining Q, but does not explain them. Here are the steps:
(-2[tex]C_{1} + C_{2}[/tex])
([tex]C_{1} + C_{3}[/tex])
(-2[tex]C_{1} + C_{4}[/tex])
then
([tex]C_{2} + C_{3}[/tex])
(4[tex]C_{2} + C_4}[/tex])