Necessity of linear map conditions











up vote
1
down vote

favorite
1












I am reading a linear algebra textbook and it mentions that, to be linear, a function $f : mathbb{R}^n rightarrow mathbb{R}^m$ must fulfill $f(x+y) = f(x) + f(y)$ and $f(cx) = c(fx)$.



I'm trying to understand why the second condition is necessary, since taking $y = (c-1)x$ and recursively expanding the sum into $f(x)$ terms seems to be a way to arrive at the same conclusion from only the first condition.










share|cite|improve this question


















  • 4




    It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
    – Eevee Trainer
    Nov 19 at 3:15






  • 3




    It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
    – Lucas Corrêa
    Nov 19 at 3:18

















up vote
1
down vote

favorite
1












I am reading a linear algebra textbook and it mentions that, to be linear, a function $f : mathbb{R}^n rightarrow mathbb{R}^m$ must fulfill $f(x+y) = f(x) + f(y)$ and $f(cx) = c(fx)$.



I'm trying to understand why the second condition is necessary, since taking $y = (c-1)x$ and recursively expanding the sum into $f(x)$ terms seems to be a way to arrive at the same conclusion from only the first condition.










share|cite|improve this question


















  • 4




    It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
    – Eevee Trainer
    Nov 19 at 3:15






  • 3




    It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
    – Lucas Corrêa
    Nov 19 at 3:18















up vote
1
down vote

favorite
1









up vote
1
down vote

favorite
1






1





I am reading a linear algebra textbook and it mentions that, to be linear, a function $f : mathbb{R}^n rightarrow mathbb{R}^m$ must fulfill $f(x+y) = f(x) + f(y)$ and $f(cx) = c(fx)$.



I'm trying to understand why the second condition is necessary, since taking $y = (c-1)x$ and recursively expanding the sum into $f(x)$ terms seems to be a way to arrive at the same conclusion from only the first condition.










share|cite|improve this question













I am reading a linear algebra textbook and it mentions that, to be linear, a function $f : mathbb{R}^n rightarrow mathbb{R}^m$ must fulfill $f(x+y) = f(x) + f(y)$ and $f(cx) = c(fx)$.



I'm trying to understand why the second condition is necessary, since taking $y = (c-1)x$ and recursively expanding the sum into $f(x)$ terms seems to be a way to arrive at the same conclusion from only the first condition.







linear-algebra






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 19 at 3:11









zipzapboing

909




909








  • 4




    It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
    – Eevee Trainer
    Nov 19 at 3:15






  • 3




    It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
    – Lucas Corrêa
    Nov 19 at 3:18
















  • 4




    It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
    – Eevee Trainer
    Nov 19 at 3:15






  • 3




    It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
    – Lucas Corrêa
    Nov 19 at 3:18










4




4




It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
– Eevee Trainer
Nov 19 at 3:15




It's probably just a convenience sort of thing, and more helpful for non-integers $c$ (if I'm understanding your argument correctly). Personally I always see the two combined: for constants $alpha,beta$, $f$ is linear if $$f(alpha x + beta y) = alpha f(x) + beta f(y)$$
– Eevee Trainer
Nov 19 at 3:15




3




3




It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
– Lucas Corrêa
Nov 19 at 3:18






It seems to me that you want to write $cx$ as $x + cdots + x$ $c$ times. But if $c$ is not integer? So it's more convenient to check $f(cx) = cf(x)$
– Lucas Corrêa
Nov 19 at 3:18












2 Answers
2






active

oldest

votes

















up vote
1
down vote



accepted










A problem with the proposed way of defining $f(cx)$,



$f(cx) = f(x + (c - 1)x) = f(x) + f((c - 1)x), ; text{and so forth}, tag 1$



is that, unless $c in Bbb N$, the recursive process won't terminate. What happens is $c = sqrt 2$ or $c = pi$, for example? Or even if $0 > c in Bbb Z$? Of course here one may take



$f(cx) = f(-x + (c + 1)x) = f(-x) + f((c + 1)x), tag 2$



