Prove that $sup S=sup R,$ if $SsubseteqBbb{R}$ is bounded from above and $Rsubseteq S$.












3












$begingroup$


Please, is this correct?



Let $S$ be a subset of the real numbers bounded from above and let $Rsubseteq S$ satisfy the following condition: $forall;xin S,;exists; rin R;text{such that};xleq r$.
I want to prove that begin{align} sup S=sup R.end{align}



PROOF



Let $xin S$ be arbitrary, then $exists; rin R;text{such that};xleq r.$ The number, $r$, is an upper bound for the set $S.$ So, $sup Sleq r,;text{for some} ; rin R.$ By definition of $sup,;;yleqsup R, forall; yin R.$ In particular, $y=r,;rleqsup R.$ Thus,
begin{align}tag{1} sup Sleq rleqsup R.end{align}
Since $Rsubseteq S$, we have
begin{align}tag{2} sup Rleq sup S.end{align}
Thus, begin{align} sup S=sup R.end{align}






real-analysis analysis







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
    $endgroup$
    – trancelocation
    Jan 10 at 4:22












  • $begingroup$
    @trancelocation: You are indeed, right!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:24
















3












$begingroup$


Please, is this correct?



Let $S$ be a subset of the real numbers bounded from above and let $Rsubseteq S$ satisfy the following condition: $forall;xin S,;exists; rin R;text{such that};xleq r$.
I want to prove that begin{align} sup S=sup R.end{align}



PROOF



Let $xin S$ be arbitrary, then $exists; rin R;text{such that};xleq r.$ The number, $r$, is an upper bound for the set $S.$ So, $sup Sleq r,;text{for some} ; rin R.$ By definition of $sup,;;yleqsup R, forall; yin R.$ In particular, $y=r,;rleqsup R.$ Thus,
begin{align}tag{1} sup Sleq rleqsup R.end{align}
Since $Rsubseteq S$, we have
begin{align}tag{2} sup Rleq sup S.end{align}
Thus, begin{align} sup S=sup R.end{align}






real-analysis analysis







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
    $endgroup$
    – trancelocation
    Jan 10 at 4:22












  • $begingroup$
    @trancelocation: You are indeed, right!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:24














3












3








3


1



$begingroup$


Please, is this correct?



Let $S$ be a subset of the real numbers bounded from above and let $Rsubseteq S$ satisfy the following condition: $forall;xin S,;exists; rin R;text{such that};xleq r$.
I want to prove that begin{align} sup S=sup R.end{align}



PROOF



Let $xin S$ be arbitrary, then $exists; rin R;text{such that};xleq r.$ The number, $r$, is an upper bound for the set $S.$ So, $sup Sleq r,;text{for some} ; rin R.$ By definition of $sup,;;yleqsup R, forall; yin R.$ In particular, $y=r,;rleqsup R.$ Thus,
begin{align}tag{1} sup Sleq rleqsup R.end{align}
Since $Rsubseteq S$, we have
begin{align}tag{2} sup Rleq sup S.end{align}
Thus, begin{align} sup S=sup R.end{align}






real-analysis analysis







share|cite|improve this question











$endgroup$




Please, is this correct?



Let $S$ be a subset of the real numbers bounded from above and let $Rsubseteq S$ satisfy the following condition: $forall;xin S,;exists; rin R;text{such that};xleq r$.
I want to prove that begin{align} sup S=sup R.end{align}



PROOF



Let $xin S$ be arbitrary, then $exists; rin R;text{such that};xleq r.$ The number, $r$, is an upper bound for the set $S.$ So, $sup Sleq r,;text{for some} ; rin R.$ By definition of $sup,;;yleqsup R, forall; yin R.$ In particular, $y=r,;rleqsup R.$ Thus,
begin{align}tag{1} sup Sleq rleqsup R.end{align}
Since $Rsubseteq S$, we have
begin{align}tag{2} sup Rleq sup S.end{align}
Thus, begin{align} sup S=sup R.end{align}






real-analysis analysis




real-analysis analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 10 at 4:38







Omojola Micheal

















asked Jan 10 at 4:15









Omojola MichealOmojola Micheal

1,824324




1,824324








  • 1




    $begingroup$
    Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
    $endgroup$
    – trancelocation
    Jan 10 at 4:22












  • $begingroup$
    @trancelocation: You are indeed, right!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:24














  • 1




    $begingroup$
    Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
    $endgroup$
    – trancelocation
    Jan 10 at 4:22












  • $begingroup$
    @trancelocation: You are indeed, right!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:24








1




1




$begingroup$
Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
$endgroup$
– trancelocation
Jan 10 at 4:22






