How to Express the Summation of an Inner Product Space

Multi tool use
Multi tool use

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite












I'm having an issue with the following problem from Ch. 6.1 (Inner Product Spaces and Norms) of Friedberg's Linear Algebra, 4th ed.




$"$Let $v_1 ,v_2 ,...,v_k$ be an orthogonal set in V, and let $a_1 ,a_2 ,...,a_k$ be scalars. Prove that $$||sum_i=1^k a_i v_i||^2 = sum_i=1^k |a_i|^2 ||v_i||^2."$$




My attempt at a solution:



$"$Recall that since $v_1 ,v_2 ,...,v_k$ is orthogonal, any two distinct vectors $v_1 ,v_j in v_1 ,v_2 ,...,v_k$ would form the equality $<v_i ,v_j>=0$. Let us pick a vector $v_iin v_1 ,v_2 ,...,v_k$ such that $<v_i,v_i>neq0$. By the properties $||x||=sqrt<x,x>$ and $overlinesum_ell=1^n x_ell=sum_ell=1^n overlinex_ell$ ('the conjugate of a sum is the sum of the conjugates'), we have $$||sum_i=1^k a_i v_i||^2 =<sum_i=1^k a_i v_i,sum_i=1^k a_i v_i>$$
$$=sum_i=1^k a_i sum_i=1^k overlinea_i <v_i,v_i>.$$ Note that as each $sum_i=1^k a_i ,sum_i=1^k overlinea_i$ simply denotes a scalar, we can use the properties $<cx,y>=c<x,y>$ and $<x,cy>=bar c <x,y>."$




At this point I am basically stuck. If I make the argument... $$sum_i=1^k a_i sum_i=1^k bar a_i=(a_1 + a_2 +...+ a_k)(bar a_1 + bar a_2 +...+bar a_k)$$
$$=(a_1 + a_2 +...+ a_k) overline(a_1 + a_2 +...+ a_k)$$
$$=|a_1 + a_2 +...+ a_k|^2$$
$$=|sum_i=1^k a_i|^2$$
... I get no further, because to the best of my knowledge, $|sum_i=1^k a_i|^2neq sum_i=1^k |a_i|^2$ (because of the triangle inequality). I feel I am probably making a few fatal errors throughout this proof. Could anybody knowledgeable in Linear Algebra please shed some light for me?







share|cite|improve this question

















  • 1




    You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
    – Nik Pronko
    Aug 7 at 17:38











  • @NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
    – greycatbird
    Aug 7 at 17:46










  • This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
    – Nik Pronko
    Aug 7 at 17:53














up vote
5
down vote

favorite












I'm having an issue with the following problem from Ch. 6.1 (Inner Product Spaces and Norms) of Friedberg's Linear Algebra, 4th ed.




$"$Let $v_1 ,v_2 ,...,v_k$ be an orthogonal set in V, and let $a_1 ,a_2 ,...,a_k$ be scalars. Prove that $$||sum_i=1^k a_i v_i||^2 = sum_i=1^k |a_i|^2 ||v_i||^2."$$




My attempt at a solution:



$"$Recall that since $v_1 ,v_2 ,...,v_k$ is orthogonal, any two distinct vectors $v_1 ,v_j in v_1 ,v_2 ,...,v_k$ would form the equality $<v_i ,v_j>=0$. Let us pick a vector $v_iin v_1 ,v_2 ,...,v_k$ such that $<v_i,v_i>neq0$. By the properties $||x||=sqrt<x,x>$ and $overlinesum_ell=1^n x_ell=sum_ell=1^n overlinex_ell$ ('the conjugate of a sum is the sum of the conjugates'), we have $$||sum_i=1^k a_i v_i||^2 =<sum_i=1^k a_i v_i,sum_i=1^k a_i v_i>$$
$$=sum_i=1^k a_i sum_i=1^k overlinea_i <v_i,v_i>.$$ Note that as each $sum_i=1^k a_i ,sum_i=1^k overlinea_i$ simply denotes a scalar, we can use the properties $<cx,y>=c<x,y>$ and $<x,cy>=bar c <x,y>."$




