Bounds on a convex function












0












$begingroup$


Let $f(x)$ be an increasing and infinitely differentiable strictly convex function with $f(0)=0$, it is easy to show that $f(m)-frac{m}{n}f(n)>0 $ for any $m> n> 0$ since $frac{n}{m}f(m)+frac{m-n}{m}f(0)> f(n)$ by definition. Suppose that we know $f''(0)=C>0$, is it possible to bound $f(m)-frac{m}{n}f(n)$ further?



I was hoping to show this by a Taylor expansion around zero:
$$f(x)=sum_{k=1}^infty frac{f^{(k)}(0) }{k!}x^k,$$
then we can show that:
$$ f(m)-frac{m}{n}f(n)=frac{m(m-n)}{2}C+sum_{k=3}^infty frac{f^{(k)}(0) }{k!}m(m^{k-1}-n^{k-1})>0$$
However, I'm not sure that the sum in the above equation is positive or negative, so I'm not sure if it is bounded below by sth like $frac{m(m-n)}{2}C$. Any help will be much appreciated.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    Let $f(x)$ be an increasing and infinitely differentiable strictly convex function with $f(0)=0$, it is easy to show that $f(m)-frac{m}{n}f(n)>0 $ for any $m> n> 0$ since $frac{n}{m}f(m)+frac{m-n}{m}f(0)> f(n)$ by definition. Suppose that we know $f''(0)=C>0$, is it possible to bound $f(m)-frac{m}{n}f(n)$ further?



    I was hoping to show this by a Taylor expansion around zero:
    $$f(x)=sum_{k=1}^infty frac{f^{(k)}(0) }{k!}x^k,$$
    then we can show that:
    $$ f(m)-frac{m}{n}f(n)=frac{m(m-n)}{2}C+sum_{k=3}^infty frac{f^{(k)}(0) }{k!}m(m^{k-1}-n^{k-1})>0$$
    However, I'm not sure that the sum in the above equation is positive or negative, so I'm not sure if it is bounded below by sth like $frac{m(m-n)}{2}C$. Any help will be much appreciated.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      Let $f(x)$ be an increasing and infinitely differentiable strictly convex function with $f(0)=0$, it is easy to show that $f(m)-frac{m}{n}f(n)>0 $ for any $m> n> 0$ since $frac{n}{m}f(m)+frac{m-n}{m}f(0)> f(n)$ by definition. Suppose that we know $f''(0)=C>0$, is it possible to bound $f(m)-frac{m}{n}f(n)$ further?



      I was hoping to show this by a Taylor expansion around zero:
      $$f(x)=sum_{k=1}^infty frac{f^{(k)}(0) }{k!}x^k,$$
      then we can show that:
      $$ f(m)-frac{m}{n}f(n)=frac{m(m-n)}{2}C+sum_{k=3}^infty frac{f^{(k)}(0) }{k!}m(m^{k-1}-n^{k-1})>0$$
      However, I'm not sure that the sum in the above equation is positive or negative, so I'm not sure if it is bounded below by sth like $frac{m(m-n)}{2}C$. Any help will be much appreciated.










      share|cite|improve this question









      $endgroup$




      Let $f(x)$ be an increasing and infinitely differentiable strictly convex function with $f(0)=0$, it is easy to show that $f(m)-frac{m}{n}f(n)>0 $ for any $m> n> 0$ since $frac{n}{m}f(m)+frac{m-n}{m}f(0)> f(n)$ by definition. Suppose that we know $f''(0)=C>0$, is it possible to bound $f(m)-frac{m}{n}f(n)$ further?



      I was hoping to show this by a Taylor expansion around zero:
      $$f(x)=sum_{k=1}^infty frac{f^{(k)}(0) }{k!}x^k,$$
      then we can show that:
      $$ f(m)-frac{m}{n}f(n)=frac{m(m-n)}{2}C+sum_{k=3}^infty frac{f^{(k)}(0) }{k!}m(m^{k-1}-n^{k-1})>0$$
      However, I'm not sure that the sum in the above equation is positive or negative, so I'm not sure if it is bounded below by sth like $frac{m(m-n)}{2}C$. Any help will be much appreciated.







      convex-analysis upper-lower-bounds






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 8 at 9:14









      user46666user46666

      335




      335






















          0






          active

          oldest

          votes












          Your Answer








          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%2f3065951%2fbounds-on-a-convex-function%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3065951%2fbounds-on-a-convex-function%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

          Wiesbaden

          Marschland

          Dieringhausen