Proof of an inequality using analytic geometry

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











up vote
12
down vote

favorite
3












If $p,q,r$ are real numbers and $0<p<q<r$, then $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



Is this a well-known inequality?



My proof of it is based on analytic geometry:



If you plot the points $P=(p,1/p)$, $Q=(q,1/q)$, $R=(r,1/r)$ in this order, you get the vertices of a triangle circumscribed by an equilateral hyperbola $xy=1$ entirely on the first quadrant (as all numbers $p,q,r$ are positive and because a line cannot intercept a conic in three points). The area of this triangle PQR can be given by the following formula: $$frac 12 begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix$$



And as these coordinates are written anticlockwise in this determinant, it has to be positive:
$$begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix>0$$



From that we get



$$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



Is this proof correct?



Is there another, simpler proof for this inequality?










share|cite|improve this question



























    up vote
    12
    down vote

    favorite
    3












    If $p,q,r$ are real numbers and $0<p<q<r$, then $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



    Is this a well-known inequality?



    My proof of it is based on analytic geometry:



    If you plot the points $P=(p,1/p)$, $Q=(q,1/q)$, $R=(r,1/r)$ in this order, you get the vertices of a triangle circumscribed by an equilateral hyperbola $xy=1$ entirely on the first quadrant (as all numbers $p,q,r$ are positive and because a line cannot intercept a conic in three points). The area of this triangle PQR can be given by the following formula: $$frac 12 begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix$$



    And as these coordinates are written anticlockwise in this determinant, it has to be positive:
    $$begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix>0$$



    From that we get



    $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



    Is this proof correct?



    Is there another, simpler proof for this inequality?










    share|cite|improve this question

























      up vote
      12
      down vote

      favorite
      3









      up vote
      12
      down vote

      favorite
      3






      3





      If $p,q,r$ are real numbers and $0<p<q<r$, then $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



      Is this a well-known inequality?



      My proof of it is based on analytic geometry:



      If you plot the points $P=(p,1/p)$, $Q=(q,1/q)$, $R=(r,1/r)$ in this order, you get the vertices of a triangle circumscribed by an equilateral hyperbola $xy=1$ entirely on the first quadrant (as all numbers $p,q,r$ are positive and because a line cannot intercept a conic in three points). The area of this triangle PQR can be given by the following formula: $$frac 12 begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix$$



      And as these coordinates are written anticlockwise in this determinant, it has to be positive:
      $$begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix>0$$



      From that we get



      $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



      Is this proof correct?



      Is there another, simpler proof for this inequality?










      share|cite|improve this question















      If $p,q,r$ are real numbers and $0<p<q<r$, then $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



      Is this a well-known inequality?



      My proof of it is based on analytic geometry:



      If you plot the points $P=(p,1/p)$, $Q=(q,1/q)$, $R=(r,1/r)$ in this order, you get the vertices of a triangle circumscribed by an equilateral hyperbola $xy=1$ entirely on the first quadrant (as all numbers $p,q,r$ are positive and because a line cannot intercept a conic in three points). The area of this triangle PQR can be given by the following formula: $$frac 12 begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix$$



      And as these coordinates are written anticlockwise in this determinant, it has to be positive:
      $$begin vmatrix p & frac 1p & 1 \ q & frac 1q & 1 \ r & frac 1r & 1 \ end vmatrix>0$$



      From that we get



      $$frac pq +frac qr +frac rp >frac qp +frac rq +frac pr$$



      Is this proof correct?



      Is there another, simpler proof for this inequality?







      algebra-precalculus proof-verification inequality proof-writing analytic-geometry






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Sep 25 at 19:07









      greedoid

      30.2k94183




      30.2k94183










      asked Sep 19 at 17:44









      MrDudulex

      3109




      3109




















          3 Answers
          3






          active

          oldest

          votes

















          up vote
          6
          down vote



          accepted










          Just a slightly different view at your proof: If the function $f: I to Bbb R$ is
          strictly convex on the interval $I subset Bbb R$ then for $p < q < r$ in $I$
          $$
          f(q) < fracr-qr-p , f(p) + fracq-pr-p , f(r) \
          iff (r-q) , f(p) + (p-r) , f(q) + (q-p) , f(r) > 0 quad (*)
          $$
          Choosing $f(x) = frac 1x$ gives the desired inequality.



          The connection to your solution is that $(*)$ can be written as
          $$
          begin vmatrix p & f(p) & 1 \ q & f(q) & 1 \ r & f(r) & 1 \ end vmatrix>0
          , ,
          $$
          i.e. the (oriented) area of the triangle is positive because
          $f(x) = frac 1x$ is strictly convex.






          share|cite|improve this answer


















          • 1




            Nice fact. Using this fact we can create many homologous inequalities with such convex functions
            – MrDudulex
            Sep 19 at 19:31


















          up vote
          6
          down vote













          Put $x=rover q>1$ and $y= qover p>1$ so we have to prove $$1over x+1over y +xy >x+y+1over xy$$ or $$x+y+x^2y^2>x^2y+y^2x+1$$
          or $$x^2y^2-xy(x+y)+(x+y)-1>0$$



          or $$(xy-1)(xy+1)-(x+y)(xy-1)>0$$ or $$(xy-1)(xy-x-y+1)>0$$



          or $$(xy-1)(x-1)(y-1)>0$$
          which is true.






          share|cite|improve this answer





























            up vote
            4
            down vote













            Your inequalitiy is equavalent to $$- left( q-r right) left( p-r right) left( p-q right) >0$$
            and this is true since we have $$0<p<q<r$$






            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%2f2923057%2fproof-of-an-inequality-using-analytic-geometry%23new-answer', 'question_page');

              );

              Post as a guest






























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes








              up vote
              6
              down vote



              accepted










              Just a slightly different view at your proof: If the function $f: I to Bbb R$ is
              strictly convex on the interval $I subset Bbb R$ then for $p < q < r$ in $I$
              $$
              f(q) < fracr-qr-p , f(p) + fracq-pr-p , f(r) \
              iff (r-q) , f(p) + (p-r) , f(q) + (q-p) , f(r) > 0 quad (*)
              $$
              Choosing $f(x) = frac 1x$ gives the desired inequality.



              The connection to your solution is that $(*)$ can be written as
              $$
              begin vmatrix p & f(p) & 1 \ q & f(q) & 1 \ r & f(r) & 1 \ end vmatrix>0
              , ,
              $$
              i.e. the (oriented) area of the triangle is positive because
              $f(x) = frac 1x$ is strictly convex.






              share|cite|improve this answer


















              • 1




                Nice fact. Using this fact we can create many homologous inequalities with such convex functions
                – MrDudulex
                Sep 19 at 19:31















              up vote
              6
              down vote



              accepted










              Just a slightly different view at your proof: If the function $f: I to Bbb R$ is
              strictly convex on the interval $I subset Bbb R$ then for $p < q < r$ in $I$
              $$
              f(q) < fracr-qr-p , f(p) + fracq-pr-p , f(r) \
              iff (r-q) , f(p) + (p-r) , f(q) + (q-p) , f(r) > 0 quad (*)
              $$
              Choosing $f(x) = frac 1x$ gives the desired inequality.



              The connection to your solution is that $(*)$ can be written as
              $$
              begin vmatrix p & f(p) & 1 \ q & f(q) & 1 \ r & f(r) & 1 \ end vmatrix>0
              , ,
              $$
              i.e. the (oriented) area of the triangle is positive because
              $f(x) = frac 1x$ is strictly convex.






              share|cite|improve this answer


















              • 1




                Nice fact. Using this fact we can create many homologous inequalities with such convex functions
                – MrDudulex
                Sep 19 at 19:31













              up vote
              6
              down vote



              accepted







              up vote
              6
              down vote



              accepted






              Just a slightly different view at your proof: If the function $f: I to Bbb R$ is
              strictly convex on the interval $I subset Bbb R$ then for $p < q < r$ in $I$
              $$
              f(q) < fracr-qr-p , f(p) + fracq-pr-p , f(r) \
              iff (r-q) , f(p) + (p-r) , f(q) + (q-p) , f(r) > 0 quad (*)
              $$
              Choosing $f(x) = frac 1x$ gives the desired inequality.



              The connection to your solution is that $(*)$ can be written as
              $$
              begin vmatrix p & f(p) & 1 \ q & f(q) & 1 \ r & f(r) & 1 \ end vmatrix>0
              , ,
              $$
              i.e. the (oriented) area of the triangle is positive because
              $f(x) = frac 1x$ is strictly convex.






              share|cite|improve this answer














              Just a slightly different view at your proof: If the function $f: I to Bbb R$ is
              strictly convex on the interval $I subset Bbb R$ then for $p < q < r$ in $I$
              $$
              f(q) < fracr-qr-p , f(p) + fracq-pr-p , f(r) \
              iff (r-q) , f(p) + (p-r) , f(q) + (q-p) , f(r) > 0 quad (*)
              $$
              Choosing $f(x) = frac 1x$ gives the desired inequality.



              The connection to your solution is that $(*)$ can be written as
              $$
              begin vmatrix p & f(p) & 1 \ q & f(q) & 1 \ r & f(r) & 1 \ end vmatrix>0
              , ,
              $$
              i.e. the (oriented) area of the triangle is positive because
              $f(x) = frac 1x$ is strictly convex.







              share|cite|improve this answer














              share|cite|improve this answer



              share|cite|improve this answer








              edited Sep 19 at 19:21

























              answered Sep 19 at 19:15









              Martin R

              24.3k32844




              24.3k32844







              • 1




                Nice fact. Using this fact we can create many homologous inequalities with such convex functions
                – MrDudulex
                Sep 19 at 19:31













              • 1




                Nice fact. Using this fact we can create many homologous inequalities with such convex functions
                – MrDudulex
                Sep 19 at 19:31








              1




              1




              Nice fact. Using this fact we can create many homologous inequalities with such convex functions
              – MrDudulex
              Sep 19 at 19:31





              Nice fact. Using this fact we can create many homologous inequalities with such convex functions
              – MrDudulex
              Sep 19 at 19:31











              up vote
              6
              down vote













              Put $x=rover q>1$ and $y= qover p>1$ so we have to prove $$1over x+1over y +xy >x+y+1over xy$$ or $$x+y+x^2y^2>x^2y+y^2x+1$$
              or $$x^2y^2-xy(x+y)+(x+y)-1>0$$



              or $$(xy-1)(xy+1)-(x+y)(xy-1)>0$$ or $$(xy-1)(xy-x-y+1)>0$$



              or $$(xy-1)(x-1)(y-1)>0$$
              which is true.






              share|cite|improve this answer


























                up vote
                6
                down vote













                Put $x=rover q>1$ and $y= qover p>1$ so we have to prove $$1over x+1over y +xy >x+y+1over xy$$ or $$x+y+x^2y^2>x^2y+y^2x+1$$
                or $$x^2y^2-xy(x+y)+(x+y)-1>0$$



                or $$(xy-1)(xy+1)-(x+y)(xy-1)>0$$ or $$(xy-1)(xy-x-y+1)>0$$



                or $$(xy-1)(x-1)(y-1)>0$$
                which is true.






                share|cite|improve this answer
























                  up vote
                  6
                  down vote










                  up vote
                  6
                  down vote









                  Put $x=rover q>1$ and $y= qover p>1$ so we have to prove $$1over x+1over y +xy >x+y+1over xy$$ or $$x+y+x^2y^2>x^2y+y^2x+1$$
                  or $$x^2y^2-xy(x+y)+(x+y)-1>0$$



                  or $$(xy-1)(xy+1)-(x+y)(xy-1)>0$$ or $$(xy-1)(xy-x-y+1)>0$$



                  or $$(xy-1)(x-1)(y-1)>0$$
                  which is true.






                  share|cite|improve this answer














                  Put $x=rover q>1$ and $y= qover p>1$ so we have to prove $$1over x+1over y +xy >x+y+1over xy$$ or $$x+y+x^2y^2>x^2y+y^2x+1$$
                  or $$x^2y^2-xy(x+y)+(x+y)-1>0$$



                  or $$(xy-1)(xy+1)-(x+y)(xy-1)>0$$ or $$(xy-1)(xy-x-y+1)>0$$



                  or $$(xy-1)(x-1)(y-1)>0$$
                  which is true.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Sep 19 at 18:11

























                  answered Sep 19 at 17:56









                  greedoid

                  30.2k94183




                  30.2k94183




















                      up vote
                      4
                      down vote













                      Your inequalitiy is equavalent to $$- left( q-r right) left( p-r right) left( p-q right) >0$$
                      and this is true since we have $$0<p<q<r$$






                      share|cite|improve this answer


























                        up vote
                        4
                        down vote













                        Your inequalitiy is equavalent to $$- left( q-r right) left( p-r right) left( p-q right) >0$$
                        and this is true since we have $$0<p<q<r$$






                        share|cite|improve this answer
























                          up vote
                          4
                          down vote










                          up vote
                          4
                          down vote









                          Your inequalitiy is equavalent to $$- left( q-r right) left( p-r right) left( p-q right) >0$$
                          and this is true since we have $$0<p<q<r$$






                          share|cite|improve this answer














                          Your inequalitiy is equavalent to $$- left( q-r right) left( p-r right) left( p-q right) >0$$
                          and this is true since we have $$0<p<q<r$$







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited Sep 19 at 18:01

























                          answered Sep 19 at 17:58









                          Dr. Sonnhard Graubner

                          69.5k32761




                          69.5k32761



























                               

                              draft saved


                              draft discarded















































                               


                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2923057%2fproof-of-an-inequality-using-analytic-geometry%23new-answer', 'question_page');

                              );

                              Post as a guest













































































                              Popular posts from this blog

                              How to check contact read email or not when send email to Individual?

                              Displaying single band from multi-band raster using QGIS

                              How many registers does an x86_64 CPU actually have?