At this point I am basically stuck. If I make the argument... $$sum_i=1^k a_i sum_i=1^k bar a_i=(a_1 + a_2 +...+ a_k)(bar a_1 + bar a_2 +...+bar a_k)$$
$$=(a_1 + a_2 +...+ a_k) overline(a_1 + a_2 +...+ a_k)$$
$$=|a_1 + a_2 +...+ a_k|^2$$
$$=|sum_i=1^k a_i|^2$$
... I get no further, because to the best of my knowledge, $|sum_i=1^k a_i|^2neq sum_i=1^k |a_i|^2$ (because of the triangle inequality). I feel I am probably making a few fatal errors throughout this proof. Could anybody knowledgeable in Linear Algebra please shed some light for me?







share|cite|improve this question

















  • 1




    You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
    – Nik Pronko
    Aug 7 at 17:38











  • @NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
    – greycatbird
    Aug 7 at 17:46










  • This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
    – Nik Pronko
    Aug 7 at 17:53












up vote
5
down vote

favorite









up vote
5
down vote

favorite











I'm having an issue with the following problem from Ch. 6.1 (Inner Product Spaces and Norms) of Friedberg's Linear Algebra, 4th ed.




$"$Let $v_1 ,v_2 ,...,v_k$ be an orthogonal set in V, and let $a_1 ,a_2 ,...,a_k$ be scalars. Prove that $$||sum_i=1^k a_i v_i||^2 = sum_i=1^k |a_i|^2 ||v_i||^2."$$




My attempt at a solution:



$"$Recall that since $v_1 ,v_2 ,...,v_k$ is orthogonal, any two distinct vectors $v_1 ,v_j in v_1 ,v_2 ,...,v_k$ would form the equality $<v_i ,v_j>=0$. Let us pick a vector $v_iin v_1 ,v_2 ,...,v_k$ such that $<v_i,v_i>neq0$. By the properties $||x||=sqrt<x,x>$ and $overlinesum_ell=1^n x_ell=sum_ell=1^n overlinex_ell$ ('the conjugate of a sum is the sum of the conjugates'), we have $$||sum_i=1^k a_i v_i||^2 =<sum_i=1^k a_i v_i,sum_i=1^k a_i v_i>$$
$$=sum_i=1^k a_i sum_i=1^k overlinea_i <v_i,v_i>.$$ Note that as each $sum_i=1^k a_i ,sum_i=1^k overlinea_i$ simply denotes a scalar, we can use the properties $<cx,y>=c<x,y>$ and $<x,cy>=bar c <x,y>."$




At this point I am basically stuck. If I make the argument... $$sum_i=1^k a_i sum_i=1^k bar a_i=(a_1 + a_2 +...+ a_k)(bar a_1 + bar a_2 +...+bar a_k)$$
$$=(a_1 + a_2 +...+ a_k) overline(a_1 + a_2 +...+ a_k)$$
$$=|a_1 + a_2 +...+ a_k|^2$$
$$=|sum_i=1^k a_i|^2$$
... I get no further, because to the best of my knowledge, $|sum_i=1^k a_i|^2neq sum_i=1^k |a_i|^2$ (because of the triangle inequality). I feel I am probably making a few fatal errors throughout this proof. Could anybody knowledgeable in Linear Algebra please shed some light for me?







share|cite|improve this question













I'm having an issue with the following problem from Ch. 6.1 (Inner Product Spaces and Norms) of Friedberg's Linear Algebra, 4th ed.




$"$Let $v_1 ,v_2 ,...,v_k$ be an orthogonal set in V, and let $a_1 ,a_2 ,...,a_k$ be scalars. Prove that $$||sum_i=1^k a_i v_i||^2 = sum_i=1^k |a_i|^2 ||v_i||^2."$$