since we have $f(-x) = -f(x)$ from



$f(x) + f(-x) = f(x + (-x)) = f(0) = 0. tag 3$



But with $c notin Z$, we will never arrive at a result for $f(cx)$.



If $c in Bbb Q$, one can make some progress in this direction via the observation that with



$c = dfrac{p}{q}, ; p, q in Bbb Z, tag 4$



we can write



$pf(x) = f(px) = f left (q dfrac{p}{q}x right ) = qf left (dfrac{p}{q}x right ), tag 5$



whence



$f left (dfrac{p}{q}x right ) = dfrac{p}{q}f(x). tag 6$



We can handle $f(cx) = cf(x)$, $c in Bbb Z$, via $f(x + y) = f(x) + f(y)$ without axiomatizing $f(cx) = cf(x)$ since the addition axiom essenially posits an abelian group homomporphism between $Bbb R^m$ and $Bbb R^n$, and such homomorphisms extend in a natural way to $Bbb Z$-module homomorphisms; as we have seen, rational $c$ then obey $f(cx) = cf(x)$; but for $c$ irrational we are faced with a non-terminating process . . .



Typically the assumption that $f(x)$ is continuous may be invoked to address the case of irrational $c$. Then if $c_n to c$ with $c_n in Bbb Q$, we have



$c_n f(x) = f(c_n x) to f(cx) tag 7$



by the continuity of $f(x)$.






