10.5. TIETZE EXTENSION THEOREM 271

Proposition 10.5.12 Suppose {v1, · · · ,vk} is an orthonormal set of vectors. Then it islinearly independent.

Proof: Suppose ∑ki=1 civi = 0. Then taking inner products with v j,

0 = (0,v j) = ∑i

ci (vi,v j) = ∑i

ciδ i j = c j.

Since j is arbitrary, this shows the set is linearly independent as claimed. ■It turns out that if X is any subspace of H, then there exists an orthonormal basis for X .

Lemma 10.5.13 Let X be a subspace of dimension n whose basis is {x1, · · · ,xn} . Thenthere exists an orthonormal basis for X , {u1, · · · ,un} which has the property that for eachk ≤ n, span(x1, · · · ,xk) = span(u1, · · · ,uk) .

Proof: Let {x1, · · · ,xn} be a basis for X . Let u1 ≡ x1/ |x1| . Therefore, it followsthat for k = 1, span(u1) = span(x1) and {u1} is an orthonormal set. Now suppose forsome k < n, u1, · · · , uk have been chosen such that (u j,ul) = δ jl and span(x1, · · · ,xk) =span(u1, · · · ,uk). Then define

uk+1 ≡xk+1−∑

kj=1 (xk+1,u j)u j∣∣∣xk+1−∑kj=1 (xk+1,u j)u j

∣∣∣ , (10.13)

where the denominator is not equal to zero because the x j form a basis and so

xk+1 /∈ span(x1, · · · ,xk) = span(u1, · · · ,uk)

Thus by induction,

uk+1 ∈ span(u1, · · · ,uk,xk+1) = span(x1, · · · ,xk,xk+1) .

Also, xk+1 ∈ span(u1, · · · ,uk,uk+1) which is seen easily by solving 10.13 for xk+1 and itfollows

span(x1, · · · ,xk,xk+1) = span(u1, · · · ,uk,uk+1) .

If l ≤ k, then denoting by C the scalar∣∣∣xk+1−∑

kj=1 (xk+1,u j)u j

∣∣∣−1,

(uk+1,ul) =C

((xk+1,ul)−

k

∑j=1

(xk+1,u j)(u j,ul)

)

=C

((xk+1,ul)−

k

∑j=1

(xk+1,u j)δ l j

)=C ((xk+1,ul)− (xk+1,ul)) = 0.

The vectors,{u j}n

j=1 , generated in this way are therefore an orthonormal basis becauseeach vector has unit length. ■

The process by which these vectors were generated is called the Gram Schmidt process.The following corollary is obtained from the above process.

Corollary 10.5.14 Let X be a finite dimensional inner product space of dimension n whosebasis is {u1, · · · ,uk,xk+1, · · · ,xn} . Then if {u1, · · · ,uk} is orthonormal, then the GramSchmidt process applied to the given list of vectors in order leaves {u1, · · · ,uk} unchanged.

10.5. TIETZE EXTENSION THEOREM 271Proposition 10.5.12 Suppose {v1,---,v,} is an orthonormal set of vectors. Then it islinearly independent.Proof: Suppose - civ; = 0. Then taking inner products with w;,(0 ,Vj) = Lai Vi,V;) =) cb); = cj.iSince j is arbitrary, this shows the set is linearly independent as claimed. MfIt turns out that if X is any subspace of H, then there exists an orthonormal basis for X.Lemma 10.5.13 Let X be a subspace of dimension n whose basis is {a@1,-++ ,&n,}. Thenthere exists an orthonormal basis for X, {u,-+- ,Un} which has the property that for eachk <n, span(x ,--+ ,@) = span (u1,--- , Ug).Proof: Let {x1,---,a,} be a basis for X. Let uj = x)/|x1|. Therefore, it followsthat for k = 1, span(w,) = span(a,) and {zw} is an orthonormal set. Now suppose forsome k <n, uy, +++, Ux have been chosen such that (wj,u;) = 6; and span (a1,--- , a) =span (tu,,--- , ug). Then definekx * x ,U;)U;na keel — Lia) (@ey1, Uj) Uj . (10.13)Te 1 — vi (@e41, Uj) Ujwhere the denominator is not equal to zero because the x; form a basis and sotx+1 ¢ span(a1,--- ,X,_) = span (w),--- , Ug)Thus by induction,Uk+1 € span (a1, °° . Uk, Le+1) = span (a1,-- . BK, E41) :Also, #41 € span (w1,+++ , Uz, Ux+1) which is seen easily by solving 10.13 for v,+ and itfollowsspan (a ,--- LK, Le+1) = span (u1,-°- Uk, Uk+1) :-1If / <k, then denoting by C the scalar lees — Yi (a@x41,U;) us|?k(Ux41, UW) o( rx41,t) — Y (@ep1, Uy) ws)j=lke(( L+1,Ul) 2h Tk+1,Uj 13) =C((wx41, U1) — (@e+1,4)) = 9.The vectors, {u iin , generated in this way are therefore an orthonormal basis becauseeach vector has unit length.The process by which these vectors were generated is called the Gram Schmidt process.The following corollary is obtained from the above process.Corollary 10.5.14 Let X be a finite dimensional inner product space of dimension n whosebasis is {uy,+++ ,U,Xk41,°°* Xn}. Then if {uy,---,ug} is orthonormal, then the GramSchmidt process applied to the given list of vectors in order leaves {uj,--- , ux} unchanged.