A Motivation of Adjoint Operators on Inner Product Spaces

A Motivation of Adjoint Operators on Inner Product Spaces

A motivation of adjoint operators

In the real inner product space Rn with the standard inner product v,w=[a1a2an],[b1b2bn]=a1b1+a2b2++anbn=wtv,

we have Av,w=v,Atw.

However, in the complex inner product space Cn with the standard inner product v,w=[w1w2wn],[z1z2zn]=w1¯z1+w2¯z2++wn¯zn=¯wtv,

we DO NOT have Av,w=v,Atw.
Instead, we have Av,w=v,¯Atw.
Recall that we define the conjugate transpose or adjoint A of a matrix A as A=¯At. Hence, we have Av,w=v,Aw.
This gives us a motivation of defining adjoint of matrices. We want to define a linear operator T on a finite dimensional inner product space V which satisfies that T(v),w=v,T(w)

In most of standard textbooks, like Friedberg, Insel and Spence's Linear Algebra, they gave a lemma first (Theorem 6.8, Riesz Representation Theorem), then proved the existence of T by using the lemma (Theorem 6.9). However, the lemma seems to be clever for novices.

I am going to define adjoint of operators through adjoint of matrices here. A brief version see Treil's Linear Algebra Done Wrong (Section 5.5).

Let V be a finite dimensional inner product space V and let T be a linear operator on V. Given an "orthonormal" basis β for V, (the existence of such basis follows immediately from the Gram-Schmidt process,) we have the following commutative diagram VTVϕβϕβFn[T]βFn

where ϕβ is the standard representation of V with respect to β and [T]β is the matrix representation of T in the ordered basis β. The definitions and properties of ϕβ and [T]β see Chapter 2 in Friedberg, Insel and Spence's Linear Algebra.

Note that we have (Theorem 2.14) T(v)=ϕ1β([T]βϕβ(v)).

Imitating this, let us define a mapping T:VV by T(v)=ϕ1β([T]βϕβ(v)),
where [T]β is the conjugate transpose of [T]β.

Obviously, T is a linear operator. We show that T(v),w=v,T(w)

We need a key lemma (without proof): If β is an orthonormal basis for V, then v,w=[v]β,[w]β=ϕβ(v),ϕβ(w).

Therefore, v,T(w)=v,ϕ1β([T]βϕβ(w))Lemma=ϕβ(v),[T]βϕβ(w)=[T]βϕβ(v),ϕβ(w)Theorem 2.14=ϕβ(T(v)),ϕβ(w)Lemma=T(v),w.

Remark. We defined T by choosing a specific orthonormal basis. But the definition of T is independent on the choice of the orthonormal basis since [v]β,[w]β=[v]α,[w]α

for any two orthonormal bases.

Proof: Suppose that α={v1,v2,...,vn} and β={w1,w2,...,wn} are two orthonormal bases for Cn. Then [v]β=[I]βα[v]α. Note that ([I]βα)ij=vj,wi

and ([I]βα)ij=¯([I]βα)ji=¯vi,wj=wj,vi=([I]αβ)ij=([I]βα)1ij
Therefore, [v]β,[w]β=[I]βα[v]α,[I]βα[w]α=[v]α,([I]βα)[I]βα[w]α=[v]α,[w]α

As I mentioned before, Theorem 6.8 and Theorem 6.9 are tricky. But they appear in many exams. So you still have to know how to prove them. I come up with a method to help you remember these theorems.

We will need a very basic but important theorem (Theorem 6.5).

Theorem 6.5. Let V be a nonzero finite-dimensional inner product space. Then V has an orthonormal basis β. Furthermore, if β={v1,v2,...,vn} and xV}, then x=ni=1x,vivi.

Now, let us discuss Theorem 6.8 and Theorem 6.9.

Theorem 6.8. Let V be a finite-dimensional inner product space over F, and let g:VF be a linear transformation. Then there exists a unique vector yV such that g(x)=x,y for all xV.

I am used to using the following identities to remind me the form of y. Let {v1,v2,...,vn} be an orthonormal basis for Fn. x,y=x,v1v1++x,vnvn,y,v1v1++y,vnvn=x,v1¯y,v1++x,vn¯y,vng(x)=g(x,v1v1++x,vnvn)=x,v1g(v1)++x,vng(vn)

Compare the terms. To get g(x)=x,y, we must have g(vi)=¯y,vi. Equivalently, y,vi=¯g(vi). Therefore, y=y,v1v1++y,vnvn=¯g(v1)v1++¯g(vn)vn
I have the following diagram. VVg=,yFF

Theorem 6.9. Let V be a finite-dimensional inner product space, and let T be a linear operator on V. Then there exists a unique function T:VV such that T(x),y=x,T(y) for all x,yV. Furthermore, T is linear.

For applying the lemma, we have to construct a linear functional first and define T(v) to be the y induced by the lemma. VV?=,yFF

How to define the linear functional? Let us observate that ,y=,T(v)=T(),v. Thus, T(),v is the desired linear functional. That is, given vV, we have a linear functional T(),v:VF. By the lemma, which induces a unique vector y. Then define T by T(v)=y. VVT(),v=,yFF

No comments:

Post a Comment