20.08.2013 Views

Operators on Hilbert Spaces - user web page - AIMS

Operators on Hilbert Spaces - user web page - AIMS

Operators on Hilbert Spaces - user web page - AIMS

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Secti<strong>on</strong> 3.2. Riesz Representati<strong>on</strong> of functi<strong>on</strong>als Page 11<br />

3.2 Riesz Representati<strong>on</strong> of functi<strong>on</strong>als<br />

Theorem 3.2.1 ([Red53], 5·4 Theorem (Riesz representati<strong>on</strong> theorem)) Every bounded linear<br />

functi<strong>on</strong>al ϕ <strong>on</strong> a <strong>Hilbert</strong> space H can be represented in terms of the inner product<br />

ϕ(x) = 〈x, u〉, (3.6)<br />

where u depends <strong>on</strong> ϕ and is uniquely determined by ϕ and has norm ϕ = u.<br />

We want to prove that<br />

(a) ϕ has a representati<strong>on</strong> ϕ(x) = 〈x, u〉,<br />

(b) u is unique,<br />

(c) ϕ = u holds.<br />

Proof.<br />

If ϕ = 0 then (a), (b) and (c) hold, if we take u = 0. So suppose that ϕ = 0.<br />

(a) Now N(ϕ) is a closed subspace of H. Furthermore since ϕ = 0, we have that N(ϕ) = H,<br />

which implies that N(ϕ) ⊥ = 0 by Theorem 2.3.7. Hence there must be at least <strong>on</strong>e n<strong>on</strong>zero<br />

element, say u0 in N(ϕ) ⊥ .<br />

Now set z = ϕ(x)u0 − ϕ(u0)x, then apply ϕ to give ϕ(z) = ϕ(x)ϕ(u0) − ϕ(u0)ϕ(x) =<br />

0, and so z ∈ N(ϕ). Also, since u0 ∈ N(ϕ) ⊥ we have,<br />

where<br />

which implies that<br />

If we set<br />

then ϕ(x) = 〈x, u〉. Hence (a) is proved.<br />

0 = 〈z, u0〉 = 〈ϕ(x)u0 − ϕ(u0)x, u0〉<br />

= ϕ(x)〈u0, u0〉 − ϕ(u0)〈x, u0〉<br />

〈u0, u0〉 = u0 2 = 0,<br />

ϕ(x) = ϕ(u0)〈x, u0〉<br />

u02 .<br />

u = ϕ(u0)u0<br />

,<br />

u02 (b) To prove that u is unique, suppose that for all x ∈ H we have,<br />

Then<br />

ϕ(x) = 〈x, u1〉 = 〈x, u2〉.<br />

〈x, u1 − u2〉 = 0 for all x.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!