Distance to closed and convex sets that have intersection $C subseteq D rightarrow$ $ d_D(x^*) leq d_C(x^*) $












0














Let $C subseteq mathbb{R}^n$ be a closed convex set, and $x^* in C^c$ (not in $C$ and its closure).



Define the Euclidean distance from $x^*$ to $C$ as $d_C(x^*):=min_{z in C}|z -x^*|_2$.



Let $D$ be a closed convex set containing $C$, i.e., $C subseteq D$.



Show that
$$
d_D(x^*) leq d_C(x^*)
$$



I do not know how to use $C subseteq D$ together with taking minimum.






optimization convex-optimization projective-geometry







share|cite|improve this question






















  • Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
    – B.Swan
    Nov 25 at 7:57


















0














Let $C subseteq mathbb{R}^n$ be a closed convex set, and $x^* in C^c$ (not in $C$ and its closure).



Define the Euclidean distance from $x^*$ to $C$ as $d_C(x^*):=min_{z in C}|z -x^*|_2$.



Let $D$ be a closed convex set containing $C$, i.e., $C subseteq D$.



Show that
$$
d_D(x^*) leq d_C(x^*)
$$



I do not know how to use $C subseteq D$ together with taking minimum.






optimization convex-optimization projective-geometry







share|cite|improve this question






















  • Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
    – B.Swan
    Nov 25 at 7:57
















0












0








0







Let $C subseteq mathbb{R}^n$ be a closed convex set, and $x^* in C^c$ (not in $C$ and its closure).



Define the Euclidean distance from $x^*$ to $C$ as $d_C(x^*):=min_{z in C}|z -x^*|_2$.



Let $D$ be a closed convex set containing $C$, i.e., $C subseteq D$.



Show that
$$
d_D(x^*) leq d_C(x^*)
$$



I do not know how to use $C subseteq D$ together with taking minimum.






optimization convex-optimization projective-geometry







share|cite|improve this question













Let $C subseteq mathbb{R}^n$ be a closed convex set, and $x^* in C^c$ (not in $C$ and its closure).



Define the Euclidean distance from $x^*$ to $C$ as $d_C(x^*):=min_{z in C}|z -x^*|_2$.



Let $D$ be a closed convex set containing $C$, i.e., $C subseteq D$.



Show that
$$
d_D(x^*) leq d_C(x^*)
$$



I do not know how to use $C subseteq D$ together with taking minimum.






optimization convex-optimization projective-geometry




optimization convex-optimization projective-geometry






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 25 at 7:53









Saeed

580110




580110












  • Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
    – B.Swan
    Nov 25 at 7:57




















  • Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
    – B.Swan
    Nov 25 at 7:57


















Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
– B.Swan
Nov 25 at 7:57






Assume the distance is strictly smaller, use minimum property and that every element in $C$ is an element in $D$. That leads to a contradiction.
– B.Swan
Nov 25 at 7:57












2 Answers
2






active

oldest

votes


















1














Since $C subseteq D$, the minimum over $C$ can only be greater or equal to the minimum over $D$, so



$$d_D(x^*)=min_{z in D}|z -x^*|_2 leq min_{z in C}|z -x^*|_2= d_D(x^*)$$






