## Section OD Orthonormal Diagonalization

We have seen in SectionÂ SD that under the right conditions a square matrix is similar to a diagonal matrix. We recognize now, via TheoremÂ SCB, that a similarity transformation is a change of basis on a matrix representation. So we can now discuss the choice of a basis used to build a matrix representation, and decide if some bases are better than others for this purpose. This will be the tone of this section. We will also see that every matrix has a reasonably useful matrix representation, and we will discover a new class of diagonalizable linear transformations. First we need some basic facts about triangular matrices.

### Subsection TM Triangular Matrices

An upper, or lower, triangular matrix is exactly what it sounds like it should be, but here are the two relevant definitions.

#### Definition UTM. Upper Triangular Matrix.

The \(n\times n\) square matrix \(A\) is upper triangular if \(\matrixentry{A}{ij}=0\) whenever \(i\gt j\text{.}\)

#### Definition LTM. Lower Triangular Matrix.

The \(n\times n\) square matrix \(A\) is lower triangular if \(\matrixentry{A}{ij}=0\) whenever \(i\lt j\text{.}\)

Obviously, properties of a lower triangular matrices will have analogues for upper triangular matrices. Rather than stating two very similar theorems, we will say that matrices are âtriangular of the same typeâ as a convenient shorthand to cover both possibilities and then give a proof for just one type.

#### Theorem PTMT. Product of Triangular Matrices is Triangular.

Suppose that \(A\) and \(B\) are square matrices of size \(n\) that are triangular of the same type. Then \(AB\) is also triangular of that type.

#### Proof.

We prove this for lower triangular matrices and leave the proof for upper triangular matrices to you. Suppose that \(A\) and \(B\) are both lower triangular. We need only establish that certain entries of the product \(AB\) are zero. Suppose that \(i\lt j\text{,}\) then

Since \(\matrixentry{AB}{ij}=0\) whenever \(i\lt j\text{,}\) by DefinitionÂ LTM, \(AB\) is lower triangular.

The inverse of a triangular matrix is triangular, of the same type.

#### Theorem ITMT. Inverse of a Triangular Matrix is Triangular.

Suppose that \(A\) is a nonsingular matrix of size \(n\) that is triangular. Then the inverse of \(A\text{,}\) \(\inverse{A}\text{,}\) is triangular of the same type. Furthermore, the diagonal entries of \(\inverse{A}\) are the reciprocals of the corresponding diagonal entries of \(A\text{.}\) More precisely, \(\matrixentry{\inverse{A}}{ii}=\matrixentry{A}{ii}^{-1}\text{.}\)

#### Proof.

We give the proof for the case when \(A\) is lower triangular, and leave the case when \(A\) is upper triangular for you. Consider the process for computing the inverse of a matrix that is outlined in the proof of TheoremÂ CINM. We augment \(A\) with the size \(n\) identity matrix, \(I_n\text{,}\) and row-reduce the \(n\times 2n\) matrix to reduced row-echelon form via the algorithm in TheoremÂ REMEF. The proof involves tracking the peculiarities of this process in the case of a lower triangular matrix. Let \(M=\augmented{A}{I_n}\text{.}\)

First, none of the diagonal elements of \(A\) are zero. By repeated expansion about the first row, the determinant of a lower triangular matrix can be seen to be the product of the diagonal entries (TheoremÂ DER). If just one of these diagonal elements was zero, then the determinant of \(A\) is zero and \(A\) is singular by TheoremÂ SMZD. Slightly violating the exact algorithm for row reduction we can form a matrix, \(M^\prime\text{,}\) that is row-equivalent to \(M\text{,}\) by multiplying row \(i\) by the nonzero scalar \(\matrixentry{A}{ii}^{-1}\text{,}\) for \(1\leq i\leq n\text{.}\) This sets \(\matrixentry{M^\prime}{ii}=1\) and \(\matrixentry{M^\prime}{i,n+1}=\matrixentry{A}{ii}^{-1}\text{,}\) and leaves every zero entry of \(M\) unchanged.

