Prove Triangle Inequality for Two Special Cases












0












$begingroup$


I am reading "Understanding Analysis" - it is a great book. However, I lack a solutions manual and some of these answers are difficult to find. It has been a while since I've written proofs and I'm wondering if these proofs are sufficient for the problem, or I can do better:



The problem states:




Use the triangle inequality to establish the inequalities:



(a) $|a - b| le |a| + |b|$



(b) $||a| - |b|| le |a - b|$




Starting with (a):



Note that $|a - b| = |a + (-b)|$



so $|a + (-b)| le |a| + |-b|$ by the definition of the Triangle Inequality.



So $|a + (-b)| le a + b$ by applying the rules of the absolute value.



By definition $|a + b| le a + b$



which surely means $|a + b| le |a| + |b|$ by the rules of the absolute value.



and since we have shown $|a + (-b)| le a + b$, $|a + b| le a + b$ and, $|a + b| le |a| + |b|$



Then it must the be case where $|a - b| le |a| + |b|$





For (b) it seems we can proceed directly:



$||a| - |b|| = |a - b|$ by the definition of the absolute value.



Then it must be the case that $|a - b| le |a - b|$



and so $||a| - |b|| le |a - b|$





I hope I did these correctly. It would be very helpful if I could be provided the correct answer if I am wrong - and methods to write cleaner proofs. Thank you!










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    I am reading "Understanding Analysis" - it is a great book. However, I lack a solutions manual and some of these answers are difficult to find. It has been a while since I've written proofs and I'm wondering if these proofs are sufficient for the problem, or I can do better:



    The problem states:




    Use the triangle inequality to establish the inequalities:



    (a) $|a - b| le |a| + |b|$



    (b) $||a| - |b|| le |a - b|$




    Starting with (a):



    Note that $|a - b| = |a + (-b)|$



    so $|a + (-b)| le |a| + |-b|$ by the definition of the Triangle Inequality.



    So $|a + (-b)| le a + b$ by applying the rules of the absolute value.



    By definition $|a + b| le a + b$



    which surely means $|a + b| le |a| + |b|$ by the rules of the absolute value.



    and since we have shown $|a + (-b)| le a + b$, $|a + b| le a + b$ and, $|a + b| le |a| + |b|$



    Then it must the be case where $|a - b| le |a| + |b|$





    For (b) it seems we can proceed directly:



    $||a| - |b|| = |a - b|$ by the definition of the absolute value.



    Then it must be the case that $|a - b| le |a - b|$



    and so $||a| - |b|| le |a - b|$





    I hope I did these correctly. It would be very helpful if I could be provided the correct answer if I am wrong - and methods to write cleaner proofs. Thank you!










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      I am reading "Understanding Analysis" - it is a great book. However, I lack a solutions manual and some of these answers are difficult to find. It has been a while since I've written proofs and I'm wondering if these proofs are sufficient for the problem, or I can do better:



      The problem states:




      Use the triangle inequality to establish the inequalities:



      (a) $|a - b| le |a| + |b|$



      (b) $||a| - |b|| le |a - b|$




      Starting with (a):



      Note that $|a - b| = |a + (-b)|$



      so $|a + (-b)| le |a| + |-b|$ by the definition of the Triangle Inequality.



      So $|a + (-b)| le a + b$ by applying the rules of the absolute value.



      By definition $|a + b| le a + b$



      which surely means $|a + b| le |a| + |b|$ by the rules of the absolute value.



      and since we have shown $|a + (-b)| le a + b$, $|a + b| le a + b$ and, $|a + b| le |a| + |b|$



      Then it must the be case where $|a - b| le |a| + |b|$





      For (b) it seems we can proceed directly:



      $||a| - |b|| = |a - b|$ by the definition of the absolute value.



      Then it must be the case that $|a - b| le |a - b|$



      and so $||a| - |b|| le |a - b|$





      I hope I did these correctly. It would be very helpful if I could be provided the correct answer if I am wrong - and methods to write cleaner proofs. Thank you!










      share|cite|improve this question









      $endgroup$




      I am reading "Understanding Analysis" - it is a great book. However, I lack a solutions manual and some of these answers are difficult to find. It has been a while since I've written proofs and I'm wondering if these proofs are sufficient for the problem, or I can do better:



      The problem states:




      Use the triangle inequality to establish the inequalities:



      (a) $|a - b| le |a| + |b|$



      (b) $||a| - |b|| le |a - b|$




      Starting with (a):



      Note that $|a - b| = |a + (-b)|$



      so $|a + (-b)| le |a| + |-b|$ by the definition of the Triangle Inequality.



      So $|a + (-b)| le a + b$ by applying the rules of the absolute value.



      By definition $|a + b| le a + b$



      which surely means $|a + b| le |a| + |b|$ by the rules of the absolute value.



      and since we have shown $|a + (-b)| le a + b$, $|a + b| le a + b$ and, $|a + b| le |a| + |b|$



      Then it must the be case where $|a - b| le |a| + |b|$





      For (b) it seems we can proceed directly:



      $||a| - |b|| = |a - b|$ by the definition of the absolute value.



      Then it must be the case that $|a - b| le |a - b|$



      and so $||a| - |b|| le |a - b|$





      I hope I did these correctly. It would be very helpful if I could be provided the correct answer if I am wrong - and methods to write cleaner proofs. Thank you!







      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 Jan 24 at 0:26









      CL40CL40

      2136




      2136






















          3 Answers
          3






          active

          oldest

          votes


















          0












          $begingroup$

          (a) Prove $|a - b| le |a| + |b|$



          We know that $|x|+|y| ge |x+y|$



          $$text{Let $x=a$ and let $y=-b$. Substituting we get}$$



          begin{align}
          |x|+|y| &ge |x+y| \
          |a| + |-b| &ge |a + (-b)| \
          |a| + |b| &ge |a-b| \
          |a-b| &le |a| + |b|
          end{align}



          (b) Prove $||a| - |b|| le |a - b|$



          $$text{Let $x=a$ and $y=b-a$.}$$
          begin{align}
          |x|+|y| &ge |x+y| \
          |a| + |b-a| &ge |b| \
          |a| + |a-b| &ge |b| \
          |b| &le |a| + |a-b| \
          -|a-b| &le |a| - |b| tag{1.}
          end{align}



          $$text{Next, let $x=b$ and $y=a-b$.}$$
          begin{align}
          |x|+|y| &ge |x+y| \
          |b| + |a-b| &ge |a| \
          |a| &le |b| + |a-b| \
          |a| - |b| &le |a-b| tag{2.}
          end{align}



          $$text{From $(1.)$ and $(2.)$, we get}$$
          begin{align}
          -|a-b| le |a| - |b| le |a-b| \
          ||a| - |b|| le |a - b|
          end{align}






          share|cite|improve this answer









          $endgroup$





















            0












            $begingroup$

            If you have the already proven the standard form of the triangle inequality.



            $|a+b| le |a|+|b|$



            then you can say.



            $|a-b| = |a+(-b)| le |a|+|-b| = |a|+|b|$



            But you didn't stop there. And, what you do say after that is incorrect. You say "$|a+b| le a+b$" when, in fact, $|a+b| ge a+b$



            As for the second one, I am not following your logic. Here is what I might say.



            $||a|-|b|| = ||(a-b)+b| - |b|| le ||a-b| + |b| - |b|| = |a-b|$



            If you don't have the the proof of the standard form in your back pocket, then square both sides, or brute force the cases:



            $age 0$ and $bge 0, a<0$ and $bge 0, age 0$ and $b< 0, a< 0$ and $b< 0.$






            share|cite|improve this answer









            $endgroup$





















              0












              $begingroup$

              $ lvert a+b rvert leq a+b$ is untrue. A counter example is $a=b=-1$. In fact, the reverse inequality is true by the triangle inequality: $ lvert a+b rvert geq a+b$.



              You need to use two facts for proving the first inequality:



              (1) $a+(-b)=a-b$



              (2) $ lvert -b rvert= lvert b rvert$



              For (b), $lvert lvert a rvert -lvert brvert rvert=lvert a-brvert$ is untrue. A counter examples is a=1 and b=-1.



              A correct reasoning would be noting $lvert a-b rvert=lvert b-a rvert$.
              And $lvert a-b rvert +lvert b rvert geq lvert (a-b)+b rvert=lvert a rvert$ by the trinagle inequality.
              Similarly $lvert b-a rvert +lvert a rvert geq lvert (b-a)+a rvert=lvert b rvert$
              Therefore we have $lvert a-b rvert geq max(lvert a rvert-lvert b rvert,lvert b rvert-lvert a rvert)=lvert lvert a rvert-lvert b rvert rvert$ by the definition of the absolute value.






              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%2f3085273%2fprove-triangle-inequality-for-two-special-cases%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$

                (a) Prove $|a - b| le |a| + |b|$



                We know that $|x|+|y| ge |x+y|$



                $$text{Let $x=a$ and let $y=-b$. Substituting we get}$$



                begin{align}
                |x|+|y| &ge |x+y| \
                |a| + |-b| &ge |a + (-b)| \
                |a| + |b| &ge |a-b| \
                |a-b| &le |a| + |b|
                end{align}



                (b) Prove $||a| - |b|| le |a - b|$



                $$text{Let $x=a$ and $y=b-a$.}$$
                begin{align}
                |x|+|y| &ge |x+y| \
                |a| + |b-a| &ge |b| \
                |a| + |a-b| &ge |b| \
                |b| &le |a| + |a-b| \
                -|a-b| &le |a| - |b| tag{1.}
                end{align}



                $$text{Next, let $x=b$ and $y=a-b$.}$$
                begin{align}
                |x|+|y| &ge |x+y| \
                |b| + |a-b| &ge |a| \
                |a| &le |b| + |a-b| \
                |a| - |b| &le |a-b| tag{2.}
                end{align}



                $$text{From $(1.)$ and $(2.)$, we get}$$
                begin{align}
                -|a-b| le |a| - |b| le |a-b| \
                ||a| - |b|| le |a - b|
                end{align}






                share|cite|improve this answer









                $endgroup$


















                  0












                  $begingroup$

                  (a) Prove $|a - b| le |a| + |b|$



                  We know that $|x|+|y| ge |x+y|$



                  $$text{Let $x=a$ and let $y=-b$. Substituting we get}$$



                  begin{align}
                  |x|+|y| &ge |x+y| \
                  |a| + |-b| &ge |a + (-b)| \
                  |a| + |b| &ge |a-b| \
                  |a-b| &le |a| + |b|
                  end{align}



                  (b) Prove $||a| - |b|| le |a - b|$



                  $$text{Let $x=a$ and $y=b-a$.}$$
                  begin{align}
                  |x|+|y| &ge |x+y| \
                  |a| + |b-a| &ge |b| \
                  |a| + |a-b| &ge |b| \
                  |b| &le |a| + |a-b| \
                  -|a-b| &le |a| - |b| tag{1.}
                  end{align}



                  $$text{Next, let $x=b$ and $y=a-b$.}$$
                  begin{align}
                  |x|+|y| &ge |x+y| \
                  |b| + |a-b| &ge |a| \
                  |a| &le |b| + |a-b| \
                  |a| - |b| &le |a-b| tag{2.}
                  end{align}



                  $$text{From $(1.)$ and $(2.)$, we get}$$
                  begin{align}
                  -|a-b| le |a| - |b| le |a-b| \
                  ||a| - |b|| le |a - b|
                  end{align}






                  share|cite|improve this answer









                  $endgroup$
















                    0












                    0








                    0





                    $begingroup$

                    (a) Prove $|a - b| le |a| + |b|$



                    We know that $|x|+|y| ge |x+y|$



                    $$text{Let $x=a$ and let $y=-b$. Substituting we get}$$



                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |a| + |-b| &ge |a + (-b)| \
                    |a| + |b| &ge |a-b| \
                    |a-b| &le |a| + |b|
                    end{align}



                    (b) Prove $||a| - |b|| le |a - b|$



                    $$text{Let $x=a$ and $y=b-a$.}$$
                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |a| + |b-a| &ge |b| \
                    |a| + |a-b| &ge |b| \
                    |b| &le |a| + |a-b| \
                    -|a-b| &le |a| - |b| tag{1.}
                    end{align}



                    $$text{Next, let $x=b$ and $y=a-b$.}$$
                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |b| + |a-b| &ge |a| \
                    |a| &le |b| + |a-b| \
                    |a| - |b| &le |a-b| tag{2.}
                    end{align}



                    $$text{From $(1.)$ and $(2.)$, we get}$$
                    begin{align}
                    -|a-b| le |a| - |b| le |a-b| \
                    ||a| - |b|| le |a - b|
                    end{align}






                    share|cite|improve this answer









                    $endgroup$



                    (a) Prove $|a - b| le |a| + |b|$



                    We know that $|x|+|y| ge |x+y|$



                    $$text{Let $x=a$ and let $y=-b$. Substituting we get}$$



                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |a| + |-b| &ge |a + (-b)| \
                    |a| + |b| &ge |a-b| \
                    |a-b| &le |a| + |b|
                    end{align}



                    (b) Prove $||a| - |b|| le |a - b|$



                    $$text{Let $x=a$ and $y=b-a$.}$$
                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |a| + |b-a| &ge |b| \
                    |a| + |a-b| &ge |b| \
                    |b| &le |a| + |a-b| \
                    -|a-b| &le |a| - |b| tag{1.}
                    end{align}



                    $$text{Next, let $x=b$ and $y=a-b$.}$$
                    begin{align}
                    |x|+|y| &ge |x+y| \
                    |b| + |a-b| &ge |a| \
                    |a| &le |b| + |a-b| \
                    |a| - |b| &le |a-b| tag{2.}
                    end{align}



                    $$text{From $(1.)$ and $(2.)$, we get}$$
                    begin{align}
                    -|a-b| le |a| - |b| le |a-b| \
                    ||a| - |b|| le |a - b|
                    end{align}







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Jan 24 at 1:22









                    steven gregorysteven gregory

                    18.3k32258




                    18.3k32258























                        0












                        $begingroup$

                        If you have the already proven the standard form of the triangle inequality.



                        $|a+b| le |a|+|b|$



                        then you can say.



                        $|a-b| = |a+(-b)| le |a|+|-b| = |a|+|b|$



                        But you didn't stop there. And, what you do say after that is incorrect. You say "$|a+b| le a+b$" when, in fact, $|a+b| ge a+b$



                        As for the second one, I am not following your logic. Here is what I might say.



                        $||a|-|b|| = ||(a-b)+b| - |b|| le ||a-b| + |b| - |b|| = |a-b|$



                        If you don't have the the proof of the standard form in your back pocket, then square both sides, or brute force the cases:



                        $age 0$ and $bge 0, a<0$ and $bge 0, age 0$ and $b< 0, a< 0$ and $b< 0.$






                        share|cite|improve this answer









                        $endgroup$


















                          0












                          $begingroup$

                          If you have the already proven the standard form of the triangle inequality.



                          $|a+b| le |a|+|b|$



                          then you can say.



                          $|a-b| = |a+(-b)| le |a|+|-b| = |a|+|b|$



                          But you didn't stop there. And, what you do say after that is incorrect. You say "$|a+b| le a+b$" when, in fact, $|a+b| ge a+b$



                          As for the second one, I am not following your logic. Here is what I might say.



                          $||a|-|b|| = ||(a-b)+b| - |b|| le ||a-b| + |b| - |b|| = |a-b|$



                          If you don't have the the proof of the standard form in your back pocket, then square both sides, or brute force the cases:



                          $age 0$ and $bge 0, a<0$ and $bge 0, age 0$ and $b< 0, a< 0$ and $b< 0.$






                          share|cite|improve this answer









                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            If you have the already proven the standard form of the triangle inequality.



                            $|a+b| le |a|+|b|$



                            then you can say.



                            $|a-b| = |a+(-b)| le |a|+|-b| = |a|+|b|$



                            But you didn't stop there. And, what you do say after that is incorrect. You say "$|a+b| le a+b$" when, in fact, $|a+b| ge a+b$



                            As for the second one, I am not following your logic. Here is what I might say.



                            $||a|-|b|| = ||(a-b)+b| - |b|| le ||a-b| + |b| - |b|| = |a-b|$



                            If you don't have the the proof of the standard form in your back pocket, then square both sides, or brute force the cases:



                            $age 0$ and $bge 0, a<0$ and $bge 0, age 0$ and $b< 0, a< 0$ and $b< 0.$






                            share|cite|improve this answer









                            $endgroup$



                            If you have the already proven the standard form of the triangle inequality.



                            $|a+b| le |a|+|b|$



                            then you can say.



                            $|a-b| = |a+(-b)| le |a|+|-b| = |a|+|b|$



                            But you didn't stop there. And, what you do say after that is incorrect. You say "$|a+b| le a+b$" when, in fact, $|a+b| ge a+b$



                            As for the second one, I am not following your logic. Here is what I might say.



                            $||a|-|b|| = ||(a-b)+b| - |b|| le ||a-b| + |b| - |b|| = |a-b|$



                            If you don't have the the proof of the standard form in your back pocket, then square both sides, or brute force the cases:



                            $age 0$ and $bge 0, a<0$ and $bge 0, age 0$ and $b< 0, a< 0$ and $b< 0.$







                            share|cite|improve this answer












                            share|cite|improve this answer



                            share|cite|improve this answer










                            answered Jan 24 at 1:02









                            Doug MDoug M

                            45.3k31954




                            45.3k31954























                                0












                                $begingroup$

                                $ lvert a+b rvert leq a+b$ is untrue. A counter example is $a=b=-1$. In fact, the reverse inequality is true by the triangle inequality: $ lvert a+b rvert geq a+b$.



                                You need to use two facts for proving the first inequality:



                                (1) $a+(-b)=a-b$



                                (2) $ lvert -b rvert= lvert b rvert$



                                For (b), $lvert lvert a rvert -lvert brvert rvert=lvert a-brvert$ is untrue. A counter examples is a=1 and b=-1.



                                A correct reasoning would be noting $lvert a-b rvert=lvert b-a rvert$.
                                And $lvert a-b rvert +lvert b rvert geq lvert (a-b)+b rvert=lvert a rvert$ by the trinagle inequality.
                                Similarly $lvert b-a rvert +lvert a rvert geq lvert (b-a)+a rvert=lvert b rvert$
                                Therefore we have $lvert a-b rvert geq max(lvert a rvert-lvert b rvert,lvert b rvert-lvert a rvert)=lvert lvert a rvert-lvert b rvert rvert$ by the definition of the absolute value.






                                share|cite|improve this answer









                                $endgroup$


















                                  0












                                  $begingroup$

                                  $ lvert a+b rvert leq a+b$ is untrue. A counter example is $a=b=-1$. In fact, the reverse inequality is true by the triangle inequality: $ lvert a+b rvert geq a+b$.



                                  You need to use two facts for proving the first inequality:



                                  (1) $a+(-b)=a-b$



                                  (2) $ lvert -b rvert= lvert b rvert$



                                  For (b), $lvert lvert a rvert -lvert brvert rvert=lvert a-brvert$ is untrue. A counter examples is a=1 and b=-1.



                                  A correct reasoning would be noting $lvert a-b rvert=lvert b-a rvert$.
                                  And $lvert a-b rvert +lvert b rvert geq lvert (a-b)+b rvert=lvert a rvert$ by the trinagle inequality.
                                  Similarly $lvert b-a rvert +lvert a rvert geq lvert (b-a)+a rvert=lvert b rvert$
                                  Therefore we have $lvert a-b rvert geq max(lvert a rvert-lvert b rvert,lvert b rvert-lvert a rvert)=lvert lvert a rvert-lvert b rvert rvert$ by the definition of the absolute value.






                                  share|cite|improve this answer









                                  $endgroup$
















                                    0












                                    0








                                    0





                                    $begingroup$

                                    $ lvert a+b rvert leq a+b$ is untrue. A counter example is $a=b=-1$. In fact, the reverse inequality is true by the triangle inequality: $ lvert a+b rvert geq a+b$.



                                    You need to use two facts for proving the first inequality:



                                    (1) $a+(-b)=a-b$



                                    (2) $ lvert -b rvert= lvert b rvert$



                                    For (b), $lvert lvert a rvert -lvert brvert rvert=lvert a-brvert$ is untrue. A counter examples is a=1 and b=-1.



                                    A correct reasoning would be noting $lvert a-b rvert=lvert b-a rvert$.
                                    And $lvert a-b rvert +lvert b rvert geq lvert (a-b)+b rvert=lvert a rvert$ by the trinagle inequality.
                                    Similarly $lvert b-a rvert +lvert a rvert geq lvert (b-a)+a rvert=lvert b rvert$
                                    Therefore we have $lvert a-b rvert geq max(lvert a rvert-lvert b rvert,lvert b rvert-lvert a rvert)=lvert lvert a rvert-lvert b rvert rvert$ by the definition of the absolute value.






                                    share|cite|improve this answer









                                    $endgroup$



                                    $ lvert a+b rvert leq a+b$ is untrue. A counter example is $a=b=-1$. In fact, the reverse inequality is true by the triangle inequality: $ lvert a+b rvert geq a+b$.



                                    You need to use two facts for proving the first inequality:



                                    (1) $a+(-b)=a-b$



                                    (2) $ lvert -b rvert= lvert b rvert$



                                    For (b), $lvert lvert a rvert -lvert brvert rvert=lvert a-brvert$ is untrue. A counter examples is a=1 and b=-1.



                                    A correct reasoning would be noting $lvert a-b rvert=lvert b-a rvert$.
                                    And $lvert a-b rvert +lvert b rvert geq lvert (a-b)+b rvert=lvert a rvert$ by the trinagle inequality.
                                    Similarly $lvert b-a rvert +lvert a rvert geq lvert (b-a)+a rvert=lvert b rvert$
                                    Therefore we have $lvert a-b rvert geq max(lvert a rvert-lvert b rvert,lvert b rvert-lvert a rvert)=lvert lvert a rvert-lvert b rvert rvert$ by the definition of the absolute value.







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Jan 24 at 1:02









                                    NotoriousJuanGNotoriousJuanG

                                    843




                                    843






























                                        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%2f3085273%2fprove-triangle-inequality-for-two-special-cases%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

                                        MongoDB - Not Authorized To Execute Command

                                        How to fix TextFormField cause rebuild widget in Flutter

                                        in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith