Ben Blum-Smith asked the question I’ve been pondering since my last post

I’m a little confused… if a real matrix is not symmetric, there is no guarantee of a real eigenvector (e.g. take a 2-d rotation matrix), so what did you mean “I expect that other arguments along similar lines are possible for non-symmetric real matrices”?

As it turns out, I’ve been spending quite some time repairing my own understanding of linear algebra. What I should have said is, I expect to find similar arguments for normal matrices.

Normal is a terrible name of course. Are other matrices weird? non-conformist?

Unfortunately, I haven’t figured out how to pin down a similarly elementary flavored proof for normal matrices. Instead, I’m going to present an argument for another branch of the family tree: (so to speak) orthonormal matrices.

But first, I realized my last post might have jumped in a bit too deep all at once, so I’m going to try to err the other way and cover some more basic linear algebra this time as well. Bear with me and let me define orthonormal matrices before I talk about their eigenanalysis. I’ll give two definitions and suggest why they’re equivalent.

One standard approach is to think of the columns as vectors in . For instance, take the vector space , aka. “yes, that convenient mathematical model for the space we live in.” We might have the matrix (courtesy wikipedia)

We say a square matrix like this is orthonormal when the column vectors are all length and are pairwise orthogonal. More symbolically, for every column vector , (equivalently ) and for any two distinct column vectors and , their dot product is . This gives a simple computation we can perform to check that the above matrix is in fact orthonormal.

But, I’m a graphics person, so let’s make a picture. I’ll go ahead and plot the three column vectors (labeled ) relative to the standard basis vectors , and .

As you can see, the column vectors appear to be unit length and orthogonal to each other. If we place them in correspondence with the three standard coordinate vectors (axes) then we can think of the column vector basis as a rotated image of the standard basis. That is, our matrix is encoding a rotation transformation. This is how we get our second definition of an orthonormal matrix.

If we want the effect of multiplying by an orthonormal matrix to be a “rotation” (whatever that means in -dimensional space) then it should probably have the following properties. (A) transforming a vector shouldn’t change its length and (B) if two vectors are orthogonal before transforming them with our matrix, then they better remain orthogonal after transforming them. These two conditions translate to the following properties

- For all vectors ,
- For all vectors ,

In fact, we can now see that the first condition is a special case of the second. We can express the second condition in a more algebraic sounding way with the phrase “an orthonormal transformation is a transformation that preserves the dot product.” We can get an even nicer algebraic characterization if we do a little symbol pushing.

Now, the only way that the rightmost equality is gong to hold is if we can just remove from the middle. But we can do this precisely when the identity matrix. Aha. That’s a great definition, now we don’t have to talk about column vectors or any sort of vectors whatsoever. Slick!

(It turns out that you can get the equation for orthonormal matrices from the first definition I gave too. The trick is to realize that the entry of the matrix product encodes the dot product between the th and th column vectors.)

OK, now that we’re all chummy with orthonormal matrices, I want to state the key theorem for their eigenanalysis.

Theorem:Given an orthonormal matrix , () there exists a two dimensional subspace of “fixed” by . In other words, there exist vectors so that for any linear combination , the vector is also a linear combination of and .

Since we defined an orthonormal transformation to preserve length, this means we can think of ‘s effect or action on the subspace as a rotation. Combined with some other (simpler) theorems, we can arrive at the punch line of orthonormal eigenanalysis:

Every -dimensional rotation factors into a series of independent -dimensional rotations.

This is a fascinating geometric fact, but it’s usually buried behind this mess about “complex eigenvalues.” Continuing my theme, you don’t need complex numbers, polynomials or lagrange multipliers to prove this theorem.

**proof:**

To start, why don’t we just leverage our previous result about symmetric matrices. In order to do this, we have to “symmetrize” our orthonormal matrix: . Since is symmetric, we know that it must have some maximal eigenvalue and eigenvector so that

This tells us that the three vectors , , and are linearly dependent. Geometrically, they all lie in the same plane. However, we really want to focus on , not , so let’s go ahead and “rotate” this arrangement of three vectors by :

(You can check that if and only if , but I’ll just assume that’s already been proven here. You may also want to note that this is the key point at which we invoke orthonormality.) Squint, and you should see that this equation tells us that if we keep rotating by , then we start becoming linearly dependent after the second rotation. We just need to dot our ‘i’s and cross our ‘t’s now.

Let and . Then,

There is obviously a lot more to be said about the consequences of this theorem for , , and dimensional rotations, but I’ve already said more than enough for a single post.