Let \(M_j\) denote the matrix obtained form \(M^\prime\) after converting column \(j\) to a pivot column. We can convert column \(j\) of \(M_{j-1}\) into a pivot column with a set of \(n-j-1\) row operations of the form \(\rowopadd{\alpha}{j}{k}\) with \(j+1\leq k\leq n\text{.}\) The key observation here is that we add multiples of row \(j\) only to higher-numbered rows. This means that none of the entries in rows \(1\) through \(j-1\) is changed, and since row \(j\) has zeros in columns \(j+1\) through \(n\text{,}\) none of the entries in rows \(j+1\) through \(n\) is changed in columns \(j+1\) through \(n\text{.}\) The first \(n\) columns of \(M^\prime\) form a lower triangular matrix with 1's on the diagonal. In its conversion to the identity matrix through this sequence of row operations, it remains lower triangular with 1's on the diagonal.

What happens in columns \(n+1\) through \(2n\) of \(M^\prime\text{?}\) These columns began in \(M\) as the identity matrix, and in \(M^\prime\) each diagonal entry was scaled to a reciprocal of the corresponding diagonal entry of \(A\text{.}\) Notice that trivially, these final \(n\) columns of \(M^\prime\) form a lower triangular matrix. Just as we argued for the first \(n\) columns, the row operations that convert \(M_{j-1}\) into \(M_j\) will preserve the lower triangular form in the final \(n\) columns and preserve the exact values of the diagonal entries. By TheoremÂ CINM, the final \(n\) columns of \(M_n\) is the inverse of \(A\text{,}\) and this matrix has the necessary properties advertised in the conclusion of this theorem.

### Subsection UTMR Upper Triangular Matrix Representation

Not every matrix is diagonalizable, but every linear transformation has a matrix representation that is an upper triangular matrix, and the basis that achieves this representation is especially pleasing. Here is the theorem.

#### Theorem UTMR. Upper Triangular Matrix Representation.

Suppose that \(\ltdefn{T}{V}{V}\) is a linear transformation. Then there is a basis \(B\) for \(V\) such that the matrix representation of \(T\) relative to \(B\text{,}\) \(\matrixrep{T}{B}{B}\text{,}\) is an upper triangular matrix. Each diagonal entry is an eigenvalue of \(T\text{,}\) and if \(\lambda\) is an eigenvalue of \(T\text{,}\) then \(\lambda\) occurs \(\algmult{T}{\lambda}\) times on the diagonal.

#### Proof.

We begin with a proof by induction (Proof TechniqueÂ I) of the first statement in the conclusion of the theorem. We use induction on the dimension of \(V\) to show that if \(\ltdefn{T}{V}{V}\) is a linear transformation, then there is a basis \(B\) for \(V\) such that the matrix representation of \(T\) relative to \(B\text{,}\) \(\matrixrep{T}{B}{B}\text{,}\) is an upper triangular matrix.

To start suppose that \(\dimension{V}=1\text{.}\) Choose any nonzero vector \(\vect{v}\in V\) and realize that \(V=\spn{\set{\vect{v}}}\text{.}\) Then \(\lteval{T}{\vect{v}}=\beta\vect{v}\) for some \(\beta\in\complexes\text{,}\) which determines \(T\) uniquely (TheoremÂ LTDB). This description of \(T\) also gives us a matrix representation relative to the basis \(B=\set{\vect{v}}\) as the \(1\times 1\) matrix with lone entry equal to \(\beta\text{.}\) And this matrix representation is upper triangular (DefinitionÂ UTM).

For the induction step let \(\dimension{V}=m\text{,}\) and assume the theorem is true for every linear transformation defined on a vector space of dimension less than \(m\text{.}\) By TheoremÂ EMHE (suitably converted to the setting of a linear transformation), \(T\) has at least one eigenvalue, and we denote this eigenvalue as \(\lambda\text{.}\) (We will remark later about how critical this step is.) We now consider properties of the linear transformation \(\ltdefn{T-\lambda I_V}{V}{V}\text{.}\)

Let \(\vect{x}\) be an eigenvector of \(T\) for \(\lambda\text{.}\) By definition \(\vect{x}\neq\zerovector\text{.}\) Then

So \(T-\lambda I_V\) is not injective, as it has a nontrivial kernel (TheoremÂ KILT). With an application of TheoremÂ RPNDD we bound the rank of \(T-\lambda I_V\text{,}\)

Let \(W\) be the subspace of \(V\) that is the range of \(T-\lambda I_V\text{,}\) \(W=\rng{T-\lambda I_V}\text{,}\) and define \(k=\dimension{W}\leq m-1\text{.}\) We define a new linear transformation \(S\text{,}\) on \(W\text{,}\)

