proof of Gram-Schmidt orthogonalization procedure
Note that, while we state the following as a theorem for the sake of logical completeness and to establish notation, our definition of Gram-Schmidt orthogonalization
is wholly equivalent
to that given in the defining entry.
Theorem.
(Gram-Schmidt Orthogonalization)
Let {uk}nk=1 be a basis for an inner product space V with inner product
<,>. Define v1=u1∣∣u1∣∣ and {mk}nk=2 recursively by
𝐦𝐤=𝐮𝐤-<𝐮𝐤,𝐯𝟏>𝐯𝟏-<𝐮𝐤,𝐯𝟐>𝐯𝟐-…-<𝐮𝐤,𝐯𝐤-𝟏>𝐯𝐤-𝟏, | (1) |
where vk=mk∣∣mk∣∣ for 2≤k≤n. Then {vk}nk=1 is an orthonormal basis for V.
Proof.
We proceed by induction on n. In the case n=1, we suppose
{𝐮𝐤}nk=1={𝐮𝐤}1k=1=𝐮𝟏 is a basis for the inner product space V. Letting 𝐯𝟏=𝐮𝟏∣∣𝐮𝟏∣∣, it is clear that 𝐯𝟏∈Span(𝐮𝟏), whence it follows that Span(𝐯𝟏)=Span(𝐮𝟏)=V. Thus 𝐯𝟏 is an orthonormal basis for V, and the result holds for n=1. Now let n≥1∈ℕ, and suppose the result holds for arbitrary n. Let {𝐮𝐤}n+1k=1 be a basis for an inner product space V. By the inductive hypothesis we may use {𝐮𝐤}nk=1 to construct an orthonormal set
of vectors {𝐯𝐤}nk=1 such that Span({𝐯𝐤}nk=1)=Span({𝐮𝐤}nk=1). In accordance with the procedure outlined in the statement of the theorem, let 𝐦𝐧+𝟏 be defined as
𝐮𝐧+𝟏-<𝐮𝐧+𝟏,𝐯𝟏>𝐯𝟏-<𝐮𝐧+𝟏,𝐯𝟐>𝐯𝟐-…-<𝐮𝐧+𝟏,𝐯𝐧>𝐯𝐧=𝐮𝐧+𝟏-n∑i=1<𝐮𝐧+𝟏,𝐯𝐢>𝐯𝐢. |
First we show that the vectors 𝐯𝟏,𝐯𝟐,…,𝐯𝐧,𝐦𝐧+𝟏 are mutually orthogonal.
Consider the inner product of
𝐦𝐧+𝟏 with 𝐯𝐣 for 1≤j≤n. By construction, we have
<𝐦𝐧+𝟏,𝐯𝐣≥<𝐮𝐧+𝟏-n∑i=1<𝐮𝐧+𝟏,𝐯𝐢>𝐯𝐢,𝐯𝐣≥<𝐮𝐧+𝟏,𝐯𝐣>-<n∑i=1<𝐮𝐧+𝟏,𝐯𝐢>𝐯𝐢,𝐯𝐣>. |
Now since {𝐯𝐤}nk=1 is an orthonormal set of vectors, whence <𝐯𝐢,𝐯𝐣≥δij, each term in the summation on the right-hand side of the preceding equation will vanish except for the term where i=j. Thus by this and the preceding equation, we have
<𝐦𝐧+𝟏,𝐯𝐣≥<𝐮𝐧+𝟏,𝐯𝐣>-<n∑i=1<𝐮𝐧+𝟏,𝐯𝐢>𝐯𝐢,𝐯𝐣≥<𝐮𝐧+𝟏,𝐯𝐣>-≪𝐮𝐧+𝟏,𝐯𝐣>𝐯𝐣,𝐯𝐣>=<𝐮𝐧+𝟏,𝐯𝐣>-<𝐮𝐧+𝟏,𝐯𝐣><𝐯𝐣,𝐯𝐣≥<𝐮𝐧+𝟏,𝐯𝐣>-<𝐮𝐧+𝟏,𝐯𝐣≥0. |
Thus 𝐦𝐧+𝟏 is orthogonal to 𝐯𝐣 for 1≤j≤n, so we may take 𝐯𝐧+𝟏=𝐦𝐧+𝟏∣∣𝐦𝐧+𝟏∣∣ to have {𝐯𝐤}n+1k=1 an orthonormal set of vectors. Finally we show that {𝐯𝐤}n+1k=1 is a basis for V.
By construction, each 𝐯𝐤 is a linear combination of the vectors {𝐮𝐤}n+1k=1, so we have n+1 orthogonal, hence linearly independent
vectors in the n+1 dimensional space V, from which it follows that {𝐯𝐤}n+1k=1 is a basis for V. Thus the result holds for n+1, and by the principle of induction, for all n.
∎
Title | proof of Gram-Schmidt orthogonalization procedure |
Canonical name | ProofOfGramSchmidtOrthogonalizationProcedure |
Date of creation | 2013-03-22 16:27:17 |
Last modified on | 2013-03-22 16:27:17 |
Owner | rspuzio (6075) |
Last modified by | rspuzio (6075) |
Numerical id | 11 |
Author | rspuzio (6075) |
Entry type | Proof |
Classification | msc 65F25 |
Synonym | Gram-Schmidt |
Synonym | orthogonalization |
Related topic | GramSchmidtOrthogonalization |
Related topic | ExampleOfGramSchmidtOrthogonalization |
Related topic | InnerProductSpace |
Related topic | InnerProduct |
Related topic | QRDecomposition |
Related topic | NormedVectorSpace |
Related topic | Orthogonal |
Related topic | OrthogonalVectors |
Related topic | Basis |
Related topic | Span |
Related topic | LinearIndependence |
Related topic | Orthonormal |
Related topic | OrthonormalBasis |
Defines | Gram-Schmidt orthogonalization |