My attempt at a solution:



$"$Recall that since $v_1 ,v_2 ,...,v_k$ is orthogonal, any two distinct vectors $v_1 ,v_j in v_1 ,v_2 ,...,v_k$ would form the equality $<v_i ,v_j>=0$. Let us pick a vector $v_iin v_1 ,v_2 ,...,v_k$ such that $<v_i,v_i>neq0$. By the properties $||x||=sqrt<x,x>$ and $overlinesum_ell=1^n x_ell=sum_ell=1^n overlinex_ell$ ('the conjugate of a sum is the sum of the conjugates'), we have $$||sum_i=1^k a_i v_i||^2 =<sum_i=1^k a_i v_i,sum_i=1^k a_i v_i>$$
$$=sum_i=1^k a_i sum_i=1^k overlinea_i <v_i,v_i>.$$ Note that as each $sum_i=1^k a_i ,sum_i=1^k overlinea_i$ simply denotes a scalar, we can use the properties $<cx,y>=c<x,y>$ and $<x,cy>=bar c <x,y>."$




At this point I am basically stuck. If I make the argument... $$sum_i=1^k a_i sum_i=1^k bar a_i=(a_1 + a_2 +...+ a_k)(bar a_1 + bar a_2 +...+bar a_k)$$
$$=(a_1 + a_2 +...+ a_k) overline(a_1 + a_2 +...+ a_k)$$
$$=|a_1 + a_2 +...+ a_k|^2$$
$$=|sum_i=1^k a_i|^2$$
... I get no further, because to the best of my knowledge, $|sum_i=1^k a_i|^2neq sum_i=1^k |a_i|^2$ (because of the triangle inequality). I feel I am probably making a few fatal errors throughout this proof. Could anybody knowledgeable in Linear Algebra please shed some light for me?









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Aug 7 at 18:32









zzuussee

1,639420




1,639420









asked Aug 7 at 17:31









greycatbird

1066




1066







  • 1




    You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
    – Nik Pronko
    Aug 7 at 17:38











  • @NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
    – greycatbird
    Aug 7 at 17:46










  • This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
    – Nik Pronko
    Aug 7 at 17:53












  • 1




    You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
    – Nik Pronko
    Aug 7 at 17:38











  • @NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
    – greycatbird
    Aug 7 at 17:46










  • This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
    – Nik Pronko
    Aug 7 at 17:53







1




1




You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
– Nik Pronko
Aug 7 at 17:38





You have one algebraic mistake: it should be $langle sum_i=1 a_iv, sum_i = 1 a_iv rangle = sum_i=1 sum_j=1 a_i bar a_j langle v_i, v_j rangle$. Think about how to apply properties of inner product iteratively.
– Nik Pronko
Aug 7 at 17:38













@NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
– greycatbird
Aug 7 at 17:46




@NikPronko: Thank you. Why though do you employ different subscripts, especially when orthogonality is an issue? If vi=/=vj, then wouldn't <vi,vj>=0, causing the entire expression to equal zero? Anyways, that is the assumption I proceeded with, possibly causing many errors.
– greycatbird
Aug 7 at 17:46












This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
– Nik Pronko
Aug 7 at 17:53




This is true, but if you work out this sum just for general vectors it would be evedent that $langle v_i, v_irangle$ are multiplied by $a_i bar a_j$ and not by the product of sums. Your reasoning is essentially correct.
– Nik Pronko
Aug 7 at 17:53










2 Answers
2






active

oldest

votes

















up vote
2
down vote



accepted










You should treat expression $leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle$ more carefully:



$$
leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle =
sum^k_i=1 leftlangle a_iv_i, sum^k_j=1 a_j v_j rightrangle =
sum^k_i=1 a_i leftlangle v_i, sum^k_j=1 a_jv_j rightrangle.
$$



and then each



$$
leftlangle v_i, sum^k_j=1 a_jv_j rightrangle = sum^k_j=1 bar a_j leftlangle v_i,v_j rightrangle
$$