This does not look we have accomplished much, since the action of \(S\) is identical to the action of \(T\text{.}\) For our purposes this will be a good thing. What is different is the domain and codomain. \(S\) is defined on \(W\text{,}\) a vector space with dimension less than \(m\text{,}\) and so is susceptible to our induction hypothesis. Verifying that \(S\) is really a linear transformation is almost entirely routine, with one exception. Employing \(T\) in our definition of \(S\) raises the possibility that the outputs of \(S\) will not be contained within \(W\) (but instead will lie inside \(V\text{,}\) but outside \(W\)). To examine this possibility, suppose that \(\vect{w}\in W\text{.}\) We have

Since \(W\) is the range of \(T-\lambda I_V\text{,}\) \(\lteval{\left(T-\lambda I_V\right)}{\vect{w}}\in W\text{.}\) And by PropertyÂ SC, \(\lambda\vect{w}\in W\text{.}\) Finally, applying PropertyÂ AC we see by closure that the sum is in \(W\) and so we conclude that \(\lteval{S}{\vect{w}}\in W\text{.}\) This argument convinces us that it is legitimate to define \(S\) as we did with \(W\) as the codomain.

\(S\) is a linear transformation defined on a vector space with dimension \(k\text{,}\) less than \(m\text{,}\) so we can apply the induction hypothesis and conclude that \(W\) has a basis, \(C=\set{\vectorlist{w}{k}}\text{,}\) such that the matrix representation of \(S\) relative to \(C\) is an upper triangular matrix.

Beginning with the linearly independent set \(C\text{,}\) repeatedly apply TheoremÂ ELIS to add vectors to \(C\text{,}\) maintaining a linearly independent set and spanning ever larger subspaces of \(V\text{.}\) This process will end with the addition of \(m-k\) vectors, which together with \(C\) will span all of \(V\text{.}\) Denote these vectors as \(D=\set{\vectorlist{u}{{m-k}}}\text{.}\) Then \(B=C\cup D\) is a basis for \(V\text{,}\) and is the basis we desire for the conclusion of the theorem. So we now consider the matrix representation of \(T\) relative to \(B\text{.}\)

Since the definition of \(T\) and \(S\) agree on \(W\text{,}\) the first \(k\) columns of \(\matrixrep{T}{B}{B}\) will have the upper triangular matrix representation of \(S\) in the first \(k\) rows. The remaining \(m-k\) rows of these first \(k\) columns will be all zeros since the outputs of \(T\) for basis vectors from \(C\) are all contained in \(W\) and hence are linear combinations of the basis vectors in \(C\text{.}\) The situation for \(T\) on the basis vectors in \(D\) is not quite as pretty, but it is close.

For \(1\leq i\leq m-k\text{,}\) consider

In the penultimate equality, we have rewritten an element of the range of \(T-\lambda I_V\) as a linear combination of the basis vectors, \(C\text{,}\) for the range of \(T-\lambda I_V\text{,}\) \(W\text{,}\) using the scalars \(\scalarlist{a}{k}\text{.}\) If we incorporate these \(m-k\) column vectors into the matrix representation \(\matrixrep{T}{B}{B}\) we find \(m-k\) occurrences of \(\lambda\) on the diagonal, and any nonzero entries lying only in the first \(k\) rows. Together with the \(k\times k\) upper triangular representation in the upper left-hand corner, the entire matrix representation for \(T\) is clearly upper triangular. This completes the induction step. So for any linear transformation there is a basis that creates an upper triangular matrix representation.

We have one more statement in the conclusion of the theorem to verify. The eigenvalues of \(T\text{,}\) and their multiplicities, can be computed with the techniques of ChapterÂ E relative to any matrix representation (TheoremÂ EER). We take this approach with our upper triangular matrix representation \(\matrixrep{T}{B}{B}\text{.}\) Let \(d_i\) be the diagonal entry of \(\matrixrep{T}{B}{B}\) in row \(i\) and column \(i\text{.}\) Then the characteristic polynomial, computed as a determinant (DefinitionÂ CP) with repeated expansions about the first column, is

