### Archetype K

From A First Course in Linear Algebra
Version 2.01
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/

Summary  Square matrix of size 5. Nonsingular. 3 distinct eigenvalues, 2 of multiplicity 2.

A matrix:

\eqalignno{ \left [\array{ 10 & 18 & 24 & 24 &−12 \cr 12 & −2 & −6 & 0 &−18 \cr −30&−21&−23&−30& 39 \cr 27 & 30 & 36 & 37 &−30 \cr 18 & 24 & 30 & 30 &−20 } \right ]&&&&&& }

Matrix brought to reduced row-echelon form:

\eqalignno{ \left [\array{ \text{1}&0&0&0&0 \cr 0&\text{1}&0&0&0 \cr 0&0&\text{1}&0&0 \cr 0&0&0&\text{1}&0 \cr 0&0&0&0&\text{1} } \right ]&&&&&& }

Analysis of the row-reduced matrix (Notation RREFA):

\eqalignno{ r = 5 & &D = \left \{1,\kern 1.95872pt 2,\kern 1.95872pt 3,\kern 1.95872pt 4,\kern 1.95872pt 5\right \} & &F = \left \{\ \right \} & & & & & & }

Matrix (coefficient matrix) is nonsingular or singular? (Theorem NMRRI) at the same time, examine the size of the set F above.Notice that this property does not apply to matrices that are not square.
Nonsingular.

This is 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 the homogenous system with this matrix as the coefficient matrix and write the solutions in vector form (Theorem VFSLS) to see these vectors arise.
\left \langle \left \{\ \right \}\right \rangle

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)
\left \langle \left \{\left [\array{ 10 \cr 12 \cr −30 \cr 27 \cr 18} \right ],\kern 1.95872pt \left [\array{ 18 \cr −2 \cr −21 \cr 30 \cr 24} \right ],\kern 1.95872pt \left [\array{ 24 \cr −6 \cr −23 \cr 36 \cr 30} \right ],\kern 1.95872pt \left [\array{ 24 \cr 0 \cr −30 \cr 37 \cr 30} \right ],\kern 1.95872pt \left [\array{ −12 \cr −18 \cr 39 \cr −30 \cr −20 } \right ]\right \}\right \rangle

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 by a set of linearly independent vectors that span the null space of L, computed as according to Theorem FS and Theorem BNS. When r = m, the matrix L has no rows and the column space is all of {ℂ}^{m}.
L = \left [\array{ } \right ]
\left \langle \left \{\left [\array{ 1 \cr 0 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 1 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 1 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 1 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 0 \cr 1 } \right ]\right \}\right \rangle

Column space of the matrix, expressed as the span of a set of linearly independent vectors. These vectors are computed by row-reducing 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.
\left \langle \left \{\left [\array{ 1 \cr 0 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 1 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 1 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 1 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 0 \cr 1 } \right ]\right \}\right \rangle

Row space of the matrix, expressed as a span of a set of linearly independent vectors, obtained from the nonzero rows of the equivalent matrix in reduced row-echelon form. (Theorem BRS)
\left \langle \left \{\left [\array{ 1 \cr 0 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 1 \cr 0 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 1 \cr 0 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 1 \cr 0 } \right ],\kern 1.95872pt \left [\array{ 0 \cr 0 \cr 0 \cr 0 \cr 1 } \right ]\right \}\right \rangle

Inverse matrix, if it exists. The inverse is not defined for matrices that are not square, and if the matrix is square, then the matrix must be nonsingular. (Definition MI, Theorem NI)
\left [\array{ 1 & −\left ({9\over 4}\right ) &−\left ({3\over 2}\right )& 3 & −6 \cr {21\over 2} & {43\over 4} & {21\over 2} & 9 & −9 \cr −15&−\left ({21\over 2} \right )& −11 &−15& {39\over 2} \cr 9 & {15\over 4} & {9\over 2} & 10 & −15 \cr {9\over 2} & {3\over 4} & {3\over 2} & 6 &−\left ({19\over 2} \right ) } \right ]

Subspace dimensions associated with the matrix. (Definition NOM, Definition ROM) Verify Theorem RPNC

\eqalignno{ \text{Matrix columns: }5 & &\text{Rank: }5 & &\text{Nullity: }0 & & & & & & }

Determinant of the matrix, which is only defined for square matrices. The matrix is nonsingular if and only if the determinant is nonzero (Theorem SMZD). (Product of all eigenvalues?)
\text{Determinant } =\ 16

Eigenvalues, and bases for eigenspaces. (Definition EEM,Definition EM)

\eqalignno{ λ & = −2 &{ℰ}_{K}\left (−2\right ) & = \left \langle \left \{\left [\array{ 2 \cr −2 \cr 1 \cr 0 \cr 1 } \right ],\kern 1.95872pt \left [\array{ −1 \cr 2 \cr −2 \cr 1 \cr 0 } \right ]\right \}\right \rangle & & & & \cr λ & = 1 &{ℰ}_{K}\left (1\right ) & = \left \langle \left \{\left [\array{ 4 \cr −10 \cr 7 \cr 0 \cr 2 } \right ],\kern 1.95872pt \left [\array{ −4 \cr 18 \cr −17 \cr 5 \cr 0 } \right ]\right \}\right \rangle & & & & \cr λ & = 4 &{ℰ}_{K}\left (4\right ) & = \left \langle \left \{\left [\array{ 1 \cr −1 \cr 0 \cr 1 \cr 1 } \right ]\right \}\right \rangle & & & & }

Geometric and algebraic multiplicities. (Definition GMEDefinition AME)

\eqalignno{ {γ}_{K}\left (−2\right ) & = 2 &{α}_{K}\left (−2\right ) & = 2 & & & & \cr {γ}_{K}\left (1\right ) & = 2 &{α}_{K}\left (1\right ) & = 2 & & & & \cr {γ}_{K}\left (4\right ) & = 1 &{α}_{K}\left (4\right ) & = 1 & & & & }

Diagonalizable? (Definition DZM)
Yes, full eigenspaces, Theorem DMFE.

The diagonalization. (Theorem DC)

\eqalignno{ &\left [\array{ −4&−3&−4&−6& 7 \cr −7&−5&−6&−8&10 \cr 1 &−1&−1& 1 &−3 \cr 1 & 0 & 0 & 1 &−2 \cr 2 & 5 & 6 & 4 & 0 } \right ]\left [\array{ 10 & 18 & 24 & 24 &−12 \cr 12 & −2 & −6 & 0 &−18 \cr −30&−21&−23&−30& 39 \cr 27 & 30 & 36 & 37 &−30 \cr 18 & 24 & 30 & 30 &−20 } \right ]\left [\array{ 2 &−1& 4 & −4 & 1 \cr −2& 2 &−10& 18 &−1 \cr 1 &−2& 7 &−17& 0 \cr 0 & 1 & 0 & 5 & 1 \cr 1 & 0 & 2 & 0 & 1 } \right ]&& \cr & = \left [\array{ −2& 0 &0&0&0 \cr 0 &−2&0&0&0 \cr 0 & 0 &1&0&0 \cr 0 & 0 &0&1&0 \cr 0 & 0 &0&0&4 } \right ] && }