By properties of inner product you know.



As vectors are orthogonal last expression simplifies to $bar a_i | v_i |^2$ and so the result



$$
leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle = sum^k_i=1 |a_i|^2| v_i|^2
$$



follows.






share|cite|improve this answer




























    up vote
    1
    down vote













    Note that



    $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>$



    Also note that, for each $i$,



    $sum_j=1^ka_ioverlinea_jleft<v_i,v_j right>=a_ioverlinea_ileft< v_i,v_iright> $ since $left<v_i,v_j right>=0$ if $ineq j$.



    Thus,



    $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>= sum_i=1^ka_ioverlinea_ileft<v_i,v_i right>=sum_i=1^k|a_i|^2left| v_i right|^2$



    I hope it helps :)






    share|cite|improve this answer





















      Your Answer




      StackExchange.ifUsing("editor", function ()
      return StackExchange.using("mathjaxEditing", function ()
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      );
      );
      , "mathjax-editing");

      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "69"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      convertImagesToLinks: true,
      noModals: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );








       

      draft saved


      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2875185%2fhow-to-express-the-summation-of-an-inner-product-space%23new-answer', 'question_page');

      );

      Post as a guest






























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      2
      down vote



      accepted










      You should treat expression $leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle$ more carefully:



      $$
      leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle =
      sum^k_i=1 leftlangle a_iv_i, sum^k_j=1 a_j v_j rightrangle =
      sum^k_i=1 a_i leftlangle v_i, sum^k_j=1 a_jv_j rightrangle.
      $$



      and then each



      $$
      leftlangle v_i, sum^k_j=1 a_jv_j rightrangle = sum^k_j=1 bar a_j leftlangle v_i,v_j rightrangle
      $$



      By properties of inner product you know.



      As vectors are orthogonal last expression simplifies to $bar a_i | v_i |^2$ and so the result



      $$
      leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle = sum^k_i=1 |a_i|^2| v_i|^2
      $$



      follows.






      share|cite|improve this answer

























        up vote
        2
        down vote



        accepted










        You should treat expression $leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle$ more carefully:



        $$
        leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle =
        sum^k_i=1 leftlangle a_iv_i, sum^k_j=1 a_j v_j rightrangle =
        sum^k_i=1 a_i leftlangle v_i, sum^k_j=1 a_jv_j rightrangle.
        $$



        and then each



        $$
        leftlangle v_i, sum^k_j=1 a_jv_j rightrangle = sum^k_j=1 bar a_j leftlangle v_i,v_j rightrangle
        $$



        By properties of inner product you know.



        As vectors are orthogonal last expression simplifies to $bar a_i | v_i |^2$ and so the result



        $$
        leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle = sum^k_i=1 |a_i|^2| v_i|^2
        $$



        follows.






        share|cite|improve this answer























          up vote
          2
          down vote



          accepted







          up vote
          2
          down vote



          accepted






          You should treat expression $leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle$ more carefully:



          $$
          leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle =
          sum^k_i=1 leftlangle a_iv_i, sum^k_j=1 a_j v_j rightrangle =
          sum^k_i=1 a_i leftlangle v_i, sum^k_j=1 a_jv_j rightrangle.
          $$



          and then each



          $$
          leftlangle v_i, sum^k_j=1 a_jv_j rightrangle = sum^k_j=1 bar a_j leftlangle v_i,v_j rightrangle
          $$



          By properties of inner product you know.



          As vectors are orthogonal last expression simplifies to $bar a_i | v_i |^2$ and so the result



          $$
          leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle = sum^k_i=1 |a_i|^2| v_i|^2
          $$



          follows.






          share|cite|improve this answer













          You should treat expression $leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle$ more carefully:



          $$
          leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle =
          sum^k_i=1 leftlangle a_iv_i, sum^k_j=1 a_j v_j rightrangle =
          sum^k_i=1 a_i leftlangle v_i, sum^k_j=1 a_jv_j rightrangle.
          $$



          and then each



          $$
          leftlangle v_i, sum^k_j=1 a_jv_j rightrangle = sum^k_j=1 bar a_j leftlangle v_i,v_j rightrangle
          $$



          By properties of inner product you know.



          As vectors are orthogonal last expression simplifies to $bar a_i | v_i |^2$ and so the result



          $$
          leftlangle sum^k_i=1 a_iv_i , sum^k_i=1 a_iv_irightrangle = sum^k_i=1 |a_i|^2| v_i|^2
          $$



          follows.







          share|cite|improve this answer













          share|cite|improve this answer



          share|cite|improve this answer











          answered Aug 7 at 17:50









          Nik Pronko

          795717




          795717




















              up vote
              1
              down vote













              Note that



              $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>$



              Also note that, for each $i$,



              $sum_j=1^ka_ioverlinea_jleft<v_i,v_j right>=a_ioverlinea_ileft< v_i,v_iright> $ since $left<v_i,v_j right>=0$ if $ineq j$.



              Thus,



              $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>= sum_i=1^ka_ioverlinea_ileft<v_i,v_i right>=sum_i=1^k|a_i|^2left| v_i right|^2$



              I hope it helps :)






              share|cite|improve this answer

























                up vote
                1
                down vote













                Note that



                $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>$



                Also note that, for each $i$,



                $sum_j=1^ka_ioverlinea_jleft<v_i,v_j right>=a_ioverlinea_ileft< v_i,v_iright> $ since $left<v_i,v_j right>=0$ if $ineq j$.



                Thus,



                $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>= sum_i=1^ka_ioverlinea_ileft<v_i,v_i right>=sum_i=1^k|a_i|^2left| v_i right|^2$



                I hope it helps :)






                share|cite|improve this answer























                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  Note that



                  $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>$



                  Also note that, for each $i$,



                  $sum_j=1^ka_ioverlinea_jleft<v_i,v_j right>=a_ioverlinea_ileft< v_i,v_iright> $ since $left<v_i,v_j right>=0$ if $ineq j$.



                  Thus,



                  $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>= sum_i=1^ka_ioverlinea_ileft<v_i,v_i right>=sum_i=1^k|a_i|^2left| v_i right|^2$



                  I hope it helps :)






                  share|cite|improve this answer













                  Note that



                  $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>$



                  Also note that, for each $i$,



                  $sum_j=1^ka_ioverlinea_jleft<v_i,v_j right>=a_ioverlinea_ileft< v_i,v_iright> $ since $left<v_i,v_j right>=0$ if $ineq j$.



                  Thus,



                  $left<sum^k_i=1a_i v_i,sum^k_j=1a_j v_j right>= sum_i=1^ksum_j=1^ka_ioverlinea_jleft< v_i,v_j right>= sum_i=1^ka_ioverlinea_ileft<v_i,v_i right>=sum_i=1^k|a_i|^2left| v_i right|^2$



                  I hope it helps :)







                  share|cite|improve this answer













                  share|cite|improve this answer



                  share|cite|improve this answer











                  answered Aug 7 at 17:47









                  Lev Ban

                  48616




                  48616






















                       

                      draft saved


                      draft discarded


























                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2875185%2fhow-to-express-the-summation-of-an-inner-product-space%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      cDS ilILUSn4knS6t7o,Cfj8Moz,d8,rwq27,p2lLVq6sxM
                      5zhLPFeBnUzD5B9i3F6WH SUkFpiC5QOD NLmLd1sfCOa4Q,GFmzPj12ivvDUs 0a3Ym6rvIglWvbltlJq Aq aCSP704DVfbUJiDM1pr

                      這個網誌中的熱門文章

                      How to combine Bézier curves to a surface?

                      Propositional logic and tautologies

                      Distribution of Stopped Wiener Process with Stochastic Volatility