12.8  Spectral Resolutions and Functions of a Normal Operator

The last two sections produce an orthonormal basis of eigenvectors. A basis, though, is a choice: permute it, or rotate inside the eigenspace of a repeated eigenvalue, and the basis changes while the operator does not. This section rewrites the same information with nothing chosen — a list of eigenvalues, and the orthogonal projections onto their eigenspaces — and then spends it. Once an operator is written as λ1P1+⋯+λkPk, any function whatsoever on those k numbers produces a new operator, and powers, square roots and exponentials all become one line of arithmetic on the spectrum.

Throughout, V is a non-zero finite-dimensional inner product space over F=R or F=C, and T∈L(V). We say that T satisfies

(∗)V has an orthonormal basis of eigenvectors of T.

By Theorem 12.4.2 this holds over C exactly for the normal operators, and by Theorem 12.5.1 it holds over R exactly for the self-adjoint ones. Stating everything for an operator satisfying (∗) covers both fields at once, and keeps in view the only property we ever use.

12.8.1. Grouping an eigenbasis by eigenvalue

Here is the observation the section runs on. Let (e1,…,en) be an orthonormal eigenbasis of T, with Tej=μjej. The list μ1,…,μn repeats: an eigenvalue of geometric multiplicity 3 appears three times. Sort the basis vectors into bundles by the eigenvalue they carry, and each bundle spans one eigenspace. Summing the coordinates of a vector inside one bundle is exactly projecting it onto that eigenspace — orthogonally, because the basis is orthonormal. So T is a weighted sum of perpendicular projections, one weight per distinct eigenvalue, and the weights and the projections no longer remember the basis.

A normal operator is a sum of perpendicular projections, weighted by its distinct eigenvalues.

Definition 12.8.1 (Spectral Resolution)

Let T∈L(V) satisfy (∗), let λ1,…,λk be the distinct eigenvalues of T, and write Ei=Eλi(T) for the corresponding eigenspaces. Let Pi:=PEi∈L(V) be the orthogonal projection onto Ei (Definition 11.3.2). The identity T=λ1P1+λ2P2+⋯+λkPk is the spectral resolution of T, and the family (P1,…,Pk) is the resolution of the identity attached to T.

Two clauses carry weight. The eigenvalues are listed once each, so k is the number of distinct eigenvalues and not dim⁡V; and the projections are orthogonal, which is the whole content of the definition, since every diagonalizable operator has some such expression with oblique projections. That the displayed identity is true, and that the Pi fit together as neatly as one could want, is the next theorem.

Theorem 12.8.1 (The Spectral Resolution and Its Projections)

Let T∈L(V) satisfy (∗), with distinct eigenvalues λ1,…,λk, eigenspaces Ei=Eλi(T) and Pi=PEi. Then:

  • (a) V=E1⊕⋯⊕Ek, and Ei⊥Ej whenever i≠j;
  • (b) Pi∗=Pi and Pi2=Pi for every i, and PiPj=0 whenever i≠j;
  • (c) P1+⋯+Pk=idV;
  • (d) T=λ1P1+⋯+λkPk;
  • (e) TPi=PiT=λiPi for every i.

Idea. Everything is read off one orthonormal eigenbasis. Sorting its vectors by eigenvalue cuts it into k bundles; the only thing to check is that the i-th bundle spans the whole of Ei, not just part of it, and that is a coordinate comparison. After that, (a) is the orthonormality of the basis, (c) and (d) are the coordinate formula v=∑j⟨v,ej⟩ej with its terms grouped, and (b) and (e) are bookkeeping.

Proof. Let B=(e1,…,en) be an orthonormal basis of V with Tej=μjej, which exists by (∗). Each ej is non-zero, so each μj is an eigenvalue of T and therefore equals exactly one λi. Put Si:={j:μj=λi}, so that {1,…,n} is the disjoint union of S1,…,Sk.

Step 1. Ei=span(ej:j∈Si). The inclusion (⊇) is immediate, since Tej=λiej for j∈Si. For (⊆), let v∈Ei and write v=∑jcjej in the basis B. Applying T, ∑jcjμjej=Tv=λiv=∑jcjλiej. Coordinates in a basis are unique, so cj(μj−λi)=0 for every j, and hence cj=0 unless j∈Si. In particular Si≠∅, because Ei≠{0}.

Step 2 (a). By Step 1, V=span(B)=E1+⋯+Ek. If i≠j, then Si and Sj are disjoint and B is orthonormal, so every spanning vector of Ei is orthogonal to every spanning vector of Ej; hence Ei⊥Ej. Pairwise orthogonal subspaces are independent: if u1+⋯+uk=0 with ui∈Ei, then pairing with ul kills every term but one and leaves ‖ul‖2=0, so ul=0. By Theorem 1.7.4 the sum is direct.

Step 3 (b). Each Pi is self-adjoint by Theorem 11.3.3 (b), and satisfies Pi2=Pi with imPi=Ei and kerPi=Ei⊥ (Definition 11.3.2 and the discussion following it). For i≠j, Step 2 gives Ej⊆Ei⊥, so imPj⊆kerPi and PiPj=0.

Step 4 (c) and (d). By Step 1, (ej:j∈Si) is an orthonormal basis of Ei, so Theorem 11.3.3 (a) gives Piv=∑j∈Si⟨v,ej⟩ej(v∈V). Summing over i collects every index j exactly once, so by Theorem 11.2.1, ∑i=1kPiv=∑j=1n⟨v,ej⟩ej=v, which is (c). Multiplying the i-th group by λi instead, ∑i=1kλiPiv=∑i=1k∑j∈Si⟨v,ej⟩λiej=∑j=1n⟨v,ej⟩μjej=T(∑j=1n⟨v,ej⟩ej)=Tv, where the second equality uses μj=λi for j∈Si, and the third the linearity of T together with Tej=μjej. This is (d).

