Notes on Complex Analysis
Export PDFGitHub

§10.1.1 The Gram–Schmidt Process

10.1.1 The Gram–Schmidt Process

The Gram–Schmidt process replaces a finite linearly independent set with an orthonormal set having the same span. This makes it possible to choose coordinates that respect the geometry induced by an inner product.

Definition 10.1.1.1 (Basis and Dimension).

Let 𝑉 be a vector space. A basis of 𝑉 is a linearly independent set that spans 𝑉. The vector space 𝑉 is finite-dimensional iff it is spanned by a finite set. If a basis of 𝑉 contains 𝑛 vectors, then 𝑉 is said to be 𝑛-dimensional and we write dim𝑉=𝑛.

We can verify that the dimensionality is unique to a vector space and independent of basis:

Proposition 10.1.1.2.

Every finite-dimensional vector space has a finite basis. Moreover, any two bases of a finite-dimensional vector space contain the same number of vectors, and so dim𝑉 is well-defined.
Proof.

Let 𝑆={𝑣𝑘}𝑘=1𝑚 span 𝑉. If 𝑆 is linearly independent, then it is already a basis. Otherwise, one of its vectors is a linear combination of the others; removing that vector does not change the span. If the remaining set is still linearly dependent, repeat the same step. Since 𝑆 is finite, the process will end with a linearly independent set that still spans 𝑉, a basis.

Now let 𝑆𝑚={𝑣𝑗}𝑗=1𝑚 and 𝑆𝑛={𝑤𝑘}𝑘=1𝑛 be two bases such that 𝑚≤𝑛. Let 𝑣1=∑𝑘=1𝑛𝑐𝑘𝑤𝑘. Then at least one of these terms is nonzero, namely 𝑐𝑘1𝑤𝑘1. Moreover, since

𝑤𝑘1=1𝑐𝑘1(𝑣1−∑𝑘≠𝑘1𝑐𝑘𝑤𝑘),(10.1.1.1)

we obtain a new basis {𝑤𝑘}𝑘=1𝑘≠𝑘1𝑛∪{𝑣1}. It is a basis because any vector in 𝑉 can be written as a linear combination of these vectors by (10.1.1.1)(10.1.1.4)(10.1.1.1); and linear independence is satisfied, because if 𝑑1𝑣1+∑𝑘≠𝑘1𝑑𝑘𝑤𝑘=0, then a substitution for 𝑣1 forces all coefficients to 0.

Now inductively assume that for a 𝑗∈ℕ<𝑚, the set {𝑤𝑘}𝑘∈ℕ≤𝑛∖{𝑘𝑖}𝑖≤𝑗∪{𝑣𝑘}𝑘=1𝑗 is a basis for 𝑉. Let 𝑣𝑗+1=∑𝑘=1𝑗𝑐𝑘𝑣𝑘+∑𝑘∉{𝑘𝑖}𝑖=1𝑗𝑐𝑘𝑤𝑘. Then at least one of these terms, excluding all the multiples of {𝑣𝑘}, is nonzero, namely 𝑐𝑘𝑗+1𝑤𝑘𝑗+1 (as otherwise, 𝑣𝑗+1 is a linear combination of {𝑣𝑘}, contradicting independence of 𝑆𝑚).

Therefore, replacing 𝑤𝑘𝑗+1 with 𝑣𝑗+1 in {𝑤𝑘}𝑘∈ℕ≤𝑛∖{𝑘𝑖}𝑖≤𝑗∪{𝑣𝑘}𝑘=1𝑗, giving {𝑤𝑘}𝑘∈ℕ≤𝑛∖{𝑘𝑖}𝑖≤𝑗+1∪{𝑣𝑘}𝑘=1𝑗+1, is a basis (by the exact same argument as in the base case).

By mathematical induction, we can then transform 𝑆𝑛 into a basis of 𝑛 elements, including all elements of 𝑆𝑚. Continue to denote the transformed basis by 𝑆𝑛. Then any nonzero vector 𝑣 in 𝑆𝑛∖𝑆𝑚 can be written as a linear combination of elements in 𝑆𝑚, which violates the linear independence of vectors in 𝑆𝑛, thus no vector exists in 𝑆𝑛∖𝑆𝑚, and 𝑛=𝑚. The case 𝑛≤𝑚 follows symmetrically. ⁠□

Remark.

More generally, every vector space has a basis, including infinite-dimensional vector spaces. The general statement for more general vector spaces is equivalent to the Axiom of Choice and equivalent to Zorn’s lemma. Only the elementary finite-dimensional result above is needed for our purposes here.

Definition 10.1.1.3.

Let 𝑉 be an inner product space. A finite set {𝑒𝑘}𝑘=1𝑛⊆𝑉 is orthogonal iff

⟨𝑒𝑗,𝑒𝑘⟩=0whenever𝑗≠𝑘.

It is orthonormal iff

