Inequality $(1+x^k)^k+1geq (1+x^k+1)^k$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
5
down vote

favorite
2












Let $k$ be a positive integer and $x$ a positive real number. Prove that $(1+x^k)^k+1geq (1+x^k+1)^k$.



This looks similar to Bernoulli's inequality. If we write $X=x^k$, the inequality is equivalent to $(1+X)^frack+1kgeq 1+X^frack+1k$, but this is not exactly in the form where we can apply Bernoulli.







share|cite|improve this question






















  • What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
    – Rushabh Mehta
    Aug 8 at 21:29










  • $$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
    – InterstellarProbe
    Aug 8 at 21:29










  • It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
    – Rushabh Mehta
    Aug 8 at 21:30










  • It looks like a modified triangle inequality...
    – InterstellarProbe
    Aug 8 at 21:31














up vote
5
down vote

favorite
2












Let $k$ be a positive integer and $x$ a positive real number. Prove that $(1+x^k)^k+1geq (1+x^k+1)^k$.



This looks similar to Bernoulli's inequality. If we write $X=x^k$, the inequality is equivalent to $(1+X)^frack+1kgeq 1+X^frack+1k$, but this is not exactly in the form where we can apply Bernoulli.







share|cite|improve this question






















  • What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
    – Rushabh Mehta
    Aug 8 at 21:29










  • $$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
    – InterstellarProbe
    Aug 8 at 21:29










  • It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
    – Rushabh Mehta
    Aug 8 at 21:30










  • It looks like a modified triangle inequality...
    – InterstellarProbe
    Aug 8 at 21:31












up vote
5
down vote

favorite
2









up vote
5
down vote

favorite
2






2





Let $k$ be a positive integer and $x$ a positive real number. Prove that $(1+x^k)^k+1geq (1+x^k+1)^k$.



This looks similar to Bernoulli's inequality. If we write $X=x^k$, the inequality is equivalent to $(1+X)^frack+1kgeq 1+X^frack+1k$, but this is not exactly in the form where we can apply Bernoulli.







share|cite|improve this question














Let $k$ be a positive integer and $x$ a positive real number. Prove that $(1+x^k)^k+1geq (1+x^k+1)^k$.



This looks similar to Bernoulli's inequality. If we write $X=x^k$, the inequality is equivalent to $(1+X)^frack+1kgeq 1+X^frack+1k$, but this is not exactly in the form where we can apply Bernoulli.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 9 at 11:56









Michael Rozenberg

88.4k1579180




88.4k1579180










asked Aug 8 at 21:21









Karo

991320




991320











  • What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
    – Rushabh Mehta
    Aug 8 at 21:29










  • $$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
    – InterstellarProbe
    Aug 8 at 21:29










  • It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
    – Rushabh Mehta
    Aug 8 at 21:30










  • It looks like a modified triangle inequality...
    – InterstellarProbe
    Aug 8 at 21:31
















  • What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
    – Rushabh Mehta
    Aug 8 at 21:29










  • $$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
    – InterstellarProbe
    Aug 8 at 21:29










  • It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
    – Rushabh Mehta
    Aug 8 at 21:30










  • It looks like a modified triangle inequality...
    – InterstellarProbe
    Aug 8 at 21:31















What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
– Rushabh Mehta
Aug 8 at 21:29




What assumptions of the real numbers are we allowing? Because certain assumptions make this trivially easy.
– Rushabh Mehta
Aug 8 at 21:29












$$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
– InterstellarProbe
Aug 8 at 21:29




$$beginalign*(1+x^k)^k+1 & = (1+x^k)^k(1+x^k) \ & = (1+x^k)^k + x^k(1+x^k)^k \ & = (1+x^k)^k + (x+x^k+1)^kendalign*$$ Not sure if this helps, but it may.
– InterstellarProbe
Aug 8 at 21:29












It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
– Rushabh Mehta
Aug 8 at 21:30




It all depends on the assumptions of the properties of the real numbers that he's allowed to assume. This could either be really easy or really hard.
– Rushabh Mehta
Aug 8 at 21:30












It looks like a modified triangle inequality...
– InterstellarProbe
Aug 8 at 21:31