The roots of the polynomial equation \(\charpoly{\matrixrep{T}{B}{B}}{x}=0\) are the eigenvalues of the linear transformation (TheoremÂ EMRCP). So each diagonal entry is an eigenvalue, and is repeated on the diagonal exactly \(\algmult{T}{\lambda}\) times (DefinitionÂ AME).

A key step in this proof was the construction of the subspace \(W\) with dimension strictly less than that of \(V\text{.}\) This required an eigenvalue/eigenvector pair, which was guaranteed to us by TheoremÂ EMHE. Digging deeper, the proof of TheoremÂ EMHE requires that we can factor polynomials completely, into linear factors. This will not always happen if our set of scalars is the reals, \(\reals\text{.}\) So this is our final explanation of our choice of the complex numbers, \(\complexes\text{,}\) as our set of scalars. In \(\complexes\) polynomials factor completely, so every matrix has at least one eigenvalue, and an inductive argument will get us to upper triangular matrix representations.

In the case of linear transformations defined on \(\complex{m}\text{,}\) we can use the inner product (DefinitionÂ IP) profitably to fine-tune the basis that yields an upper triangular matrix representation. Recall that the adjoint of matrix \(A\) (DefinitionÂ A) is written as \(\adjoint{A}\text{.}\)

#### Theorem OBUTR. Orthonormal Basis for Upper Triangular Representation.

Suppose that \(A\) is a square matrix. Then there is a unitary matrix \(U\text{,}\) and an upper triangular matrix \(T\text{,}\) such that

and \(T\) has the eigenvalues of \(A\) as the entries of the diagonal.

#### Proof.

This theorem is a statement about matrices and similarity. We can convert it to a statement about linear transformations, matrix representations and bases (TheoremÂ SCB). Suppose that \(A\) is an \(n\times n\) matrix, and define the linear transformation \(\ltdefn{S}{\complex{n}}{\complex{n}}\) by \(\lteval{S}{\vect{x}}=A\vect{x}\text{.}\) Then TheoremÂ UTMR gives us a basis \(B=\set{\vectorlist{v}{n}}\) for \(\complex{n}\) such that a matrix representation of \(S\) relative to \(B\text{,}\) \(\matrixrep{S}{B}{B}\text{,}\) is upper triangular.

Now convert the basis \(B\) into an orthogonal basis, \(C\text{,}\) by an application of the Gram-Schmidt procedure (TheoremÂ GSP). This is a messy business computationally, but here we have an excellent illustration of the power of the Gram-Schmidt procedure. We need only be sure that \(B\) is linearly independent and spans \(\complex{n}\text{,}\) and then we know that \(C\) is linearly independent, spans \(\complex{n}\) and is also an orthogonal set. We will now consider the matrix representation of \(S\) relative to \(C\) (rather than \(B\)). Write the new basis as \(C=\set{\vectorlist{y}{n}}\text{.}\) The application of the Gram-Schmidt procedure creates each vector of \(C\text{,}\) say \(\vect{y}_j\text{,}\) as the difference of \(\vect{v}_j\) and a linear combination of \(\vectorlist{y}{j-1}\text{.}\) We are not concerned here with the actual values of the scalars in this linear combination, so we will write

where the \(b_{jk}\) are shorthand for the scalars. The equation above is in a form useful for creating the basis \(C\) from \(B\text{.}\) To better understand the relationship between \(B\) and \(C\) convert it to read

In this form, we recognize that the change-of-basis matrix \(\cbm{B}{C}=\matrixrep{I_{\complex{n}}}{B}{C}\) (DefinitionÂ CBM) is an upper triangular matrix. By TheoremÂ SCB we have

The inverse of an upper triangular matrix is upper triangular (TheoremÂ ITMT), and the product of two upper triangular matrices is again upper triangular (TheoremÂ PTMT). So \(\matrixrep{S}{C}{C}\) is an upper triangular matrix.

Now, multiply each vector of \(C\) by a nonzero scalar, so that the result has norm 1. In this way we create a new basis \(D\) which is an orthonormal set (DefinitionÂ ONS). Note that the change-of-basis matrix \(\cbm{C}{D}\) is a diagonal matrix with nonzero entries equal to the norms of the vectors in \(C\text{.}\)

