How can I prove that $d(A,B)=d(A,bar{B})=d(bar{A},bar{B})$












1












$begingroup$


How can I prove that $d(A,B)=d(A,bar{B})=d(bar{A},bar{B})$



$bar{A}$ is the set of all accumulation points $A$



If $d(A,B)=inf{ d(a,b)$ with $ain A , bin B}=alpha$



$d(A,bar{B})=inf{ d(a,b)$ with $ain A , bin bar{B}}=beta$



$d(bar{A},bar{B})=inf{ d(a,b)$ with $ain bar{A} , bin bar{B}}=gamma$



I proved that $alpha geq beta geq gamma$










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
    $endgroup$
    – parsiad
    Jan 9 at 1:56










  • $begingroup$
    $inf$ has the special command inf
    $endgroup$
    – Chase Ryan Taylor
    Jan 9 at 2:30
















1












$begingroup$


How can I prove that $d(A,B)=d(A,bar{B})=d(bar{A},bar{B})$



$bar{A}$ is the set of all accumulation points $A$



If $d(A,B)=inf{ d(a,b)$ with $ain A , bin B}=alpha$



$d(A,bar{B})=inf{ d(a,b)$ with $ain A , bin bar{B}}=beta$



$d(bar{A},bar{B})=inf{ d(a,b)$ with $ain bar{A} , bin bar{B}}=gamma$



I proved that $alpha geq beta geq gamma$










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
    $endgroup$
    – parsiad
    Jan 9 at 1:56










  • $begingroup$
    $inf$ has the special command inf
    $endgroup$
    – Chase Ryan Taylor
    Jan 9 at 2:30














1












1








1


1



$begingroup$


How can I prove that $d(A,B)=d(A,bar{B})=d(bar{A},bar{B})$



$bar{A}$ is the set of all accumulation points $A$



If $d(A,B)=inf{ d(a,b)$ with $ain A , bin B}=alpha$



$d(A,bar{B})=inf{ d(a,b)$ with $ain A , bin bar{B}}=beta$



$d(bar{A},bar{B})=inf{ d(a,b)$ with $ain bar{A} , bin bar{B}}=gamma$



I proved that $alpha geq beta geq gamma$










share|cite|improve this question











$endgroup$




How can I prove that $d(A,B)=d(A,bar{B})=d(bar{A},bar{B})$



$bar{A}$ is the set of all accumulation points $A$



If $d(A,B)=inf{ d(a,b)$ with $ain A , bin B}=alpha$



$d(A,bar{B})=inf{ d(a,b)$ with $ain A , bin bar{B}}=beta$



$d(bar{A},bar{B})=inf{ d(a,b)$ with $ain bar{A} , bin bar{B}}=gamma$



I proved that $alpha geq beta geq gamma$







general-topology analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 9 at 5:22









Henno Brandsma

108k347114




108k347114










asked Jan 9 at 1:52









Ivan S. GuerraIvan S. Guerra

349113




349113








  • 2




    $begingroup$
    I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
    $endgroup$
    – parsiad
    Jan 9 at 1:56










  • $begingroup$
    $inf$ has the special command inf
    $endgroup$
    – Chase Ryan Taylor
    Jan 9 at 2:30














  • 2




    $begingroup$
    I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
    $endgroup$
    – parsiad
    Jan 9 at 1:56










  • $begingroup$
    $inf$ has the special command inf
    $endgroup$
    – Chase Ryan Taylor
    Jan 9 at 2:30








2




2




$begingroup$
I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
$endgroup$
– parsiad
Jan 9 at 1:56




$begingroup$
I think you mean $geq$, not $>$. Otherwise you would have disproved your claim.
$endgroup$
– parsiad
Jan 9 at 1:56












$begingroup$
$inf$ has the special command inf
$endgroup$
– Chase Ryan Taylor
Jan 9 at 2:30




$begingroup$
$inf$ has the special command inf
$endgroup$
– Chase Ryan Taylor
Jan 9 at 2:30










3 Answers
3






active

oldest

votes


