share|cite|improve this answer




























    up vote
    1
    down vote













    You are correct that induction combined with $f(x+y)=f(x)+f(y)$ yields $f(nx)=nf(x)$ for $nin mathbb{N}$. However, for $c=pi$ (say) it isn't obvious how one would show that it follows that $f(pi x)=pi f(x)$.



    Of course, we want our maps to respect scalar multiplication, so it necessitates making the definition $f(lambda x)=lambda f(x)$ for all $lambda in mathbb{R}$.






    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: 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%2f3004471%2fnecessity-of-linear-map-conditions%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      1
      down vote



      accepted










      A problem with the proposed way of defining $f(cx)$,



      $f(cx) = f(x + (c - 1)x) = f(x) + f((c - 1)x), ; text{and so forth}, tag 1$



      is that, unless $c in Bbb N$, the recursive process won't terminate. What happens is $c = sqrt 2$ or $c = pi$, for example? Or even if $0 > c in Bbb Z$? Of course here one may take



      $f(cx) = f(-x + (c + 1)x) = f(-x) + f((c + 1)x), tag 2$



      since we have $f(-x) = -f(x)$ from



      $f(x) + f(-x) = f(x + (-x)) = f(0) = 0. tag 3$



      But with $c notin Z$, we will never arrive at a result for $f(cx)$.



      If $c in Bbb Q$, one can make some progress in this direction via the observation that with



      $c = dfrac{p}{q}, ; p, q in Bbb Z, tag 4$



      we can write



      $pf(x) = f(px) = f left (q dfrac{p}{q}x right ) = qf left (dfrac{p}{q}x right ), tag 5$



      whence



      $f left (dfrac{p}{q}x right ) = dfrac{p}{q}f(x). tag 6$



      We can handle $f(cx) = cf(x)$, $c in Bbb Z$, via $f(x + y) = f(x) + f(y)$ without axiomatizing $f(cx) = cf(x)$ since the addition axiom essenially posits an abelian group homomporphism between $Bbb R^m$ and $Bbb R^n$, and such homomorphisms extend in a natural way to $Bbb Z$-module homomorphisms; as we have seen, rational $c$ then obey $f(cx) = cf(x)$; but for $c$ irrational we are faced with a non-terminating process . . .



      Typically the assumption that $f(x)$ is continuous may be invoked to address the case of irrational $c$. Then if $c_n to c$ with $c_n in Bbb Q$, we have



      $c_n f(x) = f(c_n x) to f(cx) tag 7$



      by the continuity of $f(x)$.






      share|cite|improve this answer

























        up vote
        1
        down vote



        accepted










        A problem with the proposed way of defining $f(cx)$,



        $f(cx) = f(x + (c - 1)x) = f(x) + f((c - 1)x), ; text{and so forth}, tag 1$



        is that, unless $c in Bbb N$, the recursive process won't terminate. What happens is $c = sqrt 2$ or $c = pi$, for example? Or even if $0 > c in Bbb Z$? Of course here one may take



        $f(cx) = f(-x + (c + 1)x) = f(-x) + f((c + 1)x), tag 2$



        since we have $f(-x) = -f(x)$ from



        $f(x) + f(-x) = f(x + (-x)) = f(0) = 0. tag 3$



        But with $c notin Z$, we will never arrive at a result for $f(cx)$.



        If $c in Bbb Q$, one can make some progress in this direction via the observation that with



        $c = dfrac{p}{q}, ; p, q in Bbb Z, tag 4$



        we can write



        $pf(x) = f(px) = f left (q dfrac{p}{q}x right ) = qf left (dfrac{p}{q}x right ), tag 5$



        whence



        $f left (dfrac{p}{q}x right ) = dfrac{p}{q}f(x). tag 6$



        We can handle $f(cx) = cf(x)$, $c in Bbb Z$, via $f(x + y) = f(x) + f(y)$ without axiomatizing $f(cx) = cf(x)$ since the addition axiom essenially posits an abelian group homomporphism between $Bbb R^m$ and $Bbb R^n$, and such homomorphisms extend in a natural way to $Bbb Z$-module homomorphisms; as we have seen, rational $c$ then obey $f(cx) = cf(x)$; but for $c$ irrational we are faced with a non-terminating process . . .



        Typically the assumption that $f(x)$ is continuous may be invoked to address the case of irrational $c$. Then if $c_n to c$ with $c_n in Bbb Q$, we have



        $c_n f(x) = f(c_n x) to f(cx) tag 7$



        by the continuity of $f(x)$.






        share|cite|improve this answer























          up vote
          1
          down vote



          accepted







          up vote
          1
          down vote



          accepted






          A problem with the proposed way of defining $f(cx)$,



          $f(cx) = f(x + (c - 1)x) = f(x) + f((c - 1)x), ; text{and so forth}, tag 1$



          is that, unless $c in Bbb N$, the recursive process won't terminate. What happens is $c = sqrt 2$ or $c = pi$, for example? Or even if $0 > c in Bbb Z$? Of course here one may take



          $f(cx) = f(-x + (c + 1)x) = f(-x) + f((c + 1)x), tag 2$



          since we have $f(-x) = -f(x)$ from



          $f(x) + f(-x) = f(x + (-x)) = f(0) = 0. tag 3$



          But with $c notin Z$, we will never arrive at a result for $f(cx)$.



          If $c in Bbb Q$, one can make some progress in this direction via the observation that with



          $c = dfrac{p}{q}, ; p, q in Bbb Z, tag 4$



          we can write



          $pf(x) = f(px) = f left (q dfrac{p}{q}x right ) = qf left (dfrac{p}{q}x right ), tag 5$



          whence



          $f left (dfrac{p}{q}x right ) = dfrac{p}{q}f(x). tag 6$



          We can handle $f(cx) = cf(x)$, $c in Bbb Z$, via $f(x + y) = f(x) + f(y)$ without axiomatizing $f(cx) = cf(x)$ since the addition axiom essenially posits an abelian group homomporphism between $Bbb R^m$ and $Bbb R^n$, and such homomorphisms extend in a natural way to $Bbb Z$-module homomorphisms; as we have seen, rational $c$ then obey $f(cx) = cf(x)$; but for $c$ irrational we are faced with a non-terminating process . . .



          Typically the assumption that $f(x)$ is continuous may be invoked to address the case of irrational $c$. Then if $c_n to c$ with $c_n in Bbb Q$, we have



          $c_n f(x) = f(c_n x) to f(cx) tag 7$



          by the continuity of $f(x)$.






          share|cite|improve this answer












          A problem with the proposed way of defining $f(cx)$,



          $f(cx) = f(x + (c - 1)x) = f(x) + f((c - 1)x), ; text{and so forth}, tag 1$



          is that, unless $c in Bbb N$, the recursive process won't terminate. What happens is $c = sqrt 2$ or $c = pi$, for example? Or even if $0 > c in Bbb Z$? Of course here one may take



          $f(cx) = f(-x + (c + 1)x) = f(-x) + f((c + 1)x), tag 2$



          since we have $f(-x) = -f(x)$ from



          $f(x) + f(-x) = f(x + (-x)) = f(0) = 0. tag 3$



          But with $c notin Z$, we will never arrive at a result for $f(cx)$.



          If $c in Bbb Q$, one can make some progress in this direction via the observation that with



          $c = dfrac{p}{q}, ; p, q in Bbb Z, tag 4$



          we can write



          $pf(x) = f(px) = f left (q dfrac{p}{q}x right ) = qf left (dfrac{p}{q}x right ), tag 5$



          whence



          $f left (dfrac{p}{q}x right ) = dfrac{p}{q}f(x). tag 6$



          We can handle $f(cx) = cf(x)$, $c in Bbb Z$, via $f(x + y) = f(x) + f(y)$ without axiomatizing $f(cx) = cf(x)$ since the addition axiom essenially posits an abelian group homomporphism between $Bbb R^m$ and $Bbb R^n$, and such homomorphisms extend in a natural way to $Bbb Z$-module homomorphisms; as we have seen, rational $c$ then obey $f(cx) = cf(x)$; but for $c$ irrational we are faced with a non-terminating process . . .



          Typically the assumption that $f(x)$ is continuous may be invoked to address the case of irrational $c$. Then if $c_n to c$ with $c_n in Bbb Q$, we have



          $c_n f(x) = f(c_n x) to f(cx) tag 7$



          by the continuity of $f(x)$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 19 at 3:58









          Robert Lewis

          42.5k22862




          42.5k22862






















              up vote
              1
              down vote













              You are correct that induction combined with $f(x+y)=f(x)+f(y)$ yields $f(nx)=nf(x)$ for $nin mathbb{N}$. However, for $c=pi$ (say) it isn't obvious how one would show that it follows that $f(pi x)=pi f(x)$.



              Of course, we want our maps to respect scalar multiplication, so it necessitates making the definition $f(lambda x)=lambda f(x)$ for all $lambda in mathbb{R}$.






              share|cite|improve this answer

























                up vote
                1
                down vote













                You are correct that induction combined with $f(x+y)=f(x)+f(y)$ yields $f(nx)=nf(x)$ for $nin mathbb{N}$. However, for $c=pi$ (say) it isn't obvious how one would show that it follows that $f(pi x)=pi f(x)$.



                Of course, we want our maps to respect scalar multiplication, so it necessitates making the definition $f(lambda x)=lambda f(x)$ for all $lambda in mathbb{R}$.






                share|cite|improve this answer























                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  You are correct that induction combined with $f(x+y)=f(x)+f(y)$ yields $f(nx)=nf(x)$ for $nin mathbb{N}$. However, for $c=pi$ (say) it isn't obvious how one would show that it follows that $f(pi x)=pi f(x)$.



                  Of course, we want our maps to respect scalar multiplication, so it necessitates making the definition $f(lambda x)=lambda f(x)$ for all $lambda in mathbb{R}$.






                  share|cite|improve this answer












                  You are correct that induction combined with $f(x+y)=f(x)+f(y)$ yields $f(nx)=nf(x)$ for $nin mathbb{N}$. However, for $c=pi$ (say) it isn't obvious how one would show that it follows that $f(pi x)=pi f(x)$.



                  Of course, we want our maps to respect scalar multiplication, so it necessitates making the definition $f(lambda x)=lambda f(x)$ for all $lambda in mathbb{R}$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 19 at 3:43









                  Antonios-Alexandros Robotis

                  9,01041640




                  9,01041640






























                      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%2f3004471%2fnecessity-of-linear-map-conditions%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

                      Puebla de Zaragoza

                      Musa