The prior subsection suggests
that projecting onto the line spanned by
decomposes a vector into two parts
|
|
that are orthogonal and so are "not interacting".
We will now develop that suggestion.
Definition 2.1
- Vectors are mutually orthogonal when any two are orthogonal: if then the dot product is zero.
Theorem 2.2
- If the vectors in a set are mutually orthogonal and nonzero then that set is linearly independent.
Proof:
Consider a linear relationship
.
If then taking the dot product of
with both sides of the equation
shows, since is nonzero, that is zero.
Corollary 2.3
- If the vectors in a size subset of a dimensional space are mutually orthogonal and nonzero then that set is a basis for the space.
Proof:
Any linearly independent size subset of a dimensional space is a basis.
Of course, the converse of Corollary 2.3
does not hold— not every basis of every subspace
of is made of mutually orthogonal vectors.
However, we can get the partial converse
that for every subspace of there is at least one basis
consisting of mutually orthogonal vectors.
Example 2.4:
The members and of this basis for
are not orthogonal.
|
|
However, we can derive from
a new basis for the same space that does have mutually orthogonal members.
For the first member of the new basis we simply use .
For the second member of the new basis,
we take away from its part in the direction of
,
|
|
which leaves the part, pictured above, of that is orthogonal to (it is orthogonal by the definition of the projection onto the span of ). Note that, by the corollary, is a basis for .
Definition 2.5:
- An orthogonal basis for a vector space is a basis of mutually orthogonal vectors.
Example 2.6:
To turn this basis for
into an orthogonal basis, we take the first vector as it is given.
We get by starting with the given second vector
and
subtracting away the part of it in the direction of .
Finally, we get
by taking the third given vector and subtracting the part of it
in the direction of , and also the part
of it in the direction of .
Again the corollary gives that
is a basis for the space.
The next result verifies that
the process used in those examples works with any basis for any
subspace of an
(we are restricted to only because we have not given a
definition of orthogonality for other vector spaces).
Theorem 2.7 (Gram-Schmidt orthogonalization):
- If
is a basis for a subspace of then, where
the 's form an orthogonal basis for the same subspace.
Proof:
We will use induction to check that each is nonzero,
is in the span of
and is orthogonal to all preceding vectors:
.
With those, and with
Corollary 2.3, we will have that
is a basis for the same space as
.
We shall cover the cases up to , which give the
sense of the argument.
Completing the details is Problem 15.
The case is trivial— setting equal to
makes it a nonzero vector since is a member of a basis,
it is obviously in the desired span,
and the "orthogonal to all preceding vectors" condition is vacuously met.
For the case, expand the definition of .
This expansion shows that is nonzero or else this
would be a non-trivial linear dependence among the 's
(it is nontrivial because the coefficient of is )
and also shows that
is in the desired span.
Finally, is orthogonal to the only preceding vector
because this projection is orthogonal.
The case is the same as the case except for one detail.
As in the case, expanding the definition
shows that is nonzero and is in the span.
A calculation shows that
is orthogonal to the preceding vector .
(Here's the difference from the case— the second line has
two kinds of terms.
The first term is zero because this projection is orthogonal, as in the
case.
The second term is zero because is orthogonal
to and so is orthogonal to any vector
in the line spanned by .)
The check that is also
orthogonal to the other preceding vector is similar.
Beyond having the vectors in the basis be orthogonal, we can do more; we can arrange for each vector to have length one by dividing each by its own length (we can normalize the lengths).
Example 2.8:
Normalizing the length of each vector in the orthogonal basis of Example 2.6 produces this orthonormal basis.
Besides its intuitive appeal, and its analogy with the
standard basis for , an orthonormal basis also simplifies
some computations.
Licensing
Content obtained and/or adapted from: