Lecture 29 - More on Orthonormality

Let's look at an example. Consider:

L={...,e−2it,e−it,e0,eit,e2it,...}

We claim that this is an orthonormal list of vectors in the space of continuous complex-valued functions with domain R, equipped with the inner product:

⟨f,g⟩=12π∫02πf(t)g(t)―dt

Note that this is an inner product, which we could verify with the 5 properties of an inner product. Notice that it's interesting that this list is infinite, while being orthonormal. Notice then that:

eiθ=cos⁡(θ)+isin⁡(θ)⇒eiθ―=cos⁡(θ)−isin⁡(θ)=cos⁡(−θ)+isin⁡(−θ)=e−iθ

We prove both of these.

\begin{proof}
We first show that any u,v∈L. Notice that then u=emit and v=enit for some m,n∈Z. Notice if m≠n then u≠v so we expect ⟨u,v⟩=0:

⟨u,v⟩=12π∫02πemitenit―dt=12π∫02πemite−nitdt=12π∫02πe(m−n)itdt

Notice that m≠n so then m−n≠0 so then:

⟨u,v⟩=12πe(m−n)it(m−n)i|02π=0

by plugging in. If instead m=n then m−n=0 so then:

⟨u,v⟩=12π∫02π1dt=2π2π=1

as we expected.
\end{proof}

Graham-Schmidt Process

Suppose e1,...,en is an orthonormal basis for inner product space V. Let v∈V. Thus:

v=α1e1+⋯+αnen

for all αi∈F. What if we wanted to know that all the α's are? Normally we'd row reduce, but when you deal with an orthonormal basis, you can calculate these directly! We'll make a formula for them.

Take the inner product of both sides of the original equation with one ei (it doesn't matter), then:

⟨v,ei⟩=⟨α1e1+⋯+αnen,ei⟩=α1⟨e1,ei⟩+⋯+αn⟨en,ei⟩=αi⟨ei,ei⟩(all other prods are orthogonal)=αi

So in any inner product space have some orthonormal basis (ONB) e1,...,en, any vector V can be written uniquely as:

v=⟨v,e1⟩e1+⋯+⟨v,en⟩en

Suppose further that I have U=span(e1,...,ei). Since:

v=⟨v,e1⟩e1+⋯+⟨v,ei⟩ei⏟∈U+⟨v,ei+1⟩ei+1+⋯+⟨v,en⟩en⏟orthogonal to all u∈U$$It′seasytoshowthefirstunderbrace.Forthesecondone,noticethatallthe$⟨v,ei+1⟩$andonwardsneedtobe0,henceshowingthisproperty.But$U$hereisaninterestingwaytoorthoganlizeaspace!>[!definition]Projectionof$v$onto$u$.>Toprojectsome$v∈V$onto$u∈U$:>

P_u(v) = \langle v, e_1 \rangle e_1 + \dots + \langle v, e_i \rangle e_i

Gram Schmidt Process

The goal is to start with a basis for V, namely v1,...,vn, and find a basis e1,...,en that's orthonormal, such that span(v1,...,vi)=span(e1,...,ei) (we want to build the vectors up one at a time).

Gram Schmidt Algorithm

Given v1,...,vn. We want span(v1)=span(e1), so we need e1 to be a scalar multiple of v1, while being unit length. Hence:

  1. e1=v1‖v1‖ (note ‖v1‖≠0 since v1 is in a basis list for V).

Then suppose we already have e1,...,ei−1 already with e1,...,ei−1 are orthonormal and span(e1,...,ei−1)=span(v1,...,vi−1). We want:

Where U=span(e1,...,ei−1). Then the next vector we want is:

ei=vi−Pu(vi)‖vi−Pu(vi)‖
Note

You can just normalize all of your vectors at the very end, rather than during the process. You can just get non-normal length ei′'s, then normalize all once at the very end.

Notice that ‖vi−Pu(v)‖≠0 since if it was equal then vi∈span(v1,...,vi−1) which contradicts it composing a basis of the other vectors. Clearly ei then is unit length.

Further, ei is orthogonal to e1,...,ei−1.

Lastly, span(e1,...,ei)=span(v1,...,vi) since we knew the previous span of i−1 is true, and we get vi spanned from the ei equation to show the new list spans the v1,...,vi list.

You continue this process up till the list terminates. Then you have your orthonormal basis e1,...,en.

Consequences of Gram Schmidt

Notice that all that we require is that v1,...,vn is our basis, or namely dim(V)=n. Hence:

  1. Every finite dimensional product space has an orthonormal has an orthonormal basis.
  2. Suppose T∈L(V), and there is a basis for V via v1,...,vn such that M(T,βv) is UT. Then there exists an orthonormal basis e1,...,en for which M(T,βe) is UT.
  3. Every operator T∈L(V) where dim(V) is a complex inner product space has an UT matrix representation with respect to an orthonormal basis (combining the two above)

An Example

Take v1=(1,1) and v2=(3,1). We know these aren't colinear vectors, so clearly they span R2. So v1,v2 is a valid basis.

To use Gram Schmidt, scale v1 to a unit size to e1=(2−1/2,2−1/2). Then take v2 and subtract the projection of it onto u=e1. Namely:

e2=(3,1)−⟨v,e1⟩e1‖...‖=[22−22]