It looks like a modified triangle inequality...
– InterstellarProbe
Aug 8 at 21:31










4 Answers
4






active

oldest

votes

















up vote
7
down vote



accepted










Let $f(X) = (1+X)^r - 1 - X^r$ for $r> 1$. Then $f(0)=0$ and
$$
f'(X) = rleft((1+X)^r-1-X^r-1right)geq 0
$$
since $Xmapsto X^r-1$ is an increasing function. Hence $f$ is also increasing and we get $f(X)geq f(0)=0$ for $Xgeq 0$. Now set $r = (k+1)/k$.






share|cite|improve this answer



























    up vote
    2
    down vote













    Let $f(x)=x^alpha$, where $alpha>1$.



    Thus, $f$ is a convex function and since for positives $a$ and $b$ such that $ageq b$ we have $$(a+b,0)succ (a,b),$$ by Karamata we obtain:
    $$f(a+b)+f(0)geq f(a)+f(b)$$ or
    $$(a+b)^alphageq a^alpha+b^alpha$$ and since the last inequality is symmetric, it's true for all positives $a$ and $b$.



    Id est, for $a=1$, $b=x^k$ and $alpha=frack+1k$ we got your inequality.






    share|cite|improve this answer



























      up vote
      1
      down vote













      Case 1. $xle 1$.



      Then $x^kge x^k+1$ and therefore
      $$(1+x^k)^k+1 = (1+x^k)(1+x^k)^k ge (1+x^k)^k ge (1+x^k+1)^k.$$



      Case 2. $x>1$.



      We divide the inequality by $x^k(k+1)$ and get the following equivalent form
      $$left(1+left(frac 1x right)^kright)^k+1 ge left(1+left(frac 1x right)^k+1right)^k.$$
      This is just Case 1. for the number $dfrac 1x$.






      share|cite|improve this answer



























        up vote
        0
        down vote













        For $rgeq 1$, we have by Minkowski's Inequality that
        $$X+1=big(X^r+0^rbig)^frac1r+big(0^r+1^rbig)^frac1rgeq left((X+0)^r+(0+1)^rright)^frac1r=left(1+X^rright)^frac1rtext for all Xgeq0,.$$
        This shows that
        $$(1+X)^rgeq 1+X^r,.$$
        Note that the inequality becomes an equality iff $r=1$ or $X=0$. Now, for $k,linmathbbR_>0$ with $kleq l$, we then see that, with $X:=x^k$ and $r:=fraclk$, we have
        $$left(1+x^kright)^fraclkgeq 1+x^l,,text or left(1+x^kright)^lgeqleft(1+x^lright)^k,,$$
        for all $x>0$. The equality case is when $x=0$ and when $k=l$. This problem is a particular case where $l=k+1$. Furthermore, we conclude that the function $f:mathbbR_geq0timesmathbbR_>0tomathbbR$ defined by $$f(x,k):=left(1+x^kright)^frac1ktext for all xgeq0text and k>0$$
        is a nondecreasing function in $k$, and it is strictly increasing with respect to $k$ for $x>0$.






        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: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2876606%2finequality-1xkk1-geq-1xk1k%23new-answer', 'question_page');

          );

          Post as a guest






























          4 Answers
          4






          active

          oldest

          votes








          4 Answers
          4






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          7
          down vote



          accepted










          Let $f(X) = (1+X)^r - 1 - X^r$ for $r> 1$. Then $f(0)=0$ and
          $$
          f'(X) = rleft((1+X)^r-1-X^r-1right)geq 0
          $$
          since $Xmapsto X^r-1$ is an increasing function. Hence $f$ is also increasing and we get $f(X)geq f(0)=0$ for $Xgeq 0$. Now set $r = (k+1)/k$.






          share|cite|improve this answer
























            up vote
            7
            down vote



            accepted










            Let $f(X) = (1+X)^r - 1 - X^r$ for $r> 1$. Then $f(0)=0$ and
            $$
            f'(X) = rleft((1+X)^r-1-X^r-1right)geq 0
            $$
            since $Xmapsto X^r-1$ is an increasing function. Hence $f$ is also increasing and we get $f(X)geq f(0)=0$ for $Xgeq 0$. Now set $r = (k+1)/k$.






            share|cite|improve this answer






















              up vote
              7
              down vote



              accepted







              up vote
              7
              down vote



              accepted






              Let $f(X) = (1+X)^r - 1 - X^r$ for $r> 1$. Then $f(0)=0$ and
              $$
              f'(X) = rleft((1+X)^r-1-X^r-1right)geq 0
              $$
              since $Xmapsto X^r-1$ is an increasing function. Hence $f$ is also increasing and we get $f(X)geq f(0)=0$ for $Xgeq 0$. Now set $r = (k+1)/k$.






              share|cite|improve this answer












              Let $f(X) = (1+X)^r - 1 - X^r$ for $r> 1$. Then $f(0)=0$ and
              $$
              f'(X) = rleft((1+X)^r-1-X^r-1right)geq 0
              $$
              since $Xmapsto X^r-1$ is an increasing function. Hence $f$ is also increasing and we get $f(X)geq f(0)=0$ for $Xgeq 0$. Now set $r = (k+1)/k$.







              share|cite|improve this answer












              share|cite|improve this answer



              share|cite|improve this answer










              answered Aug 8 at 21:41









              Seewoo Lee

              4,756823




              4,756823




















                  up vote
                  2
                  down vote













                  Let $f(x)=x^alpha$, where $alpha>1$.



                  Thus, $f$ is a convex function and since for positives $a$ and $b$ such that $ageq b$ we have $$(a+b,0)succ (a,b),$$ by Karamata we obtain:
                  $$f(a+b)+f(0)geq f(a)+f(b)$$ or
                  $$(a+b)^alphageq a^alpha+b^alpha$$ and since the last inequality is symmetric, it's true for all positives $a$ and $b$.



                  Id est, for $a=1$, $b=x^k$ and $alpha=frack+1k$ we got your inequality.






                  share|cite|improve this answer
























                    up vote
                    2
                    down vote













                    Let $f(x)=x^alpha$, where $alpha>1$.



                    Thus, $f$ is a convex function and since for positives $a$ and $b$ such that $ageq b$ we have $$(a+b,0)succ (a,b),$$ by Karamata we obtain:
                    $$f(a+b)+f(0)geq f(a)+f(b)$$ or
                    $$(a+b)^alphageq a^alpha+b^alpha$$ and since the last inequality is symmetric, it's true for all positives $a$ and $b$.



                    Id est, for $a=1$, $b=x^k$ and $alpha=frack+1k$ we got your inequality.






                    share|cite|improve this answer






















                      up vote
                      2
                      down vote










                      up vote
                      2
                      down vote









                      Let $f(x)=x^alpha$, where $alpha>1$.



                      Thus, $f$ is a convex function and since for positives $a$ and $b$ such that $ageq b$ we have $$(a+b,0)succ (a,b),$$ by Karamata we obtain:
                      $$f(a+b)+f(0)geq f(a)+f(b)$$ or
                      $$(a+b)^alphageq a^alpha+b^alpha$$ and since the last inequality is symmetric, it's true for all positives $a$ and $b$.



                      Id est, for $a=1$, $b=x^k$ and $alpha=frack+1k$ we got your inequality.






                      share|cite|improve this answer












                      Let $f(x)=x^alpha$, where $alpha>1$.



                      Thus, $f$ is a convex function and since for positives $a$ and $b$ such that $ageq b$ we have $$(a+b,0)succ (a,b),$$ by Karamata we obtain:
                      $$f(a+b)+f(0)geq f(a)+f(b)$$ or
                      $$(a+b)^alphageq a^alpha+b^alpha$$ and since the last inequality is symmetric, it's true for all positives $a$ and $b$.



                      Id est, for $a=1$, $b=x^k$ and $alpha=frack+1k$ we got your inequality.







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Aug 9 at 3:51









                      Michael Rozenberg

                      88.4k1579180




                      88.4k1579180




















                          up vote
                          1
                          down vote













                          Case 1. $xle 1$.



                          Then $x^kge x^k+1$ and therefore
                          $$(1+x^k)^k+1 = (1+x^k)(1+x^k)^k ge (1+x^k)^k ge (1+x^k+1)^k.$$



                          Case 2. $x>1$.



                          We divide the inequality by $x^k(k+1)$ and get the following equivalent form
                          $$left(1+left(frac 1x right)^kright)^k+1 ge left(1+left(frac 1x right)^k+1right)^k.$$
                          This is just Case 1. for the number $dfrac 1x$.






                          share|cite|improve this answer
























                            up vote
                            1
                            down vote













                            Case 1. $xle 1$.



                            Then $x^kge x^k+1$ and therefore
                            $$(1+x^k)^k+1 = (1+x^k)(1+x^k)^k ge (1+x^k)^k ge (1+x^k+1)^k.$$



                            Case 2. $x>1$.



                            We divide the inequality by $x^k(k+1)$ and get the following equivalent form
                            $$left(1+left(frac 1x right)^kright)^k+1 ge left(1+left(frac 1x right)^k+1right)^k.$$
                            This is just Case 1. for the number $dfrac 1x$.






                            share|cite|improve this answer






















                              up vote
                              1
                              down vote










                              up vote
                              1
                              down vote









                              Case 1. $xle 1$.



                              Then $x^kge x^k+1$ and therefore
                              $$(1+x^k)^k+1 = (1+x^k)(1+x^k)^k ge (1+x^k)^k ge (1+x^k+1)^k.$$



                              Case 2. $x>1$.



                              We divide the inequality by $x^k(k+1)$ and get the following equivalent form
                              $$left(1+left(frac 1x right)^kright)^k+1 ge left(1+left(frac 1x right)^k+1right)^k.$$
                              This is just Case 1. for the number $dfrac 1x$.






                              share|cite|improve this answer












                              Case 1. $xle 1$.



                              Then $x^kge x^k+1$ and therefore
                              $$(1+x^k)^k+1 = (1+x^k)(1+x^k)^k ge (1+x^k)^k ge (1+x^k+1)^k.$$



                              Case 2. $x>1$.



                              We divide the inequality by $x^k(k+1)$ and get the following equivalent form
                              $$left(1+left(frac 1x right)^kright)^k+1 ge left(1+left(frac 1x right)^k+1right)^k.$$
                              This is just Case 1. for the number $dfrac 1x$.







                              share|cite|improve this answer












                              share|cite|improve this answer



                              share|cite|improve this answer










                              answered Aug 9 at 12:36









                              timon92

                              3,7141724




                              3,7141724




















                                  up vote
                                  0
                                  down vote













                                  For $rgeq 1$, we have by Minkowski's Inequality that
                                  $$X+1=big(X^r+0^rbig)^frac1r+big(0^r+1^rbig)^frac1rgeq left((X+0)^r+(0+1)^rright)^frac1r=left(1+X^rright)^frac1rtext for all Xgeq0,.$$
                                  This shows that
                                  $$(1+X)^rgeq 1+X^r,.$$
                                  Note that the inequality becomes an equality iff $r=1$ or $X=0$. Now, for $k,linmathbbR_>0$ with $kleq l$, we then see that, with $X:=x^k$ and $r:=fraclk$, we have
                                  $$left(1+x^kright)^fraclkgeq 1+x^l,,text or left(1+x^kright)^lgeqleft(1+x^lright)^k,,$$
                                  for all $x>0$. The equality case is when $x=0$ and when $k=l$. This problem is a particular case where $l=k+1$. Furthermore, we conclude that the function $f:mathbbR_geq0timesmathbbR_>0tomathbbR$ defined by $$f(x,k):=left(1+x^kright)^frac1ktext for all xgeq0text and k>0$$
                                  is a nondecreasing function in $k$, and it is strictly increasing with respect to $k$ for $x>0$.






                                  share|cite|improve this answer
























                                    up vote
                                    0
                                    down vote













                                    For $rgeq 1$, we have by Minkowski's Inequality that
                                    $$X+1=big(X^r+0^rbig)^frac1r+big(0^r+1^rbig)^frac1rgeq left((X+0)^r+(0+1)^rright)^frac1r=left(1+X^rright)^frac1rtext for all Xgeq0,.$$
                                    This shows that
                                    $$(1+X)^rgeq 1+X^r,.$$
                                    Note that the inequality becomes an equality iff $r=1$ or $X=0$. Now, for $k,linmathbbR_>0$ with $kleq l$, we then see that, with $X:=x^k$ and $r:=fraclk$, we have
                                    $$left(1+x^kright)^fraclkgeq 1+x^l,,text or left(1+x^kright)^lgeqleft(1+x^lright)^k,,$$
                                    for all $x>0$. The equality case is when $x=0$ and when $k=l$. This problem is a particular case where $l=k+1$. Furthermore, we conclude that the function $f:mathbbR_geq0timesmathbbR_>0tomathbbR$ defined by $$f(x,k):=left(1+x^kright)^frac1ktext for all xgeq0text and k>0$$
                                    is a nondecreasing function in $k$, and it is strictly increasing with respect to $k$ for $x>0$.






                                    share|cite|improve this answer






















                                      up vote
                                      0
                                      down vote










                                      up vote
                                      0
                                      down vote









                                      For $rgeq 1$, we have by Minkowski's Inequality that
                                      $$X+1=big(X^r+0^rbig)^frac1r+big(0^r+1^rbig)^frac1rgeq left((X+0)^r+(0+1)^rright)^frac1r=left(1+X^rright)^frac1rtext for all Xgeq0,.$$
                                      This shows that
                                      $$(1+X)^rgeq 1+X^r,.$$
                                      Note that the inequality becomes an equality iff $r=1$ or $X=0$. Now, for $k,linmathbbR_>0$ with $kleq l$, we then see that, with $X:=x^k$ and $r:=fraclk$, we have
                                      $$left(1+x^kright)^fraclkgeq 1+x^l,,text or left(1+x^kright)^lgeqleft(1+x^lright)^k,,$$
                                      for all $x>0$. The equality case is when $x=0$ and when $k=l$. This problem is a particular case where $l=k+1$. Furthermore, we conclude that the function $f:mathbbR_geq0timesmathbbR_>0tomathbbR$ defined by $$f(x,k):=left(1+x^kright)^frac1ktext for all xgeq0text and k>0$$
                                      is a nondecreasing function in $k$, and it is strictly increasing with respect to $k$ for $x>0$.






                                      share|cite|improve this answer












                                      For $rgeq 1$, we have by Minkowski's Inequality that
                                      $$X+1=big(X^r+0^rbig)^frac1r+big(0^r+1^rbig)^frac1rgeq left((X+0)^r+(0+1)^rright)^frac1r=left(1+X^rright)^frac1rtext for all Xgeq0,.$$
                                      This shows that
                                      $$(1+X)^rgeq 1+X^r,.$$
                                      Note that the inequality becomes an equality iff $r=1$ or $X=0$. Now, for $k,linmathbbR_>0$ with $kleq l$, we then see that, with $X:=x^k$ and $r:=fraclk$, we have
                                      $$left(1+x^kright)^fraclkgeq 1+x^l,,text or left(1+x^kright)^lgeqleft(1+x^lright)^k,,$$
                                      for all $x>0$. The equality case is when $x=0$ and when $k=l$. This problem is a particular case where $l=k+1$. Furthermore, we conclude that the function $f:mathbbR_geq0timesmathbbR_>0tomathbbR$ defined by $$f(x,k):=left(1+x^kright)^frac1ktext for all xgeq0text and k>0$$
                                      is a nondecreasing function in $k$, and it is strictly increasing with respect to $k$ for $x>0$.







                                      share|cite|improve this answer












                                      share|cite|improve this answer



                                      share|cite|improve this answer










                                      answered Aug 8 at 22:41









                                      Batominovski

                                      23.6k22779




                                      23.6k22779






















                                           

                                          draft saved


                                          draft discarded


























                                           


                                          draft saved


                                          draft discarded














                                          StackExchange.ready(
                                          function ()
                                          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2876606%2finequality-1xkk1-geq-1xk1k%23new-answer', 'question_page');

                                          );

                                          Post as a guest













































































                                          這個網誌中的熱門文章

                                          How to combine Bézier curves to a surface?

                                          Mutual Information Always Non-negative

                                          Why am i infinitely getting the same tweet with the Twitter Search API?