Why is my textbook using a rather long proof involving sequences?

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











up vote
2
down vote

favorite












Claim: If $K_1$ and $K_2$ are disjoint nonempty compact sets, show that $exists k_iin K_i$ such that $0<vert k_1-k_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$.



Can't we simply say that if $0=vert y_1-y_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$, then $y_1in K_1cap K_2$ - a contradiction?



here what the book provided:
enter image description here







share|cite|improve this question















  • 2




    But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
    – Suzet
    Jul 22 at 5:50







  • 2




    No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
    – Jair Taylor
    Jul 22 at 5:50






  • 4




    The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
    – Rhys Steele
    Jul 22 at 5:50






  • 1




    I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
    – Lord Shark the Unknown
    Jul 22 at 5:56






  • 2




    inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
    – fleablood
    Jul 22 at 5:58














up vote
2
down vote

favorite












Claim: If $K_1$ and $K_2$ are disjoint nonempty compact sets, show that $exists k_iin K_i$ such that $0<vert k_1-k_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$.



Can't we simply say that if $0=vert y_1-y_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$, then $y_1in K_1cap K_2$ - a contradiction?



here what the book provided:
enter image description here







share|cite|improve this question















  • 2




    But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
    – Suzet
    Jul 22 at 5:50







  • 2




    No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
    – Jair Taylor
    Jul 22 at 5:50






  • 4




    The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
    – Rhys Steele
    Jul 22 at 5:50






  • 1




    I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
    – Lord Shark the Unknown
    Jul 22 at 5:56






  • 2




    inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
    – fleablood
    Jul 22 at 5:58












up vote
2
down vote

favorite









up vote
2
down vote

favorite











Claim: If $K_1$ and $K_2$ are disjoint nonempty compact sets, show that $exists k_iin K_i$ such that $0<vert k_1-k_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$.



Can't we simply say that if $0=vert y_1-y_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$, then $y_1in K_1cap K_2$ - a contradiction?



here what the book provided:
enter image description here







share|cite|improve this question











Claim: If $K_1$ and $K_2$ are disjoint nonempty compact sets, show that $exists k_iin K_i$ such that $0<vert k_1-k_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$.



Can't we simply say that if $0=vert y_1-y_2vert=infvert x_1-x_2vert : x_1in K_1 quadlandquad x_2in K_2$, then $y_1in K_1cap K_2$ - a contradiction?



here what the book provided:
enter image description here









share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Jul 22 at 5:45









TheLast Cipher

538414




538414







  • 2




    But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
    – Suzet
    Jul 22 at 5:50







  • 2




    No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
    – Jair Taylor
    Jul 22 at 5:50






  • 4




    The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
    – Rhys Steele
    Jul 22 at 5:50






  • 1




    I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
    – Lord Shark the Unknown
    Jul 22 at 5:56






  • 2




    inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
    – fleablood
    Jul 22 at 5:58












  • 2




    But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
    – Suzet
    Jul 22 at 5:50







  • 2




    No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
    – Jair Taylor
    Jul 22 at 5:50






  • 4




    The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
    – Rhys Steele
    Jul 22 at 5:50






  • 1




    I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
    – Lord Shark the Unknown
    Jul 22 at 5:56






  • 2




    inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
    – fleablood
    Jul 22 at 5:58







2




2




But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
– Suzet
Jul 22 at 5:50





But how do you define $y_1$ and $y_2$? You did not justify that your infimum may be written as $|y_1-y_2|$ with $y_1in K_1$ and $y_2in K_2$. However, this is required by the claim.
– Suzet
Jul 22 at 5:50





2




2




No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
– Jair Taylor
Jul 22 at 5:50




No. You need to use compactness somehow. e.g., Consider $K_1 = 0$ and $K_2 = 1/n $.
– Jair Taylor
Jul 22 at 5:50




4




4




The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
– Rhys Steele
Jul 22 at 5:50




The non-trivial claim is that the $inf$ is attained by some $k_1, k_2$, not that the $inf$ is strictly positive
– Rhys Steele
Jul 22 at 5:50




1




1




I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
– Lord Shark the Unknown
Jul 22 at 5:56




I presume this is because the book has not proved one of (i) the product of two compact spaces is compact, (ii) the image of a compact set under a continuous map is compact, (iii) a compact subset of $Bbb R$ is closed.
– Lord Shark the Unknown
Jul 22 at 5:56




2




2




inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
– fleablood
Jul 22 at 5:58




inf is not min. You have no idea that any $|y_1 - y_2| = inf$ exist.
– fleablood
Jul 22 at 5:58










2 Answers
2






active

oldest

votes

















up vote
3
down vote



accepted










$A < B = C$ is a shorthand for $A < B$ and $B = C$.

You seem to think that its negation is $A ge B = C$ (a shorthand for $A ge B$ and $B = C$)

But that is not the case : its negation is $A ge B$ or $B neq C$.



So it is not valid to prove $A < B = C$ by assuming $A ge B = C$ and getting a contradiction.






