prove $U(P_n,f)−L(P_n,f)$ = $ frac{f(1)−f(0)}{n}$











up vote
0
down vote

favorite












Suppose $ f: [0,1]$ -> $R$ is an increasing function. For each $ n in N$ , consider the uniform partition $Pn := ( x_0, x_1,..., x_n )$ of $[0,1]$ where $x_i = i$ for $0≤i≤n$.



Now, I need to prove



a) $U(P_n,f)−L(P_n,f)$ = $ frac{f(1)−f(0)}{n}$



and



b) show $f in R [0, 1]$



I get some idea on part a: $m_i = frac {x_i}{n} $ and $M_i= {x_i}{n}$ , then I am not sure



but for part b, I have no idea (is it something like $epsilon > 0$ )?










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    Suppose $ f: [0,1]$ -> $R$ is an increasing function. For each $ n in N$ , consider the uniform partition $Pn := ( x_0, x_1,..., x_n )$ of $[0,1]$ where $x_i = i$ for $0≤i≤n$.



    Now, I need to prove



    a) $U(P_n,f)−L(P_n,f)$ = $ frac{f(1)−f(0)}{n}$



    and



    b) show $f in R [0, 1]$



    I get some idea on part a: $m_i = frac {x_i}{n} $ and $M_i= {x_i}{n}$ , then I am not sure



    but for part b, I have no idea (is it something like $epsilon > 0$ )?










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      Suppose $ f: [0,1]$ -> $R$ is an increasing function. For each $ n in N$ , consider the uniform partition $Pn := ( x_0, x_1,..., x_n )$ of $[0,1]$ where $x_i = i$ for $0≤i≤n$.



      Now, I need to prove



      a) $U(P_n,f)−L(P_n,f)$ = $ frac{f(1)−f(0)}{n}$



      and



      b) show $f in R [0, 1]$



      I get some idea on part a: $m_i = frac {x_i}{n} $ and $M_i= {x_i}{n}$ , then I am not sure



      but for part b, I have no idea (is it something like $epsilon > 0$ )?










      share|cite|improve this question













      Suppose $ f: [0,1]$ -> $R$ is an increasing function. For each $ n in N$ , consider the uniform partition $Pn := ( x_0, x_1,..., x_n )$ of $[0,1]$ where $x_i = i$ for $0≤i≤n$.



      Now, I need to prove



      a) $U(P_n,f)−L(P_n,f)$ = $ frac{f(1)−f(0)}{n}$



      and



      b) show $f in R [0, 1]$



      I get some idea on part a: $m_i = frac {x_i}{n} $ and $M_i= {x_i}{n}$ , then I am not sure



      but for part b, I have no idea (is it something like $epsilon > 0$ )?







      real-analysis proof-verification






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 22 at 20:05









      Math Avengers

      709




      709






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote













          Abridged solution. If $f$ is increasing on $[a, b]$ then $suplimits_{x in [a, b]} f(x) = f(b)$ and $inflimits_{x in [a, b]} f(x) = f(a).$ Q.E.D.



          Addendum. Part (b) follows instantaneously from part (a) if you know the definition of Riemann integral as the equality if the supremum of lower approximations and infimum of upper approximations.






          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%2f3009587%2fprove-up-n-f%25e2%2588%2592lp-n-f-fracf1%25e2%2588%2592f0n%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













            Abridged solution. If $f$ is increasing on $[a, b]$ then $suplimits_{x in [a, b]} f(x) = f(b)$ and $inflimits_{x in [a, b]} f(x) = f(a).$ Q.E.D.



            Addendum. Part (b) follows instantaneously from part (a) if you know the definition of Riemann integral as the equality if the supremum of lower approximations and infimum of upper approximations.






            share|cite|improve this answer



























              up vote
              0
              down vote













              Abridged solution. If $f$ is increasing on $[a, b]$ then $suplimits_{x in [a, b]} f(x) = f(b)$ and $inflimits_{x in [a, b]} f(x) = f(a).$ Q.E.D.



              Addendum. Part (b) follows instantaneously from part (a) if you know the definition of Riemann integral as the equality if the supremum of lower approximations and infimum of upper approximations.






              share|cite|improve this answer

























                up vote
                0
                down vote










                up vote
                0
                down vote









                Abridged solution. If $f$ is increasing on $[a, b]$ then $suplimits_{x in [a, b]} f(x) = f(b)$ and $inflimits_{x in [a, b]} f(x) = f(a).$ Q.E.D.



                Addendum. Part (b) follows instantaneously from part (a) if you know the definition of Riemann integral as the equality if the supremum of lower approximations and infimum of upper approximations.






                share|cite|improve this answer














                Abridged solution. If $f$ is increasing on $[a, b]$ then $suplimits_{x in [a, b]} f(x) = f(b)$ and $inflimits_{x in [a, b]} f(x) = f(a).$ Q.E.D.



                Addendum. Part (b) follows instantaneously from part (a) if you know the definition of Riemann integral as the equality if the supremum of lower approximations and infimum of upper approximations.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Nov 22 at 20:16

























                answered Nov 22 at 20:08









                Will M.

                2,337313




                2,337313






























                    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%2f3009587%2fprove-up-n-f%25e2%2588%2592lp-n-f-fracf1%25e2%2588%2592f0n%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

                    Ellipse (mathématiques)

                    Quarter-circle Tiles

                    Mont Emei