Direct sum problem











up vote
1
down vote

favorite












In vector space $mathbb{R} ^ mathbb{R} =left{ f mid f colon mathbb{R} to mathbb{R} right} $ let L be a set of even functions $( f(-t)=f(t))$ and and M a set of odd functions
$( f(-t)=-f(t))$ .It's easy to prove that L and M are subspaces of the vector space but how do I prove that
$mathbb{R} ^ mathbb{R} = M oplus L$ ? It's easy to prove that nul function is in the intersection of M and L but how can a function that isn't even or odd be a sum of two functions that are even or odd. For example the exponential function $ e^x$ ?










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    In vector space $mathbb{R} ^ mathbb{R} =left{ f mid f colon mathbb{R} to mathbb{R} right} $ let L be a set of even functions $( f(-t)=f(t))$ and and M a set of odd functions
    $( f(-t)=-f(t))$ .It's easy to prove that L and M are subspaces of the vector space but how do I prove that
    $mathbb{R} ^ mathbb{R} = M oplus L$ ? It's easy to prove that nul function is in the intersection of M and L but how can a function that isn't even or odd be a sum of two functions that are even or odd. For example the exponential function $ e^x$ ?










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      In vector space $mathbb{R} ^ mathbb{R} =left{ f mid f colon mathbb{R} to mathbb{R} right} $ let L be a set of even functions $( f(-t)=f(t))$ and and M a set of odd functions
      $( f(-t)=-f(t))$ .It's easy to prove that L and M are subspaces of the vector space but how do I prove that
      $mathbb{R} ^ mathbb{R} = M oplus L$ ? It's easy to prove that nul function is in the intersection of M and L but how can a function that isn't even or odd be a sum of two functions that are even or odd. For example the exponential function $ e^x$ ?










      share|cite|improve this question













      In vector space $mathbb{R} ^ mathbb{R} =left{ f mid f colon mathbb{R} to mathbb{R} right} $ let L be a set of even functions $( f(-t)=f(t))$ and and M a set of odd functions
      $( f(-t)=-f(t))$ .It's easy to prove that L and M are subspaces of the vector space but how do I prove that
      $mathbb{R} ^ mathbb{R} = M oplus L$ ? It's easy to prove that nul function is in the intersection of M and L but how can a function that isn't even or odd be a sum of two functions that are even or odd. For example the exponential function $ e^x$ ?







      vector-spaces






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 25 at 11:01









      user15269

      1588




      1588






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote



          accepted










          Suppose you are able to write $f$ as the sum of an even function $g$ and an odd function $h$; then, for every $tinmathbb{R}$,
          begin{align}
          f(t)&=g(t)+h(t)\
          f(-t)&=g(-t)+h(-t)=g(t)-h(t)
          end{align}

          Can you go on?






          share|cite|improve this answer





















          • Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
            – user15269
            Nov 25 at 11:44










          • @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
            – egreg
            Nov 25 at 11:51










          • Thanks I get it
            – user15269
            Nov 25 at 12: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',
          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%2f3012692%2fdirect-sum-problem%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








          up vote
          0
          down vote



          accepted










          Suppose you are able to write $f$ as the sum of an even function $g$ and an odd function $h$; then, for every $tinmathbb{R}$,
          begin{align}
          f(t)&=g(t)+h(t)\
          f(-t)&=g(-t)+h(-t)=g(t)-h(t)
          end{align}

          Can you go on?






          share|cite|improve this answer





















          • Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
            – user15269
            Nov 25 at 11:44










          • @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
            – egreg
            Nov 25 at 11:51










          • Thanks I get it
            – user15269
            Nov 25 at 12:07

















          up vote
          0
          down vote



          accepted










          Suppose you are able to write $f$ as the sum of an even function $g$ and an odd function $h$; then, for every $tinmathbb{R}$,
          begin{align}
          f(t)&=g(t)+h(t)\
          f(-t)&=g(-t)+h(-t)=g(t)-h(t)
          end{align}

          Can you go on?






          share|cite|improve this answer





















          • Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
            – user15269
            Nov 25 at 11:44










          • @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
            – egreg
            Nov 25 at 11:51










          • Thanks I get it
            – user15269
            Nov 25 at 12:07















          up vote
          0
          down vote



          accepted







          up vote
          0
          down vote



          accepted






          Suppose you are able to write $f$ as the sum of an even function $g$ and an odd function $h$; then, for every $tinmathbb{R}$,
          begin{align}
          f(t)&=g(t)+h(t)\
          f(-t)&=g(-t)+h(-t)=g(t)-h(t)
          end{align}

          Can you go on?






          share|cite|improve this answer












          Suppose you are able to write $f$ as the sum of an even function $g$ and an odd function $h$; then, for every $tinmathbb{R}$,
          begin{align}
          f(t)&=g(t)+h(t)\
          f(-t)&=g(-t)+h(-t)=g(t)-h(t)
          end{align}

          Can you go on?







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 25 at 11:29









          egreg

          176k1384198




          176k1384198












          • Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
            – user15269
            Nov 25 at 11:44










          • @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
            – egreg
            Nov 25 at 11:51










          • Thanks I get it
            – user15269
            Nov 25 at 12:07




















          • Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
            – user15269
            Nov 25 at 11:44










          • @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
            – egreg
            Nov 25 at 11:51










          • Thanks I get it
            – user15269
            Nov 25 at 12:07


















          Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
          – user15269
          Nov 25 at 11:44




          Does this mean that not every function can be written in this form? For example $ e^x + frac{1}{e^x} $ would then have to be an even function which it isn't.
          – user15269
          Nov 25 at 11:44












          @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
          – egreg
          Nov 25 at 11:51




          @user15269 No, every function can be written as a sum of an even and an odd function; if the function is even to begin with, the “odd part” is the constant zero function (which is odd, isn't it?)
          – egreg
          Nov 25 at 11:51












          Thanks I get it
          – user15269
          Nov 25 at 12:07






          Thanks I get it
          – user15269
          Nov 25 at 12: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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3012692%2fdirect-sum-problem%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

          To store a contact into the json file from server.js file using a class in NodeJS

          Redirect URL with Chrome Remote Debugging Android Devices

          Dieringhausen