Step 5 (e). For v∈V we have Piv∈Ei, so T(Piv)=λiPiv; thus TPi=λiPi. In the other order, (d) and (b) give PiT=Pi(∑j=1kλjPj)=λiPi2=λiPi. This proves the theorem.

For matrices the picture is the familiar one, packaged differently. If A∈Mn(C) is normal, write A=UDU∗ with U unitary and D diagonal (Corollary 12.4.3). Grouping the columns q1,…,qn of U by their eigenvalue turns this into A=∑i=1kλiPi,Pi=∑j∈Siqjqj∗, so each Pi is a sum of rank-one projections and rankPi=dim⁡Ei.

Example (A Symmetric 3×3 Matrix)

Let A=(122212221)∈M3(R). Find the spectral resolution of A.

Solution. Write A=2J−I, where J is the all-ones matrix. Since Jx=(x1+x2+x3)1, we get J1=31 and Jx=0 exactly when x1+x2+x3=0. So J has eigenvalues 3 and 0, and A has eigenvalues λ1=2⋅3−1=5,λ2=2⋅0−1=−1, with E5=span(1) of dimension 1 and E−1=1⊥ of dimension 2. Since ‖1‖2=3, the orthogonal projection onto E5 is P1=1311⊤=13J, and P2=I−P1 by Theorem 12.8.1 (c). Concretely, P1=13(111111111),P2=13(2−1−1−12−1−1−12). Check. Both are symmetric, both satisfy Pi2=Pi, their product is 0, they sum to I, and 5P1−P2=53J−I+13J=2J−I=A. Note that the resolution has two terms, not three: k=2 counts distinct eigenvalues, while rankP2=2 records the multiplicity of −1.

12.8.2. Orthogonal projections versus oblique ones

An expression T=∑λiπi with idempotents summing to the identity is not by itself news. In the proof of Theorem 10.8.3 the semisimple part of T is written as ∑iλiπi, where πi=hi(T) projects onto the generalized eigenspace Gλi(T) along the sum of the others (Theorem 9.8.1 (d)); when T is diagonalizable, that is a decomposition of T itself, and those πi satisfy πi2=πi, πiπj=0 for i≠j and ∑iπi=idV, exactly as in Theorem 12.8.1 (b) and (c). What they do not satisfy is πi∗=πi, and that single missing condition is the whole difference between Chapter 10 and this section.

Example (Two Projections That Are Not Orthogonal)

Let A=(1102)∈M2(R), which is diagonalizable with eigenvalues 1 and 2. Compute the projections π1,π2 of Theorem 9.8.1 for A, verify that A=π1+2π2, and decide whether they are orthogonal projections.

Solution. The eigenspaces are E1=span(e1) and E2=span((1,1)), read off from A−I=(0101) and A−2I=(−1100). Since the eigenvalues are distinct, the generalized eigenspaces are the eigenspaces. With P=(1101) we have P−1AP=diag(1,2), so π1=P(1000)P−1=(1−100),π2=I−π1=(0101). Both square to themselves, their products vanish in both orders, they sum to I, and 1⋅π1+2⋅π2=(1−100)+(0202)=A. They are not orthogonal projections: π1⊤=(10−10)≠π1. Geometrically, π1 projects onto span(e1) along span((1,1)), and those two lines meet at 45∘, not at a right angle. Consistently, A is not normal: A⊤A=(1115)≠(2224)=AA⊤.

Warning. “Diagonalizable” gives projections; only “normal” makes them orthogonal. Every diagonalizable operator splits as ∑λiπi with idempotents that annihilate each other and sum to the identity, and Example (Two Projections That Are Not Orthogonal) is such a splitting for a matrix that is not normal. The projections there are not self-adjoint, so they are not the projections of Definition 12.8.1, and the eigenspaces they project onto are not perpendicular. Whenever an argument needs ⟨Piu,v⟩=⟨u,Piv⟩ — and most of this section does — normality is what pays for it.

12.8.3. What makes a resolution the resolution

The projections in Definition 12.8.1 were built from the eigenspaces, so they are visibly determined by T. It is much more useful to know the converse: that any decomposition with the right formal properties has to be that one. This is what lets us recognize a spectral resolution when it turns up by accident, and it is the engine of the uniqueness proof for square roots below.

Theorem 12.8.2 (Uniqueness of the Spectral Resolution)

Let V be a non-zero finite-dimensional inner product space over F and let T∈L(V). Suppose T=μ1Q1+μ2Q2+⋯+μmQm, where μ1,…,μm∈F are distinct and Q1,…,Qm∈L(V) are non-zero operators satisfying

  • (R1) Qi∗=Qi and Qi2=Qi for every i;
  • (R2) QiQj=0 whenever i≠j;
  • (R3) Q1+⋯+Qm=idV.

Then T satisfies (∗), spec(T)={μ1,…,μm}, and Qi is the orthogonal projection onto Eμi(T) for every i. In particular m is the number of distinct eigenvalues of T, and the given decomposition is the spectral resolution of T.

Idea. Three moves. ① A self-adjoint idempotent is the orthogonal projection onto its own image: self-adjointness is used here and nowhere else, which is exactly why Example (Two Projections That Are Not Orthogonal) escapes the theorem. ② Conditions (R2) and (R3) then break V into the orthogonal direct sum of the images Ui=imQi. ③ On Ui the operator T is multiplication by μi, so Ui⊆Eμi(T); and because the μi are distinct, an eigenvector of T cannot spread across two pieces, which upgrades the inclusion to an equality.

Proof. Write Ui=imQi, which is non-zero because Qi≠0.

