Unit 5, lesson 24

Real Schur Form

How a conjugate eigenpair of a real matrix gives a real invariant plane, why real Schur form uses diagonal blocks of size one and two, and when a two-by-two block is a rotation-scaling block.

  • Video 24
  • Invariant Blocks and Schur Form

The quarter turn of the plane moves every real line through the origin off itself, so it has no real eigenvector. Its eigenvalues ii and −i-i 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 A∈Rn×nA \in \mathbb{R}^{n \times n}. Its characteristic polynomial has real coefficients, so conjugating the factorization of χA\chi_A over C\mathbb{C} gives the same polynomial back. Hence the nonreal eigenvalues of AA come in pairs λ\lambda, λ‾\overline{\lambda} with equal algebraic multiplicities. Eigenvectors pair up the same way. If z∈Cnz \in \mathbb{C}^n is nonzero and Az=λzAz = \lambda z, then conjugating every entry and using A‾=A\overline{A} = A gives

Az‾=λ‾ z‾.A\overline{z} = \overline{\lambda}\,\overline{z}.

The pairs (λ,z)(\lambda, z) and (λ‾,z‾)(\overline{\lambda}, \overline{z}) form a complex conjugate eigenpair. When λ=a+ib\lambda = a + ib with a,b∈Ra, b \in \mathbb{R} and b≠0b \ne 0, write z=x+iyz = x + iy with x,y∈Rnx, y \in \mathbb{R}^n. Comparing real and imaginary parts of A(x+iy)=(a+ib)(x+iy)A(x + iy) = (a + ib)(x + iy) gives

Ax=ax−by,Ay=bx+ay.\begin{aligned} Ax &= ax - by, \\[0.4em] Ay &= bx + ay. \end{aligned}

In plain words A real matrix cannot tell ii from −i-i, 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 AA mixes with each other.

Example Tuples such as (x1,x2)(x_1, x_2) stand for column vectors. The matrix

A=[0−212]A = \begin{bmatrix} 0 & -2 \\ 1 & 2 \end{bmatrix}

has χA(t)=t2−2t+2\chi_A(t) = t^2 - 2t + 2, with roots 1±i1 \pm i. For λ=1+i\lambda = 1 + i the second row of A−λIA - \lambda I gives z1+(1−i)z2=0z_1 + (1 - i)z_2 = 0, so z=(−1+i,1)z = (-1 + i, 1) is an eigenvector, and z‾=(−1−i,1)\overline{z} = (-1 - i, 1) is an eigenvector for 1−i1 - i. Here a=b=1a = b = 1, x=(−1,1)x = (-1, 1) and y=(1,0)y = (1, 0), and indeed

Ax=(−2,1)=x−y,Ay=(0,1)=x+y.\begin{aligned} Ax &= (-2, 1) = x - y, \\[0.4em] Ay &= (0, 1) = x + y. \end{aligned}

Real invariant plane

Definition Let A∈Rn×nA \in \mathbb{R}^{n \times n} have a nonreal eigenvalue λ=a+ib\lambda = a + ib, with a,b∈Ra, b \in \mathbb{R} and b≠0b \ne 0, and an eigenvector z=x+iyz = x + iy with x,y∈Rnx, y \in \mathbb{R}^n. Then xx and yy are linearly independent, and the real plane

U=span⁡R{x,y}⊆RnU = \operatorname{span}_{\mathbb{R}}\{x, y\} \subseteq \mathbb{R}^n

is invariant under AA. In the ordered basis (x,y)(x, y) the restriction A∣UA|_U has the matrix

[ab−ba],\begin{bmatrix} a & b \\ -b & a \end{bmatrix},

whose eigenvalues are a±iba \pm ib. Invariance is read off from Ax=ax−byAx = ax - by and Ay=bx+ayAy = bx + ay. For independence, the span of xx and yy is not {0}\{0\}, since z≠0z \ne 0. If it were a line, that invariant real line would be spanned by a real eigenvector with a real eigenvalue μ\mu, so Ax=μxAx = \mu x and Ay=μyAy = \mu y. That gives Az=μzAz = \mu z, which forces λ=μ\lambda = \mu and contradicts b≠0b \ne 0. The plane UU contains no real eigenvector of AA, because the restriction has no real eigenvalue. The basis (x,y)(x, y) need not be orthogonal, and xx and yy 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 AA maps into itself. In the coordinates of the basis (x,y)(x, y), which may be skewed or unevenly scaled, the restriction of AA to that plane has the matrix pattern of a rotation combined with a scaling.

