Eksamen Solutions TMA4230 2005-05-31 S
Eksamen Solutions TMA4230 2005-05-31 S
Eksamen Solutions TMA4230 2005-05-31 S
Suggested solution
Text in small type, like this, is not part of the solution, but rather comments on the solution.
Problem 1
a) The closed graph theorem states that, if X and Y are Banach spaces and T : X Y is a linear operator
with closed graph in X Y , then T is bounded.
An operator with a closed graph is itself called closed, so an even briefer statement of the theorem is possible
and acceptable. Kreyszig considers the case where T is defined only on a closed subspace of X . This is only
apparently more general, since a closed subspace of a Banach space is itself a Banach space. But of course,
this formulation is also acceptable. It is necessary for both X and Y to be Banach spaces, as counterexamples
can be constructed if either of them is not complete.
b) First, ker P is a closed subspace: This is true of the kernel of every bounded linear operator, whether
or not they are projections. From P 2 = P we get P P x = P x, so that P y = y if y = P x im P . It follows
that im P = ker(I P ), which is a closed subspace. If y im P ker P then y = P y = 0, so y = 0. Thus
im P ker P = {0}. And we can always write x = P x + (I P )x with P x im P and (I P )x ker P , so
that X = im P + ker(I P ).
c) By assumption, every x X is uniquely written x = y + z with y Y and z Z . If P is a projection
with image Y and kernel Z , then we are forced to have P y = y and P z = 0, so P x = P (y + z) = y.
Moreover, this is well defined P because of the uniqueness of the decomposition of x.
To prove the linearity of P is straightforward, and Ill skip it here.
To prove that P is bounded, we use the closed graph theorem. If x X we write as before x = y + z
with y Y , z Z , and note that P x = y. Thus we get a pair (x, y) = (y + z, y) in the graph of P , and
we note that every member of the graph of P can be written this way. Put differently, a pair (x, y)
belongs to the graph of P if and only if y Y and x y Z .
Let now (x n , y n ) belong to the graph of P for each n, and assume x n x and y n y in the norm
topology, i.e., kx n xk 0 and ky n yk 0.
Now, since Y is closed, y Y is an immediate consequence. And since x n y n xy and x n y n Z ,
and moreover Z is closed, we get x y Z . Thus the limit (x, y) belongs to the graph of P . We have
proved that P has a closed graph, and therefore the boundedness of P .
Problem 2
b) We apply the identity of the previous question. Since now p(x) = 0, we get p(x) = {0}, so that
p (x) = {0}. That is, (x) is contained in the zero set of p, which is a finite set.
soln.tex,v 1.2
Suggested solution
Problem 3
a) Any bounded self-adjoint operator T on a Hilbert space H can be written
Z
T = d E
R
k (E k E k1 )
where 0 < 1 < < n , 0 < m, n M , k1 k k for k = 1, . . . , n, and the limit is taken as the
norm maxk |k k1 | goes to zero.
Finally,
Z
f (T ) =
f () d E
b) It is known that E is constant in each subinterval of the complement of the spectrum. There are
n + 1 such intervals, yielding n + 1 different values of E . By the continuity from the right of the
spectral map, the value of each E k is the value of E in the interval to the right of k . Thus
< 1 ,
0
E =
k < k+1 ,
E
k
k = 1, . . . , n 1,
n .
k=1
The following question was not supposed to be here. It had been replaced by a different question, but then
an early version was delivered to the exam office by mistake.
The students were told around 11:30, and told that they could skip this question and still get a full score.
i tT
e i t d E.
=e
i t T
e i t d E .
soln.tex,v 1.2