Step 1. Qi=PUi. Fix i and drop the subscript. If u∈U, say u=Qx, then Qu=Q2x=Qx=u, so Q is the identity on U. Next, kerQ=U⊥. Indeed, if Qw=0, then for every x, ⟨w,Qx⟩=⟨Qw,x⟩=0 by Definition 11.6.1 and (R1), so w∈U⊥; conversely if w∈U⊥, then Qw∈U and ‖Qw‖2=⟨Qw,Qw⟩=⟨w,Q2w⟩=⟨w,Qw⟩=0, using (R1) twice and then Qw∈U⊥w; so Qw=0. Finally, for any v∈V, v=Qv+(v−Qv),Qv∈U,Q(v−Qv)=Qv−Q2v=0, so v−Qv∈kerQ=U⊥. This is the splitting of v in U⊕U⊥ (Theorem 11.3.2), so Qv=PUv by Definition 11.3.2.

Step 2. V=U1⊕⋯⊕Um, orthogonally. By (R3), every v equals ∑iQiv∈∑iUi. For i≠j, u=Qix and w=Qjy satisfy ⟨u,w⟩=⟨Qix,Qjy⟩=⟨QjQix,y⟩=0 by (R1) and (R2), so Ui⊥Uj. As in Step 2 of the proof of Theorem 12.8.1, pairwise orthogonal subspaces are independent, so the sum is direct.

Step 3. T acts on Ui as multiplication by μi. Let u∈Ui. By Step 1, Qiu=u, and for j≠i, Qju=QjQiu=0 by (R2). Hence Tu=∑l=1mμlQlu=μiu. Since Ui≠{0}, this makes μi an eigenvalue of T, with Ui⊆Eμi(T).

Step 4. spec(T)={μ1,…,μm} and Ui=Eμi(T). Let λ be an eigenvalue of T with eigenvector v≠0. By (R3), v=∑iQiv with Qiv∈Ui, and by Step 3, ∑i=1mμiQiv=Tv=λv=∑i=1mλQiv. Subtracting, ∑i(μi−λ)Qiv=0 with the i-th term in Ui, so by the directness of Step 2 every term vanishes: Qiv=0 whenever μi≠λ. As v≠0, some Qiv≠0, and for that i we get λ=μi. The μl being distinct, i is the only index with μi=λ, so v=Qiv∈Ui. Therefore spec(T)⊆{μ1,…,μm} and Eμi(T)⊆Ui; with Step 3 both are equalities.

Step 5. By Steps 1 and 4, Qi=PUi=PEμi(T). Choosing an orthonormal basis of each Ui (Theorem 11.2.2) and concatenating gives an orthonormal basis of V by Step 2, made of eigenvectors of T by Step 3; so T satisfies (∗). This proves the theorem.

Read the other way round, the theorem is the complex spectral theorem again with no basis in sight: over C, an operator is normal if and only if it can be written as ∑μiQi with distinct μi and non-zero self-adjoint idempotents satisfying (R2) and (R3) (Theorem 12.4.2). Conditions (R1)–(R3) are the entire content of the theorem, compressed into three lines of algebra.

Quick check. The matrices π1,π2 of Example (Two Projections That Are Not Orthogonal) satisfy πi2=πi, π1π2=π2π1=0 and π1+π2=I, and the coefficients 1 and 2 are distinct. Which hypothesis of Theorem 12.8.2 fails, and what does its failure cost?

Solution. Self-adjointness in (R1): π1⊤≠π1. Everything else holds. The cost is Step 1 of the proof: π1 is a projection onto span(e1), but along span((1,1)) rather than along span(e1)⊥=span(e2), so it is not Pspan(e1). Consequently the two images are not perpendicular, and the conclusion fails at its strongest point: (1102) does not satisfy (∗), since it is not normal.

12.8.4. Functions of an operator

Powers are now trivial. Multiplying the resolution by itself and using PiPj=0 for i≠j leaves only the diagonal terms: T2=(∑iλiPi)(∑jλjPj)=∑iλi2Pi, and the same computation repeated gives Tm=∑iλimPi. So p(T)=∑ip(λi)Pi for every polynomial p. Stare at that formula and notice what it does not use: nothing about p except its k values on the spectrum. Any function at all supplies those.

Definition 12.8.2 (Function of an Operator)

Let T∈L(V) satisfy (∗), with distinct eigenvalues λ1,…,λk and spectral resolution T=∑iλiPi. For any function f:spec(T)→F, define f(T):=∑i=1kf(λi)Pi ∈L(V).

In words: apply f to each eigenvalue and reweight the same projections. The function needs no continuity, no differentiability and no formula — it is k numbers. And the definition is unambiguous: the λi and the Pi are determined by T alone, by Theorem 12.8.2, so no choice of basis or of eigenvectors enters.

Four instances show the range. Taking f(λ)=λ returns T. Taking f≡1 returns idV, by Theorem 12.8.1 (c). Taking f(λ)=λ― returns T∗, since Pi∗=Pi. And if 0∉spec(T), taking f(λ)=λ−1 returns T−1, because (∑iλiPi)(∑jλj−1Pj)=∑iPi=idV.

The notation is, on its face, dangerous. For a polynomial p the symbol p(T) already means something — the operator a0idV+a1T+⋯+aNTN of Definition 2.4.2, which Chapter 6 studied at length. If Definition 12.8.2 disagreed with it, the whole notation would have to be abandoned. Part (a) below says it does not, and that is the reason the rest of the theorem is safe to use.

Theorem 12.8.3 (Properties of the Functional Calculus)