Example Take the real matrix

A=[101−121−101],A = \begin{bmatrix} 1 & 0 & 1 \\ -1 & 2 & 1 \\ -1 & 0 & 1 \end{bmatrix},

with χA(t)=(t2−2t+2)(t−2)\chi_A(t) = (t^2 - 2t + 2)(t - 2) and eigenvalues 1±i1 \pm i and 22. The vector z=(1,1,i)z = (1, 1, i) satisfies Az=(1+i)zAz = (1 + i)z, so a=b=1a = b = 1, x=(1,1,0)x = (1, 1, 0) and y=(0,0,1)y = (0, 0, 1). Then

Ax=(1,1,−1)=x−y,Ay=(1,1,1)=x+y,\begin{aligned} Ax &= (1, 1, -1) = x - y, \\[0.4em] Ay &= (1, 1, 1) = x + y, \end{aligned}

so the plane UU spanned by xx and yy is invariant, and in the basis (x,y)(x, y) the restriction has the matrix with rows (1,1)(1, 1) and (−1,1)(-1, 1). The vectors xx and yy are perpendicular but have lengths 2\sqrt{2} and 11. The remaining eigenvalue 22 has the real eigenvector e2e_2, which lies outside UU.

Real Schur form

Definition The real Schur theorem says the following. Let A∈Rn×nA \in \mathbb{R}^{n \times n} with n≥1n \ge 1. There is a real orthogonal matrix QQ, so that QTQ=IQ^{\mathsf{T}}Q = I, such that

QTAQ=T=[T11T12⋯T1k0T22⋯T2k⋮⋱⋮0⋯0Tkk]\begin{aligned} &Q^{\mathsf{T}}AQ = T \\[0.4em] &\quad = \begin{bmatrix} T_{11} & T_{12} & \cdots & T_{1k} \\ 0 & T_{22} & \cdots & T_{2k} \\ \vdots & & \ddots & \vdots \\ 0 & \cdots & 0 & T_{kk} \end{bmatrix} \end{aligned}

is real and block upper triangular, and each diagonal block TjjT_{jj} is 1×11 \times 1 or 2×22 \times 2. Each 1×11 \times 1 block is a real eigenvalue of AA, and each 2×22 \times 2 block is a real matrix with a pair of nonreal complex conjugate eigenvalues. The matrix TT is a real Schur form of AA. Since

χA=χT11⋯χTkk,\chi_A = \chi_{T_{11}} \cdots \chi_{T_{kk}},

the diagonal blocks account for every eigenvalue of AA with its algebraic multiplicity. For each jj, the columns of QQ that belong to the first jj blocks span a subspace invariant under AA. In general neither QQ nor TT is unique, and the blocks above the diagonal may be nonzero. The form is upper triangular exactly when all eigenvalues of AA are real.

The proof is an induction on nn that removes one or two dimensions at a time. Assume the theorem for every size below nn. The fundamental theorem of algebra gives a complex eigenvalue λ\lambda of AA. If λ\lambda is real, the real singular matrix A−λIA - \lambda I has a nonzero real kernel vector, and normalizing it gives a unit vector q1q_1 spanning a real invariant line. If λ\lambda is not real, the real invariant plane built from an eigenvector has an orthonormal basis q1,q2q_1, q_2 by the Gram-Schmidt process. Completing to a real orthonormal basis of Rn\mathbb{R}^n gives an orthogonal Q0Q_0 with

Q0TAQ0=[T11C0B],Q_0^{\mathsf{T}}AQ_0 = \begin{bmatrix} T_{11} & C \\ 0 & B \end{bmatrix},

where T11T_{11} is s×ss \times s with s=1s = 1 or s=2s = 2, and BB is the real (n−s)×(n−s)(n - s) \times (n - s) compression of AA to the orthogonal complement of the chosen line or plane. If s=ns = n the proof is complete. Otherwise the induction hypothesis gives an orthogonal ZZ with ZTBZZ^{\mathsf{T}}BZ in real Schur form, and Q=Q0[Is00Z]Q = Q_0\begin{bmatrix} I_s & 0 \\ 0 & Z \end{bmatrix} 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 2×22 \times 2 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 3×33 \times 3 matrix AA from the real invariant plane example, orthonormalize the plane with q1=(1,1,0)/2q_1 = (1, 1, 0)/\sqrt{2} and q2=e3q_2 = e_3, and complete with q3=(1,−1,0)/2q_3 = (1, -1, 0)/\sqrt{2}. Then

