Let \(T: \IR^n \rightarrow \IR^m\) be a linear map with standard matrix \(A\text{.}\) Sort the following items into three groups of statements: a group that means \(T\) is injective, a group that means \(T\) is surjective, and a group that means \(T\) is bijective.
By item (B) from ActivityΒ 4.2.5 we may define an inverse map \(T^{-1} : \IR^n \rightarrow \IR^n\) that defines \(T^{-1}(\vec b)\) as the unique solution \(\vec x\) satisfying \(T(\vec x)=\vec b\text{,}\) that is, \(T(T^{-1}(\vec b))=\vec b\text{.}\)
be the standard matrix for \(T^{-1}\text{.}\) We call \(A^{-1}\) the inverse matrix of \(A\text{,}\) and we also say that \(A\) is an invertible matrix.
Let \(T: \IR^3 \rightarrow \IR^3\) be the linear bijection given by the standard matrix \(A=\left[\begin{array}{ccc} 2 & -1 & -6 \\ 2 & 1 & 3 \\ 1 & 1 & 4 \end{array}\right]\text{.}\)
To find \(\vec x = T^{-1}(\vec{e}_1)\text{,}\) we need to find the unique solution for \(T(\vec x)=\vec e_1\text{.}\) Which of these linear systems can be used to find this solution?
So far, we have only considered augmented matrices with a single augmented column. Write down an augmented matrix with more than one augmented column whose RREF would help us find \(A^{-1}.\)
Let \(T:\IR^n\to\IR^n\) be a linear bijection with standard matrix \(A\) and suppose \(\vec{b}\in\IR^n\text{.}\) By definition of the inverse map and inverse matrix, the vector \(\vec{x}=A^{-1}\vec{b}\) is the unique solution to the equation \(A\vec{x}=\vec{b}\text{.}\)
In other words, when the matrix \(A\) is invertible, we have a new method for solving the equation \(A\vec{x}=\vec{b}\text{:}\) we can first calculate \(A^{-1}\) and then calculate the product \(\vec{x}=A^{-1}\vec{b}\text{.}\)
Let \(T:\IR^2\to\IR^2\) be the bijective linear map defined by \(T\left(\left[\begin{array}{c}x\\y\end{array}\right]\right)=\left[\begin{array}{c} 2x -3y \\ -3x + 5y\end{array}\right]\text{,}\) with the inverse map \(T^{-1}\left(\left[\begin{array}{c}x\\y\end{array}\right]\right)=\left[\begin{array}{c} 5x+ 3y \\ 3x + 2y\end{array}\right]\text{.}\)
\(T^{-1}\circ T=T\circ T^{-1}\) is the identity map for any bijective linear transformation \(T\text{.}\) Therefore \(A^{-1}A=AA^{-1}\) equals the identity matrix \(I\) for any invertible matrix \(A\text{.}\)
Now that we have defined the inverse of a matrix, we have the ability to solve matrix equations. In the following equations, \(A,B\) all denote square matrices of the same size and \(I\) denotes the identity matrix. For each equation, solve for \(X\text{.}\)
Solving linear systems using matrix multiplication is most useful when we are working with one common coefficient matrix, and varying the right-hand side. That is, when we have \(A\vec{x}=\vec{b}\) for several different values of \(\vec{b}\text{.}\)
In the following, let \(A=\left[\begin{matrix}2 & -1 & -6\\ 2 & 1 & 3\\ 1 & 1 & 4\end{matrix}\right]\) and consider the following questions about various equations of the form \(A\vec{x}=\vec{b}\text{?}\)
Suppose that \(\vec{b}=\left[\begin{matrix} 1\\1\\1\end{matrix}\right]\text{.}\) If asked to solve the equation \(A\vec{x}=\vec{b}\text{,}\) which of the following approaches do you prefer?
Suppose that \(\vec{b}_1,\vec{b}_2,\vec{b}_3=\left[\begin{matrix} 1\\1\\1\end{matrix}\right],\left[\begin{matrix} 2\\1\\3\end{matrix}\right],\left[\begin{matrix} -1\\3\\5\end{matrix}\right]\text{.}\) If asked to solve each of the equations \(A\vec{x}=\vec{b}_1, A\vec{x}=\vec{b}_2, A\vec{x}=\vec{b}_3\text{,}\) which of the following approaches do you prefer?
Calculate \(\RREF[A|\vec{b}_1]\text{,}\)\(\RREF[A|\vec{b}_2]\text{,}\) and \(\RREF[A|\vec{b}_3]\)
Suppose that \(\vec{b}_1,\dots, \vec{b}_{10}\) are 10 distinct vectors. If asked to solve each of the equations \(A\vec{x}=\vec{b}_1, \dots, A\vec{x}=\vec{b}_{10}\text{,}\) which of the following approaches do you prefer?
For any choice of \(\vec{b} \in \mathbb{R}^n\text{,}\) the system of equations represented by the augmented matrix \([A|\vec{b}]\) has a unique solution.
Assume \(T\) is a square matrix, and \(T^4\) is the zero matrix. Prove that \((I - T)^{-1} = I + T + T^2 + T^3.\) You will need to first prove a lemma that matrix multiplication distributes over matrix addition.
Assume that \(H\) is invertible, and that \(HG\) is the zero matrix. Prove that \(G\) must be the zero matrix. Would this still be true if \(H\) were not invertible?