Let T∈L(V) satisfy (∗), with distinct eigenvalues λ1,…,λk and resolution of the identity (P1,…,Pk). Let f,g:spec(T)→F and c∈F, with f+g, cf and fg taken pointwise.

  • (a) (Compatibility) For every p∈F[x], the operator p(T) of Definition 2.4.2 equals ∑ip(λi)Pi; that is, it agrees with Definition 12.8.2 applied to the restriction of p to spec(T).
  • (b) (Algebra homomorphism) (f+g)(T)=f(T)+g(T), (cf)(T)=cf(T), (fg)(T)=f(T)g(T)=g(T)f(T), and 1(T)=idV.
  • (c) (Adjoints) f(T)∗=f―(T), where f―(λ)=f(λ)―. In particular f(T) is self-adjoint when f is real-valued, and unitary when |f(λi)|=1 for every i.
  • (d) (Spectral mapping) f(T) satisfies (∗), with the same orthonormal eigenbasis as T, and spec(f(T))=f(spec(T)).
  • (e) (Commutation) If S∈L(V) commutes with T, then S commutes with every Pi and hence with f(T). In particular T and f(T) commute.

Idea. Everything rests on one multiplication table, PiPj=δijPi. It says that the operators ∑iciPi multiply exactly the way the coefficient lists (c1,…,ck) multiply coordinatewise, so L(V) contains a copy of the algebra of all F-valued functions on spec(T), and f↦f(T) is the obvious map into it. That makes (b) and (c) one-line computations. The one statement needing an argument is (a) — that the copy sitting inside is the same copy Chapter 2 built by substituting T into polynomials — and the argument is to compute the powers of T. For (e), a commuting S preserves each eigenspace, and an operator preserving all the summands of an orthogonal direct sum commutes with the projections onto them.

Proof.

  • (a) We first show that Tm=∑i=1kλimPifor every integer m≥0, with the usual convention λ0=1. For m=0 both sides equal idV, by Theorem 12.8.1 (c). Assuming the formula for m, Theorem 12.8.1 (d) and (b) give Tm+1=T⋅Tm=(∑iλiPi)(∑jλjmPj)=∑i,jλiλjmPiPj=∑iλim+1Pi, since PiPj=0 for i≠j and Pi2=Pi. Now let p=a0+a1x+⋯+aNxN. By Definition 2.4.2 and the formula just proved, p(T)=∑m=0NamTm=∑m=0Nam∑i=1kλimPi=∑i=1k(∑m=0Namλim)Pi=∑i=1kp(λi)Pi, the middle step being a rearrangement of a finite double sum.

  • (b) The first two identities are immediate from Definition 12.8.2. For the product, Theorem 12.8.1 (b) gives f(T)g(T)=∑i,jf(λi)g(λj)PiPj=∑if(λi)g(λi)Pi, which is (fg)(T). The right-hand side is symmetric in f and g, so f(T)g(T)=g(T)f(T). Finally 1(T)=∑iPi=idV by Theorem 12.8.1 (c).

  • (c) By Theorem 11.6.2 (a) and (b), and Pi∗=Pi, f(T)∗=∑i=1kf(λi)―Pi∗=f―(T). If f is real-valued then f―=f and f(T)∗=f(T). If |f(λi)|=1 for all i, then f―f≡1, so by (b) f(T)∗f(T)=(f―f)(T)=idV, and likewise f(T)f(T)∗=idV; so f(T) is unitary (Definition 11.7.2).

  • (d) Let B=(e1,…,en) be an orthonormal eigenbasis of T, with Tej=μjej, and fix j. Let i be the index with μj=λi. Then ej∈Ei, so Piej=ej, while Plej=0 for l≠i because Ei⊆El⊥=kerPl, by Theorem 12.8.1 (a) and Definition 11.3.2. Hence f(T)ej=f(λi)ej=f(μj)ej. So B is an orthonormal basis of eigenvectors of f(T), which is (∗) for f(T). The matrix of f(T) in B is diag(f(μ1),…,f(μn)), so its eigenvalues are exactly the numbers f(μj), that is the numbers f(λi); hence spec(f(T))=f(spec(T)).

  • (e) Suppose ST=TS. Each Ei is S-invariant: if Tv=λiv, then T(Sv)=S(Tv)=λiSv. Let v∈V and write v=∑iPiv with Piv∈Ei (Theorem 12.8.1 (c)). Applying S gives Sv=∑iSPiv with SPiv∈Ei, and this is the decomposition of Sv in E1⊕⋯⊕Ek, which is unique. Comparing it with Sv=∑iPi(Sv) gives PiSv=SPiv for every i, that is SPi=PiS. Hence S commutes with f(T)=∑if(λi)Pi. Since T commutes with itself, the last claim follows. This proves the theorem.

Part (a) is what makes the notation honest. Writing T, eT and p(T) in the same paragraph is legitimate precisely because the polynomial case is common ground: the new definition extends the old one instead of competing with it. It also reconciles this section with Chapter 10. An operator satisfying (∗) is diagonalizable, so every Jordan block of its matrix has size 1, and Definition 10.9.1 consults no derivatives at all — it too returns ∑if(λi)Pi. The two constructions of f(A) agree for normal A, and Chapter 10’s extra machinery is precisely the price of dropping normality.

Warning. Outside the normal case, f on the spectrum is not enough data. For A=(0100) the only eigenvalue is 0, so the recipe “f(A)=∑if(λi)Pi” would read f(A)=f(0)I for every f — and with f(x)=x it would announce A=0. The recipe is not wrong, it is inapplicable: A is not normal, so there is no resolution of the identity to expand in. Chapter 10’s definition of f(A) has to consult f′(0) as well (Definition 10.9.1), and that derivative is exactly what the missing orthogonality would have spared us.

Quick check. Let T∈L(V) satisfy (∗) with spec(T)={0,1}. Identify T.

Solution. T is the orthogonal projection onto E1(T). Indeed the spectral resolution reads T=0⋅P1+1⋅P2=P2=PE1(T). So the operators satisfying (∗) with spectrum in {0,1} are exactly the orthogonal projections, together with 0 and idV for the degenerate spectra {0} and {1}.

12.8.5. Square roots

