Skip to main content

Archetype B Archetype B

⬜  Summary   System with three equations, three unknowns. Nonsingular coefficient matrix. Distinct integer eigenvalues for coefficient matrix.
⬜  Definition  A system of linear equations (Definition SLE).
\begin{align*} -7x_1 -6 x_2 - 12x_3 &=-33\\ 5x_1 + 5x_2 + 7x_3 &=24\\ x_1 +4x_3 &=5 \end{align*}
⬜  Solutions  Some solutions to the system of linear equations, not necessarily exhaustive (Definition SSLE):
\begin{gather*} x_1 = -3,\quad x_2 = 5,\quad x_3 = 2 \end{gather*}
⬜  Augmented Matrix  Augmented matrix of the linear system of equations (Definition AM):
\begin{equation*} \begin{bmatrix} -7&-6&- 12&-33\\ 5&5&7&24\\ 1&0&4&5 \end{bmatrix} \end{equation*}
⬜  Row-Reduced Augmented Matrix  Matrix in reduced row-echelon form, row-equivalent to the augmented matrix. (Definition RREF)
\begin{equation*} \begin{bmatrix} \leading{1}&0&0&-3\\ 0&\leading{1}&0&5\\ 0&0&\leading{1}&2 \end{bmatrix} \end{equation*}
⬜  Augmented Matrix Analysis  Analysis of the augmented matrix (Definition RREF).
\begin{align*} r&=3&D&=\set{1,\,2,\,3}&F&=\set{4} \end{align*}
⬜  Vector Form of Solutions  Vector form of the solution set to the system of equations (Theorem VFSLS). Notice the relationship between the free variables and the set \(F\) above. Also, notice the pattern of 0's and 1's in the entries of the vectors corresponding to elements of the set \(F\) in the larger examples.
\begin{equation*} \colvector{x_1\\x_2\\x_3}=\colvector{-3\\5\\2} \end{equation*}
⬜  Associated Homogeneous System  Given a system of equations we can always build a new, related, homogeneous system (Definition HS) by converting the constant terms to zeros and retaining the coefficients of the variables. Properties of this new system will have precise relationships with various properties of the original system.
\begin{align*} -7x_1 -6 x_2 - 12x_3 &=0\\ 5x_1 + 5x_2 + 7x_3 &=0\\ x_1 +4x_3 &=0 \end{align*}
⬜  Solutions, Homogeneous System  Some solutions to the associated homogeneous system of linear equations, not necessarily exhaustive (Definition SSLE). Review Theorem HSC as you consider these solutions.
\begin{gather*} x_1 = 0,\quad x_2 = 0,\quad x_3 = 0 \end{gather*}
⬜  Row-Reduced Augmented Matrix, Homogeneous System  Form the augmented matrix of the homogeneous linear system, and use row operations to convert to reduced row-echelon form. Notice how the entries of the final column remain zeros.
\begin{equation*} \begin{bmatrix} \leading{1} & 0 & 0 & 0\\ 0 & \leading{1} & 0 & 0\\ 0 & 0 & \leading{1} & 0 \end{bmatrix} \end{equation*}
⬜  Augmented Matrix Analysis, Homogeneous System  Analysis of the augmented matrix for the homogeneous system (Definition RREF). Compare this with the same analysis of the original system, especially in the case where the original system is inconsistent (Theorem RCLS).
\begin{align*} r&=3&D&=\set{1,\,2,\,3}&F&=\set{4} \end{align*}
⬜  Coefficient Matrix  For any system of equations we can isolate the coefficient matrix, which will be identical to the coefficient matrix of the associated homogeneous system. For the remainder of the discussion of this system of equations, we will analyze just the coefficient matrix.
\begin{equation*} \begin{bmatrix} -7&-6&-12\\ 5&5&7\\ 1&0&4 \end{bmatrix} \end{equation*}
⬜  Row-Reduced Coefficient Matrix  Row-equivalent matrix in reduced row-echelon form (Definition RREF).
\begin{equation*} \begin{bmatrix} \leading{1} & 0 & 0\\ 0 & \leading{1} & 0\\ 0 & 0 & \leading{1} \end{bmatrix} \end{equation*}
⬜  Coefficient Matrix Analysis  Analysis of the reduced row-echelon form of the matrix (Definition RREF). For archetypes that begin as systems of equations, compare this analysis with the analysis for the coefficient matrices of the original system, and of the associated homogeneous system.
\begin{align*} r&=3&D&=\set{1,\,2,\,3}&F&=\set{\ } \end{align*}
⬜  Nonsingular Matrix?  Is the matrix nonsingular or singular? Nonsingular. Notice that the row-reduced version of the matrix is the identity matrix and apply Theorem NMRRI. At the same time, examine the sizes of the sets \(D\) and \(F\) from the analysis of the reduced row-echelon version of the matrix.
⬜  Null Space  The null space of the matrix. The set of vectors used in the span construction is a linearly independent set of column vectors that spans the null space of the matrix (Theorem SSNS, Theorem BNS). Solve a homogeneous system with this matrix as the coefficient matrix and write the solutions in vector form (Theorem VFSLS) to see these vectors arise. Compare the entries of these vectors for indices in \(D\) versus entries for indices in \(F\text{.}\)
\begin{equation*} \set{\ } \end{equation*}
⬜  Column Space, Original Columns  The column space of the matrix, expressed as the span of a set of linearly independent vectors that are also columns of the matrix. These columns have indices that form the set \(D\) above (Theorem BCS).
\begin{equation*} \set{\colvector{-7\\5\\1},\,\colvector{-6\\5\\0},\,\colvector{-12\\7\\4}} \end{equation*}
⬜  Column Space, Extended Echelon Form  The column space of the matrix, as it arises from the extended echelon form of the matrix. The matrix \(L\) is computed as described in Definition EEF. This is followed by the column space described as the span of a set of linearly independent vectors that equals the null space of \(L\text{,}\) computed as according to Theorem FS and Theorem BNS. When \(r=m\text{,}\) the matrix \(L\) has no rows and the column space is all of \(\complex{m}\text{.}\)
\begin{equation*} L=\begin{bmatrix}\end{bmatrix} \end{equation*}
\begin{equation*} \set{\colvector{1\\0\\0},\,\colvector{0\\1\\0},\,\colvector{0\\0\\1}} \end{equation*}
⬜  Column Space, Row Space of Transpose  The column space of the matrix, expressed as the span of a set of linearly independent vectors. These vectors are computed by bringing the transpose of the matrix into reduced row-echelon form, tossing out the zero rows, and writing the remaining nonzero rows as column vectors. By Theorem CSRST and Theorem BRS, and in the style of Example CSROI, this yields a linearly independent set of vectors that span the column space.
\begin{equation*} \set{\colvector{1\\0\\0},\,\colvector{0\\1\\0},\,\colvector{0\\0\\1}} \end{equation*}
⬜  Row Space  Row space of the matrix, expressed as a span of a set of linearly independent vectors, obtained from the nonzero rows of the row-equivalent matrix in reduced row-echelon form. (Theorem BRS)
\begin{equation*} \set{\colvector{1\\0\\0},\,\colvector{0\\1\\0},\,\colvector{0\\0\\1}} \end{equation*}
⬜  Inverse Matrix?  The matrix is nonsingular, and by Theorem NI has an inverse (Definition MI). The inverse can be computed with the procedure in Theorem CINM.
\begin{equation*} \begin{bmatrix} -10 & -12 & -9\\ \frac{13}{2} & 8 & \frac{11}{2}\\ \frac{5}{2} & 3 & \frac{5}{2} \end{bmatrix} \end{equation*}
⬜  Subspace Dimensions  Subspace dimensions associated with the matrix (Definition ROM, Definition NOM). Verify Theorem RPNC.
\begin{align*} \text{rank}&=3&\text{nullity}&=0&\text{columns}&=3 \end{align*}
⬜  Determinant  Value of the determinant of the matrix. The matrix is nonsingular so the determinant is nonzero (Theorem SMZD). Notice that zero is not an eigenvalue of the matrix (Theorem SMZE).
\begin{equation*} \text{determinant}=-2 \end{equation*}
⬜  Eigenvalues, Eigenspaces  Eigenvalues, and bases for eigenspaces (Definition EEM, Definition EM). Compute a matrix-vector product (Definition MVP) for each eigenvector as an interesting check.
\begin{align*} \eigensystem{B}{-1}{\colvector{-5\\3\\1}}\\ \eigensystem{B}{1}{\colvector{-3\\2\\1}}\\ \eigensystem{B}{2}{\colvector{-2\\1\\1}}\\ %& forces align environment \end{align*}
⬜  Eigenvalue Multiplicities  Geometric and algebraic multiplicities (Definition GME, Definition AME).
\begin{align*} \geomult{B}{-1}&=1&\algmult{B}{-1}&=1\\ \geomult{B}{1}&=1&\algmult{B}{1}&=1\\ \geomult{B}{2}&=1&\algmult{B}{2}&=1 \end{align*}
⬜  Diagonalizable  Diagonalizable (Definition DZM)?

Yes, distinct eigenvalues, Theorem DED.

⬜  Diagonalization  The diagonalization (Theorem DC).
\begin{equation*} \begin{bmatrix}-1&-1&-1\\2&3&1\\-1&-2&1 \end{bmatrix}\begin{bmatrix} -7&-6&-12\\ 5&5&7\\ 1&0&4 \end{bmatrix} \begin{bmatrix}-5&-3&-2\\3&2&1\\1&1&1 \end{bmatrix}=\begin{bmatrix}-1&0&0\\0&1&0\\0&0&2 \end{bmatrix} \end{equation*}