share|cite|improve this answer





























    0














    for $forall z in D$ and $yin C$, we have
    begin{align}
    d_D(x^*) &= min_{z in D} |z-x^*|_2 \
    &= min_{yin C} |(z_{best} -y)+ (y-x^*)|_2 \
    &leq min_{y in C}|z_{best}-y|_2 + min_{y in C}|y-x^*|_2 \
    & leq min_{yin C}|y-x^*|_2 \
    &=d_C(x^*)
    end{align}




    Answer above has mistakes. while, maybe we can try a new way to solve this.



    Notice that for any element $y in C$, because $C subseteq D$, so that $y in D$, and another element $z_{best} in D$, satisfy $d_D(x^*)=min_{z in D} |z-x^*|_2=|z_{best}-x^*|_2$, from this definition, it is quite clear to see
    $$ |y-x^*|_2 geq |z_{best}-x^*|_2, forall y in C$$
    which results in
    $$d_C(x^*) = min_{yin C}|y-x^*|_2 geq |z_{best}-x^*|_2 = d_D(x^*)$$






    share|cite|improve this answer























    • How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
      – Saeed
      Nov 25 at 18:59










    • You are right! And I post a new solution under the original one. I hope it can help you.
      – Caldera
      Nov 26 at 7:50











    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%2f3012558%2fdistance-to-closed-and-convex-sets-that-have-intersection-c-subseteq-d-righta%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1














    Since $C subseteq D$, the minimum over $C$ can only be greater or equal to the minimum over $D$, so



    $$d_D(x^*)=min_{z in D}|z -x^*|_2 leq min_{z in C}|z -x^*|_2= d_D(x^*)$$






    share|cite|improve this answer


























      1














      Since $C subseteq D$, the minimum over $C$ can only be greater or equal to the minimum over $D$, so



      $$d_D(x^*)=min_{z in D}|z -x^*|_2 leq min_{z in C}|z -x^*|_2= d_D(x^*)$$






      share|cite|improve this answer
























        1












        1








        1






        Since $C subseteq D$, the minimum over $C$ can only be greater or equal to the minimum over $D$, so



        $$d_D(x^*)=min_{z in D}|z -x^*|_2 leq min_{z in C}|z -x^*|_2= d_D(x^*)$$






        share|cite|improve this answer












        Since $C subseteq D$, the minimum over $C$ can only be greater or equal to the minimum over $D$, so



        $$d_D(x^*)=min_{z in D}|z -x^*|_2 leq min_{z in C}|z -x^*|_2= d_D(x^*)$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 25 at 8:05









        B.Swan

        1,0011719




        1,0011719























            0














            for $forall z in D$ and $yin C$, we have
            begin{align}
            d_D(x^*) &= min_{z in D} |z-x^*|_2 \
            &= min_{yin C} |(z_{best} -y)+ (y-x^*)|_2 \
            &leq min_{y in C}|z_{best}-y|_2 + min_{y in C}|y-x^*|_2 \
            & leq min_{yin C}|y-x^*|_2 \
            &=d_C(x^*)
            end{align}




            Answer above has mistakes. while, maybe we can try a new way to solve this.



            Notice that for any element $y in C$, because $C subseteq D$, so that $y in D$, and another element $z_{best} in D$, satisfy $d_D(x^*)=min_{z in D} |z-x^*|_2=|z_{best}-x^*|_2$, from this definition, it is quite clear to see
            $$ |y-x^*|_2 geq |z_{best}-x^*|_2, forall y in C$$
            which results in
            $$d_C(x^*) = min_{yin C}|y-x^*|_2 geq |z_{best}-x^*|_2 = d_D(x^*)$$






            share|cite|improve this answer























            • How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
              – Saeed
              Nov 25 at 18:59










            • You are right! And I post a new solution under the original one. I hope it can help you.
              – Caldera
              Nov 26 at 7:50
















            0














            for $forall z in D$ and $yin C$, we have
            begin{align}
            d_D(x^*) &= min_{z in D} |z-x^*|_2 \
            &= min_{yin C} |(z_{best} -y)+ (y-x^*)|_2 \
            &leq min_{y in C}|z_{best}-y|_2 + min_{y in C}|y-x^*|_2 \
            & leq min_{yin C}|y-x^*|_2 \
            &=d_C(x^*)
            end{align}




            Answer above has mistakes. while, maybe we can try a new way to solve this.



            Notice that for any element $y in C$, because $C subseteq D$, so that $y in D$, and another element $z_{best} in D$, satisfy $d_D(x^*)=min_{z in D} |z-x^*|_2=|z_{best}-x^*|_2$, from this definition, it is quite clear to see
            $$ |y-x^*|_2 geq |z_{best}-x^*|_2, forall y in C$$
            which results in
            $$d_C(x^*) = min_{yin C}|y-x^*|_2 geq |z_{best}-x^*|_2 = d_D(x^*)$$






            share|cite|improve this answer























            • How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
              – Saeed
              Nov 25 at 18:59










            • You are right! And I post a new solution under the original one. I hope it can help you.
              – Caldera
              Nov 26 at 7:50














            0












            0








            0






            for $forall z in D$ and $yin C$, we have
            begin{align}
            d_D(x^*) &= min_{z in D} |z-x^*|_2 \
            &= min_{yin C} |(z_{best} -y)+ (y-x^*)|_2 \
            &leq min_{y in C}|z_{best}-y|_2 + min_{y in C}|y-x^*|_2 \
            & leq min_{yin C}|y-x^*|_2 \
            &=d_C(x^*)
            end{align}




            Answer above has mistakes. while, maybe we can try a new way to solve this.



            Notice that for any element $y in C$, because $C subseteq D$, so that $y in D$, and another element $z_{best} in D$, satisfy $d_D(x^*)=min_{z in D} |z-x^*|_2=|z_{best}-x^*|_2$, from this definition, it is quite clear to see
            $$ |y-x^*|_2 geq |z_{best}-x^*|_2, forall y in C$$
            which results in
            $$d_C(x^*) = min_{yin C}|y-x^*|_2 geq |z_{best}-x^*|_2 = d_D(x^*)$$






            share|cite|improve this answer














            for $forall z in D$ and $yin C$, we have
            begin{align}
            d_D(x^*) &= min_{z in D} |z-x^*|_2 \
            &= min_{yin C} |(z_{best} -y)+ (y-x^*)|_2 \
            &leq min_{y in C}|z_{best}-y|_2 + min_{y in C}|y-x^*|_2 \
            & leq min_{yin C}|y-x^*|_2 \
            &=d_C(x^*)
            end{align}




            Answer above has mistakes. while, maybe we can try a new way to solve this.



            Notice that for any element $y in C$, because $C subseteq D$, so that $y in D$, and another element $z_{best} in D$, satisfy $d_D(x^*)=min_{z in D} |z-x^*|_2=|z_{best}-x^*|_2$, from this definition, it is quite clear to see
            $$ |y-x^*|_2 geq |z_{best}-x^*|_2, forall y in C$$
            which results in
            $$d_C(x^*) = min_{yin C}|y-x^*|_2 geq |z_{best}-x^*|_2 = d_D(x^*)$$







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Nov 26 at 7:48

























            answered Nov 25 at 8:17









            Caldera

            11




            11












            • How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
              – Saeed
              Nov 25 at 18:59










            • You are right! And I post a new solution under the original one. I hope it can help you.
              – Caldera
              Nov 26 at 7:50


















            • How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
              – Saeed
              Nov 25 at 18:59










            • You are right! And I post a new solution under the original one. I hope it can help you.
              – Caldera
              Nov 26 at 7:50
















            How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
            – Saeed
            Nov 25 at 18:59




            How do you know when you ignore $min_{y in C}|z_{best}-y|_2$ inequality still holds?
            – Saeed
            Nov 25 at 18:59












            You are right! And I post a new solution under the original one. I hope it can help you.
            – Caldera
            Nov 26 at 7:50




            You are right! And I post a new solution under the original one. I hope it can help you.
            – Caldera
            Nov 26 at 7:50


















            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3012558%2fdistance-to-closed-and-convex-sets-that-have-intersection-c-subseteq-d-righta%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

            Bundesstraße 106

            Image
            Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
            Read more

            Verónica Boquete

            Image
            Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
            Read more

            Ida-Boy-Ed-Garten

            Image
            Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
            Read more