The function λ↦λ is defined on [0,∞), so Definition 12.8.2 produces a square root of T as soon as the spectrum lies there. The interesting part is that the square root is unique once we ask it to be of the same kind, and the uniqueness proof is a direct application of Theorem 12.8.2: a square root’s own resolution, squared, has to be T’s.

Note first that over C the hypothesis is stronger than it looks. If T satisfies (∗) and spec(T)⊆R, then f(λ)=λ is real-valued on the spectrum, so T=f(T) is self-adjoint by Theorem 12.8.3 (c). A normal operator with real spectrum is self-adjoint.

Theorem 12.8.4 (The Square Root of a Non-negative Normal Operator)

Let V be a non-zero finite-dimensional inner product space over F and let T∈L(V) satisfy (∗) with spec(T)⊆[0,∞). Then there is exactly one operator S∈L(V) such that

  • (i) S satisfies (∗);
  • (ii) spec(S)⊆[0,∞);
  • (iii) S2=T.

It is S=∑iλiPi, where T=∑iλiPi is the spectral resolution of T. This S is self-adjoint, and it commutes with every operator that commutes with T.

Idea. Existence is the functional calculus applied to  : squaring a function squares its values. Uniqueness is where the work is, and the trick is not to compare S with the candidate directly but to square S’s own resolution. If S=∑jμjQj, then S2=∑jμj2Qj, and the μj2 are still distinct because the μj are distinct and non-negative. So ∑jμj2Qj meets every condition of Theorem 12.8.2 for T, which forces it to be T’s spectral resolution term by term.

Proof. Existence. Let f(λ)=λ on spec(T)⊆[0,∞), which takes values in [0,∞)⊆F, and put S=f(T)=∑iλiPi. Then f2 is the function λ↦λ, so by Theorem 12.8.3 (b) and (a), S2=f(T)f(T)=(f2)(T)=T, giving (iii). By Theorem 12.8.3 (d), S satisfies (∗) and spec(S)={λ1,…,λk}⊆[0,∞), giving (i) and (ii). Since f is real-valued, S is self-adjoint by Theorem 12.8.3 (c), and it commutes with everything commuting with T by (e) of the same theorem.

Uniqueness. Let S satisfy (i), (ii) and (iii), and let S=μ1Q1+⋯+μlQl be its spectral resolution (Theorem 12.8.1): the μj are the distinct eigenvalues of S, and the Qj are non-zero self-adjoint idempotents with QjQj′=0 for j≠j′ and ∑jQj=idV. By Theorem 12.8.3 (a) applied to S and p=x2, T=S2=∑j=1lμj2Qj. The scalars μj2 are distinct: the μj are distinct by construction, and non-negative by (ii), so μj2=μj′2 would force μj=μj′. The family (Q1,…,Ql) satisfies (R1), (R2) and (R3) of Theorem 12.8.2, and every Qj is non-zero. That theorem therefore identifies the displayed expression as the spectral resolution of T: after renumbering, l=k, μj2=λj and Qj=Pj for every j. Since μj≥0 and μj2=λj, we get μj=λj, and hence S=∑j=1kλjPj, which is the operator constructed above. This proves the theorem.

The square root is written T, or T1/2. Chapter 13 takes the hypothesis spec(T)⊆[0,∞) as the definition of a positive operator, proves that it is equivalent to ⟨Tv,v⟩≥0 for all v, and makes this theorem the tool behind polar decomposition and the singular value decomposition; the notation A1/2 in the notation table refers to exactly the operator built here.

Example (A Square Root, and Three Impostors)

Let A=(106610)∈M2(R). Find its spectral resolution, compute A and Am, and find a symmetric square root of A other than A.

Solution. The resolution. A is symmetric, hence self-adjoint on R2. Since A(1,1)=(16,16) and A(1,−1)=(4,−4), the eigenvalues are 16 and 4, with eigenlines span((1,1)) and span((1,−1)). Both spanning vectors have squared length 2, so P1=12(1111),P2=12(1−1−11),A=16P1+4P2.

The square root. Both eigenvalues are positive, so Theorem 12.8.4 applies: A=4P1+2P2=(2222)+(1−1−11)=(3113), and indeed (3113)2=(106610).

Powers. By Theorem 12.8.3 (a), Am=16mP1+4mP2, that is Am=12(16m+4m16m−4m16m−4m16m+4m). For m=3 this reads (2080201620162080), which is A3.

An impostor. Changing one sign gives B=4P1−2P2=(1331), and B2=A as well. So A has more than one symmetric square root; B fails clause (ii) of Theorem 12.8.4, since spec(B)={4,−2}. Flipping the other sign, and both, gives −B and −A: four symmetric square roots, and exactly one of them has non-negative spectrum.

Warning. “A square root” and “the square root” are different things. Uniqueness in Theorem 12.8.4 needs all three clauses. Dropping (ii) admits the three sign-flipped roots of Example (A Square Root, and Three Impostors). Dropping (i) admits more still, and the cheapest witness is the zero operator on C2. Take S=(0100),S2=0. Here spec(S)={0}⊆[0,∞), so (ii) holds, and (iii) holds by the display, yet S≠0=0. Only (i) fails: S∗S=diag(0,1) while SS∗=diag(1,0). The phrase “the square root of T” always means the one satisfying all three.

12.8.6. The exponential and the unitary group

Chapter 10 defined eA for every A∈Mn(C) as the sum of the series ∑mAm/m! (Definition 10.9.2) and proved that the series converges (Theorem 10.9.3). We do not redevelop any of that. What the spectral resolution adds is that for a normal matrix the series can be summed by inspection, and that the answer identifies the unitary matrices as the exponentials of the Hermitian ones — the matrix version of |eiθ|=1.

Theorem 12.8.5 (Unitary Matrices Are Exponentials of Hermitian Matrices)