Now we can convert our results into the language of matrices. Let \(E\) be the basis of \(\complex{n}\) formed with the standard unit vectors (DefinitionÂ SUV). Then the matrix representation of \(S\) relative to \(E\) is simply \(A\text{,}\) \(A=\matrixrep{S}{E}{E}\text{.}\) The change-of-basis matrix \(\cbm{D}{E}\) has columns that are simply the vectors in \(D\text{,}\) the orthonormal basis. As such, TheoremÂ CUMOS tells us that \(\cbm{D}{E}\) is a unitary matrix, and by DefinitionÂ UM has an inverse equal to its adjoint. Write \(U=\cbm{D}{E}\text{.}\) We have

The inverse of a diagonal matrix is also a diagonal matrix, and so this final expression is the product of three upper triangular matrices, and so is again upper triangular (TheoremÂ PTMT). Thus the desired upper triangular matrix, \(T\text{,}\) is the matrix representation of \(S\) relative to the orthonormal basis \(D\text{,}\) \(\matrixrep{S}{D}{D}\text{.}\)

### Subsection NM Normal Matrices

Normal matrices comprise a broad class of interesting matrices, many of which we have met already. But they are most interesting since they define exactly which matrices we can diagonalize via a unitary matrix. This is the upcoming TheoremÂ OD. Here is the definition.

#### Definition NRML. Normal Matrix.

The square matrix \(A\) is normal if \(\adjoint{A}A=A\adjoint{A}\text{.}\)

So a normal matrix commutes with its adjoint. Part of the beauty of this definition is that it includes many other types of matrices. A diagonal matrix will commute with its adjoint, since the adjoint is again diagonal and the entries are just conjugates of the entries of the original diagonal matrix. A Hermitian (self-adjoint) matrix (DefinitionÂ HM) will trivially commute with its adjoint, since the two matrices are the same. A real, symmetric matrix is Hermitian, so these matrices are also normal. A unitary matrix (DefinitionÂ UM) has its adjoint as its inverse, and inverses commute (TheoremÂ OSIS), so unitary matrices are normal. Another class of normal matrices is the skew-symmetric matrices. However, these broad descriptions still do not capture all of the normal matrices, as the next example shows.

#### Example ANM. A normal matrix.

Let

Then

so we see by DefinitionÂ NRML that \(A\) is normal. However, \(A\) is not symmetric (hence, as a real matrix, not Hermitian), not unitary, and not skew-symmetric.

### Subsection OD Orthonormal Diagonalization

A diagonal matrix is very easy to work with in matrix multiplication (ExampleÂ HPDM) and an orthonormal basis also has many advantages (TheoremÂ COB). How about converting a matrix to a diagonal matrix through a similarity transformation using a unitary matrix (i.e. build a diagonal matrix representation with an orthonormal matrix)? That'd be fantastic! When can we do this? We can always accomplish this feat when the matrix is normal, and normal matrices are the only ones that behave this way. Here is the theorem.

#### Theorem OD. Orthonormal Diagonalization.

Suppose that \(A\) is a square matrix. Then there is a unitary matrix \(U\) and a diagonal matrix \(D\text{,}\) with diagonal entries equal to the eigenvalues of \(A\text{,}\) such that \(\adjoint{U}AU=D\) if and only if \(A\) is a normal matrix.

#### Proof.

##### (â)Â

Suppose there is a unitary matrix \(U\) that diagonalizes \(A\text{.}\) We would usally write this condition as \(\adjoint{U}AU=D\text{,}\) but we will find it convenient in this part of the proof to use our hypothesis in the equivalent form, \(A=UD\adjoint{U}\text{.}\) Recall that a diagonal matrix is normal, and notice that this observation is at the center of the next sequence of equalities. We check the normality of \(A\text{,}\)

So by DefinitionÂ NRML, \(A\) is a normal matrix.

##### (â)Â

For the converse, suppose that \(A\) is a normal matrix. Whether or not \(A\) is normal, TheoremÂ OBUTR provides a unitary matrix \(U\) and an upper triangular matrix \(T\text{,}\) whose diagonal entries are the eigenvalues of \(A\text{,}\) and such that \(\adjoint{U}AU=T\text{.}\) With the added condition that \(A\) is normal, we will determine that the entries of \(T\) above the diagonal must be all zero. Here we go.

First notice that DefinitionÂ UM implies that the inverse of a unitary matrix \(U\) is the adjoint, \(\adjoint{U}\text{,}\) so the product of these two matrices, in either order, is the identity matrix (TheoremÂ OSIS). We begin by showing that \(T\) is normal,

