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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Secti<strong>on</strong> 3.4. <strong>Hilbert</strong>-adjoint and self-adjoint operators Page 15<br />

Now by Cauchy-Schwarz inequality,<br />

so that<br />

|〈Sx, y〉|<br />

sup<br />

x=0 xy<br />

y=0<br />

Sxy<br />

≤ sup<br />

x=0 xy<br />

y=0<br />

= S, (3.16)<br />

h ≤ S. (3.17)<br />

Combining equati<strong>on</strong>s (3.15) and (3.17) gives h = S.<br />

(c) Let us assume that T : H1 → H2 is a linear operator such that for all x ∈ H1 and y ∈ H2,<br />

we have<br />

h(x, y) = 〈Sx, y〉 = 〈Tx, y〉.<br />

Then, by Lemma 3.3.4, Sx = Tx for all x ∈ H1. Hence S = T by definiti<strong>on</strong>.<br />

Remark 3.3.6 An important c<strong>on</strong>sequence of the Riesz representati<strong>on</strong> theorem is the existence<br />

of the adjoint of a bounded operator <strong>on</strong> a <strong>Hilbert</strong> space.<br />

3.4 <strong>Hilbert</strong>-adjoint and self-adjoint operators<br />

Definiti<strong>on</strong> 3.4.1 ([Kre78], 3·9-1 Definiti<strong>on</strong> (<strong>Hilbert</strong>-adjoint operator, T ∗ ))<br />

Given two <strong>Hilbert</strong> spaces, H1 and H2, let T : H1 → H2 be a bounded linear operator. Then the<br />

<strong>Hilbert</strong>-adjoint operator T ∗ of T is the operator T ∗ : H2 → H1 such that for all x ∈ H1 and<br />

y ∈ H2,<br />

〈Tx, y〉 = 〈x, T ∗ y〉. (3.18)<br />

Let us show that there exists such an operator T ∗ .<br />

Theorem 3.4.2 ([Kre78], 3·9-2 Theorem (Existence)) The <strong>Hilbert</strong>-adjoint operator T ∗ of T<br />

exist, is unique and is a bounded linear operator with norm<br />

Proof.<br />

C<strong>on</strong>sider<br />

T ∗ = T. (3.19)<br />

h(y, x) = 〈y, Tx〉. (3.20)

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

Saved successfully!

Ooh no, something went wrong!