Let n≥1.

  • (a) If A∈Mn(C) is normal with spectral resolution A=∑iλiPi, then eA=∑ieλiPi.
  • (b) If H∈Mn(C) is Hermitian, then eiH∈U(n), and deteiH=eitrH.
  • (c) Conversely, every U∈U(n) equals eiH for some Hermitian H, which may be chosen with spec(H)⊆[0,2π).

Idea. For (a), the partial sums of the series collapse: Am=∑iλimPi, so each partial sum is a fixed combination of the k scalar partial sums of ∑mλim/m!, whose limits are the numbers eλi. For (b) and (c), the resolution turns everything into a statement about k complex numbers: H Hermitian means real eigenvalues, eiH then has eigenvalues on the unit circle, and a unitary matrix has eigenvalues on the unit circle, each of which is eiθ for a unique θ∈[0,2π). Reading the last sentence backwards constructs H.

Proof.

  • (a) By Theorem 12.8.3 (a), Am=∑iλimPi for every m≥0, so for every N≥0, ∑m=0NAmm!=∑i=1k(∑m=0Nλimm!)Pi. Fix a position (r,s). Its entry on the right is ∑icN,i(Pi)rs, where cN,i=∑m≤Nλim/m! and the coefficients (Pi)rs do not depend on N. Each cN,i→eλi as N→∞ by the scalar exponential series, so the entry converges to ∑ieλi(Pi)rs. Hence the series converges entrywise to ∑ieλiPi, and by Definition 10.9.2 this matrix is eA.

  • (b) H is normal, so it has a spectral resolution H=∑jθjPj, and its eigenvalues θj are real by Theorem 12.2.1. The scalars iθj are distinct, so iH=∑jiθjPj is the spectral resolution of iH by Theorem 12.8.2, and (a) gives eiH=∑jeiθjPj. Each θj is real, so eiθj―eiθj=|eiθj|2=1. Hence, using Pj∗=Pj and PjPj′=δjj′Pj from Theorem 12.8.1 (b), (eiH)∗eiH=∑jeiθj―eiθjPj=∑jPj=I, so eiH∈U(n) by Definition 11.7.3. For the determinant, Theorem 10.9.4 (e) gives deteiH=etr(iH)=eitrH.

  • (c) Let U∈U(n). Then U∗U=UU∗=I, so U is normal; let U=∑jνjPj be its spectral resolution. Every eigenvalue has |νj|=1: if Ux=νjx with x≠0, then ‖x‖=‖Ux‖=|νj|‖x‖ because U is an isometry (Theorem 11.7.3), and ‖x‖≠0. So there is a unique θj∈[0,2π) with νj=eiθj, and the θj are distinct because the νj are. Put H:=∑jθjPj. The θj are real, so H∗=∑jθjPj∗=H by Theorem 11.6.2 (a), (b) and Theorem 12.8.1 (b): H is Hermitian, with spec(H)={θj}⊆[0,2π) by Theorem 12.8.2. By (a) applied to iH, eiH=∑jeiθjPj=∑jνjPj=U. This proves the theorem.

Part (c) says that the exponential map from Hermitian matrices to U(n) is onto. One consequence belongs to topology rather than algebra, so we only record it: the path t↦eitH, t∈[0,1], stays inside U(n) and runs from I to U, so every unitary matrix can be deformed continuously to the identity. Nothing of the sort holds in O(n), where the determinant is ±1 and cannot change sign along a path.

Example (Exponentiating a Hermitian Matrix, and Undoing It)

Let H=(0110). Compute eiθH for θ∈R. Then find a Hermitian K with eiK=Q, where Q=12(1−111).

Solution. Forwards. H is symmetric with H(1,1)=(1,1) and H(1,−1)=−(1,−1), so its eigenvalues are ±1 and H=P+−P−,P±=12(1±1±11). Hence iθH has resolution iθP+−iθP− (for θ≠0), and Theorem 12.8.5 (a) gives eiθH=eiθP++e−iθP−=(cos⁡θisin⁡θisin⁡θcos⁡θ), using e±iθ=cos⁡θ±isin⁡θ. Each row has squared length cos2⁡θ+sin2⁡θ=1 and the two rows are orthogonal, confirming that the result is unitary.

Backwards. Q is the rotation by π/4, hence unitary, with Q(1,−i)=eiπ/4(1,−i) and Q(1,i)=e−iπ/4(1,i). Both eigenvectors have squared length 2, so the spectral projections are R+=12(1i−i1),R−=12(1−ii1). Writing e−iπ/4=ei⋅7π/4 to land in [0,2π), the recipe of Theorem 12.8.5 (c) gives K=π4R++7π4R−=(π−3πi43πi4π), Hermitian with spectrum {π/4,7π/4}. Leaving [0,2π), the smaller choice π4(R+−R−)=π4(0i−i0) works just as well: the Hermitian logarithm is far from unique.

12.8.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define the spectral resolution of T, and say which operators have one over C and which over R.
  • (b) List the properties of the family (P1,…,Pk) given by Theorem 12.8.1, and say how many terms the resolution of a self-adjoint T∈L(R5) with eigenvalues 2,2,2,7,7 has.
  • (c) True or false: if T=μ1Q1+μ2Q2 with μ1≠μ2 and Q1,Q2 non-zero operators satisfying Qi2=Qi, Q1Q2=Q2Q1=0 and Q1+Q2=idV, then T is normal. Justify your answer.
  • (d) Define f(T) for a function f on spec(T), and say exactly how much information about f it uses.
  • (e) State Theorem 12.8.3 (a) and explain in one sentence why the rest of the section would be unusable without it.
  • (f) Give two different self-adjoint square roots of idV on R2, and say which one Theorem 12.8.4 singles out and why.

