Definition of scalar product in relation to projections












1












$begingroup$


So if $x in X$ is an element in a vector space $X$, then $forall x in X$:
$$x = e_ix^i$$
where $e_i$ is a basis for $X$. However, I encountered that this is equivalent to:
$$x = e_i (e_i, x)$$
where $(e_i, x)$ is the scalar product between $e_i$ and $x$. Why is the following true? $$x^i = (e_i, x)$$
My lecturer mentioned something about projections, but I don't understand the relation.










share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    So if $x in X$ is an element in a vector space $X$, then $forall x in X$:
    $$x = e_ix^i$$
    where $e_i$ is a basis for $X$. However, I encountered that this is equivalent to:
    $$x = e_i (e_i, x)$$
    where $(e_i, x)$ is the scalar product between $e_i$ and $x$. Why is the following true? $$x^i = (e_i, x)$$
    My lecturer mentioned something about projections, but I don't understand the relation.










    share|cite|improve this question









    $endgroup$















      1












      1








      1


      1



      $begingroup$


      So if $x in X$ is an element in a vector space $X$, then $forall x in X$:
      $$x = e_ix^i$$
      where $e_i$ is a basis for $X$. However, I encountered that this is equivalent to:
      $$x = e_i (e_i, x)$$
      where $(e_i, x)$ is the scalar product between $e_i$ and $x$. Why is the following true? $$x^i = (e_i, x)$$
      My lecturer mentioned something about projections, but I don't understand the relation.










      share|cite|improve this question









      $endgroup$




      So if $x in X$ is an element in a vector space $X$, then $forall x in X$:
      $$x = e_ix^i$$
      where $e_i$ is a basis for $X$. However, I encountered that this is equivalent to:
      $$x = e_i (e_i, x)$$
      where $(e_i, x)$ is the scalar product between $e_i$ and $x$. Why is the following true? $$x^i = (e_i, x)$$
      My lecturer mentioned something about projections, but I don't understand the relation.







      linear-algebra vector-spaces vectors linear-transformations






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Dec 5 '18 at 0:21









      daljit97daljit97

      178111




      178111






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Imagine the basis $e_i$ is orthonormal, that is $(e_i, e_j) = delta_{ij}$ ($1$ if $i = j$ or $0$ otherwise). You can expand any vector $x$ in this bases



          $$
          x = x^1 e_1 + x^2 e_2 + cdots = x^ie_i
          $$



          Now multiple both sides by some vector of the basis, say the first one



          $$
          (e^1, x) = x^1underbrace{(e_1, e_1)}_{=1} + x^2underbrace{(e_2, e_1)}_{=0} + x^3underbrace{(e_3, e_1)}_{=0} + cdots = x^1
          $$



          You can repeat the same experiment for all the other components, and quickly realize that



          $$
          (e^i, x) = x^i
          $$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            So does the basis $e_i$ need to be orthonormal?
            $endgroup$
            – daljit97
            Dec 5 '18 at 1:03






          • 1




            $begingroup$
            @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
            $endgroup$
            – caverac
            Dec 5 '18 at 1:07











          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',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          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%2f3026391%2fdefinition-of-scalar-product-in-relation-to-projections%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          1












          $begingroup$

          Imagine the basis $e_i$ is orthonormal, that is $(e_i, e_j) = delta_{ij}$ ($1$ if $i = j$ or $0$ otherwise). You can expand any vector $x$ in this bases



          $$
          x = x^1 e_1 + x^2 e_2 + cdots = x^ie_i
          $$



          Now multiple both sides by some vector of the basis, say the first one



          $$
          (e^1, x) = x^1underbrace{(e_1, e_1)}_{=1} + x^2underbrace{(e_2, e_1)}_{=0} + x^3underbrace{(e_3, e_1)}_{=0} + cdots = x^1
          $$



          You can repeat the same experiment for all the other components, and quickly realize that



          $$
          (e^i, x) = x^i
          $$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            So does the basis $e_i$ need to be orthonormal?
            $endgroup$
            – daljit97
            Dec 5 '18 at 1:03






          • 1




            $begingroup$
            @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
            $endgroup$
            – caverac
            Dec 5 '18 at 1:07
















          1












          $begingroup$

          Imagine the basis $e_i$ is orthonormal, that is $(e_i, e_j) = delta_{ij}$ ($1$ if $i = j$ or $0$ otherwise). You can expand any vector $x$ in this bases



          $$
          x = x^1 e_1 + x^2 e_2 + cdots = x^ie_i
          $$



          Now multiple both sides by some vector of the basis, say the first one



          $$
          (e^1, x) = x^1underbrace{(e_1, e_1)}_{=1} + x^2underbrace{(e_2, e_1)}_{=0} + x^3underbrace{(e_3, e_1)}_{=0} + cdots = x^1
          $$



          You can repeat the same experiment for all the other components, and quickly realize that



          $$
          (e^i, x) = x^i
          $$






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            So does the basis $e_i$ need to be orthonormal?
            $endgroup$
            – daljit97
            Dec 5 '18 at 1:03






          • 1




            $begingroup$
            @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
            $endgroup$
            – caverac
            Dec 5 '18 at 1:07














          1












          1








          1





          $begingroup$

          Imagine the basis $e_i$ is orthonormal, that is $(e_i, e_j) = delta_{ij}$ ($1$ if $i = j$ or $0$ otherwise). You can expand any vector $x$ in this bases



          $$
          x = x^1 e_1 + x^2 e_2 + cdots = x^ie_i
          $$



          Now multiple both sides by some vector of the basis, say the first one



          $$
          (e^1, x) = x^1underbrace{(e_1, e_1)}_{=1} + x^2underbrace{(e_2, e_1)}_{=0} + x^3underbrace{(e_3, e_1)}_{=0} + cdots = x^1
          $$



          You can repeat the same experiment for all the other components, and quickly realize that



          $$
          (e^i, x) = x^i
          $$






          share|cite|improve this answer









          $endgroup$



          Imagine the basis $e_i$ is orthonormal, that is $(e_i, e_j) = delta_{ij}$ ($1$ if $i = j$ or $0$ otherwise). You can expand any vector $x$ in this bases



          $$
          x = x^1 e_1 + x^2 e_2 + cdots = x^ie_i
          $$



          Now multiple both sides by some vector of the basis, say the first one



          $$
          (e^1, x) = x^1underbrace{(e_1, e_1)}_{=1} + x^2underbrace{(e_2, e_1)}_{=0} + x^3underbrace{(e_3, e_1)}_{=0} + cdots = x^1
          $$



          You can repeat the same experiment for all the other components, and quickly realize that



          $$
          (e^i, x) = x^i
          $$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 5 '18 at 0:27









          caveraccaverac

          14.5k31130




          14.5k31130












          • $begingroup$
            So does the basis $e_i$ need to be orthonormal?
            $endgroup$
            – daljit97
            Dec 5 '18 at 1:03






          • 1




            $begingroup$
            @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
            $endgroup$
            – caverac
            Dec 5 '18 at 1:07


















          • $begingroup$
            So does the basis $e_i$ need to be orthonormal?
            $endgroup$
            – daljit97
            Dec 5 '18 at 1:03






          • 1




            $begingroup$
            @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
            $endgroup$
            – caverac
            Dec 5 '18 at 1:07
















          $begingroup$
          So does the basis $e_i$ need to be orthonormal?
          $endgroup$
          – daljit97
          Dec 5 '18 at 1:03




          $begingroup$
          So does the basis $e_i$ need to be orthonormal?
          $endgroup$
          – daljit97
          Dec 5 '18 at 1:03




          1




          1




          $begingroup$
          @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
          $endgroup$
          – caverac
          Dec 5 '18 at 1:07




          $begingroup$
          @daljit97 Yes, but remember that you can always use the Gram-Schmidt algorithm, so it is not such a big thing to assume
          $endgroup$
          – caverac
          Dec 5 '18 at 1:07


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026391%2fdefinition-of-scalar-product-in-relation-to-projections%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Plaza Victoria

          In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

          How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...