So by DefinitionÂ NRML, \(T\) is a normal matrix.

We can translate the normality of \(T\) into the statement \(T\adjoint{T}-\adjoint{T}T=\zeromatrix\text{.}\) We now establish an equality we will use repeatedly. For \(1\leq i\leq n\text{,}\)

To conclude, we use the above equality repeatedly, beginning with \(i=1\text{,}\) and discover, row by row, that the entries above the diagonal of \(T\) are all zero. The key observation is that a sum of squares can only equal zero when each term of the sum is zero. For \(i=1\) we have

which forces the conclusions

For \(i=2\) we use the same equality, but also incorporate the portion of the above conclusions that says \(\matrixentry{T}{12}=0\text{,}\)

which forces the conclusions

We can repeat this process for the subsequent values of \(i=3,\,4,\,5\ldots,\,n-1\text{.}\) Notice that it is critical we do this in order, since we need to employ portions of each of the previous conclusions about rows having zero entries in order to successfully get the same conclusion for later rows. Eventually, we conclude that all of the nondiagonal entries of \(T\) are zero, so the extra assumption of normality forces \(T\) to be diagonal.

We can rearrange the conclusion of this theorem to read \(A=UD\adjoint{U}\text{.}\) Recall that a unitary matrix can be viewed as a geometry-preserving transformation (isometry), or more loosely as a rotation of sorts. Then a matrix-vector product, \(A\vect{x}\text{,}\) can be viewed instead as a sequence of three transformations. \(\adjoint{U}\) is unitary, and so is a rotation. Since \(D\) is diagonal, it just multiplies each entry of a vector by a scalar. Diagonal entries that are positive or negative, with absolute values bigger or smaller than 1 evoke descriptions like reflection, expansion and contraction. Generally we can say that \(D\) âstretchesâ a vector in each component. Final multiplication by \(U\) undoes (inverts) the rotation performed by \(\adjoint{U}\text{.}\) So a normal matrix is a rotation-stretch-rotation transformation.

The orthonormal basis formed from the columns of \(U\) can be viewed as a system of mutually perpendicular axes. The rotation by \(\adjoint{U}\) allows the transformation by \(A\) to be replaced by the simple transformation \(D\) along these axes, and then \(D\) brings the result back to the original coordinate system. For this reason TheoremÂ OD is known as the Principal Axis Theorem.

The columns of the unitary matrix in TheoremÂ OD create an especially nice basis for use with the normal matrix. We record this observation as a theorem.

#### Theorem OBNM. Orthonormal Bases and Normal Matrices.

Suppose that \(A\) is a normal matrix of size \(n\text{.}\) Then there is an orthonormal basis of \(\complex{n}\) composed of eigenvectors of \(A\text{.}\)

#### Proof.

Let \(U\) be the unitary matrix promised by TheoremÂ OD and let \(D\) be the resulting diagonal matrix. The desired set of vectors is formed by collecting the columns of \(U\) into a set. TheoremÂ CUMOS says this set of columns is orthonormal. Since \(U\) is nonsingular (TheoremÂ UMI), TheoremÂ CNMB says the set is a basis.

Since \(A\) is diagonalized by \(U\text{,}\) the diagonal entries of the matrix \(D\) are the eigenvalues of \(A\text{.}\) An argument exactly like the second half of the proof of TheoremÂ DC shows that each vector of the basis is an eigenvector of \(A\text{.}\)

In a vague way TheoremÂ OBNM is an improvement on TheoremÂ HMOE which said that eigenvectors of a Hermitian matrix for different eigenvalues are always orthogonal. Hermitian matrices are normal and we see that we can find at least one basis where *every* pair of eigenvectors is orthogonal. Notice that this is not a generalization, since TheoremÂ HMOE states a weak result which applies to many (but not all) pairs of eigenvectors, while TheoremÂ OBNM is a seemingly stronger result, but only asserts that there is one collection of eigenvectors with the stronger property.

Given an \(n\times n\) matrix \(A\text{,}\) an orthonormal basis for \(\complex{n}\text{,}\) comprised of eigenvectors of \(A\) is an extremely useful basis to have at the service of the matrix \(A\text{.}\) Why do we say this? We can consider the vectors of a basis as a preferred set of directions, known as âaxes,â which taken together might also be called a âcoordinate system.â The standard basis of DefinitionÂ SUV could be considered the default, or prototype, coordinate system. When a basis is orthornormal, we can consider the directions to be standardized to have unit length, and we can consider the axes as being mutually perpendicular. But there is more â let us be a bit more formal.