Solution.

  • (a) For T with an orthonormal basis of eigenvectors, distinct eigenvalues λ1,…,λk and Pi=PEλi(T) the orthogonal projection onto the i-th eigenspace, the spectral resolution is T=∑iλiPi (Definition 12.8.1). Over C the operators with one are exactly the normal operators (Theorem 12.4.2); over R, exactly the self-adjoint ones (Theorem 12.5.1).

  • (b) Each Pi is self-adjoint and idempotent, PiPj=0 for i≠j, ∑iPi=idV, and TPi=PiT=λiPi. The resolution has two terms, T=2P1+7P2, with rankP1=3 and rankP2=2: the resolution counts distinct eigenvalues, not multiplicities.

  • (c) False. Self-adjointness of the Qi is missing, and it is the one hypothesis of Theorem 12.8.2 that does the work. The matrices π1,π2 of Example (Two Projections That Are Not Orthogonal) satisfy everything listed, with μ1=1 and μ2=2, and π1+2π2=(1102), which is not normal.

  • (d) f(T)=∑if(λi)Pi (Definition 12.8.2). It uses exactly the k values f(λ1),…,f(λk); two functions agreeing on spec(T) give the same operator, and f need not be defined, let alone continuous, anywhere else.

  • (e) For p∈F[x], the operator ∑ip(λi)Pi coincides with the operator p(T) of Definition 2.4.2. Without it, the symbol p(T) would carry two unrelated meanings at once, and no computation mixing polynomials with other functions — for instance (T)2=T — could be trusted.

  • (f) id and the reflection TD with D=diag(1,−1), both self-adjoint with square id. Theorem 12.8.4 singles out id, because spec(id)={1}⊆[0,∞) while spec(TD)={1,−1} is not. (A third root is −id, and a fourth is TD′ with D′=diag(−1,1).)

B. Practice

Exercise (B1: Write these as ∑λiPi)

Find the spectral resolution of each of the following matrices, and check in each case that the projections are self-adjoint, idempotent, mutually annihilating and sum to I.

  • (a) A=(21−i1+i3)∈M2(C).
  • (b) S=(201030102)∈M3(R).
  • (c) U=12(1−111)∈M2(C).

Solution.

  • (a) A∗=A, trA=5 and detA=6−(1−i)(1+i)=4, so pA=x2−5x+4 and spec(A)={1,4}. From A−4I=(−21−i1+i−1) the first row gives the eigenvector v4=(1−i,2), with ‖v4‖2=2+4=6; from A−I likewise v1=(−1+i,1), with ‖v1‖2=3. Hence P4=v4v4∗6=13(11−i1+i2),P1=13(2−1+i−1−i1), and A=1⋅P1+4⋅P4. Both are Hermitian, both square to themselves, P1P4=0, and P1+P4=I.

  • (b) S is symmetric, and S(1,0,1)=3(1,0,1), S(0,1,0)=3(0,1,0), S(1,0,−1)=(1,0,−1), so spec(S)={3,1} with E1=span((1,0,−1)) and E3=span((1,0,1),(0,1,0)). Hence P1=12(10−1000−101),P3=I−P1=12(101020101), and S=P1+3P3. The stated properties follow from P1⊤=P1, P12=P1 and P3=I−P1.

  • (c) U is real orthogonal, hence unitary and normal. Since U(1,−i)=12(1+i,1−i)=eiπ/4(1,−i), and similarly U(1,i)=e−iπ/4(1,i), we get spec(U)={e±iπ/4}. Both eigenvectors have squared length 2, so with v±=(1,∓i), P±=v±v±∗2=12(1±i∓i1),U=eiπ/4P++e−iπ/4P−. Both are Hermitian and idempotent, P+P−=0 and P++P−=I.

Exercise (B2: Computing through the resolution)

Let C=(13121213)∈M2(R).

  • (a) Find the spectral resolution of C.
  • (b) Hence compute C, and verify by squaring.
  • (c) Hence give a closed formula for Cm and write down C100.
  • (d) Hence compute eC.

Solution.

  • (a) C(1,1)=25(1,1) and C(1,−1)=(1,−1), so spec(C)={25,1} and, both spanning vectors having squared length 2, P1=12(1111),P2=12(1−1−11),C=25P1+P2.

  • (b) Both eigenvalues are positive, so by Theorem 12.8.4, C=5P1+1⋅P2=(3223), and (3223)2=(13121213)=C.

  • (c) By Theorem 12.8.3 (a), Cm=25mP1+1mP2, that is Cm=12(25m+125m−125m−125m+1), so C100=12(25100+125100−125100−125100+1). (As a check, m=2 gives 12(626624624626)=(313312312313), which is C2.)

  • (d) By Theorem 12.8.5 (a), eC=e25P1+eP2=12(e25+ee25−ee25−ee25+e).

Exercise (B3: Is it a spectral resolution?)

Determine which of the following displays the spectral resolution of the operator TA on the stated space. Justify your answer; for those that do not, name the condition of Theorem 12.8.2 that fails and say what the correct resolution is.

  • (a) On R2: A=(200−1), with μ1=2, Q1=(1000), μ2=−1, Q2=(0001).
  • (b) On R2: A=3I, with μ1=μ2=3, Q1=12(1111), Q2=12(1−1−11).
  • (c) On R2: A=(3101), with μ1=3, Q1=12(2100), μ2=1, Q2=12(0−102).

