The quarter turn of the plane moves every real line through the origin off itself, so it has no real eigenvector. Its eigenvalues and are not real, and a real triangular matrix carries only real numbers on its diagonal, so no real orthonormal basis can make it triangular. Real Schur form keeps real orthonormal coordinates and allows diagonal blocks of size two for such eigenvalues. This lesson builds a real invariant plane from a conjugate pair of eigenvalues, proves that the form exists for every real square matrix, and explains when a block really is a rotation combined with a uniform scaling.
Key terms
Complex conjugate eigenpair
Definition Let . Its characteristic polynomial has real coefficients, so conjugating the factorization of over gives the same polynomial back. Hence the nonreal eigenvalues of come in pairs , with equal algebraic multiplicities. Eigenvectors pair up the same way. If is nonzero and , then conjugating every entry and using gives
The pairs and form a complex conjugate eigenpair. When with and , write with . Comparing real and imaginary parts of gives
In plain words A real matrix cannot tell from , so whatever it does to a complex eigenvector it also does, conjugated, to the conjugate vector. The real and imaginary parts of the eigenvector are real vectors that mixes with each other.
Example Tuples such as stand for column vectors. The matrix
has , with roots . For the second row of gives , so is an eigenvector, and is an eigenvector for . Here , and , and indeed
Real invariant plane
Definition Let have a nonreal eigenvalue , with and , and an eigenvector with . Then and are linearly independent, and the real plane
is invariant under . In the ordered basis the restriction has the matrix
whose eigenvalues are . Invariance is read off from and . For independence, the span of and is not , since . If it were a line, that invariant real line would be spanned by a real eigenvector with a real eigenvalue , so and . That gives , which forces and contradicts . The plane contains no real eigenvector of , because the restriction has no real eigenvalue. The basis need not be orthogonal, and and need not have equal lengths.
In plain words A nonreal eigenvalue gives no real eigenline, but the real and imaginary parts of its eigenvector span a real plane that maps into itself. In the coordinates of the basis , which may be skewed or unevenly scaled, the restriction of to that plane has the matrix pattern of a rotation combined with a scaling.
Example Take the real matrix
with and eigenvalues and . The vector satisfies , so , and . Then
so the plane spanned by and is invariant, and in the basis the restriction has the matrix with rows and . The vectors and are perpendicular but have lengths and . The remaining eigenvalue has the real eigenvector , which lies outside .
Real Schur form
Definition The real Schur theorem says the following. Let with . There is a real orthogonal matrix , so that , such that
is real and block upper triangular, and each diagonal block is or . Each block is a real eigenvalue of , and each block is a real matrix with a pair of nonreal complex conjugate eigenvalues. The matrix is a real Schur form of . Since
the diagonal blocks account for every eigenvalue of with its algebraic multiplicity. For each , the columns of that belong to the first blocks span a subspace invariant under . In general neither nor is unique, and the blocks above the diagonal may be nonzero. The form is upper triangular exactly when all eigenvalues of are real.
The proof is an induction on that removes one or two dimensions at a time. Assume the theorem for every size below . The fundamental theorem of algebra gives a complex eigenvalue of . If is real, the real singular matrix has a nonzero real kernel vector, and normalizing it gives a unit vector spanning a real invariant line. If is not real, the real invariant plane built from an eigenvector has an orthonormal basis by the Gram-Schmidt process. Completing to a real orthonormal basis of gives an orthogonal with
where is with or , and is the real compression of to the orthogonal complement of the chosen line or plane. If the proof is complete. Otherwise the induction hypothesis gives an orthogonal with in real Schur form, and finishes the step. Neither an invariant complement nor normality is needed.
In plain words Real orthonormal coordinates cannot always produce a triangular matrix, because nonreal eigenvalues have nowhere to sit on a real diagonal. Allowing a block for each conjugate pair is the only change needed, and then the same peel and repeat argument as in the complex case works.
Example For the matrix from the real invariant plane example, orthonormalize the plane with and , and complete with . Then
a real Schur form with a block for followed by the block . Starting instead from the real eigenvector , the orthonormal basis gives a second real Schur form,
with the blocks in the opposite order. In this second form the block is the compression of to the plane spanned by and , which is not invariant, since has an component.
Two-by-two real Schur block
Definition A two-by-two real Schur block is a diagonal block of a real Schur form. It is a real matrix
which is exactly the condition for to have nonreal roots. Its eigenvalues are , where
and they form a conjugate pair of eigenvalues of . The block is the matrix of the compression of to the plane spanned by its two columns of , in that orthonormal basis. For the first block this compression is the restriction of to an invariant plane. Replacing those two columns by , for any real orthogonal matrix , replaces the block by and keeps the real Schur shape. So the entries of a block are not determined by , while its eigenvalues, and with them its trace and determinant, stay the same under this replacement. In particular the entries need not follow the pattern with rows and that the basis produces.
In plain words A two-by-two block holds one conjugate pair of eigenvalues that cannot be separated over . Its eigenvalues are fixed, but its four entries depend on which orthonormal basis of the plane is chosen.
Example The block
from the first real Schur form above has trace and determinant . Its discriminant is , and , , so its eigenvalues are . It is the restriction of to the invariant plane written in the orthonormal basis . In the basis , whose vectors have lengths and , the same restriction has the matrix with rows and .
Rotation-scaling block
Definition A rotation-scaling block is a real matrix of the form
with and , where and is the angle with and . Its eigenvalues are . In an orthonormal basis it rotates the plane through the angle , measured from the first basis vector toward the second, and multiplies every length by . A real matrix with nonreal eigenvalues is a rotation-scaling block if and only if it is normal, which for a real matrix means .
For the proof, a rotation-scaling block satisfies . Conversely, write with symmetric and skew-symmetric. Expanding gives . In two dimensions with the quarter turn with rows and , and , since otherwise would be symmetric with real eigenvalues. With having rows and ,
so forces and , and has rows and . An orthogonal change of basis preserves normality, because
So a block that is not normal is not a rotation-scaling block in any orthonormal basis. It still has the matrix with rows and in the basis built from an eigenvector for , but for such a block that basis cannot be orthonormal.
In plain words A rotation-scaling block turns every vector through the same angle and stretches every length by the same factor. Nonreal eigenvalues alone do not give that picture. In an orthonormal basis it needs normality as well.
Example The matrix with rows and is the rotation-scaling block with , and , and its products and both equal . By contrast, take
Its eigenvalues are , the same as those of the rotation-scaling block with rows and . The eigenvector for gives and , and in the basis the matrix of has rows and . Yet has length while has length , and
So is not normal, and no orthonormal basis makes it a rotation-scaling block. The basis is orthogonal, but its vectors have lengths and .
Check yourself
- A real matrix has the eigenvector for the eigenvalue . Name a second eigenvalue with an eigenvector, and find .
Show the answer
Because is real, conjugation gives the eigenvalue with eigenvector . Writing gives and , and gives and . So
These are the columns of , so
a rotation-scaling block with . As a check, .
- Let
Is there a real orthogonal for which is a rotation-scaling block?
Show the answer
No. Its eigenvalues are , but rotation-scaling blocks are normal, and is normal exactly when is. Here
so is not normal. Nonreal eigenvalues are not enough for the picture of a rotation with uniform scaling. Indeed sends to a vector of length and to a vector of length .
- Let
Find a real Schur form of and decide whether the plane spanned by and is invariant. Then explain why every real Schur form of a real matrix contains a block.
Show the answer
Since , start with the real eigenvector and complete it with and . The images are , and , so the orthogonal with columns , , gives
The block has trace and determinant , so it carries the eigenvalues , and . The plane spanned by and is not invariant, because has an component. The block is a compression to that plane, not a restriction.
Finally, the diagonal blocks have sizes or and their sizes add up to , which is odd, so at least one block is . Hence every real matrix has a real eigenvalue, and the same argument works for every real square matrix of odd size.