share|cite|improve this answer




























    up vote
    4
    down vote













    Here's a short proof if you want it:



    $K_1$ and $K_2$ are compact, so $K_1 times K_2$ is compact by Tychonoff. The function $K_1 times K_2 to Bbb R$ sending $(x_1, x_2)$ to $|x_1 - x_2|$ is continuous, so the range is compact, so it has a minimum which can be expressed as $|k_1 - k_2|$ for some $k_1 in K_1$ and $k_2 in K_2$.






    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%2f2859133%2fwhy-is-my-textbook-using-a-rather-long-proof-involving-sequences%23new-answer', 'question_page');

      );

      Post as a guest






























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      3
      down vote



      accepted










      $A < B = C$ is a shorthand for $A < B$ and $B = C$.

      You seem to think that its negation is $A ge B = C$ (a shorthand for $A ge B$ and $B = C$)

      But that is not the case : its negation is $A ge B$ or $B neq C$.



      So it is not valid to prove $A < B = C$ by assuming $A ge B = C$ and getting a contradiction.






      share|cite|improve this answer

























        up vote
        3
        down vote



        accepted










        $A < B = C$ is a shorthand for $A < B$ and $B = C$.

        You seem to think that its negation is $A ge B = C$ (a shorthand for $A ge B$ and $B = C$)

        But that is not the case : its negation is $A ge B$ or $B neq C$.



        So it is not valid to prove $A < B = C$ by assuming $A ge B = C$ and getting a contradiction.






        share|cite|improve this answer























          up vote
          3
          down vote



          accepted







          up vote
          3
          down vote



          accepted






          $A < B = C$ is a shorthand for $A < B$ and $B = C$.

          You seem to think that its negation is $A ge B = C$ (a shorthand for $A ge B$ and $B = C$)

          But that is not the case : its negation is $A ge B$ or $B neq C$.



          So it is not valid to prove $A < B = C$ by assuming $A ge B = C$ and getting a contradiction.






          share|cite|improve this answer













          $A < B = C$ is a shorthand for $A < B$ and $B = C$.

          You seem to think that its negation is $A ge B = C$ (a shorthand for $A ge B$ and $B = C$)

          But that is not the case : its negation is $A ge B$ or $B neq C$.



          So it is not valid to prove $A < B = C$ by assuming $A ge B = C$ and getting a contradiction.







          share|cite|improve this answer













          share|cite|improve this answer



          share|cite|improve this answer











          answered Jul 22 at 7:35









          mercio

          43.9k256107




          43.9k256107




















              up vote
              4
              down vote













              Here's a short proof if you want it:



              $K_1$ and $K_2$ are compact, so $K_1 times K_2$ is compact by Tychonoff. The function $K_1 times K_2 to Bbb R$ sending $(x_1, x_2)$ to $|x_1 - x_2|$ is continuous, so the range is compact, so it has a minimum which can be expressed as $|k_1 - k_2|$ for some $k_1 in K_1$ and $k_2 in K_2$.






              share|cite|improve this answer

























                up vote
                4
                down vote













                Here's a short proof if you want it:



                $K_1$ and $K_2$ are compact, so $K_1 times K_2$ is compact by Tychonoff. The function $K_1 times K_2 to Bbb R$ sending $(x_1, x_2)$ to $|x_1 - x_2|$ is continuous, so the range is compact, so it has a minimum which can be expressed as $|k_1 - k_2|$ for some $k_1 in K_1$ and $k_2 in K_2$.






                share|cite|improve this answer























                  up vote
                  4
                  down vote










                  up vote
                  4
                  down vote









                  Here's a short proof if you want it:



                  $K_1$ and $K_2$ are compact, so $K_1 times K_2$ is compact by Tychonoff. The function $K_1 times K_2 to Bbb R$ sending $(x_1, x_2)$ to $|x_1 - x_2|$ is continuous, so the range is compact, so it has a minimum which can be expressed as $|k_1 - k_2|$ for some $k_1 in K_1$ and $k_2 in K_2$.






                  share|cite|improve this answer













                  Here's a short proof if you want it:



                  $K_1$ and $K_2$ are compact, so $K_1 times K_2$ is compact by Tychonoff. The function $K_1 times K_2 to Bbb R$ sending $(x_1, x_2)$ to $|x_1 - x_2|$ is continuous, so the range is compact, so it has a minimum which can be expressed as $|k_1 - k_2|$ for some $k_1 in K_1$ and $k_2 in K_2$.







                  share|cite|improve this answer













                  share|cite|improve this answer



                  share|cite|improve this answer











                  answered Jul 22 at 6:37









                  Kenny Lau

                  18.7k2157




                  18.7k2157






















                       

                      draft saved


                      draft discarded


























                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2859133%2fwhy-is-my-textbook-using-a-rather-long-proof-involving-sequences%23new-answer', 'question_page');

                      );

                      Post as a guest













































































                      Comments

                      Popular posts from this blog

                      What is the equation of a 3D cone with generalised tilt?

                      Color the edges and diagonals of a regular polygon

                      Relationship between determinant of matrix and determinant of adjoint?