QTAQ=[12−1−121−12002],Q^{\mathsf{T}}AQ = \begin{bmatrix} 1 & \sqrt{2} & -1 \\ -\tfrac{1}{\sqrt{2}} & 1 & -\tfrac{1}{\sqrt{2}} \\ 0 & 0 & 2 \end{bmatrix},

a real Schur form with a 2×22 \times 2 block for 1±i1 \pm i followed by the 1×11 \times 1 block 22. Starting instead from the real eigenvector e2e_2, the orthonormal basis (e2,e1,e3)(e_2, e_1, e_3) gives a second real Schur form,

[2−110110−11],\begin{bmatrix} 2 & -1 & 1 \\ 0 & 1 & 1 \\ 0 & -1 & 1 \end{bmatrix},

with the blocks in the opposite order. In this second form the 2×22 \times 2 block is the compression of AA to the plane spanned by e1e_1 and e3e_3, which is not invariant, since Ae1=(1,−1,−1)Ae_1 = (1, -1, -1) has an e2e_2 component.

Two-by-two real Schur block

Definition A two-by-two real Schur block is a 2×22 \times 2 diagonal block TjjT_{jj} of a real Schur form. It is a real matrix

M=[pqrs]with(p−s)2+4qr<0,\begin{gathered} M = \begin{bmatrix} p & q \\ r & s \end{bmatrix} \\[0.4em] \text{with} \quad (p - s)^2 + 4qr < 0, \end{gathered}

which is exactly the condition for χM(t)=t2−(p+s)t+(ps−qr)\chi_M(t) = t^2 - (p + s)t + (ps - qr) to have nonreal roots. Its eigenvalues are α±iβ\alpha \pm i\beta, where

α=p+s2,β=(ps−qr)−α2>0,\begin{aligned} \alpha &= \frac{p + s}{2}, \\[0.4em] \beta &= \sqrt{(ps - qr) - \alpha^2} > 0, \end{aligned}

and they form a conjugate pair of eigenvalues of AA. The block is the matrix of the compression of AA to the plane spanned by its two columns of QQ, in that orthonormal basis. For the first block this compression is the restriction of AA to an invariant plane. Replacing those two columns QjQ_j by QjZQ_jZ, for any real orthogonal 2×22 \times 2 matrix ZZ, replaces the block by ZTTjjZZ^{\mathsf{T}}T_{jj}Z and keeps the real Schur shape. So the entries of a block are not determined by AA, 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 (a,b)(a, b) and (−b,a)(-b, a) that the basis (x,y)(x, y) produces.

In plain words A two-by-two block holds one conjugate pair of eigenvalues that cannot be separated over R\mathbb{R}. Its eigenvalues are fixed, but its four entries depend on which orthonormal basis of the plane is chosen.

Example The block

M=[12−121]M = \begin{bmatrix} 1 & \sqrt{2} \\ -\tfrac{1}{\sqrt{2}} & 1 \end{bmatrix}

from the first real Schur form above has trace 22 and determinant 1+1=21 + 1 = 2. Its discriminant is (1−1)2+4⋅2⋅(−12)=−4<0(1 - 1)^2 + 4 \cdot \sqrt{2} \cdot \big(-\tfrac{1}{\sqrt{2}}\big) = -4 < 0, and α=1\alpha = 1, β=2−1=1\beta = \sqrt{2 - 1} = 1, so its eigenvalues are 1±i1 \pm i. It is the restriction of AA to the invariant plane UU written in the orthonormal basis (q1,q2)(q_1, q_2). In the basis (x,y)(x, y), whose vectors have lengths 2\sqrt{2} and 11, the same restriction has the matrix with rows (1,1)(1, 1) and (−1,1)(-1, 1).

Rotation-scaling block

Definition A rotation-scaling block is a real 2×22 \times 2 matrix of the form

