Chapter 3: Problem 15
Suppose that \(A\) and \(B\) are matrices having \(n\) rows. Prove that $M(A \mid B)=(M A \mid M B)\( for any \)m \times n\( matrix \)M$.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 3: Problem 15
Suppose that \(A\) and \(B\) are matrices having \(n\) rows. Prove that $M(A \mid B)=(M A \mid M B)\( for any \)m \times n\( matrix \)M$.
All the tools & learning materials you need for study success - in one app.
Get started for free
For each system of linear equations with the invertible coefficient matrix \(A\), (1) Compute \(A^{-1}\). (2) Use \(A^{-1}\) to solve the system. (a) \(\begin{aligned} x_{1}+3 x_{2} &=4 \\ 2 x_{1}+5 x_{2} &=3 \end{aligned}\) (b) $\begin{aligned} x_{1}+2 x_{2}-x_{3} &=5 \\ x_{2}+x_{3} &=1 \\ 2 x_{1}-2 x_{2}+x_{3} &=4 \end{aligned}$
Let \(B\) be an \(n \times m\) matrix with rank \(m\). Prove that there exists an $m \times n\( matrix \)A\( such that \)A B=I_{m}$.
For each of the following matrices, compute the rank and the inverse if it exists. (a) \(\left(\begin{array}{ll}1 & 2 \\ 1 & 1\end{array}\right)\) (b) \(\left(\begin{array}{ll}1 & 2 \\ 2 & 4\end{array}\right)\) (c) $\left(\begin{array}{rrr}1 & 2 & 1 \\ 1 & 3 & 4 \\ 2 & 3 & -1\end{array}\right)$ (d) $\left(\begin{array}{rrr}0 & -2 & 4 \\ 1 & 1 & -1 \\ 2 & 4 & -5\end{array}\right)$ (e) $\left(\begin{array}{rrr}1 & 2 & 1 \\ -1 & 1 & 2 \\ 1 & 0 & 1\end{array}\right)$ (f) $\left(\begin{array}{lll}1 & 2 & 1 \\ 1 & 0 & 1 \\ 1 & 1 & 1\end{array}\right)$ (g) $\left(\begin{array}{rrrr}1 & 2 & 1 & 0 \\ 2 & 5 & 5 & 1 \\ -2 & -3 & 0 & 3 \\ 3 & 4 & -2 & -3\end{array}\right)$ (h) $\left(\begin{array}{rrrr}1 & 0 & 1 & 1 \\ 1 & 1 & -1 & 2 \\ 2 & 0 & 1 & 0 \\ 0 & -1 & 1 & -3\end{array}\right)$
Find the rank of the following matrices. (a) $\left(\begin{array}{lll}1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 1 & 0\end{array}\right)$ (b) $\left(\begin{array}{lll}1 & 1 & 0 \\ 2 & 1 & 1 \\ 1 & 1 & 1\end{array}\right)$ (c) \(\left(\begin{array}{lll}1 & 0 & 2 \\ 1 & 1 & 4\end{array}\right)\) (d) \(\left(\begin{array}{lll}1 & 2 & 1 \\ 2 & 4 & 2\end{array}\right)\) (e) $\left(\begin{array}{rrrrr}1 & 2 & 3 & 1 & 1 \\ 1 & 4 & 0 & 1 & 2 \\ 0 & 2 & -3 & 0 & 1 \\ 1 & 0 & 0 & 0 & 0\end{array}\right)$ (f) $\left(\begin{array}{rrrrr}1 & 2 & 0 & 1 & 1 \\ 2 & 4 & 1 & 3 & 0 \\ 3 & 6 & 2 & 5 & 1 \\ -4 & -8 & 1 & -3 & 1\end{array}\right)$ (g) $\left(\begin{array}{llll}1 & 1 & 0 & 1 \\ 2 & 2 & 0 & 2 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 0 & 1\end{array}\right)$
Prove Theorem 3.4: Consider the equation \(a x=b\) (i) If \(a \neq 0,\) then \(x=b / a\) is a unique solution of \(a x=b\) (ii) If \(a=0\) but \(b \neq 0,\) then \(a x=b\) has no solution. (iii) If \(a=0\) and \(b=0,\) then every scalar \(k\) is a solution of \(a x=b\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.