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 , any function whatsoever on those
numbers produces
a new operator, and powers, square roots, and
exponentials all become one line of arithmetic on the
spectrum.
Throughout, is
a nonzero finite-dimensional inner
product space over or , and . We say that satisfies
By Theorem 12.4.2
this holds over
exactly for the normal operators, and
by Theorem 12.5.1 it
holds over
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.
Grouping
an eigenbasis by eigenvalue
Here is the observation the section runs on. Let
be an orthonormal eigenbasis of
, with . The list
repeats: an eigenvalue of geometric multiplicity 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 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
satisfy , let
be the distinct
eigenvalues of ,
and write for the corresponding
eigenspaces. Let be the orthogonal projection
onto (Definition 11.3.2).
The identity is the spectral resolution of
, and the family
is the resolution of the identity
attached to .
Two clauses carry weight. The eigenvalues are listed
once each, so is the number of
distinct eigenvalues and not ; 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 fit together as
neatly as one could want, is the next theorem.
Theorem
12.8.1 (The Spectral Resolution and Its
Projections)
Let
satisfy ,
with distinct eigenvalues , eigenspaces ,
and .
Then:
- (a) , and whenever ;
- (b) and for every
, and whenever ;
- (c) ;
- (d) ;
- (e) for every .
Idea. Everything is read off one
orthonormal eigenbasis. Sorting its vectors by
eigenvalue cuts it into bundles; the only thing
to check is that the -th bundle spans the
whole of , 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
with its terms grouped, and (b) and (e) are
bookkeeping.
Proof. Let be an orthonormal basis of with , which exists by . Each is nonzero, so
each is an
eigenvalue of and
therefore equals exactly one . Put so that is the disjoint union of .
Step 1. . The inclusion is immediate,
since for . For , let and
write in the basis . Applying , Coordinates in a basis are unique, so for every , and hence unless . In
particular , because .
Step 2 (a). By Step 1, . If , then and are disjoint and
is orthonormal,
so every spanning vector of is orthogonal to
every spanning vector of ; hence . Pairwise
orthogonal subspaces are independent: if with , then
pairing with kills every
term but one and leaves ,
so . By Theorem 1.7.4 the
sum is direct.
Step 3 (b). Each is self-adjoint by Theorem 11.3.3 (b),
and satisfies with and (Definition 11.3.2
and the discussion following it). For , Step 2 gives
, so and .
Step 4 (c) and (d). By Step 1, is an orthonormal basis of , so Theorem 11.3.3 (a)
gives Summing over collects every index
exactly once, so
by Theorem 11.2.1,
which is (c). Multiplying the -th group by instead, where the second equality uses for
, and
the third the linearity of together with . This is (d).
Step 5 (e). For we have
, so ; thus . In
the other order, (d) and (b) give This proves the theorem.
For matrices the picture is the familiar one,
packaged differently. If is normal, write with
unitary and
diagonal (Corollary 12.4.3).
Grouping the columns of by their eigenvalue
turns this into so each is a sum of rank-one
projections and .
Example
(A Symmetric Matrix)
Let . Find the
spectral resolution of .
Solution. Write , where
is the all-ones
matrix. Since , we get and
exactly when . So
has eigenvalues
and , and has eigenvalues with of dimension and of
dimension . Since
,
the orthogonal projection onto is , and by Theorem 12.8.1
(c). Concretely, Check. Both are symmetric, both
satisfy , their product is , they sum to , and Note that the resolution has two terms, not
three: counts
distinct eigenvalues, while records the
multiplicity of .
Orthogonal
projections versus oblique ones
An expression with idempotents summing to
the identity is not by itself news. In the proof of Theorem 10.8.3 the
semisimple part of is written as ,
where projects onto the generalized eigenspace
along the sum of the others (Theorem 9.8.1 (d));
when is
diagonalizable, that is a decomposition of itself, and those satisfy , for , and ,
exactly as in Theorem 12.8.1 (b)
and (c). What they do not satisfy is
,
and that single missing condition is the whole
difference between Chapter 10 and this section.
Example
(Two Projections That Are Not Orthogonal)
Let , which is diagonalizable with
eigenvalues and
. Compute the
projections 𝛑𝛑 of Theorem 9.8.1 for
, verify that
𝛑𝛑, and decide whether they are orthogonal
projections.
Solution. The eigenspaces are
and , read off from and . Since the
eigenvalues are distinct, the generalized eigenspaces
are the eigenspaces. With we have , so 𝛑𝛑𝛑 Both square to themselves, their products
vanish in both orders, they sum to , and 𝛑𝛑 They are not orthogonal
projections: 𝛑𝛑. Geometrically, 𝛑 projects onto
along , and those
two lines meet at , not at a
right angle. Consistently, is not normal:
Warning. “Diagonalizable”
gives projections; only “normal” makes them
orthogonal. Every diagonalizable operator
splits as 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 — and most of
this section does — normality is what pays for it.
What makes
a resolution the resolution
The projections in Definition 12.8.1
were built from the eigenspaces, so they are visibly
determined by . 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 be a
nonzero finite-dimensional inner product space over
and let . Suppose
where are
distinct and are nonzero operators
satisfying
- (R1) and for every
;
- (R2) whenever ;
- (R3) .
Then satisfies
, , and is the orthogonal
projection onto for every
. In particular
is the number of
distinct eigenvalues of , and the given
decomposition is the spectral resolution of .
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 into the
orthogonal direct sum of the images . ③ On the operator is multiplication by
, so ; and because the are distinct, an
eigenvector of
cannot spread across two pieces, which upgrades the
inclusion to an equality.
Proof. Write , which is
nonzero because .
Step 1. . Fix
and drop the
subscript. If , say , then , so is the identity on
. Next, .
Indeed, if , then for every , by Definition 11.6.1
and (R1), so ; conversely if ,
then and using (R1) twice and then ; so .
Finally, for any , so . This is the
splitting of in (Theorem 11.3.2), so
by Definition 11.3.2.
Step 2. , orthogonally. By (R3), every equals . For , and
satisfy by (R1) and (R2), so . As in Step
2 of the proof of Theorem 12.8.1,
pairwise orthogonal subspaces are independent, so the
sum is direct.
Step 3. acts on as multiplication by
. Let
.
By Step 1, , and for , by (R2). Hence
Since , this makes an eigenvalue of
, with .
Step 4. and . Let be an eigenvalue
of with
eigenvector . By (R3), with , and
by Step 3, Subtracting, with the -th term in , so by the directness
of Step 2 every term vanishes:
whenever . As ,
some , and for that we get . The
being
distinct, is the
only index with , so . Therefore and ; with Step 3 both are equalities.
Step 5. By Steps 1 and 4, . Choosing an orthonormal basis
of each (Theorem 11.2.2) and
concatenating gives an orthonormal basis of by Step 2, made of
eigenvectors of
by Step 3; so
satisfies .
This proves the theorem.
Read the other way round, the theorem is the complex
spectral theorem again with no basis in sight: over
, an operator is
normal if and only if it can be written
as
with distinct
and nonzero 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.
Solution. Self-adjointness in (R1):
𝛑𝛑. Everything else holds. The cost is Step
1 of the proof: 𝛑 is a projection
onto , but
along
rather than along , so it is not .
Consequently the two images are not perpendicular, and
the conclusion fails at its strongest point: does not satisfy , since it is not
normal.
Functions
of an operator
Powers are now trivial. Multiplying the resolution by
itself and using for leaves only the diagonal terms: and the same computation repeated gives . So for every polynomial
. Stare at that
formula and notice what it does not
use: nothing about except its values on the spectrum.
Any function at all supplies those.
Definition
12.8.2 (Function of an Operator)
Let
satisfy ,
with distinct eigenvalues and spectral resolution .
For any function ,
define
In words: apply to each eigenvalue and
reweight the same projections. The function needs no
continuity, no differentiability, and no formula — it is
numbers. And the
definition is unambiguous: the and the are determined by
alone, by Theorem 12.8.2, so
no choice of basis or of eigenvectors enters.
Four instances show the range. Taking
returns . Taking
returns
, by Theorem 12.8.1
(c). Taking returns , since . And if
,
taking returns , because
The notation is, on its face, dangerous. For a
polynomial the
symbol already
means something — the operator 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
satisfy ,
with distinct eigenvalues and resolution of the identity . Let
and , with , , and
taken
pointwise.
- (a)
(Compatibility) For every , the operator
of Definition 2.4.2
equals ;
that is, it agrees with Definition 12.8.2
applied to the restriction of to .
- (b) (Algebra
homomorphism) , , , and .
- (c)
(Adjoints) ,
where . In particular is self-adjoint when
is real-valued,
and unitary when for every .
- (d)
(Spectral mapping) satisfies , with the same
orthonormal eigenbasis as , and .
- (e)
(Commutation) If commutes
with , then commutes with every
and hence with
. In particular
and commute.
Idea. Everything rests on one
multiplication table, . It says that the operators
multiply exactly the way the coefficient lists
multiply coordinatewise, so contains a copy of
the algebra of all -valued functions on
, and 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 into polynomials — and
the argument is to compute the powers of . For (e), a commuting
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 with the usual convention . For both sides equal
, by Theorem 12.8.1
(c). Assuming the formula for , Theorem 12.8.1 (d)
and (b) give since for and . Now let . By Definition 2.4.2 and
the formula just proved, 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 which is . The right-hand
side is symmetric in and , so .
Finally by Theorem 12.8.1
(c).
(c) By Theorem 11.6.2 (a)
and (b), and , If is
real-valued then and . If for all , then , so by
(b) , and likewise ; so
is unitary (Definition 11.7.2).
(d) Let be an orthonormal eigenbasis of
, with , and fix . Let be the index with . Then
,
so , while
for because
, by Theorem 12.8.1 (a)
and Definition 11.3.2.
Hence So is
an orthonormal basis of eigenvectors of , which is for . The matrix of in is , so its eigenvalues are exactly the
numbers ,
that is the numbers ; hence .
(e) Suppose . Each is -invariant: if , then . Let and write
with (Theorem 12.8.1
(c)). Applying
gives with , and
this is the decomposition of in , which is unique. Comparing it with gives for every , that is . Hence commutes with . Since commutes with itself,
the last claim follows. This proves the
theorem.
Part (a) is what makes the notation honest. Writing
, , and 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 , and Definition 10.9.1
consults no derivatives at all — it too returns .
The two constructions of agree for normal
, and Chapter
10’s extra machinery is precisely the price of dropping
normality.
Warning. Outside the normal
case, on the
spectrum is not enough data. For the only eigenvalue is
, so the recipe
“” would read for every
— and with it would
announce .
The recipe is not wrong, it is inapplicable: is not normal, so
there is no resolution of the identity to expand in.
Chapter 10’s definition of has to consult
as well
(Definition 10.9.1),
and that derivative is exactly what the missing
orthogonality would have spared us.
Quick check. Let satisfy
with .
Identify .
Solution. is the orthogonal
projection onto . Indeed the
spectral resolution reads .
So the operators satisfying with spectrum in
are
exactly the orthogonal projections, together with and for the degenerate
spectra and
.
Square
roots
The function is defined on , so Definition 12.8.2
produces a square root of 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 ’s.
Note first that over the hypothesis is
stronger than it looks. If satisfies and ,
then is real-valued on the spectrum, so
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 Nonnegative Normal
Operator)
Let be a
nonzero finite-dimensional inner product space over
and let satisfy
with . Then there is exactly
one operator such that
- (i) satisfies ;
- (ii) ;
- (iii) .
It is , where is
the spectral resolution of . This is self-adjoint, and it
commutes with every operator that commutes with .
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 with the
candidate directly but to square ’s own resolution.
If , then ,
and the are
still distinct because the are distinct
and nonnegative. So meets
every condition of Theorem 12.8.2 for
, which forces it
to be ’s spectral
resolution term by term.
Proof. Existence. Let
on , which takes values in ,
and put . Then is the function ,
so by Theorem 12.8.3 (b)
and (a), giving (iii). By Theorem 12.8.3
(d), satisfies
and , giving (i) and (ii). Since is real-valued, is self-adjoint by Theorem 12.8.3
(c), and it commutes with everything commuting with
by (e) of the
same theorem.
Uniqueness. Let satisfy (i), (ii), and
(iii), and let be its spectral resolution (Theorem 12.8.1):
the are the
distinct eigenvalues of , and the are nonzero
self-adjoint idempotents with for
and
.
By Theorem 12.8.3 (a)
applied to and
, The scalars are
distinct: the are distinct by
construction, and nonnegative by (ii), so
would force . The family
satisfies (R1), (R2), and (R3) of Theorem 12.8.2,
and every is
nonzero. That theorem therefore identifies the displayed
expression as the spectral resolution of : after renumbering,
, , and
for every
. Since and , we
get , and hence which is the operator constructed above. This
proves the theorem.
The square root is written , or . Chapter 13 takes
the hypothesis as the definition of a
positive operator, proves that it is
equivalent to for all , and makes this
theorem the tool behind polar decomposition and the
singular value decomposition; the notation in the notation
table refers to exactly the operator built here.
Example
(A Square Root, and Three Impostors)
Let . Find its spectral resolution, compute
and , and find a
symmetric square root of other than .
Solution. The resolution.
is symmetric,
hence self-adjoint on . Since and
,
the eigenvalues are and , with eigenlines and . Both
spanning vectors have squared length , so
The square root. Both eigenvalues are
positive, so Theorem 12.8.4
applies: and indeed .
Powers. By Theorem 12.8.3
(a), , that is For
this reads , which is .
An impostor. Changing one sign gives , and as well. So
has more than
one symmetric square root; fails clause (ii) of
Theorem 12.8.4,
since . Flipping the other sign, and both, gives
and : four
symmetric square roots, and exactly one of them has
nonnegative 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 . Take Here , so (ii) holds, and
(iii) holds by the display, yet .
Only (i) fails: while .
The phrase “the square root of ” always means the one
satisfying all three.
The
exponential and the unitary group
Chapter 10 defined for every as the
sum of the series (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 .
Theorem
12.8.5 (Unitary Matrices Are Exponentials of
Hermitian Matrices)
Let .
- (a) If is normal
with spectral resolution , then .
- (b) If is
Hermitian, then , and .
- (c) Conversely,
every equals for some
Hermitian , which
may be chosen with .
Idea. For (a), the partial sums of
the series collapse: , so each partial sum
is a fixed combination of the scalar partial sums of
,
whose limits are the numbers . For (b)
and (c), the resolution turns everything into a
statement about
complex numbers:
Hermitian means real eigenvalues, then has
eigenvalues on the unit circle, and a unitary matrix has
eigenvalues on the unit circle, each of which is for a unique
. Reading the last sentence backwards
constructs .
Proof.
(a) By Theorem 12.8.3
(a), for every , so for every
, Fix a position . Its entry on the
right is ,
where and the coefficients do not depend
on . Each
as by
the scalar exponential series, so the entry converges to
.
Hence the series converges entrywise to ,
and by Definition 10.9.2
this matrix is .
(b) is normal, so it has a
spectral resolution , and its eigenvalues are real by Theorem 12.2.1.
The scalars are distinct,
so is the spectral resolution
of by Theorem 12.8.2,
and (a) gives Each is real, so
. Hence,
using and from Theorem 12.8.1
(b), so by Definition 11.7.3.
For the determinant, Theorem 10.9.4 (e)
gives .
(c) Let . Then
, so
is normal; let be its spectral resolution.
Every eigenvalue has : if
with ,
then because
is an isometry
(Theorem 11.7.3),
and . So there is a unique
with , and the are distinct
because the
are. Put The are real, so
by Theorem 11.6.2 (a),
(b) and Theorem 12.8.1
(b): is
Hermitian, with by Theorem 12.8.2. By
(a) applied to ,
This proves the theorem.
Part (c) says that the exponential map from Hermitian
matrices to is
surjective. One consequence belongs to
topology rather than algebra, so we only record it: the
path , , stays inside and runs from
to , so every unitary
matrix can be deformed continuously to the identity.
Nothing of the sort holds in , where the
determinant is
and cannot change sign along a path.
Example
(Exponentiating a Hermitian Matrix, and Undoing
It)
Let . Compute
for
.
Then find a Hermitian with , where .
Solution. Forwards. is symmetric with
and
,
so its eigenvalues are and Hence has resolution
(for ), and Theorem 12.8.5 (a)
gives using . Each row
has squared length and the two rows are orthogonal, confirming
that the result is unitary.
Backwards. is the rotation by
, hence
unitary, with and . Both eigenvectors have
squared length ,
so the spectral projections are Writing to land in , the recipe of
Theorem 12.8.5 (c)
gives Hermitian with spectrum .
Leaving ,
the smaller choice works just as well: the
Hermitian logarithm is far from unique.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define the
spectral resolution of , and say which
operators have one over and which over .
- (b) List the
properties of the family given
by Theorem 12.8.1,
and say how many terms the resolution of a self-adjoint
with eigenvalues has.
- (c) True or false:
if with and nonzero operators satisfying , , and
,
then is normal.
Justify your answer.
- (d) Define for a function on , and say exactly
how much information about 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 on , and say which one
Theorem 12.8.4
singles out and why.
Solution.
(a) For with an orthonormal
basis of eigenvectors, distinct eigenvalues , and the orthogonal
projection onto the -th eigenspace, the
spectral resolution is (Definition 12.8.1).
Over the
operators with one are exactly the normal operators (Theorem 12.4.2);
over , exactly
the self-adjoint ones (Theorem 12.5.1).
(b) Each is self-adjoint and
idempotent, for , , and . The resolution has
two terms, , with
and
: the
resolution counts distinct eigenvalues, not
multiplicities.
(c) False.
Self-adjointness of the is missing, and it is
the one hypothesis of Theorem 12.8.2
that does the work. The matrices 𝛑𝛑 of Example (Two Projections That Are Not Orthogonal)
satisfy everything listed, with and , and 𝛑𝛑, which is
not normal.
(d) (Definition 12.8.2).
It uses exactly the values ; two functions agreeing on give the same
operator, and
need not be defined, let alone continuous, anywhere
else.
(e) For , the operator
coincides with the operator of Definition 2.4.2.
Without it, the symbol would carry two
unrelated meanings at once, and no computation mixing
polynomials with other functions — for instance — could
be trusted.
(f) and the reflection
with , both
self-adjoint with square . Theorem 12.8.4
singles out ,
because while
is not. (A third root is , and a fourth is
with
.)
B. Practice
Exercise
(B1: Write these as )
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 .
- (a) .
- (b) .
- (c) .
Solution.
(a) , , and , so and .
From the first row gives the
eigenvector , with ; from likewise ,
with . Hence and . Both are Hermitian, both
square to themselves, , and .
(b) is symmetric, and
, , , so
with and . Hence and . The stated properties follow from , , and .
(c) is real orthogonal,
hence unitary and normal. Since , and similarly
, we get . Both eigenvectors have squared
length , so with
, Both are Hermitian and idempotent, and
.
Exercise
(B2: Computing through the resolution)
Let .
- (a) Find the
spectral resolution of .
- (b) Hence compute
, and
verify by squaring.
- (c) Hence give a
closed formula for and write down
.
- (d) Hence compute
.
Solution.
(a) and
,
so and, both spanning vectors having squared
length ,
(b) Both
eigenvalues are positive, so by Theorem 12.8.4,
and .
(c) By Theorem 12.8.3
(a), , that is so . (As a check, gives , which is .)
(d) By Theorem 12.8.5
(a),
Exercise
(B3: Is it a spectral resolution?)
Determine which of the following displays the
spectral resolution of the operator 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 : , with , , , .
- (b) On : , with , , .
- (c) On : , with , , , .
Solution.
(a) Yes. The two
matrices are symmetric, idempotent, nonzero, annihilate
each other, and sum to , and ; the
coefficients and
are distinct. By
Theorem 12.8.2
this is the spectral resolution, and indeed ,
.
(b) No: the
scalars are not distinct, so the
hypothesis of Theorem 12.8.2
fails at once. The identity
is true but uninformative — the eigenvalue has been split
artificially across two projections. The spectral
resolution of
has a single term, , since and
.
(c) No: is not self-adjoint,
since , so (R1) fails.
Everything else holds: , , ,
and . There is no correct resolution to offer,
because is not
normal: while . The projections
here are onto along , two
lines that are not perpendicular.
C. Going deeper
Exercise
(C1: The projections are polynomials in the
operator)
Let
satisfy ,
with distinct eigenvalues and resolution of the identity .
- (a) Prove that , where
is
the -th Lagrange
basis polynomial for the nodes .
- (b) Deduce that for
every there is a polynomial of degree less than
with .
- (c) Deduce that
every operator commuting with commutes with each
, 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 are distinct elements of
, so Definition 6.6.1 gives
of degree , and Theorem 6.6.1 (a)
gives . By Theorem 12.8.3
(a),
(b) Let be the interpolating
polynomial of degree less than with for every , which exists by Theorem 6.6.1. By Theorem 12.8.3
(a), Explicitly, .
(c) If , then commutes with every
polynomial in by
Theorem 6.7.1 (d), in
particular with .
Exercise
(C2: When the projections have rank one)
Let
satisfy ,
with and
resolution of the identity .
- (a) Prove that and that .
- (b) Deduce that
every has rank
if and only if
has distinct
eigenvalues.
- (c) Suppose every
has rank . Prove that every commuting
with is a
polynomial in .
Solution.
(a) by Definition 11.3.2,
so . By Theorem 12.8.1
(a), , so the dimensions add to .
(b) If every
, then
(a) gives , so
has distinct eigenvalues.
Conversely, if
has distinct
eigenvalues, then and (a) forces each of the positive integers to be .
(c) By (b), and each is a line, say
with an orthonormal eigenbasis. Let
. As in the
proof of Theorem 12.8.3
(e), maps into itself, so for some . Define
by . Then for every , and two operators
agreeing on a basis are equal, so . By Exercise (C1: The projections are polynomials in the operator)
(b), is a
polynomial in .
Exercise
(C3: What the functional calculus forgets)
Let
satisfy ,
with distinct eigenvalues , and let .
- (a) Prove that if and only if
for every . Deduce
that if
and only if .
- (b) Deduce that
, a subspace of of dimension
exactly .
- (c) Deduce that
, so that the
minimal polynomial of an operator satisfying has no repeated
root.
Solution.
(a) is immediate
from Definition 12.8.2.
For ,
fix and pick
with ,
which is possible because is an
eigenvalue. Then and
for , since
(Theorem 12.8.1
(a), (b)). Hence and forces . For the
second claim, apply this to , using Theorem 12.8.3
(b).
(b) By Theorem 12.8.3
(a), every
equals , so
the left-hand side is contained in ;
conversely every is for the function
,
hence is a polynomial in by Exercise (C1: The projections are polynomials in the operator)
(b). The are
linearly independent: if , that
operator is
for , so every by (a). Hence the dimension is .
(c) Put , monic of degree . Since for
every , part (a)
gives , so
by Theorem 9.5.1.
Conversely , so for
every by (a), and
hence each divides (Theorem 6.1.3 (b)).
Distinct monic linear polynomials are coprime, since a
common divisor would divide their difference, a nonzero
constant; so divides by Lemma 6.6.3 (b). Two
monic polynomials dividing each other are equal, so
, a product
of distinct linear factors.