Search CTRL + K

Lecture 11 - Riesz Representation Theorem and Adjoints

Theorem (*)

If H is a Hilbert space, and T∈B(H), then ∃!T∗∈B(H) the adjoint of T such that:

⟨Tu,v⟩=⟨u,T∗v⟩

In addition, (T∗)∗=T and ||T∗||=||T||.

For the proof we need Riesz Representation Theorem which establishes a connection between Hilbert space and it's continuous dual space.

Definition

For a topological vector space V, its continuous dual space or topological dual space or just dual space V∗ is defined as the space of all continuous linear functional:

φ:V⟶R( or C)
Theorem

(Riesz Representation Theorem) Let H be a Hilbert space, whose inner product ⟨.,.⟩ is linear in its first argument and anti linear in its second argument. For every continuous linear functional φ∈H∗, ∃!fφ∈H called the Riesz representation of φ such that:

φ(x)=⟨x,fφ⟩,∀x∈H

Furthermore ||fφ||H=||φ||H∗, and fφ is the unique vector fφ∈Ker(φ)⊥ with,

φ(fφ)=||φ||2

Now we prove the first theorem (∗).

Proof

Fix v∈H and let:

l(u)=⟨Tu,v⟩

l is a linear operator on H, and ||l(u)||=|⟨Tu,v⟩|≤||Tu|| ||v||≤||T|| ||u|| ||v||. Therefore l∈H∗ with

||l||≤||T|| ||v||

By the Riesz representation theorem, ∃!v′∈H such that

l(u)=⟨u,v′⟩

We define T∗v=v′ so that:

T∗:H⟶H

and equivalently ⟨Tu,v⟩=⟨u,T∗v⟩.

Proposition

T∗ is linear.

Proof

For v1,v2,u∈H and c1,c2 scalars we have:

⟨u,T∗(c1v1+c2v2)⟩=⟨Tu,c1v2+c2v2⟩=c¯1⟨Tu,v1⟩+c¯2⟨Tu,v2⟩=c¯1⟨u,T∗v1⟩+c¯2⟨u,T∗v2⟩=⟨u,c1T∗v1+c2T∗v2⟩

Since u is arbitrary we have shown that T∗ is linear.

Proposition

T∗ is bounded

Proof

||T∗||=||l||≤||T|| ||v||

Proposition

T∗ is unique

Proof

Assume there exists S∈B(H) such that:

⟨u,T∗v⟩=⟨u,Sv⟩

Then we obtain that:

⟨u,T∗v−Sv⟩=0,∀u∈H

This implies T∗v=Sv for all v∈H, thus T∗=S.

Proposition

(T∗)∗=T

Proof

As T∗∈B(H), it also has an adjoint:

T∗∗:=(T∗)∗

satisfying

⟨T∗u,v⟩=⟨u,T∗∗v⟩,∀u,vH

But:

⟨T∗u,v⟩=⟨v,T∗u⟩―=⟨Tu,v⟩―=⟨v,Tu⟩

Thus we must have T∗∗=T. Moreover since:

||T||=||T∗∗||≤||T∗||

Thus ||T||=||T∗||.

Special Cases

Definition

If T∈B(H),

  1. If T∗=T, we say that T is self adjoint.
  2. If T∗=−T, we say that T is skew adjoint.
  3. If T∗=T−1 we say that T is unitary.
Proposition

If S,T∈B(H), then ST∈B(H) and:

(ST)∗=T∗S∗

If T−1∈B(H), then (T∗)−1∈B(H) and

(T−1)∗=(T∗)−1

Proof is left as an exercise to the readers.

Example

H=Cn with Tu=Au where A is an n×n matrix. We know ⟨Tu,v⟩=⟨Au,v⟩=⟨u,A∗v⟩. A∗ is the conjugate transpose matrix of A. By uniqueness T∗v=A∗v. T is obviously self-adjoint if A∗=A (if so A is also said to be a Hermitian matrix, or symmetric if A is real.)

Example

Tu(x)=a(x)u(x) on L2(Ω) where a∈L∞(Ω), then:

⟨Tu,v⟩=∫Ωa(x)u(x)v(x)―dx=∫Ωu(x)a(x)―v(x)―dx

Thus T∗v(x)=a(x)―v(x)
T is:

  • Self adjoint if a is real valued.
  • Skew adjoint if a is purely imaginary.
  • Unitary if |a|=1.
Example

Tu(x)=∫ΩK(x,y)u(y)dy∈L2(Ω)

with K∈L2(Ω×Ω). T is bounded.

⟨Tu,v⟩=∫Ω(∫ΩK(x,y)u(y)dy)v(x)―dx=∫Ωu(y)(∫ΩK(x,y)―v(x)dx―)dy

Thus T∗v=∫ΩK(x,y)―v(x)dx.
(Fubini is justified as K(x,y)u(y)v(x)∈L1(Ω×Ω))

  • T will be self adjoint if K is real-valued and K(x,y)=K(y,x).