$begingroup$
Your $r$ is not necessarily an upper bound for $S$. $r$ depends on $x$. So, how do you conclude that $r$ is an upper bound for $S$? Choose, for example, $S = (0,1)$ and $R= S cap mathbb{Q}$.
$endgroup$
– trancelocation
Jan 10 at 4:22














$begingroup$
@trancelocation: You are indeed, right!
$endgroup$
– Omojola Micheal
Jan 10 at 4:24




$begingroup$
@trancelocation: You are indeed, right!
$endgroup$
– Omojola Micheal
Jan 10 at 4:24










2 Answers
2






active

oldest

votes


















2












$begingroup$

It seems you confuse "$color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$" with "$color{blue}{exists}; rin R; color{blue}{forall};xin S,;text{such that};xleq r$".



The sets $S = (0,1)$ and $R= S cap mathbb{Q}$ satisfy the condition: $color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$.
But your conclusion $sup S leq r$ is not true for any $r in R$.



To show that $sup R = sup S$ you may proceed as follows:




  • Show $forall epsilon > 0 exists x_{epsilon}in R: sup S - epsilon < x_{epsilon}$
    $$Rightarrow forall epsilon >0: sup S - epsilon < sup R Rightarrow sup S leq sup R$$
    That's exactly what was to be shown.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:42












  • $begingroup$
    @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
    $endgroup$
    – trancelocation
    Jan 10 at 4:45










  • $begingroup$
    I get you now. Thanks!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:46










  • $begingroup$
    You are welcome. :-)
    $endgroup$
    – trancelocation
    Jan 10 at 4:46



















1












$begingroup$