Suppose \(U\) is a matrix whose columns are an orthonormal basis of eigenvectors of the \(n\times n\) matrix \(A\text{.}\) So, in particular \(U\) is a unitary matrix (TheoremÂ CUMOS). For a vector \(\vect{x}\in\complex{n}\text{,}\) use the notation \(\hat{\vect{x}}\) for the vector representation of \(\vect{x}\) relative to the orthonormal basis. So the entries of \(\hat{\vect{x}}\text{,}\) used in a linear combination of the columns of \(U\) will create \(\vect{x}\text{.}\) With DefinitionÂ MVP, we can write this relationship as

Since \(\adjoint{U}\) is the inverse of \(U\) (DefinitionÂ UM), we can rearrange this equation as

This says we can easily create the vector representation relative to the orthonormal basis with a matrix-vector product of the adjoint of \(U\text{.}\) Note that the adjoint is much easier to compute than a matrix inverse, which would be one general way to obtain a vector representation. This is our first observation about coordinatization relative to orthonormal basis. However, we already knew this, as we just have TheoremÂ COB in disguise (see ExerciseÂ OD.T20).

We also know that orthonormal bases play nicely with inner products. TheoremÂ UMPIP says unitary matrices preserve inner products (and hence norms). More geometrically, lengths and angles are preserved by multiplication by a unitary matrix. Using our notation, this becomes

So we can compute inner products with the original vectors, or with their representations, and obtain the same result. It follows that norms, lengths, and angles can all be computed with the original vectors or with the representations in the new coordinate system based on an orthonormal basis.

So far we have not really said anything new, nor has the matrix \(A\text{,}\) or its eigenvectors, come into play. We know that a matrix is really a linear transformation, so we express this view of a matrix as a function by writing generically that \(A\vect{x}=\vect{y}\text{.}\) The matrix \(U\) will diagonalize \(A\text{,}\) creating the diagonal matrix \(D\) with diagonal entries equal to the eigenvalues of \(A\text{.}\) We can write this as \(\adjoint{U}AU = D\) and convert to \(\adjoint{U}A=D\adjoint{U}\text{.}\) Then we have

So with the coordinatized vectors, the transformation by the matrix \(A\) can be accomplished with multiplication by a diagonal matrix \(D\text{.}\) A moment's thought should convince you that a matrix-vector product with a diagonal matrix is exeedingly simple computationally. Geometrically, this is simply stretching, contracting and/or reflecting in the direction of each basis vector (âaxisâ). And the multiples used for these changes are the diagonal entries of the diagonal matrix, the eigenvalues of \(A\text{.}\)

So the new coordinate system (provided by the orthonormal basis of eigenvectors) is a collection of mutually perpendicular unit vectors where inner products are preserved, and the action of the matrix \(A\) is described by multiples (eigenvalues) of the entries of the coordinatized versions of the vectors. Nice.

### Reading Questions OD Reading Questions

#### 1.

Name three broad classes of normal matrices that we have studied previously. No set that you give should be a subset of another on your list.

#### 2.

Compare and contrast TheoremÂ UTMR with TheoremÂ OD.

#### 3.

Given an \(n\times n\) matrix \(A\text{,}\) why would you desire an orthonormal basis of \(\complex{n}\) composed entirely of eigenvectors of \(A\text{?}\)

### Exercises OD Exercises

#### T10.

ExerciseÂ MM.T35 asked you to show that \(A\adjoint{A}\) is Hermitian. Prove directly that \(A\adjoint{A}\) is a normal matrix.

#### T20.

In the discussion following TheoremÂ OBNM we comment that the equation \(\hat{\vect{x}} = \adjoint{U}\vect{x}\) is just TheoremÂ COB in disguise. Formulate this observation more formally and prove the equivalence.

#### T30.

For the proof of TheoremÂ PTMT we only show that the product of two lower triangular matrices is again lower triangular. Provide a proof that the product of two upper triangular matrices is again upper triangular. Look to the proof of TheoremÂ PTMT for guidance if you need a hint.