[a−bba]=r[cos⁡θ−sin⁡θsin⁡θcos⁡θ]\begin{bmatrix} a & -b \\ b & a \end{bmatrix} = r\begin{bmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{bmatrix}

with a,b∈Ra, b \in \mathbb{R} and b≠0b \ne 0, where r=a2+b2>0r = \sqrt{a^2 + b^2} > 0 and θ\theta is the angle with cos⁡θ=a/r\cos\theta = a/r and sin⁡θ=b/r\sin\theta = b/r. Its eigenvalues are a±iba \pm ib. In an orthonormal basis it rotates the plane through the angle θ\theta, measured from the first basis vector toward the second, and multiplies every length by rr. A real 2×22 \times 2 matrix MM with nonreal eigenvalues is a rotation-scaling block if and only if it is normal, which for a real matrix means MTM=MMTM^{\mathsf{T}}M = MM^{\mathsf{T}}.

For the proof, a rotation-scaling block satisfies MTM=(a2+b2)I=MMTM^{\mathsf{T}}M = (a^2 + b^2)I = MM^{\mathsf{T}}. Conversely, write M=S+KM = S + K with S=12(M+MT)S = \tfrac{1}{2}(M + M^{\mathsf{T}}) symmetric and K=12(M−MT)K = \tfrac{1}{2}(M - M^{\mathsf{T}}) skew-symmetric. Expanding MTM=MMTM^{\mathsf{T}}M = MM^{\mathsf{T}} gives SK=KSSK = KS. In two dimensions K=cJK = cJ with JJ the quarter turn with rows (0,−1)(0, -1) and (1,0)(1, 0), and c≠0c \ne 0, since otherwise MM would be symmetric with real eigenvalues. With SS having rows (d,e)(d, e) and (e,f)(e, f),

SJ−JS=[2ef−df−d−2e],SJ - JS = \begin{bmatrix} 2e & f - d \\ f - d & -2e \end{bmatrix},

so SK=KSSK = KS forces e=0e = 0 and d=fd = f, and M=dI+cJM = dI + cJ has rows (d,−c)(d, -c) and (c,d)(c, d). An orthogonal change of basis preserves normality, because

(ZTMZ)T(ZTMZ)−(ZTMZ)(ZTMZ)T=ZT(MTM−MMT)Z.\begin{aligned} &(Z^{\mathsf{T}}MZ)^{\mathsf{T}}(Z^{\mathsf{T}}MZ) \\[0.4em] &\quad - (Z^{\mathsf{T}}MZ)(Z^{\mathsf{T}}MZ)^{\mathsf{T}} \\[0.4em] &\quad = Z^{\mathsf{T}}\big(M^{\mathsf{T}}M - MM^{\mathsf{T}}\big)Z. \end{aligned}

So a block that is not normal is not a rotation-scaling block in any orthonormal basis. It still has the matrix with rows (a,−b)(a, -b) and (b,a)(b, a) in the basis (x,−y)(x, -y) built from an eigenvector x+iyx + iy for a+iba + ib, 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 MM with rows (1,−1)(1, -1) and (1,1)(1, 1) is the rotation-scaling block with a=b=1a = b = 1, r=2r = \sqrt{2} and θ=π/4\theta = \pi/4, and its products MTMM^{\mathsf{T}}M and MMTMM^{\mathsf{T}} both equal 2I2I. By contrast, take

B=[0−410].B = \begin{bmatrix} 0 & -4 \\ 1 & 0 \end{bmatrix}.

Its eigenvalues are ±2i\pm 2i, the same as those of the rotation-scaling block with rows (0,−2)(0, -2) and (2,0)(2, 0). The eigenvector (2i,1)(2i, 1) for 2i2i gives x=(0,1)x = (0, 1) and y=(2,0)y = (2, 0), and in the basis (x,y)(x, y) the matrix of BB has rows (0,2)(0, 2) and (−2,0)(-2, 0). Yet Be1=e2Be_1 = e_2 has length 11 while Be2=−4e1Be_2 = -4e_1 has length 44, and

BTB=[10016]≠[16001]=BBT.\begin{aligned} B^{\mathsf{T}}B &= \begin{bmatrix} 1 & 0 \\ 0 & 16 \end{bmatrix} \\[0.4em] &\ne \begin{bmatrix} 16 & 0 \\ 0 & 1 \end{bmatrix} = BB^{\mathsf{T}}. \end{aligned}

So BB is not normal, and no orthonormal basis makes it a rotation-scaling block. The basis (x,y)(x, y) is orthogonal, but its vectors have lengths 11 and 22.

Check yourself

  1. A real 2×22 \times 2 matrix AA has the eigenvector (1,i)(1, i) for the eigenvalue 2−3i2 - 3i. Name a second eigenvalue with an eigenvector, and find AA.
Show the answer

Because AA is real, conjugation gives the eigenvalue 2+3i2 + 3i with eigenvector (1,−i)(1, -i). Writing 2−3i=a+ib2 - 3i = a + ib gives a=2a = 2 and b=−3b = -3, and (1,i)=x+iy(1, i) = x + iy gives x=e1x = e_1 and y=e2y = e_2. So

Ae1=ax−by=2e1+3e2,Ae2=bx+ay=−3e1+2e2.\begin{aligned} Ae_1 &= ax - by = 2e_1 + 3e_2, \\[0.4em] Ae_2 &= bx + ay = -3e_1 + 2e_2. \end{aligned}

These are the columns of AA, so

A=[2−332],A = \begin{bmatrix} 2 & -3 \\ 3 & 2 \end{bmatrix},

a rotation-scaling block with r=13r = \sqrt{13}. As a check, A(1,i)=(2−3i,3+2i)=(2−3i)(1,i)A(1, i) = (2 - 3i, 3 + 2i) = (2 - 3i)(1, i).

  1. Let
D=[1−411].D = \begin{bmatrix} 1 & -4 \\ 1 & 1 \end{bmatrix}.

Is there a real orthogonal QQ for which QTDQQ^{\mathsf{T}}DQ is a rotation-scaling block?

Show the answer

No. Its eigenvalues are 1±2i1 \pm 2i, but rotation-scaling blocks are normal, and QTDQQ^{\mathsf{T}}DQ is normal exactly when DD is. Here

DTD=[2−3−317],DDT=[17−3−32],\begin{aligned} D^{\mathsf{T}}D &= \begin{bmatrix} 2 & -3 \\ -3 & 17 \end{bmatrix}, \\[0.4em] DD^{\mathsf{T}} &= \begin{bmatrix} 17 & -3 \\ -3 & 2 \end{bmatrix}, \end{aligned}

so DD is not normal. Nonreal eigenvalues are not enough for the picture of a rotation with uniform scaling. Indeed DD sends e1e_1 to a vector of length 2\sqrt{2} and e2e_2 to a vector of length 17\sqrt{17}.

  1. Let
A=[110−110013].A = \begin{bmatrix} 1 & 1 & 0 \\ -1 & 1 & 0 \\ 0 & 1 & 3 \end{bmatrix}.

Find a real Schur form of AA and decide whether the plane spanned by e1e_1 and e2e_2 is invariant. Then explain why every real Schur form of a real 3×33 \times 3 matrix contains a 1×11 \times 1 block.

Show the answer

Since Ae3=3e3Ae_3 = 3e_3, start with the real eigenvector e3e_3 and complete it with e1e_1 and e2e_2. The images are Ae3=3e3Ae_3 = 3e_3, Ae1=e1−e2Ae_1 = e_1 - e_2 and Ae2=e3+e1+e2Ae_2 = e_3 + e_1 + e_2, so the orthogonal QQ with columns e3e_3, e1e_1, e2e_2 gives

QTAQ=[3010110−11].Q^{\mathsf{T}}AQ = \begin{bmatrix} 3 & 0 & 1 \\ 0 & 1 & 1 \\ 0 & -1 & 1 \end{bmatrix}.

The 2×22 \times 2 block has trace 22 and determinant 22, so it carries the eigenvalues 1±i1 \pm i, and χA(t)=(t−3)(t2−2t+2)\chi_A(t) = (t - 3)(t^2 - 2t + 2). The plane spanned by e1e_1 and e2e_2 is not invariant, because Ae2Ae_2 has an e3e_3 component. The block is a compression to that plane, not a restriction.

Finally, the diagonal blocks have sizes 11 or 22 and their sizes add up to 33, which is odd, so at least one block is 1×11 \times 1. Hence every real 3×33 \times 3 matrix has a real eigenvalue, and the same argument works for every real square matrix of odd size.

How this lesson connects