⟨𝑒𝑗,𝑒𝑘⟩=𝛿𝑗𝑘={1if𝑗=𝑘0if𝑗≠𝑘.
Equivalently, an orthonormal set is an orthogonal set in which ‖𝑒𝑘‖=1 for every 𝑘.

Definition 10.1.1.4 (Orthonormal Basis).

An orthonormal basis of a finite-dimensional inner product space 𝑉 is a basis of 𝑉 that is also an orthonormal set.

If {𝑒𝑘}𝑘=1𝑛 is an orthonormal basis of 𝑉, then every 𝑣∈𝑉 has the coordinate representation

𝑣=∑𝑘=1𝑛⟨𝑣,𝑒𝑘⟩𝑒𝑘.(10.1.1.2)

Indeed, writing 𝑣=∑𝑘=1𝑛𝑎𝑘𝑒𝑘 and taking the inner product with 𝑒𝑗 gives

⟨𝑣,𝑒𝑗⟩=∑𝑘=1𝑛𝑎𝑘⟨𝑒𝑘,𝑒𝑗⟩=𝑎𝑗.

Theorem 10.1.1.5 (Gram–Schmidt Orthonormalization).

Let {𝑣𝑘}𝑘=1𝑛 be a linearly independent set in an inner product space 𝑉. Define recursively

𝑢1=𝑣1,𝑒1=𝑢1‖𝑢1‖,𝑢𝑘=𝑣𝑘−∑𝑗=1𝑘−1⟨𝑣𝑘,𝑒𝑗⟩𝑒𝑗,𝑒𝑘=𝑢𝑘‖𝑢𝑘‖.(2≤𝑘≤𝑛)

Then every 𝑢𝑘 is nonzero, {𝑒𝑘}𝑘=1𝑛 is orthonormal, and

span{𝑒𝑗}𝑗=1𝑘=span{𝑣𝑗}𝑗=1𝑘∀1≤𝑘≤𝑛.
Proof.

We proceed by induction on 𝑘. Since 𝑣1≠0, 𝑢1≠0, ‖𝑒1‖=1, and span{𝑒1}=span{𝑣1}.

Suppose that {𝑒𝑗}𝑗=1𝑘−1 is orthonormal and that

span{𝑒1,…,𝑒𝑘−1}=span{𝑣1,…,𝑣𝑘−1}.

If 𝑢𝑘=0, then

𝑣𝑘=∑𝑗=1𝑘−1⟨𝑣𝑘,𝑒𝑗⟩𝑒𝑗∈span{𝑣1,…,𝑣𝑘−1},

contradicting the linear independence of {𝑣𝑗}𝑗=1𝑘. Hence 𝑢𝑘≠0, so 𝑒𝑘 is well-defined and ‖𝑒𝑘‖=1.

For every ℓ<𝑘, orthonormality gives

⟨𝑢𝑘,𝑒ℓ⟩=⟨𝑣𝑘,𝑒ℓ⟩−∑𝑗=1𝑘−1⟨𝑣𝑘,𝑒𝑗⟩⟨𝑒𝑗,𝑒ℓ⟩=⟨𝑣𝑘,𝑒ℓ⟩−⟨𝑣𝑘,𝑒ℓ⟩=0.

Therefore 𝑒𝑘 is orthogonal to 𝑒1,…,𝑒𝑘−1, and the enlarged set {𝑒𝑗}𝑗=1𝑘 is orthonormal. Finally, 𝑢𝑘 is obtained from 𝑣𝑘 by subtracting an element of span{𝑒1,…,𝑒𝑘−1}, while

𝑣𝑘=𝑢𝑘+∑𝑗=1𝑘−1⟨𝑣𝑘,𝑒𝑗⟩𝑒𝑗.

Thus adjoining either 𝑢𝑘 or 𝑣𝑘 to the preceding span gives the same space, and

span{𝑒𝑗}𝑗=1𝑘=span{𝑣𝑗}𝑗=1𝑘

by induction. ⁠□

The recursive construction in Theorem 10.1.1.5Theorem 10.1.1.5Theorem 10.1.1.5 is called the Gram–Schmidt process. At each stage, the sum

∑𝑗=1𝑘−1⟨𝑣𝑘,𝑒𝑗⟩𝑒𝑗

is the component of 𝑣𝑘 in all the previously constructed directions; and subtracting it leaves the nonzero vector 𝑢𝑘 orthogonal to all preceding directions.

Corollary 10.1.1.5.1.

Every finite-dimensional inner product space has an orthonormal basis.
Proof.Choose any basis {𝑣𝑘}𝑘=1𝑛 and apply Theorem 10.1.1.5Theorem 10.1.1.5Theorem 10.1.1.5. The resulting orthonormal set has the same span as the original basis. ⁠□

(Note that when we begin considering countably infinite orthonormal systems in the proceeding section, the same process of Gram–Schmidt is still valid, the reader can independently verify this claim.)