Solution.

  • (a) Yes. The two matrices are symmetric, idempotent, non-zero, annihilate each other and sum to I, and 2Q1−Q2=A; the coefficients 2 and −1 are distinct. By Theorem 12.8.2 this is the spectral resolution, and indeed E2=span(e1), E−1=span(e2).

  • (b) No: the scalars μ1,μ2 are not distinct, so the hypothesis of Theorem 12.8.2 fails at once. The identity 3Q1+3Q2=3I=A is true but uninformative — the eigenvalue 3 has been split artificially across two projections. The spectral resolution of 3I has a single term, 3I=3⋅id, since spec(3I)={3} and E3=R2.

  • (c) No: Q1 is not self-adjoint, since Q1⊤=12(2010)≠Q1, so (R1) fails. Everything else holds: Q12=Q1, Q2=I−Q1, Q1Q2=Q2Q1=0 and 3Q1+Q2=A. There is no correct resolution to offer, because A is not normal: A⊤A=(9332) while AA⊤=(10111). The projections here are onto E3=span(e1) along E1=span((−1,2)), two lines that are not perpendicular.

C. Going deeper

Exercise (C1: The projections are polynomials in the operator)

Let T∈L(V) satisfy (∗), with distinct eigenvalues λ1,…,λk∈F and resolution of the identity (P1,…,Pk).

  • (a) Prove that Pi=ℓi(T), where ℓi∈F[x] is the i-th Lagrange basis polynomial for the nodes λ1,…,λk.
  • (b) Deduce that for every f:spec(T)→F there is a polynomial p of degree less than k with f(T)=p(T).
  • (c) Deduce that every operator commuting with T commutes with each Pi, re-proving Theorem 12.8.3 (e) by a different route.

Hint for (a): Definition 6.6.1 produces a polynomial taking prescribed values at prescribed nodes.

Solution.

  • (a) The λi are k distinct elements of F, so Definition 6.6.1 gives ℓ1,…,ℓk∈F[x] of degree k−1, and Theorem 6.6.1 (a) gives ℓi(λj)=δij. By Theorem 12.8.3 (a), ℓi(T)=∑j=1kℓi(λj)Pj=∑j=1kδijPj=Pi.

  • (b) Let p be the interpolating polynomial of degree less than k with p(λi)=f(λi) for every i, which exists by Theorem 6.6.1. By Theorem 12.8.3 (a), p(T)=∑ip(λi)Pi=∑if(λi)Pi=f(T). Explicitly, p=∑if(λi)ℓi.

  • (c) If ST=TS, then S commutes with every polynomial in T by Theorem 6.7.1 (d), in particular with ℓi(T)=Pi.

Exercise (C2: When the projections have rank one)

Let T∈L(V) satisfy (∗), with dim⁡V=n and resolution of the identity (P1,…,Pk).

  • (a) Prove that rankPi=dim⁡Eλi(T) and that ∑irankPi=n.
  • (b) Deduce that every Pi has rank 1 if and only if T has n distinct eigenvalues.
  • (c) Suppose every Pi has rank 1. Prove that every S∈L(V) commuting with T is a polynomial in T.

Solution.

  • (a) imPi=Eλi(T) by Definition 11.3.2, so rankPi=dim⁡Eλi(T). By Theorem 12.8.1 (a), V=E1⊕⋯⊕Ek, so the dimensions add to n.

  • (b) If every rankPi=1, then (a) gives k=n, so T has n distinct eigenvalues. Conversely, if T has n distinct eigenvalues, then k=n and (a) forces each of the n positive integers rankPi to be 1.

  • (c) By (b), k=n and each Ei is a line, say Ei=span(ei) with (e1,…,en) an orthonormal eigenbasis. Let ST=TS. As in the proof of Theorem 12.8.3 (e), S maps Ei into itself, so Sei=ciei for some ci∈F. Define f:spec(T)→F by f(λi)=ci. Then f(T)ei=ciei=Sei for every i, and two operators agreeing on a basis are equal, so S=f(T). By Exercise (C1: The projections are polynomials in the operator) (b), f(T) is a polynomial in T.

Exercise (C3: What the functional calculus forgets)

Let T∈L(V) satisfy (∗), with distinct eigenvalues λ1,…,λk, and let f,g:spec(T)→F.

  • (a) Prove that f(T)=0 if and only if f(λi)=0 for every i. Deduce that f(T)=g(T) if and only if f=g.
  • (b) Deduce that {p(T):p∈F[x]}=span(P1,…,Pk), a subspace of L(V) of dimension exactly k.
  • (c) Deduce that mT=(x−λ1)(x−λ2)⋯(x−λk), so that the minimal polynomial of an operator satisfying (∗) has no repeated root.

Solution.

  • (a) (⇐) is immediate from Definition 12.8.2. For (⇒), fix i and pick v∈Eλi(T) with v≠0, which is possible because λi is an eigenvalue. Then Piv=v and Pjv=0 for j≠i, since Ei⊆kerPj (Theorem 12.8.1 (a), (b)). Hence 0=f(T)v=∑jf(λj)Pjv=f(λi)v, and v≠0 forces f(λi)=0. For the second claim, apply this to f−g, using Theorem 12.8.3 (b).

  • (b) By Theorem 12.8.3 (a), every p(T) equals ∑ip(λi)Pi, so the left-hand side is contained in span(P1,…,Pk); conversely every ∑iciPi is f(T) for the function f(λi)=ci, hence is a polynomial in T by Exercise (C1: The projections are polynomials in the operator) (b). The Pi are linearly independent: if ∑iciPi=0, that operator is f(T) for f(λi)=ci, so every ci=0 by (a). Hence the dimension is k.

  • (c) Put p=∏i(x−λi), monic of degree k. Since p(λi)=0 for every i, part (a) gives p(T)=0, so mT∣p by Theorem 9.5.1. Conversely mT(T)=0, so mT(λi)=0 for every i by (a), and hence each x−λi divides mT (Theorem 6.1.3 (b)). Distinct monic linear polynomials are coprime, since a common divisor would divide their difference, a non-zero constant; so p=∏i(x−λi) divides mT by Lemma 6.6.3 (b). Two monic polynomials dividing each other are equal, so mT=p, a product of distinct linear factors.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.