Suppose $sup R<sup S$. Then $sup R$ is not an upper bound of $S$, thus $exists xin S|sup R<xlesup S$. But this is a contradiction, since $forall rin R, rlesup R<x$, and it implies there does not exist any $rge x$. This means $sup R=sup S$.






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%2f3068232%2fprove-that-sup-s-sup-r-if-s-subseteq-bbbr-is-bounded-from-above-and-r%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









    2












    $begingroup$

    It seems you confuse "$color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$" with "$color{blue}{exists}; rin R; color{blue}{forall};xin S,;text{such that};xleq r$".



    The sets $S = (0,1)$ and $R= S cap mathbb{Q}$ satisfy the condition: $color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$.
    But your conclusion $sup S leq r$ is not true for any $r in R$.



    To show that $sup R = sup S$ you may proceed as follows:




    • Show $forall epsilon > 0 exists x_{epsilon}in R: sup S - epsilon < x_{epsilon}$
      $$Rightarrow forall epsilon >0: sup S - epsilon < sup R Rightarrow sup S leq sup R$$
      That's exactly what was to be shown.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:42












    • $begingroup$
      @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
      $endgroup$
      – trancelocation
      Jan 10 at 4:45










    • $begingroup$
      I get you now. Thanks!
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:46










    • $begingroup$
      You are welcome. :-)
      $endgroup$
      – trancelocation
      Jan 10 at 4:46
















    2












    $begingroup$

    It seems you confuse "$color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$" with "$color{blue}{exists}; rin R; color{blue}{forall};xin S,;text{such that};xleq r$".



    The sets $S = (0,1)$ and $R= S cap mathbb{Q}$ satisfy the condition: $color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$.
    But your conclusion $sup S leq r$ is not true for any $r in R$.



    To show that $sup R = sup S$ you may proceed as follows:




    • Show $forall epsilon > 0 exists x_{epsilon}in R: sup S - epsilon < x_{epsilon}$
      $$Rightarrow forall epsilon >0: sup S - epsilon < sup R Rightarrow sup S leq sup R$$
      That's exactly what was to be shown.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:42












    • $begingroup$
      @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
      $endgroup$
      – trancelocation
      Jan 10 at 4:45










    • $begingroup$
      I get you now. Thanks!
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:46










    • $begingroup$
      You are welcome. :-)
      $endgroup$
      – trancelocation
      Jan 10 at 4:46














    2












    2








    2





    $begingroup$

    It seems you confuse "$color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$" with "$color{blue}{exists}; rin R; color{blue}{forall};xin S,;text{such that};xleq r$".



    The sets $S = (0,1)$ and $R= S cap mathbb{Q}$ satisfy the condition: $color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$.
    But your conclusion $sup S leq r$ is not true for any $r in R$.



    To show that $sup R = sup S$ you may proceed as follows:




    • Show $forall epsilon > 0 exists x_{epsilon}in R: sup S - epsilon < x_{epsilon}$
      $$Rightarrow forall epsilon >0: sup S - epsilon < sup R Rightarrow sup S leq sup R$$
      That's exactly what was to be shown.






    share|cite|improve this answer











    $endgroup$



    It seems you confuse "$color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$" with "$color{blue}{exists}; rin R; color{blue}{forall};xin S,;text{such that};xleq r$".



    The sets $S = (0,1)$ and $R= S cap mathbb{Q}$ satisfy the condition: $color{blue}{forall};xin S,;color{blue}{exists}; rin R;text{such that};xleq r$.
    But your conclusion $sup S leq r$ is not true for any $r in R$.



    To show that $sup R = sup S$ you may proceed as follows:




    • Show $forall epsilon > 0 exists x_{epsilon}in R: sup S - epsilon < x_{epsilon}$
      $$Rightarrow forall epsilon >0: sup S - epsilon < sup R Rightarrow sup S leq sup R$$
      That's exactly what was to be shown.







    share|cite|improve this answer














    share|cite|improve this answer



    share|cite|improve this answer








    edited Jan 10 at 4:43

























    answered Jan 10 at 4:36









    trancelocationtrancelocation

    9,8501722




    9,8501722












    • $begingroup$
      (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:42












    • $begingroup$
      @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
      $endgroup$
      – trancelocation
      Jan 10 at 4:45










    • $begingroup$
      I get you now. Thanks!
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:46










    • $begingroup$
      You are welcome. :-)
      $endgroup$
      – trancelocation
      Jan 10 at 4:46


















    • $begingroup$
      (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:42












    • $begingroup$
      @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
      $endgroup$
      – trancelocation
      Jan 10 at 4:45










    • $begingroup$
      I get you now. Thanks!
      $endgroup$
      – Omojola Micheal
      Jan 10 at 4:46










    • $begingroup$
      You are welcome. :-)
      $endgroup$
      – trancelocation
      Jan 10 at 4:46
















    $begingroup$
    (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:42






    $begingroup$
    (+1) You claimed that "But your conclusion $sup Sleq r$ is not true for any $rin R$"but I claimed $sup Sleq r$ for some $rin R$" instead.
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:42














    $begingroup$
    @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
    $endgroup$
    – trancelocation
    Jan 10 at 4:45




    $begingroup$
    @OmojolaMicheal: If it is not true for any $r$ in the given case, then there is also no specific $r$, for which it is suddenly true.
    $endgroup$
    – trancelocation
    Jan 10 at 4:45












    $begingroup$
    I get you now. Thanks!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:46




    $begingroup$
    I get you now. Thanks!
    $endgroup$
    – Omojola Micheal
    Jan 10 at 4:46












    $begingroup$
    You are welcome. :-)
    $endgroup$
    – trancelocation
    Jan 10 at 4:46




    $begingroup$
    You are welcome. :-)
    $endgroup$
    – trancelocation
    Jan 10 at 4:46











    1












    $begingroup$

    Suppose $sup R<sup S$. Then $sup R$ is not an upper bound of $S$, thus $exists xin S|sup R<xlesup S$. But this is a contradiction, since $forall rin R, rlesup R<x$, and it implies there does not exist any $rge x$. This means $sup R=sup S$.






    share|cite|improve this answer











    $endgroup$


















      1












      $begingroup$

      Suppose $sup R<sup S$. Then $sup R$ is not an upper bound of $S$, thus $exists xin S|sup R<xlesup S$. But this is a contradiction, since $forall rin R, rlesup R<x$, and it implies there does not exist any $rge x$. This means $sup R=sup S$.






      share|cite|improve this answer











      $endgroup$
















        1












        1








        1





        $begingroup$

        Suppose $sup R<sup S$. Then $sup R$ is not an upper bound of $S$, thus $exists xin S|sup R<xlesup S$. But this is a contradiction, since $forall rin R, rlesup R<x$, and it implies there does not exist any $rge x$. This means $sup R=sup S$.






        share|cite|improve this answer











        $endgroup$



        Suppose $sup R<sup S$. Then $sup R$ is not an upper bound of $S$, thus $exists xin S|sup R<xlesup S$. But this is a contradiction, since $forall rin R, rlesup R<x$, and it implies there does not exist any $rge x$. This means $sup R=sup S$.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Jan 10 at 4:48

























        answered Jan 10 at 4:43









        Shubham JohriShubham Johri

        4,780717




        4,780717






























            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%2f3068232%2fprove-that-sup-s-sup-r-if-s-subseteq-bbbr-is-bounded-from-above-and-r%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

            Mario Kart Wii

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
            Read more

            The Binding of Isaac: Rebirth/Afterbirth

            Image
            Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
            Read more

            What does “Dominus providebit” mean?

            Image
            5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
            Read more