1












$begingroup$

For every $c>0$, there exists $x in A, yin bar B$ such that $d(x,y)leq d(A,bar B)+c/2$. There exists $y'in B$ such that $d(y',y)<c/2$, $d(A,B)leq d(x,y')leq d(x,y)+d(y,y')leq d(A,bar B)+c/2+c/2$. This implies that $d(A,B)leq d(A,bar B)$ and $d(A,B)=d(A,bar B)$ from the equality that you have proven.



$d(A,B)=d(A,bar B)$ implies that $d(B,bar A)=d(B,A)$ and $d(bar A,B)=d(bar A,bar B)$, the result follows from the fact that $d(A,B)=d(B,A)$.






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    For any $epsilon >0$ there exist $xin bar A, yin bar B$ with $d(x,y)<gamma+epsilon $ and there exist $x'in X, y'in Y$ with $d(x',x)<epsilon$ and $d(y,y')<epsilon.$ Then $$alpha le d(x',y')le d(x',x)+d(x,y)+d(y,y')<gamma+3epsilon.$$ Hence $$forall epsilon >0;(alpha<gamma+3epsilon)$$ which is not possible unless $$alphale gamma.$$ Since you already have $gamma le beta le alpha$, therefore $$alphale gammale beta le alpha;.$$






    share|cite|improve this answer











    $endgroup$





















      0












      $begingroup$

      Clearly, $betaleqalpha$ since $Bsubsetbar{B}$.



      Suppose, in order to obtain a contradiction, that $beta<alpha$.
      Then, we can find $a$ in $A$ and $b$ in $bar{B}$ such that $d(a,b)leqgamma$ where $gammaequiv(beta+alpha)/2<alpha$.
      We can also find a sequence of points $(b_{n})_{n}$ in $B$ such that $b_{n}rightarrow b$.
      By continuity, $d(a,b_{n})rightarrow d(a, b)$, which in turn implies that we can find some $n$ sufficiently large with $d(a,b_{n})<alpha$, contradicting the minimality of $alpha$.



      We have established $alpha = beta$.



      To get $beta = gamma$, we can apply the same argument, reversing the roles of $A$ and $B$.






      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%2f3066980%2fhow-can-i-prove-that-da-b-da-barb-d-bara-barb%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









        1












        $begingroup$

        For every $c>0$, there exists $x in A, yin bar B$ such that $d(x,y)leq d(A,bar B)+c/2$. There exists $y'in B$ such that $d(y',y)<c/2$, $d(A,B)leq d(x,y')leq d(x,y)+d(y,y')leq d(A,bar B)+c/2+c/2$. This implies that $d(A,B)leq d(A,bar B)$ and $d(A,B)=d(A,bar B)$ from the equality that you have proven.



        $d(A,B)=d(A,bar B)$ implies that $d(B,bar A)=d(B,A)$ and $d(bar A,B)=d(bar A,bar B)$, the result follows from the fact that $d(A,B)=d(B,A)$.






        share|cite|improve this answer









        $endgroup$


















          1












          $begingroup$

          For every $c>0$, there exists $x in A, yin bar B$ such that $d(x,y)leq d(A,bar B)+c/2$. There exists $y'in B$ such that $d(y',y)<c/2$, $d(A,B)leq d(x,y')leq d(x,y)+d(y,y')leq d(A,bar B)+c/2+c/2$. This implies that $d(A,B)leq d(A,bar B)$ and $d(A,B)=d(A,bar B)$ from the equality that you have proven.



          $d(A,B)=d(A,bar B)$ implies that $d(B,bar A)=d(B,A)$ and $d(bar A,B)=d(bar A,bar B)$, the result follows from the fact that $d(A,B)=d(B,A)$.






          share|cite|improve this answer









          $endgroup$
















            1












            1








            1





            $begingroup$

            For every $c>0$, there exists $x in A, yin bar B$ such that $d(x,y)leq d(A,bar B)+c/2$. There exists $y'in B$ such that $d(y',y)<c/2$, $d(A,B)leq d(x,y')leq d(x,y)+d(y,y')leq d(A,bar B)+c/2+c/2$. This implies that $d(A,B)leq d(A,bar B)$ and $d(A,B)=d(A,bar B)$ from the equality that you have proven.



            $d(A,B)=d(A,bar B)$ implies that $d(B,bar A)=d(B,A)$ and $d(bar A,B)=d(bar A,bar B)$, the result follows from the fact that $d(A,B)=d(B,A)$.






            share|cite|improve this answer









            $endgroup$



            For every $c>0$, there exists $x in A, yin bar B$ such that $d(x,y)leq d(A,bar B)+c/2$. There exists $y'in B$ such that $d(y',y)<c/2$, $d(A,B)leq d(x,y')leq d(x,y)+d(y,y')leq d(A,bar B)+c/2+c/2$. This implies that $d(A,B)leq d(A,bar B)$ and $d(A,B)=d(A,bar B)$ from the equality that you have proven.



            $d(A,B)=d(A,bar B)$ implies that $d(B,bar A)=d(B,A)$ and $d(bar A,B)=d(bar A,bar B)$, the result follows from the fact that $d(A,B)=d(B,A)$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 9 at 2:03









            Tsemo AristideTsemo Aristide

            57.6k11444




            57.6k11444























                1












                $begingroup$

                For any $epsilon >0$ there exist $xin bar A, yin bar B$ with $d(x,y)<gamma+epsilon $ and there exist $x'in X, y'in Y$ with $d(x',x)<epsilon$ and $d(y,y')<epsilon.$ Then $$alpha le d(x',y')le d(x',x)+d(x,y)+d(y,y')<gamma+3epsilon.$$ Hence $$forall epsilon >0;(alpha<gamma+3epsilon)$$ which is not possible unless $$alphale gamma.$$ Since you already have $gamma le beta le alpha$, therefore $$alphale gammale beta le alpha;.$$






                share|cite|improve this answer











                $endgroup$


















                  1












                  $begingroup$

                  For any $epsilon >0$ there exist $xin bar A, yin bar B$ with $d(x,y)<gamma+epsilon $ and there exist $x'in X, y'in Y$ with $d(x',x)<epsilon$ and $d(y,y')<epsilon.$ Then $$alpha le d(x',y')le d(x',x)+d(x,y)+d(y,y')<gamma+3epsilon.$$ Hence $$forall epsilon >0;(alpha<gamma+3epsilon)$$ which is not possible unless $$alphale gamma.$$ Since you already have $gamma le beta le alpha$, therefore $$alphale gammale beta le alpha;.$$






                  share|cite|improve this answer











                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$

                    For any $epsilon >0$ there exist $xin bar A, yin bar B$ with $d(x,y)<gamma+epsilon $ and there exist $x'in X, y'in Y$ with $d(x',x)<epsilon$ and $d(y,y')<epsilon.$ Then $$alpha le d(x',y')le d(x',x)+d(x,y)+d(y,y')<gamma+3epsilon.$$ Hence $$forall epsilon >0;(alpha<gamma+3epsilon)$$ which is not possible unless $$alphale gamma.$$ Since you already have $gamma le beta le alpha$, therefore $$alphale gammale beta le alpha;.$$






                    share|cite|improve this answer











                    $endgroup$



                    For any $epsilon >0$ there exist $xin bar A, yin bar B$ with $d(x,y)<gamma+epsilon $ and there exist $x'in X, y'in Y$ with $d(x',x)<epsilon$ and $d(y,y')<epsilon.$ Then $$alpha le d(x',y')le d(x',x)+d(x,y)+d(y,y')<gamma+3epsilon.$$ Hence $$forall epsilon >0;(alpha<gamma+3epsilon)$$ which is not possible unless $$alphale gamma.$$ Since you already have $gamma le beta le alpha$, therefore $$alphale gammale beta le alpha;.$$







                    share|cite|improve this answer














                    share|cite|improve this answer



                    share|cite|improve this answer








                    edited Jan 9 at 8:19

























                    answered Jan 9 at 8:14









                    DanielWainfleetDanielWainfleet

                    34.9k31648




                    34.9k31648























                        0












                        $begingroup$

                        Clearly, $betaleqalpha$ since $Bsubsetbar{B}$.



                        Suppose, in order to obtain a contradiction, that $beta<alpha$.
                        Then, we can find $a$ in $A$ and $b$ in $bar{B}$ such that $d(a,b)leqgamma$ where $gammaequiv(beta+alpha)/2<alpha$.
                        We can also find a sequence of points $(b_{n})_{n}$ in $B$ such that $b_{n}rightarrow b$.
                        By continuity, $d(a,b_{n})rightarrow d(a, b)$, which in turn implies that we can find some $n$ sufficiently large with $d(a,b_{n})<alpha$, contradicting the minimality of $alpha$.



                        We have established $alpha = beta$.



                        To get $beta = gamma$, we can apply the same argument, reversing the roles of $A$ and $B$.






                        share|cite|improve this answer











                        $endgroup$


















                          0












                          $begingroup$

                          Clearly, $betaleqalpha$ since $Bsubsetbar{B}$.



                          Suppose, in order to obtain a contradiction, that $beta<alpha$.
                          Then, we can find $a$ in $A$ and $b$ in $bar{B}$ such that $d(a,b)leqgamma$ where $gammaequiv(beta+alpha)/2<alpha$.
                          We can also find a sequence of points $(b_{n})_{n}$ in $B$ such that $b_{n}rightarrow b$.
                          By continuity, $d(a,b_{n})rightarrow d(a, b)$, which in turn implies that we can find some $n$ sufficiently large with $d(a,b_{n})<alpha$, contradicting the minimality of $alpha$.



                          We have established $alpha = beta$.



                          To get $beta = gamma$, we can apply the same argument, reversing the roles of $A$ and $B$.






                          share|cite|improve this answer











                          $endgroup$
















                            0












                            0








                            0





                            $begingroup$

                            Clearly, $betaleqalpha$ since $Bsubsetbar{B}$.



                            Suppose, in order to obtain a contradiction, that $beta<alpha$.
                            Then, we can find $a$ in $A$ and $b$ in $bar{B}$ such that $d(a,b)leqgamma$ where $gammaequiv(beta+alpha)/2<alpha$.
                            We can also find a sequence of points $(b_{n})_{n}$ in $B$ such that $b_{n}rightarrow b$.
                            By continuity, $d(a,b_{n})rightarrow d(a, b)$, which in turn implies that we can find some $n$ sufficiently large with $d(a,b_{n})<alpha$, contradicting the minimality of $alpha$.



                            We have established $alpha = beta$.



                            To get $beta = gamma$, we can apply the same argument, reversing the roles of $A$ and $B$.






                            share|cite|improve this answer











                            $endgroup$



                            Clearly, $betaleqalpha$ since $Bsubsetbar{B}$.



                            Suppose, in order to obtain a contradiction, that $beta<alpha$.
                            Then, we can find $a$ in $A$ and $b$ in $bar{B}$ such that $d(a,b)leqgamma$ where $gammaequiv(beta+alpha)/2<alpha$.
                            We can also find a sequence of points $(b_{n})_{n}$ in $B$ such that $b_{n}rightarrow b$.
                            By continuity, $d(a,b_{n})rightarrow d(a, b)$, which in turn implies that we can find some $n$ sufficiently large with $d(a,b_{n})<alpha$, contradicting the minimality of $alpha$.



                            We have established $alpha = beta$.



                            To get $beta = gamma$, we can apply the same argument, reversing the roles of $A$ and $B$.







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Jan 9 at 2:18

























                            answered Jan 9 at 2:11









                            parsiadparsiad

                            17.1k32353




                            17.1k32353






























                                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%2f3066980%2fhow-can-i-prove-that-da-b-da-barb-d-bara-barb%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

                                Npm cannot find a required file even through it is in the searched directory

                                How to fix TextFormField cause rebuild widget in Flutter