Functional Analysis/Hilbert spaces

From testwiki
Jump to navigation Jump to search

Template:Header

A normed space is called a pre-Hilbert space if for each pair (x,y) of elements in the space there is a unique complex (or real) number called an inner product of x and y, denoted by x,y, subject to the following conditions:

  • (i) The functional f(x)=x,y is linear.
  • (ii) x,y=y,x
  • (iii) x,x>0 for every nonzero x

The inner product in its second variable is not linear but antilinear: i.e., if g(y)=x,y, then g(αy)=α¯y for scalars α. We define x=x,x1/2 and this becomes a norm. Indeed, it is clear that αx=|α|x and (iii) is the reason that x=0 implies that x=0. Finally, the triangular inequality follows from the next lemma.

3.1 Lemma (Schwarz's inequality) |x,y|xy where the equality holds if and only if we can write x=λy for some scalar λ.

If we assume the lemma for a moment, it follows:

x+y2 =x2+2Rex,y+y2x2+2|x,y|+y2
(x+y)2

since Re(α)|α| for any complex number α

Proof of Lemma: First suppose x=1. If α=x,y, it then follows:

0αxy2=|α|22Re(αx,y)+y2=|α|2+y2

where the equation becomes 0 if and only if x=λy. Since we may suppose that x0, the general case follows easily.

3.2 Theorem A normed linear space is a pre-Hilbert space if and only if xy2=2x2+2y2x+y2.
Proof: The direct part is clear. To show the converse, we define

x,y=41(x+y2xy2+ix+iy2ixiy2).

It is then immediate that x,y=y,x, x,y=x,y and ix,y=ix,y. Moreover, since the calculation:

x1+x2+y2x1+x2y2 =2x1+y22x1y2x1x2+y2x1x2y2
=j=12xj+y2xjy2,

we have: x1+x2,y=x1,y+x2,y. If α is a real scalar and αj is a sequence of rational numbers converging to α, then by continuity and the above, we get: αx,y=limjαjx,y=αx,y.

3.3 Lemma Let be a pre-Hilbert. Then xjx in norm if and only if for any y xjx and xjx,y0 as j.
Proof: The direct part holds since:

|xjx|+|xjx,y|xjx(1+y)0 as j.

Conversely, we have:

xjx2=xj22Rexj,x+x20 as j

3.4 Lemma Let D be a non-empty convex closed subset of a Hilbert space. Then D admits a unique element z such that

z=inf{x;xD}.

Proof: By δ denote the right-hand side. Since D is nonempty, δ>0. For each n=1,2,..., there is some xnD such that 0xnδn1. That is, δ=limnxn. Since D is convex,

xn+xm2D and so δ12xn+xm.

It follows:

xnxm2 =2xn2+2xm2xn+xm2
2xn2+2xm24δ2
2δ2+2δ24δ2=0 as n,m

This is to say, xn is Cauchy. Since D is a closed subset of a complete metric space, whence it is complete, there is a limit zD with z=δ. The uniqueness follows since if w=δ we have

zw2=2z2+2w2z+w2

where the right side is 0 for the same reason as before.

The lemma may hold for a certain Banach space that is not a Hilbert space; this question will be investigated in the next chapter.

For a nonempty subset E, define E to be the intersection of the kernel of the linear functional uu,v taken all over vE. (In other words, E is the set of all x that is orthogonal to every yE.) Since the kernel of a continuous function is closed and the intersection of linear spaces is again a linear space, E is a closed (linear) subspace of . Finally, if xEE, then 0=x,x=x and x=0.

3.5 Lemma Let be a linear subspace of a pre-Hilbert space. Then z if and only if z=inf{z+w;w}.
Proof: (<=). Let w. By our condition, we have that zz+w. Squaring both sides gives z2z+w2. Expanding this using inner products and rearranging gives 2z,ww2. The same thing is true (by the same argument) for w, so we get 2z,ww2. This altogether implies that w22z,w=2z,ww2, from which we get 2|z,w|w2. Consider a real λ>0; by the same argument we have that 2|z,w|λw2. Since this is true for all λ>0, we get z,w=0. Since furthermore we have iw, we have that 0=z,iw=z,w. We conclude that z,w=0.

(=>) Let w. We have that z+w2=z2+2z,w+w2=z2+w2z2. Taking the first and last term in this quality, and applying the square root, gives z+wz. Finally, notice that for w=0, the infimum is obtained because z+w=z.

3.6 Theorem (orthogonal decomposition) Let be a Hilbert space and be a closed subspace. For every x we can write

x=y+z

where y and z, and y and z are uniquely determined by x.
Proof: Clearly x is convex, and it is also closed since a translation of closed set is again closed. Lemma 3.4 now gives a unique element y such that xy=inf{xw;w}. Let z=xy. By Lemma 3.5, z. For the uniqueness, suppose we have written:

x=y+z

where y and z. By Lemma 3.5, xy=inf{xw;w}. But, as noted early, such y must be unique; i.e., y=y.

3.7 Corollary Let be a subspace of a Hilbert space . Then

  • (i) ={0} if and only if is dense in .
  • (ii) =.

Proof: By continuity, x,x,. (Here, x,E denotes the image of the set E under the map yx,y.) This gives:

= and so =

by the orthogonal decomposition. (i) follows. Similarly, we have:

==.

Hence, (ii).

3.8 Theorem (representation theorem) Every continuous linear functional f on a Hilbert space has the form:

f(x)=x,y with a unique y and f=y


Proof: Let =f1({0}). Since f is continuous, is closed. If =, then take y=0. If not, by Corollary 3.6, there is a nonzero z orthogonal to . By replacing z with zz1 we may suppose that z=1. For any x, since zf(x)f(z)x is in the kernel of f and thus is orthogonal to z, we have:

0=zf(x)f(z)x,z=z,zf(x)f(z)x,z

and so:

f(x)=x,f(z)z

The uniqueness follows since x,y1=x,y2 for all x means that y1y2={0}. Finally, we have the identity:

y=|yy,y|fy

where the last inequality is Schwarz's inequality.

3.9 Exercise Using Lemma 1.6 give an alternative proof of the preceding theorem.

In view of Theorem 3.5, for each x, we can write: x=y+z where y, a closed subspace of , and z. Denote each y, which is uniquely determined by x, by π(x). The function π then turns out to be a linear operator. Indeed, for given x1,x2, we write:

x1=y1+z1,x2=y2+z2 and x1+x2=y3+z3

where yj and zj for j=1,2,3. By the uniqueness of decomposition

π(x1)+π(x2)=y1+y2=y3=π(x1+x2).

The similar reasoning shows that π commutes with scalars. Now, for x=y+z (where y and z), we have:

x2=π(x)2+z2π(x)2

That is, π is continuous with π1. In particular, when is a nonzero space, there is x0 with π(x0)=x0 and x0=1 and consequently π=1. Such π is called an orthogonal projection (onto ).

The next theorem gives an alternative proof of the Hahn-Banach theorem.

3 Theorem Let be a linear (not necessarily closed) subspace of a Hilbert space. Every continuous linear functional on can be extended to a unique continuous linear functional on that has the same norm and vanishes on .
Proof: Since is a dense subset of a Banach space , by Theorem 2.something, we can uniquely extend f so that it is continuous on . Define g=fπ. By the same argument used in the proof of Theorem 2.something (Hahn-Banach) and the fact that π=1, we obtain f=g. Since g=0 on , it remains to show the uniqueness. For this, let h be another extension with the desired properties. Since the kernel of fh is closed and thus contain , f=h on . Hence, for any x,

h(x)=(hπ)x=(fπ)x=g(x).

The extension g is thus unique.

3 Theorem Let n be an increasing sequence of closed subspaces, and be the closure of 12.... If π is an orthogonal projection onto , then for every x πn(x)x.
Proof: Let 𝒩={x;πn(x)x(n)}. Then 𝒩 is closed. Indeed, if xj𝒩 and xjx, then

πn(x)x2xxj+πn(xj)xj

and so x𝒩. Since 𝒩, the proof is complete.

Let (j,j=,j) be Hilbert spaces. The direct sum of 12 is defined as follows: let 12={(x1,x2);x11,x22} and define

x1x2,y1y2=x1,y11+x2,y22.

It is then easy to verify that (12,,) is a Hilbert space. It is also clear that this definition generalizes to a finite direct sum of Hilbert spaces. (For an infinite direct sum of Hilbert spaces, see Chapter 5.)

Recall from the previous chapter that an isometric surjection between Banach spaces is called "unitary".

3 Lemma (Hilbert adjoint) Define V:1221 by V(x1x2)=x2x1. (Clearly, V is a unitary operator.) Then (VgraT) is a graph (of some linear operator) if and only if T is densely defined.
Proof: Set =(VgraT). Let u(domT*). Then

0=0,Tv2+u,v2=0u,Tvv for every v.

That is to say, 0u, which is a graph of a linear operator by assumption. Thus, u=0. For the converse, suppose fu1,fu2. Then

0=fuj,Tvv=f,Tv2+uj,v1 (j=1,2)

and so u1u2,v1=0 for every v in the domain of T, dense. Thus, u1=u2, and is a graph of a function, say, S. The linear of S can be checked in the similar manner.

Remark: In the proof of the lemma, the linear of T was never used.

For a densely defined T, we thus obtained a linear operator which we call T*. It is characterized uniquely by:

0=f,Tu2+T*f,u1=fT*f,V(uTu) for every u,

or, more commonly,

Tu,f2=u,T*f1 for every u.

Furthermore, T*f is defined if and only if

uTu,f

is continuous for every udomT. The operator T* is called the Hilbert adjoint (or just adjoint) of T. If T is closed in addition to having dense domain, then

(VgraT*)=(V(VgraT))=graT=graT

Here, V(x2,x1)=x1x2. By the above lemma, T* is densely defined. More generally, if a densely defined operator T has a closed extension S (i.e., graTgraS=graS), then S and S* are both densely defined. It follows: graS*graT*. That is, T* is densely defined and T** exists. That S=T** follows from the next theorem.

3 Theorem Let T:12 be a densely defined operator. If T* is also densely defined, then

graT=graT**=graS

for any closed extension S of T.
Proof: As above,

(VgraT*)=graT

Here, the left-hand side is a graph of T**. For the second identity, since graS is a Hilbert space, it suffices to show graTgraS={0}. But this follows from Lemma 3.something.

The next corollary is obvious but is important in application.

3 Corollary Let 1,2 be Hilbert spaces, and T:12 a closed densely defined linear operator. Then udomT if and only if there is some K>0 such that:

T*f,uKf for every fdomT*

3 Lemma Let T:12 be a densely defined linear operator. Then kerT*=(ranT).
Proof: f is in either the left-hand side or the right-hand side if and only if:

0=T*f,u=f,Tu for every u.

(Note that f,Tu=0 for every u implies fdomT*.)

In particular, a closed densely defined operator has closed kernel. As an application we shall prove the next theorem.

3 Theorem Let T:12 be a closed densely defined linear operator. Then T is surjective if and only if there is a K>0 such that

f2KT*f1 for every fdomT*.

Proof: Suppose T is surjective. Since T has closed range, it suffices to show the estimate for f(kerT*)=ranT. Let u(kerT) with Tu=f. Denoting by G the inverse of T restricted to (kerT), we have:

f22T*f1Gf1T*fGf2

The last inequality holds since G is continuous by the closed graph theorem. To show the converse, let g2 be given. Since T* is injective, we can define a linear functional L by L(T*f)=f,g2 for f2.,

|L(T*f)|=|f,g2|KT*f for every fdomT*.

Thus, L is continuous on the range of T*. It follows from the Hahn-Banach theorem that we may assume that L is defined and continuous on 1. Thus, by Theorem 3.something, we can write L()=,u1 in 1 with some u. Since L(T*f) is continuous for fdomT*,

L(T*f)=f,g2=T*f,u1=f,T**u2 for every fdomT*.

Hence, Tu=T**u=g.

3 Corollary Let T,1,2 be as given in the preceding theorem. Then ranT is closed if and only if ranT* is closed.
Proof: Define S:1ranT by S=T. It thus suffices to show S* is surjective when T has closed range (or equivalently S is surjective.) Suppose S*fj is convergent. The preceding theorem gives:

fjfk2KS*(fjfk)10 as j,k.

Thus, fjS*fj is Cauchy in the graph of S*, which is closed. Hence, S*fj converges within the range of S*. The converse holds since T**=T.

We shall now consider some concrete examples of densely defined linear operators.

3 Theorem T:12 is continuous if and only if T* is continuous. Moreover, when T is continuous,

T2=T*T=TT*=T*2.

Proof: It is clear that T* is defined everywhere, and its continuity is a consequence of the closed graph theorem. Conversely, if T* is continuous, then T** is continuous and T=T**. For the second part,

T*f12=|TT*f,f|TT*f2f2 for every f.

Thus, T* is continuous with T*T. In particular, T*T is continuous, and so:

T*f12TT*f22 for every f.

That is to say, T*2TT*T2. Applying this result to T* in place of T completes the proof.

The identity in the theorem shows that B() is a C*-algebra, which is a topic in Chapter 6.

3 Lemma Let S,TB(). If Tx,x=Sx,x for x, then S=T.
Proof: Let R=TS. We have 0=R(x+y),x+y=Rx,y+Ry,x and 0=iR(x+iy),x+iy=Rx,y+i2Ry,x. Summing the two we get: 0=2Rx,y for x,y. Taking y=Rx gives 0=Rx2 for all x or R=0.

Remark: the above lemma is false if the underlying field is 𝐑.

Recall that an isometric surjection is called unitary.

3 Corollary A linear operator U:12 is unitary if and only if U*U and UU* are identities.
Proof: Since (U*Uxx)=Ux2=(xx)>, we see that U*U is the identity. Since UU*U=U, UU* is the identity on the range of U, which is 2 by surjectivity. Conversely, since Ux22=U*Ux,x1=x12, U is an isometry.

Curiously, the hypothesis on linearity can be omitted:

3 Theorem If U:12 is a function such that

U(x)U(y)2=xy1

for every x and y and U(0)=0, then U is a linear operator (and so unitary).
Proof: Note that U is continuous. Since U(x)=U(x)U(0)=x, we have:

xy12=U(x)U(y)22=x122Re(U(x)U(y))+y12.

Thus,

Re(xy)1=Re(U(x),U(y))2

It now follows:

U(αx+y)αU(x)U(y)22=U(αx+y)U(αx)222Re(yy)+U(y)22=y122y12+y12=0

for any x,y1 and scalar α.

There is an analog of this result for Banach space. See, for example, http://www.helsinki.fi/~jvaisala/mazurulam.pdf)

3 Exercise Construct an example so as to show that an isometric operator (i.e., a linear operator that preserves norm) need not be unitary. (Hint: a shift operator.)

A densely defined linear operator T is called "symmetric" if graTgraT*. If the equality in the above holds, then T is called "self-adjoint". In light of Theorem 3.something, every self-adjoint is closed and densely defined. If T is symmetric, then since T** is an extension of T,

graTgraT*graT**.

3 Theorem Let Tj:jj+1 be densely defined linear operators for j=1,2. Then graT1*T2*gra(T2T1)* where the equality holds if Tj**=Tj (j=1,2) and T1*T2* is closed and densely defined.
Proof: Let udom(T1*T2*). Then

T2T1v,u=T1v,T2*u=v,T1*T2*u for every vdom(T2T1).

But, by definition, (T2T1)*u denotes T1*T2*u. Hence, (T2T1)* is an extension of T1*T2*. For the second part, the fact we have just proved gives:

graT1*T2*gra(T2T1)*=gra(T2**T1**)*gra(T1*T2*)**.

3 Theorem Let T:12 be a Hilbert spaces. If T:12 is a closed densely defined operator, then T*T is a self-adjoint operator (in particular, densely defined and closed.)
Proof: In light of the preceding theorem, it suffices to show that T*T is closed. Let ujdomT*T be a sequence such that (uj,T*Tuj) converges to limit (u,v). Since

TujTuk22(T*T(ujuk)1+ujuk1),

there is some f2 such that: Tujf20. It follows from the closedness of T* that T*f=v. Since uju1+Tujf20 and T is closed, T*Tu=T*f=v.

3 Theorem Let T be a symmetric densely defined operator. If T is surjective, then T is self-adjoint and injective and T1 is self-adjoint and bounded.
Proof: If Tu=0,

Tu,v=u,Tv and u=0

if T has a dense range (for example, it is surjective). Thus, T is injective. Since T1 is closed (by Lemma 2.something) and ranT=2, T1:2domT is a continuous linear operator. Finally, we have:

graT1=VgraTVgraT*=gra(T*)1=gra(T1)*.

Here, V(x1x2)=x2x1, and the equality holds since the domains of T and T* coincide. Hence, T1 is self-adjoint. Since we have just proved that the inverse of a self-adjoint is self-adjoint, we have: (T1)1 is self-adjoint.

3 Theorem Let be a closed linear subspace of a Hilbert space . Then π is an orthogonal projection onto if and only if π=π*=π2 and the range of π is .
Proof: The direct part is clear except for π=π*. But we have:

π(x),x=π(x)2

since π(x) and xπ(x) are orthogonal. Thus, π is real and so self-adjoint then. For the converse, we only have to verify xπ(x) for every x. But we have: π(xπ(x))=0 and ker(π)=ker(π*)=(ran(π))=.

We shall now turn our attention to the spectral decomposition of a compact self-adjoint operator. Let T: be a compact operator.

Template:Subject