Proving a limit exists under some conditions












1












$begingroup$



Suppose that $f(x) > 0$ is integrable and monotone decreasing on $[0,
infty)$. Let $F_{n} = int_{0}^{n} f(t) mathop{dt}$, $n = 1, 2, 3,
ldots$. Prove that



$$lim_{ntoinfty} F_{n} $$



exists if and only if $sum_{n = 1}^{infty} f(n) < infty$.



Hint: Consider $F(n + 1) - F(n)$




I'm not sure about how to approach this problem. This is a practice problem that I have for a final exam coming soon. I think that the hint helps us show that the sequence is monotone decreasing because if we can show that quantity is less than $0$, it would imply that the terms are getting smaller and smaller.






real-analysis calculus sequences-and-series limits analysis







share|cite|improve this question











$endgroup$

















    1












    $begingroup$



    Suppose that $f(x) > 0$ is integrable and monotone decreasing on $[0,
    infty)$    . Let $F_{n} = int_{0}^{n} f(t) mathop{dt}$, $n = 1, 2, 3,
    ldots$    . Prove that



    $$lim_{ntoinfty} F_{n} $$



    exists if and only if $sum_{n = 1}^{infty} f(n) < infty$.



    Hint: Consider $F(n + 1) - F(n)$




    I'm not sure about how to approach this problem. This is a practice problem that I have for a final exam coming soon. I think that the hint helps us show that the sequence is monotone decreasing because if we can show that quantity is less than $0$, it would imply that the terms are getting smaller and smaller.






    real-analysis calculus sequences-and-series limits analysis







    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$



      Suppose that $f(x) > 0$ is integrable and monotone decreasing on $[0,
      infty)$      . Let $F_{n} = int_{0}^{n} f(t) mathop{dt}$, $n = 1, 2, 3,
      ldots$      . Prove that



      $$lim_{ntoinfty} F_{n} $$



      exists if and only if $sum_{n = 1}^{infty} f(n) < infty$.



      Hint: Consider $F(n + 1) - F(n)$




      I'm not sure about how to approach this problem. This is a practice problem that I have for a final exam coming soon. I think that the hint helps us show that the sequence is monotone decreasing because if we can show that quantity is less than $0$, it would imply that the terms are getting smaller and smaller.






      real-analysis calculus sequences-and-series limits analysis







      share|cite|improve this question











      $endgroup$





      Suppose that $f(x) > 0$ is integrable and monotone decreasing on $[0,
      infty)$      . Let $F_{n} = int_{0}^{n} f(t) mathop{dt}$, $n = 1, 2, 3,
      ldots$      . Prove that



      $$lim_{ntoinfty} F_{n} $$



      exists if and only if $sum_{n = 1}^{infty} f(n) < infty$.



      Hint: Consider $F(n + 1) - F(n)$




      I'm not sure about how to approach this problem. This is a practice problem that I have for a final exam coming soon. I think that the hint helps us show that the sequence is monotone decreasing because if we can show that quantity is less than $0$, it would imply that the terms are getting smaller and smaller.






      real-analysis calculus sequences-and-series limits analysis




      real-analysis calculus sequences-and-series limits analysis






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 14 '18 at 18:04







      Dillain Smith

















      asked Dec 14 '18 at 17:54









      Dillain SmithDillain Smith

      567




      567






















          3 Answers
          3






          active

          oldest

          votes


















          0












          $begingroup$

          Hint



          Note that
          $$
          sum_{j=1}^n f(j)leq int_0^n f(t), dt=sum_{j=1}^nint_{j-1}^{j} f(t) , dtle sum_{j=1}^n f(j-1)
          $$
          where we used linearity of the integral for the middle equality and the fact that $f$ is monotone decreasing for the outer inequalities.






          share|cite|improve this answer









          $endgroup$





















            0












            $begingroup$

            hint



            For $nge 0,$



            $$F(n+1)-F(n)=int_n^{n+1}f(t)dt$$



            $$(forall tin[n,n+1]);$$
            $$f(n+1)le f(t)le f(n)$$
            and
            $$;f(n+1)leint_n^{n+1}f(t)dtle f(n)$$






            share|cite|improve this answer









            $endgroup$





















              0












              $begingroup$

              I am also studying for my real analysis exam, so if this proof is wrong please let me know so I know what to look over :)




              If $sum_{n=1}^infty f(n) < infty$ $implies$ $lim_{nrightarrow infty} F_n < infty$




              Since $f$ is monotonically decreasing on $[0,infty)$, we know that $f(n+1) < f(n)$ $forall n in mathbb{N}$, and we know $f(0)$ exists.



              From this we can see that the following comparison is true
              $$
              F_n = int_0^n f(t)dt < sum_{k=0}^n f(k) = f(0) + sum_{k=1}^n f(k)
              $$
              now we can take the limit of both sides and see that
              $$
              lim_{nrightarrow infty} F_n < f(0) + sum_{k=1}^infty f(k)
              $$
              Therofore, the limit must exist because we know that the sum exists, and $f(0)$ exists.



              To prove the other direction the method is the same, except we say that



              $$
              sum_{k=1}^n f(k) < int_0^n f(t)dt
              $$



              since it is not a "right-Riemann Sum"






              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%2f3039705%2fproving-a-limit-exists-under-some-conditions%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                3 Answers
                3






                active

                oldest

                votes








                3 Answers
                3






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                0












                $begingroup$

                Hint



                Note that
                $$
                sum_{j=1}^n f(j)leq int_0^n f(t), dt=sum_{j=1}^nint_{j-1}^{j} f(t) , dtle sum_{j=1}^n f(j-1)
                $$
                where we used linearity of the integral for the middle equality and the fact that $f$ is monotone decreasing for the outer inequalities.






                share|cite|improve this answer









                $endgroup$


















                  0












                  $begingroup$

                  Hint



                  Note that
                  $$
                  sum_{j=1}^n f(j)leq int_0^n f(t), dt=sum_{j=1}^nint_{j-1}^{j} f(t) , dtle sum_{j=1}^n f(j-1)
                  $$
                  where we used linearity of the integral for the middle equality and the fact that $f$ is monotone decreasing for the outer inequalities.






                  share|cite|improve this answer









                  $endgroup$
















                    0












                    0








                    0





                    $begingroup$

                    Hint



                    Note that
                    $$
                    sum_{j=1}^n f(j)leq int_0^n f(t), dt=sum_{j=1}^nint_{j-1}^{j} f(t) , dtle sum_{j=1}^n f(j-1)
                    $$
                    where we used linearity of the integral for the middle equality and the fact that $f$ is monotone decreasing for the outer inequalities.






                    share|cite|improve this answer









                    $endgroup$



                    Hint



                    Note that
                    $$
                    sum_{j=1}^n f(j)leq int_0^n f(t), dt=sum_{j=1}^nint_{j-1}^{j} f(t) , dtle sum_{j=1}^n f(j-1)
                    $$
                    where we used linearity of the integral for the middle equality and the fact that $f$ is monotone decreasing for the outer inequalities.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Dec 14 '18 at 18:02









                    Foobaz JohnFoobaz John

                    22.1k41352




                    22.1k41352























                        0












                        $begingroup$

                        hint



                        For $nge 0,$



                        $$F(n+1)-F(n)=int_n^{n+1}f(t)dt$$



                        $$(forall tin[n,n+1]);$$
                        $$f(n+1)le f(t)le f(n)$$
                        and
                        $$;f(n+1)leint_n^{n+1}f(t)dtle f(n)$$






                        share|cite|improve this answer









                        $endgroup$


















                          0












                          $begingroup$

                          hint



                          For $nge 0,$



                          $$F(n+1)-F(n)=int_n^{n+1}f(t)dt$$



                          $$(forall tin[n,n+1]);$$
                          $$f(n+1)le f(t)le f(n)$$
                          and
                          $$;f(n+1)leint_n^{n+1}f(t)dtle f(n)$$






                          share|cite|improve this answer









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            hint



                            For $nge 0,$



                            $$F(n+1)-F(n)=int_n^{n+1}f(t)dt$$



                            $$(forall tin[n,n+1]);$$
                            $$f(n+1)le f(t)le f(n)$$
                            and
                            $$;f(n+1)leint_n^{n+1}f(t)dtle f(n)$$






                            share|cite|improve this answer









                            $endgroup$



                            hint



                            For $nge 0,$



                            $$F(n+1)-F(n)=int_n^{n+1}f(t)dt$$



                            $$(forall tin[n,n+1]);$$
                            $$f(n+1)le f(t)le f(n)$$
                            and
                            $$;f(n+1)leint_n^{n+1}f(t)dtle f(n)$$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Dec 14 '18 at 18:25









                            hamam_Abdallahhamam_Abdallah

                            38.1k21634




                            38.1k21634























                                0












                                $begingroup$

                                I am also studying for my real analysis exam, so if this proof is wrong please let me know so I know what to look over :)




                                If $sum_{n=1}^infty f(n) < infty$ $implies$ $lim_{nrightarrow infty} F_n < infty$




                                Since $f$ is monotonically decreasing on $[0,infty)$, we know that $f(n+1) < f(n)$ $forall n in mathbb{N}$, and we know $f(0)$ exists.



                                From this we can see that the following comparison is true
                                $$
                                F_n = int_0^n f(t)dt < sum_{k=0}^n f(k) = f(0) + sum_{k=1}^n f(k)
                                $$
                                now we can take the limit of both sides and see that
                                $$
                                lim_{nrightarrow infty} F_n < f(0) + sum_{k=1}^infty f(k)
                                $$
                                Therofore, the limit must exist because we know that the sum exists, and $f(0)$ exists.



                                To prove the other direction the method is the same, except we say that



                                $$
                                sum_{k=1}^n f(k) < int_0^n f(t)dt
                                $$



                                since it is not a "right-Riemann Sum"






                                share|cite|improve this answer









                                $endgroup$


















                                  0












                                  $begingroup$

                                  I am also studying for my real analysis exam, so if this proof is wrong please let me know so I know what to look over :)




                                  If $sum_{n=1}^infty f(n) < infty$ $implies$ $lim_{nrightarrow infty} F_n < infty$




                                  Since $f$ is monotonically decreasing on $[0,infty)$, we know that $f(n+1) < f(n)$ $forall n in mathbb{N}$, and we know $f(0)$ exists.



                                  From this we can see that the following comparison is true
                                  $$
                                  F_n = int_0^n f(t)dt < sum_{k=0}^n f(k) = f(0) + sum_{k=1}^n f(k)
                                  $$
                                  now we can take the limit of both sides and see that
                                  $$
                                  lim_{nrightarrow infty} F_n < f(0) + sum_{k=1}^infty f(k)
                                  $$
                                  Therofore, the limit must exist because we know that the sum exists, and $f(0)$ exists.



                                  To prove the other direction the method is the same, except we say that



                                  $$
                                  sum_{k=1}^n f(k) < int_0^n f(t)dt
                                  $$



                                  since it is not a "right-Riemann Sum"






                                  share|cite|improve this answer









                                  $endgroup$
















                                    0












                                    0








                                    0





                                    $begingroup$

                                    I am also studying for my real analysis exam, so if this proof is wrong please let me know so I know what to look over :)




                                    If $sum_{n=1}^infty f(n) < infty$ $implies$ $lim_{nrightarrow infty} F_n < infty$




                                    Since $f$ is monotonically decreasing on $[0,infty)$, we know that $f(n+1) < f(n)$ $forall n in mathbb{N}$, and we know $f(0)$ exists.



                                    From this we can see that the following comparison is true
                                    $$
                                    F_n = int_0^n f(t)dt < sum_{k=0}^n f(k) = f(0) + sum_{k=1}^n f(k)
                                    $$
                                    now we can take the limit of both sides and see that
                                    $$
                                    lim_{nrightarrow infty} F_n < f(0) + sum_{k=1}^infty f(k)
                                    $$
                                    Therofore, the limit must exist because we know that the sum exists, and $f(0)$ exists.



                                    To prove the other direction the method is the same, except we say that



                                    $$
                                    sum_{k=1}^n f(k) < int_0^n f(t)dt
                                    $$



                                    since it is not a "right-Riemann Sum"






                                    share|cite|improve this answer









                                    $endgroup$



                                    I am also studying for my real analysis exam, so if this proof is wrong please let me know so I know what to look over :)




                                    If $sum_{n=1}^infty f(n) < infty$ $implies$ $lim_{nrightarrow infty} F_n < infty$




                                    Since $f$ is monotonically decreasing on $[0,infty)$, we know that $f(n+1) < f(n)$ $forall n in mathbb{N}$, and we know $f(0)$ exists.



                                    From this we can see that the following comparison is true
                                    $$
                                    F_n = int_0^n f(t)dt < sum_{k=0}^n f(k) = f(0) + sum_{k=1}^n f(k)
                                    $$
                                    now we can take the limit of both sides and see that
                                    $$
                                    lim_{nrightarrow infty} F_n < f(0) + sum_{k=1}^infty f(k)
                                    $$
                                    Therofore, the limit must exist because we know that the sum exists, and $f(0)$ exists.



                                    To prove the other direction the method is the same, except we say that



                                    $$
                                    sum_{k=1}^n f(k) < int_0^n f(t)dt
                                    $$



                                    since it is not a "right-Riemann Sum"







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Dec 15 '18 at 0:33









                                    wjmccannwjmccann

                                    654118




                                    654118






























                                        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%2f3039705%2fproving-a-limit-exists-under-some-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

                                        Quarter-circle Tiles

                                        Image
                                        up vote 0 down vote favorite I have $99$ identical square tiles, each with a quarter-circle drawn on it like this: [asy] size(1.5cm); draw(Arc((2,0),1,90,180),red+1); draw((0,0)--(2,0)--(2,2)--(0,2)--(0,0)); [/asy] When I arrange the tiles in a $9times 11$ rectangular grid, each with a random orientation, what is the expected value of the number of full circles I form? I think this problem has to do with finding the chance any given 2x2 square has a circle, but I can't find it. expected-value share | cite | improve this question asked Nov 20 at 15:03 6minecraftninja 1 2
                                        Read more

                                        build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                                        Image
                                        0 I think it's similiar to NFAs. I replace the finite states of the given automaton for start-states for my new automaton. I do it with $epsilon$ -transition from the start state to the actual finite states of the given automaton. The start state of the given automaton will be my accepting(finite) state of my new one. All transitions will be reversed of course to recognize the reversed word. But how do I have to change the stack of the pushdown automaton? That's tricky. formal-languages automata context-free-grammar share | cite | improve this question edited Nov 29 '18 at 14:20 joee
                                        Read more

                                        Mont Emei

                                        Image
                                        Mont Emei.mw-parser-output .entete.map{background-image:url("//upload.wikimedia.org/wikipedia/commons/7/7a/Picto_infobox_map.png")} Vue du sommet Wanfo du mont Emei Géographie Altitude 3 099  m , Wanfo Coordonnées 29° 31′ 11″ nord, 103° 19′ 57″ est Administration Pays   Chine Province Sichuan Ville-préfecture Leshan Géolocalisation sur la carte : Sichuan Mont Emei Géolocalisation sur la carte : Chine Mont Emei modifier   Paysage panoramique du mont Emei, incluant le paysage panoramique du grand Bouddha de Leshan *   Patrimoine mondial de l'UNESCO Passerelle en bois sur le versant ouest Pays   Chine Subdivision Sichuan Type Mixte Critères (iv) (vi) (x) Superficie 15 400 ha Numéro d’identification 779 Zone géographique Asie et Pacifique  ** Année d’inscription 1996 (20 e session) * Descriptif officiel UNESCO ** Classification géog
                                        Read more