Applying the induction hypothesis indirectly? I have trouble understanding this proof.












3












$begingroup$


I am confused about the mechanics of the following proof (page 423, chapter 20, of the fourth edition of Spivak's Calculus (Taylor's Theorem)):



enter image description here



I am not sure that I understand how applying the induction hypothesis to $R'$ works in proving the lemma for $R$ for all $n$. I expected that the induction hypothesis would be applied to $R$.



Maybe my confusion stems from the fact that I don't apply the induction hypothesis generally enough. Maybe I need to assume that it holds for some $n$ for all functions $f$ that meet the given criteria and that it therefore also holds for $f'$, from which the case $n+1$ follows for all $f$. So we assume that the induction hypothesis is true for both $R$ and $R'$ but use the latter to derive the $n+1$ case for the former. This also requires that $R'$ is $(n)$-times differentiable with $R'^{(k)}(a) = 0$ for all k up to $n-1$. But this appears always to be the case.










share|cite|improve this question









$endgroup$

















    3












    $begingroup$


    I am confused about the mechanics of the following proof (page 423, chapter 20, of the fourth edition of Spivak's Calculus (Taylor's Theorem)):



    enter image description here



    I am not sure that I understand how applying the induction hypothesis to $R'$ works in proving the lemma for $R$ for all $n$. I expected that the induction hypothesis would be applied to $R$.



    Maybe my confusion stems from the fact that I don't apply the induction hypothesis generally enough. Maybe I need to assume that it holds for some $n$ for all functions $f$ that meet the given criteria and that it therefore also holds for $f'$, from which the case $n+1$ follows for all $f$. So we assume that the induction hypothesis is true for both $R$ and $R'$ but use the latter to derive the $n+1$ case for the former. This also requires that $R'$ is $(n)$-times differentiable with $R'^{(k)}(a) = 0$ for all k up to $n-1$. But this appears always to be the case.










    share|cite|improve this question









    $endgroup$















      3












      3








      3


      1



      $begingroup$


      I am confused about the mechanics of the following proof (page 423, chapter 20, of the fourth edition of Spivak's Calculus (Taylor's Theorem)):



      enter image description here



      I am not sure that I understand how applying the induction hypothesis to $R'$ works in proving the lemma for $R$ for all $n$. I expected that the induction hypothesis would be applied to $R$.



      Maybe my confusion stems from the fact that I don't apply the induction hypothesis generally enough. Maybe I need to assume that it holds for some $n$ for all functions $f$ that meet the given criteria and that it therefore also holds for $f'$, from which the case $n+1$ follows for all $f$. So we assume that the induction hypothesis is true for both $R$ and $R'$ but use the latter to derive the $n+1$ case for the former. This also requires that $R'$ is $(n)$-times differentiable with $R'^{(k)}(a) = 0$ for all k up to $n-1$. But this appears always to be the case.










      share|cite|improve this question









      $endgroup$




      I am confused about the mechanics of the following proof (page 423, chapter 20, of the fourth edition of Spivak's Calculus (Taylor's Theorem)):



      enter image description here



      I am not sure that I understand how applying the induction hypothesis to $R'$ works in proving the lemma for $R$ for all $n$. I expected that the induction hypothesis would be applied to $R$.



      Maybe my confusion stems from the fact that I don't apply the induction hypothesis generally enough. Maybe I need to assume that it holds for some $n$ for all functions $f$ that meet the given criteria and that it therefore also holds for $f'$, from which the case $n+1$ follows for all $f$. So we assume that the induction hypothesis is true for both $R$ and $R'$ but use the latter to derive the $n+1$ case for the former. This also requires that $R'$ is $(n)$-times differentiable with $R'^{(k)}(a) = 0$ for all k up to $n-1$. But this appears always to be the case.







      real-analysis calculus induction taylor-expansion






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 7 hours ago









      user245312user245312

      121118




      121118






















          2 Answers
          2






          active

          oldest

          votes


















          3












          $begingroup$

          Yes, the statement $P(n)$ that you prove is




          For every $n+1$ times differentiable function $R$, ...




          and has only $n$ as free variable. Everything else, in particular $R$ is quantified within $P(n)$.
          For induction, you show $P(0)$, i.e.,




          For every (once) differentiable function $R$, ...




          and you show $forall ncolon P(n)to P(n+1)$ to finally arrive at




          For all $ninBbb N_0$, for every $n+1$ times differentiable function $R$ ...




          For the induction step $forall ncolon P(n)to P(n+1)$, we proceed as follows:
          Let $ninBbb N_0$ be arbitrary. We want to show $P(n)to P(n+1)$.
          So assume $P(n)$. Now we want to show $P(n+1)$. So let $R$ be an arbitrary $n+2$ times differentiable with $R(a)=ldots=R^{(n+1)}(a)=0$. Then $R'$ is $n+1$ times differentiable with $(R')'(a)=ldots=(R')^{(n)}(a)=0$, hence $P(n)$ applies to $R'$ ... ... hence the conclusion holds for $R$. As $R$ was arbitrary, we conclude that $P(n+1)$ holds. Thus we have shows $P(n)to P(n+1)$. As $n$ was arbitrary, we conclude $forall ninBbb N_0colon P(n)to P(n+1)$.






          share|cite|improve this answer









          $endgroup$





















            3












            $begingroup$

            We have taken the function $R $ such that it is $n+2$ times differentiable and $R^{(k)}(a)=0$,$k=0,1,ldots,n+1$. Our Induction assumption is that the proposition holds for for all functions with degree less than that of $R$. Now if we take $R'$, it has one degree less than that of $R$, it is $(n+1) $ times differentiable and since $R^{(k)}(a)=0$,
            $k=0,1,ldots,n+1$, we have $(R')^{(k)}(a)=0$,
            $k=0,1,ldots,n$. Hence we can apply the induction assumption for $R'$ and proceed as shown in the textbook.






            share|cite|improve this answer









            $endgroup$













              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%2f3107479%2fapplying-the-induction-hypothesis-indirectly-i-have-trouble-understanding-this%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









              3












              $begingroup$

              Yes, the statement $P(n)$ that you prove is




              For every $n+1$ times differentiable function $R$, ...




              and has only $n$ as free variable. Everything else, in particular $R$ is quantified within $P(n)$.
              For induction, you show $P(0)$, i.e.,




              For every (once) differentiable function $R$, ...




              and you show $forall ncolon P(n)to P(n+1)$ to finally arrive at




              For all $ninBbb N_0$, for every $n+1$ times differentiable function $R$ ...




              For the induction step $forall ncolon P(n)to P(n+1)$, we proceed as follows:
              Let $ninBbb N_0$ be arbitrary. We want to show $P(n)to P(n+1)$.
              So assume $P(n)$. Now we want to show $P(n+1)$. So let $R$ be an arbitrary $n+2$ times differentiable with $R(a)=ldots=R^{(n+1)}(a)=0$. Then $R'$ is $n+1$ times differentiable with $(R')'(a)=ldots=(R')^{(n)}(a)=0$, hence $P(n)$ applies to $R'$ ... ... hence the conclusion holds for $R$. As $R$ was arbitrary, we conclude that $P(n+1)$ holds. Thus we have shows $P(n)to P(n+1)$. As $n$ was arbitrary, we conclude $forall ninBbb N_0colon P(n)to P(n+1)$.






              share|cite|improve this answer









              $endgroup$


















                3












                $begingroup$

                Yes, the statement $P(n)$ that you prove is




                For every $n+1$ times differentiable function $R$, ...




                and has only $n$ as free variable. Everything else, in particular $R$ is quantified within $P(n)$.
                For induction, you show $P(0)$, i.e.,




                For every (once) differentiable function $R$, ...




                and you show $forall ncolon P(n)to P(n+1)$ to finally arrive at




                For all $ninBbb N_0$, for every $n+1$ times differentiable function $R$ ...




                For the induction step $forall ncolon P(n)to P(n+1)$, we proceed as follows:
                Let $ninBbb N_0$ be arbitrary. We want to show $P(n)to P(n+1)$.
                So assume $P(n)$. Now we want to show $P(n+1)$. So let $R$ be an arbitrary $n+2$ times differentiable with $R(a)=ldots=R^{(n+1)}(a)=0$. Then $R'$ is $n+1$ times differentiable with $(R')'(a)=ldots=(R')^{(n)}(a)=0$, hence $P(n)$ applies to $R'$ ... ... hence the conclusion holds for $R$. As $R$ was arbitrary, we conclude that $P(n+1)$ holds. Thus we have shows $P(n)to P(n+1)$. As $n$ was arbitrary, we conclude $forall ninBbb N_0colon P(n)to P(n+1)$.






                share|cite|improve this answer









                $endgroup$
















                  3












                  3








                  3





                  $begingroup$

                  Yes, the statement $P(n)$ that you prove is




                  For every $n+1$ times differentiable function $R$, ...




                  and has only $n$ as free variable. Everything else, in particular $R$ is quantified within $P(n)$.
                  For induction, you show $P(0)$, i.e.,




                  For every (once) differentiable function $R$, ...




                  and you show $forall ncolon P(n)to P(n+1)$ to finally arrive at




                  For all $ninBbb N_0$, for every $n+1$ times differentiable function $R$ ...




                  For the induction step $forall ncolon P(n)to P(n+1)$, we proceed as follows:
                  Let $ninBbb N_0$ be arbitrary. We want to show $P(n)to P(n+1)$.
                  So assume $P(n)$. Now we want to show $P(n+1)$. So let $R$ be an arbitrary $n+2$ times differentiable with $R(a)=ldots=R^{(n+1)}(a)=0$. Then $R'$ is $n+1$ times differentiable with $(R')'(a)=ldots=(R')^{(n)}(a)=0$, hence $P(n)$ applies to $R'$ ... ... hence the conclusion holds for $R$. As $R$ was arbitrary, we conclude that $P(n+1)$ holds. Thus we have shows $P(n)to P(n+1)$. As $n$ was arbitrary, we conclude $forall ninBbb N_0colon P(n)to P(n+1)$.






                  share|cite|improve this answer









                  $endgroup$



                  Yes, the statement $P(n)$ that you prove is




                  For every $n+1$ times differentiable function $R$, ...




                  and has only $n$ as free variable. Everything else, in particular $R$ is quantified within $P(n)$.
                  For induction, you show $P(0)$, i.e.,




                  For every (once) differentiable function $R$, ...




                  and you show $forall ncolon P(n)to P(n+1)$ to finally arrive at




                  For all $ninBbb N_0$, for every $n+1$ times differentiable function $R$ ...




                  For the induction step $forall ncolon P(n)to P(n+1)$, we proceed as follows:
                  Let $ninBbb N_0$ be arbitrary. We want to show $P(n)to P(n+1)$.
                  So assume $P(n)$. Now we want to show $P(n+1)$. So let $R$ be an arbitrary $n+2$ times differentiable with $R(a)=ldots=R^{(n+1)}(a)=0$. Then $R'$ is $n+1$ times differentiable with $(R')'(a)=ldots=(R')^{(n)}(a)=0$, hence $P(n)$ applies to $R'$ ... ... hence the conclusion holds for $R$. As $R$ was arbitrary, we conclude that $P(n+1)$ holds. Thus we have shows $P(n)to P(n+1)$. As $n$ was arbitrary, we conclude $forall ninBbb N_0colon P(n)to P(n+1)$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 7 hours ago









                  Hagen von EitzenHagen von Eitzen

                  279k23271502




                  279k23271502























                      3












                      $begingroup$

                      We have taken the function $R $ such that it is $n+2$ times differentiable and $R^{(k)}(a)=0$,$k=0,1,ldots,n+1$. Our Induction assumption is that the proposition holds for for all functions with degree less than that of $R$. Now if we take $R'$, it has one degree less than that of $R$, it is $(n+1) $ times differentiable and since $R^{(k)}(a)=0$,
                      $k=0,1,ldots,n+1$, we have $(R')^{(k)}(a)=0$,
                      $k=0,1,ldots,n$. Hence we can apply the induction assumption for $R'$ and proceed as shown in the textbook.






                      share|cite|improve this answer









                      $endgroup$


















                        3












                        $begingroup$

                        We have taken the function $R $ such that it is $n+2$ times differentiable and $R^{(k)}(a)=0$,$k=0,1,ldots,n+1$. Our Induction assumption is that the proposition holds for for all functions with degree less than that of $R$. Now if we take $R'$, it has one degree less than that of $R$, it is $(n+1) $ times differentiable and since $R^{(k)}(a)=0$,
                        $k=0,1,ldots,n+1$, we have $(R')^{(k)}(a)=0$,
                        $k=0,1,ldots,n$. Hence we can apply the induction assumption for $R'$ and proceed as shown in the textbook.






                        share|cite|improve this answer









                        $endgroup$
















                          3












                          3








                          3





                          $begingroup$

                          We have taken the function $R $ such that it is $n+2$ times differentiable and $R^{(k)}(a)=0$,$k=0,1,ldots,n+1$. Our Induction assumption is that the proposition holds for for all functions with degree less than that of $R$. Now if we take $R'$, it has one degree less than that of $R$, it is $(n+1) $ times differentiable and since $R^{(k)}(a)=0$,
                          $k=0,1,ldots,n+1$, we have $(R')^{(k)}(a)=0$,
                          $k=0,1,ldots,n$. Hence we can apply the induction assumption for $R'$ and proceed as shown in the textbook.






                          share|cite|improve this answer









                          $endgroup$



                          We have taken the function $R $ such that it is $n+2$ times differentiable and $R^{(k)}(a)=0$,$k=0,1,ldots,n+1$. Our Induction assumption is that the proposition holds for for all functions with degree less than that of $R$. Now if we take $R'$, it has one degree less than that of $R$, it is $(n+1) $ times differentiable and since $R^{(k)}(a)=0$,
                          $k=0,1,ldots,n+1$, we have $(R')^{(k)}(a)=0$,
                          $k=0,1,ldots,n$. Hence we can apply the induction assumption for $R'$ and proceed as shown in the textbook.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered 7 hours ago









                          Thomas ShelbyThomas Shelby

                          3,1071523




                          3,1071523






























                              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%2f3107479%2fapplying-the-induction-hypothesis-indirectly-i-have-trouble-understanding-this%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

                              Callistus I

                              Tabula Rosettana

                              How to label and detect the document text images