章节大纲

  • From lesson 1 in this chapter, we learned about inner products which help us define our notions of length and distance in vector spaces. In this lesson, we are going to revisit that notion of an inner product and talk about spaces which have inner products called inner product spaces.
    ::从本章第1课中,我们学到了内产物,这些内产物帮助我们定义矢量空间的长度和距离概念。 在这个教训中,我们将重新审视内产物的概念,并谈论内产物的内产物空间。


     Recall the definition of an inner product.
    ::回顾内部产品的定义。

    Definition: An inner product in a vector space  V  is a function of two  vectors in the vector space, denoted by  u , v  . Now, the inner product has the following properties:
    ::定义:矢量空间V中的一种内产物是矢量空间中两种矢量的函数,代号为u,v。现在,内产物具有以下特性:

    1. u , v = v , u 2. u + v , w = u , w + v , w 3. c u , v = c u , v 4. u , u 0  and  u , u = 0  if and only if  u = 0
    ::{\fn黑体\fs22\bord1\shad0\3aHBE\4aH00\fscx67\fscy66\2cHFFFFFF\3cH808080}哦! {\fn黑体\fs22\bord1\shad0\3aHBE\4aH00\fscx67\fscy66\2cHFFFFFF\3cH808080}哦! {\fn黑体\fs22\bord1\shad0\3aHBE\4aH00\fscx67\fscy66\2cHFFFFFF\3cH808080}哦! {\fn黑体\fs22\bord1\shad0\3aHBE\4aH00\fscx67\fscy66\2cHFFFFFF\3cH808080}哦!

    Now, we already have examples of inner products in lesson 6.1, so in case you need a refresher go back to that lesson.
    ::现在,我们已经在6.1课中有了内部产品的例子, 所以,如果你需要再补习一下, 回到那个教训。


    Now, because we  have an inner product, we can extend the Gram-Schmidt process to any inner product space. 
    ::现在,因为我们有一个内部产品, 我们可以把Gram-Schmidt工艺 扩展到任何内部产品空间。

    Similarly, we can extend the least squares problem to any inner product space as well as inequalities such as the Cauchy-Schwarz inequality and the triangle inequality.

    Now, let's look at a  two examples of different inner products and inner product spaces and try to apply some of the generalizations of those theorems above.
    Take  P 4  to be the vector space with inner product defined as
    p ( x ) , q ( x ) = p ( 2 ) q ( 2 ) + + p ( 2 ) q ( 2 )
    where the numbers in between are also integers.
    Now, let's list out all of the values in a given polynomial evaluated at those indices in some vector in  R 5  
    So let's say that we want to find an orthonormal basis for the polynomials  { 1 , t , t 2 }  
    1 = [ 1 1 1 1 1 ] , t = [ 2 1 0 1 2 ] , t 2 = [ 4 1 0 1 4 ]
     Looking at this we see that the dot product in  R 5  is the same as this inner product in  P 4  when given the special representation of these vectors.
    Let,  v 1 = [ 1 1 1 1 1 ]  and then
    v 2 = [ 2 1 0 1 2 ]  because we'd end up getting that 
    So now let's try and make the third vector orthogonal to those first two.
    v 3 = ( 4 , 1 , 0 , 1 , 4 ) ( 1 , 1 , 1 , 1 , 1 ) ( 4 , 1 , 0 , 1 , 4 ) ( 1 , 1 , 1 , 1 , 1 ) ( 1 , 1 , 1 , 1 , 1 ) ( 1 , 1 , 1 , 1 , 1 ) ( 2 , 1 , 0 , 1 , 2 ) ( 4 , 1 , 0 , 1 , 4 ) ( 2 , 1 , 0 , 1 , 2 ) ( 2 , 1 , 0 , 1 , 2 ) ( 2 , 1 , 0 , 1 , 2 ) v 3 = ( 4 , 1 , 0 , 1 , 4 ) ( 2 , 2 , 2 , 2 , 2 ) 0 ( 2 , 0 , 1 , 2 ) v 3 = ( 2 , 1 , 2 , 1 , 2 ) v 3 = t 2 2
     
    Thus, normalizing all of these vectors we get that
    v 1 5 , v 2 10 , v 3 14 p 0 ( x ) = 1 5 p 1 ( x ) = t 10 p 2 ( x ) = t 2 2 14
     
    Doing our second example, let's try and find a best approximation applying the least squares method.
    Take the same vector space and that same orthogonal basis that we found  and approximate the  polynomial closest to  q ( x ) = 5 1 2 t 4  that is in that basis.
    Now, we get that
    q ( x ) , p 0 ( x ) = 8 p 0 ( x ) , p 0 ( x ) = 5 q ( x ) , p 1 ( x ) = 0 q ( x ) , p 2 ( x ) = 31 p 2 ( x ) , p 2 ( x ) = 14
    So, in order to find the polynomial closes to this basis we have to take the projection of  
    q ( x )  onto  Span { p 0 ( x ) , p 1 ( x ) , p 2 ( x ) }
    We get that this vector is
    q ( x ) , p 0 ( x ) p 0 ( x ) , p 0 ( x ) p 0 ( x ) + q ( x ) , p 1 ( x ) p 1 ( x ) , p 1 ( x ) p 1 ( x ) + q ( x ) , p 2 ( x ) p 2 ( x ) , p 2 ( x ) p 2 ( x ) 8 5 + 31 14 ( t 2 2 ) 8 5 + 31 t 2 + 62 14 422 155 t 2 70
     
    Now, let's look at a picture of this equation versus  q ( x )  to get

     

     

     


    This video is a review of the rest of the chapter:
    ::本录像回顾本章的其余部分: