Chapter 5 extra note 3

Selected lecture notes

orthogonal projection
Gram-Schmidt method

Orthogonal projection

Definition:
Let

EV be a vector subspace and
uV
be a vector, then
u
is orthogonal to
E
if
u,v=0
for all
vE
, and we write denoted by
uE
.

Lemma:
Let

E=span{v1,,vn}, then
uE
if and only if
uvk
for all
k
.

Definition:
Let

E,FV be vector subspaces, then
EF
if
u,v=0
for all
uE
and
vF
.

Definition:
The orthogonal projection of a vector

u on a vector subspace
E
is a vector
w
satisfies

  1. wE
    ;
  2. (uw)E
    .

Theorem:
Let

w be the orthogonal projection of
u
, then
uwuv,vE,

and the equality holds if
v=w
.

  • Proof:

    Given

    vE,
    uv=(uw)+(wv).

    Since
    w,vE
    , we have
    (wv)E
    .
    Since
    w
    is the orthogonal projection of
    u
    , we have
    (uw)E
    , and hence
    (uw)(wv)
    .

    By Pythagorean theorem, we obtain

    uv2=uw2+wv2.
    Therefore
    uw2uv2,

    and the equality holds if
    wv2=0
    , which means
    v=w
    .

Remarks:
The Theorem ensures the uniqueness of the projection, and therefore we can denote the orthogonal projection of a vector

u on a vector subspace
E
by
PEu
.

  • Proof of the uniqueness:

    Suppose there exists

    w2 that is also an orthogonal projection of
    u
    on
    E
    . That is,
    w2E
    and
    (uw2)E
    .

    Then, since

    w2E, according to the above theorem we have
    uwuw2.

    Similarly,
    w2E
    and
    (uw2)E
    implies
    uw2uv,vE,

    so we must have
    uw2uw.

    Therefore,
    uw2=uw
    , and, based on the Theorem again,
    w=w2
    .

Proposition:
Let

{v1,,vn} be an orthogonal basis of a vector subspace
E
, then, given
uV
,
PEu=k=1nu,vkvk,vkvk.

  • Proof:
    1. PEu
      is a linear combination of
      vk
      's, so
      PEuE
      .

    uw,vj=u,vjw,vj.
    We also have, since
    vk
    's are orthogonal,
    w,vj=PEu,vj=u,vjvj,vjvj,vj=(u,vjvj,vj)vj,vj=u,vj.

    Therefore,
    uw,vj=0
    for all
    j
    , and we have
    (uw)E
    .

Remarks:
The Proposition ensures the existence of the projection.

Gram-Schmidt method

Given

S={u1,,un} be a linearly independent set. We can use Gram-Schmidt process to generate an orthogonal set
β={v1,,vn}
such that
span{β}=span{S}
.

Gram-Schmidt process (the basic idea):

  1. v1=u1
    ,
    E1=span{v1}
    .
  2. v2=u2PE1u2
    ,
    E2=span{v1,v2}
    .
  3. v3=u3PE2u3
    ,
    E3=span{v1,v2,v3}
    .

Gram-Schmidt process (algorithm):

v1=u1;v2=u2u2,v1v1,v1v1;v3=u3u3,v1v1,v1v1u3,v2v2,v2v2;