Let $A$ be bounded below, and $B = b in R : b$ is a lower bound for $A$. Show that $sup B = inf A$.

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











up vote
2
down vote

favorite












This is Exercise 1.3.3 (a) from "Understanding Analysis" by Stephen Abbot, , page 17:




Let $A$ be bounded below, and define $B = b in R : b$ is a lower bound for $A$. Show that $sup B = inf A$.




Please check my proof:



Suppose $A$ be bound below, it exist number $Nleq n$ for every $nin mathbb R$ in the set and $N$ is $infA$. Then $B=b in mathbb R:b$ is a lower bound for $A$. It exist number $b$ in the set, since it contains only lower bound of $A$ then it has number $bleq M$ for every $b$ and $M$ is $sup$ of $B$. But $b$ is lower bound of $A$ and $A$ has $N$ as $sup$, $N$ is in $B$. $N$ is automatically is sup of $b$ therefore $M=N$ or $sup B=inf A$.







share|cite|improve this question


















  • 1




    wait ,why edited my question ?
    – Lingnoi401
    Jan 16 '17 at 11:00






  • 1




    @juniven exercise from Understanding Analysis by Stephen Abbot
    – Lingnoi401
    Jan 16 '17 at 11:08






  • 1




    it is in page 17
    – Lingnoi401
    Jan 16 '17 at 11:09







  • 1




    There I see Exercise 1.3.3 (a) Thank you.
    – Î˜Î£Î¦GenSan
    Jan 16 '17 at 11:13






  • 2




    You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
    – quid♦
    Jan 16 '17 at 12:23















up vote
2
down vote

favorite












This is Exercise 1.3.3 (a) from "Understanding Analysis" by Stephen Abbot, , page 17:




Let $A$ be bounded below, and define $B = b in R : b$ is a lower bound for $A$. Show that $sup B = inf A$.




Please check my proof:



Suppose $A$ be bound below, it exist number $Nleq n$ for every $nin mathbb R$ in the set and $N$ is $infA$. Then $B=b in mathbb R:b$ is a lower bound for $A$. It exist number $b$ in the set, since it contains only lower bound of $A$ then it has number $bleq M$ for every $b$ and $M$ is $sup$ of $B$. But $b$ is lower bound of $A$ and $A$ has $N$ as $sup$, $N$ is in $B$. $N$ is automatically is sup of $b$ therefore $M=N$ or $sup B=inf A$.







share|cite|improve this question


















  • 1




    wait ,why edited my question ?
    – Lingnoi401
    Jan 16 '17 at 11:00






  • 1




    @juniven exercise from Understanding Analysis by Stephen Abbot
    – Lingnoi401
    Jan 16 '17 at 11:08






  • 1




    it is in page 17
    – Lingnoi401
    Jan 16 '17 at 11:09







  • 1




    There I see Exercise 1.3.3 (a) Thank you.
    – Î˜Î£Î¦GenSan
    Jan 16 '17 at 11:13






  • 2




    You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
    – quid♦
    Jan 16 '17 at 12:23













up vote
2
down vote

favorite









up vote
2
down vote

favorite











This is Exercise 1.3.3 (a) from "Understanding Analysis" by Stephen Abbot, , page 17:




Let $A$ be bounded below, and define $B = b in R : b$ is a lower bound for $A$. Show that $sup B = inf A$.




Please check my proof:



Suppose $A$ be bound below, it exist number $Nleq n$ for every $nin mathbb R$ in the set and $N$ is $infA$. Then $B=b in mathbb R:b$ is a lower bound for $A$. It exist number $b$ in the set, since it contains only lower bound of $A$ then it has number $bleq M$ for every $b$ and $M$ is $sup$ of $B$. But $b$ is lower bound of $A$ and $A$ has $N$ as $sup$, $N$ is in $B$. $N$ is automatically is sup of $b$ therefore $M=N$ or $sup B=inf A$.







share|cite|improve this question














This is Exercise 1.3.3 (a) from "Understanding Analysis" by Stephen Abbot, , page 17:




Let $A$ be bounded below, and define $B = b in R : b$ is a lower bound for $A$. Show that $sup B = inf A$.




Please check my proof:



Suppose $A$ be bound below, it exist number $Nleq n$ for every $nin mathbb R$ in the set and $N$ is $infA$. Then $B=b in mathbb R:b$ is a lower bound for $A$. It exist number $b$ in the set, since it contains only lower bound of $A$ then it has number $bleq M$ for every $b$ and $M$ is $sup$ of $B$. But $b$ is lower bound of $A$ and $A$ has $N$ as $sup$, $N$ is in $B$. $N$ is automatically is sup of $b$ therefore $M=N$ or $sup B=inf A$.









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 16 '17 at 12:20









Martin Sleziak

43.5k6113260




43.5k6113260










asked Jan 16 '17 at 10:50









Lingnoi401

919419




919419







  • 1




    wait ,why edited my question ?
    – Lingnoi401
    Jan 16 '17 at 11:00






  • 1




    @juniven exercise from Understanding Analysis by Stephen Abbot
    – Lingnoi401
    Jan 16 '17 at 11:08






  • 1




    it is in page 17
    – Lingnoi401
    Jan 16 '17 at 11:09







  • 1




    There I see Exercise 1.3.3 (a) Thank you.
    – Î˜Î£Î¦GenSan
    Jan 16 '17 at 11:13






  • 2




    You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
    – quid♦
    Jan 16 '17 at 12:23













  • 1




    wait ,why edited my question ?
    – Lingnoi401
    Jan 16 '17 at 11:00






  • 1




    @juniven exercise from Understanding Analysis by Stephen Abbot
    – Lingnoi401
    Jan 16 '17 at 11:08






  • 1




    it is in page 17
    – Lingnoi401
    Jan 16 '17 at 11:09







  • 1




    There I see Exercise 1.3.3 (a) Thank you.
    – Î˜Î£Î¦GenSan
    Jan 16 '17 at 11:13






  • 2




    You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
    – quid♦
    Jan 16 '17 at 12:23








1




1




wait ,why edited my question ?
– Lingnoi401
Jan 16 '17 at 11:00




wait ,why edited my question ?
– Lingnoi401
Jan 16 '17 at 11:00




1




1




@juniven exercise from Understanding Analysis by Stephen Abbot
– Lingnoi401
Jan 16 '17 at 11:08




@juniven exercise from Understanding Analysis by Stephen Abbot
– Lingnoi401
Jan 16 '17 at 11:08




1




1




it is in page 17
– Lingnoi401
Jan 16 '17 at 11:09





it is in page 17
– Lingnoi401
Jan 16 '17 at 11:09





1




1




There I see Exercise 1.3.3 (a) Thank you.
– Î˜Î£Î¦GenSan
Jan 16 '17 at 11:13




There I see Exercise 1.3.3 (a) Thank you.
– Î˜Î£Î¦GenSan
Jan 16 '17 at 11:13




2




2




You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
– quid♦
Jan 16 '17 at 12:23





You question was edited as your typesetting was a bit unusual. Moreover, the body of the post should be self-contained and not depend on the content of the title (which in turn was/is a tad on the too complicated side for a title).
– quid♦
Jan 16 '17 at 12:23











1 Answer
1






active

oldest

votes

















up vote
0
down vote













$inf A$ is defined as the biggest lower bound of $A$. So it is in particular a lower bound of $A$. But that means it is an element of $B$, which is defined as the set of all lower bounds of $A$. Thus $inf Ain B$. But it is also the biggest lower bound of $A$, so for every $bin B$ follows $bleqinf A$. This gives us $inf A=max B$. But if a set has a maximum, this maximum is also its supremum. Thus $inf A=max B=sup B$.






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%2f2099966%2flet-a-be-bounded-below-and-b-b-in-r-b-is-a-lower-bound-for-a-sh%23new-answer', 'question_page');

    );

    Post as a guest






























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    $inf A$ is defined as the biggest lower bound of $A$. So it is in particular a lower bound of $A$. But that means it is an element of $B$, which is defined as the set of all lower bounds of $A$. Thus $inf Ain B$. But it is also the biggest lower bound of $A$, so for every $bin B$ follows $bleqinf A$. This gives us $inf A=max B$. But if a set has a maximum, this maximum is also its supremum. Thus $inf A=max B=sup B$.






    share|cite|improve this answer
























      up vote
      0
      down vote













      $inf A$ is defined as the biggest lower bound of $A$. So it is in particular a lower bound of $A$. But that means it is an element of $B$, which is defined as the set of all lower bounds of $A$. Thus $inf Ain B$. But it is also the biggest lower bound of $A$, so for every $bin B$ follows $bleqinf A$. This gives us $inf A=max B$. But if a set has a maximum, this maximum is also its supremum. Thus $inf A=max B=sup B$.






      share|cite|improve this answer






















        up vote
        0
        down vote










        up vote
        0
        down vote









        $inf A$ is defined as the biggest lower bound of $A$. So it is in particular a lower bound of $A$. But that means it is an element of $B$, which is defined as the set of all lower bounds of $A$. Thus $inf Ain B$. But it is also the biggest lower bound of $A$, so for every $bin B$ follows $bleqinf A$. This gives us $inf A=max B$. But if a set has a maximum, this maximum is also its supremum. Thus $inf A=max B=sup B$.






        share|cite|improve this answer












        $inf A$ is defined as the biggest lower bound of $A$. So it is in particular a lower bound of $A$. But that means it is an element of $B$, which is defined as the set of all lower bounds of $A$. Thus $inf Ain B$. But it is also the biggest lower bound of $A$, so for every $bin B$ follows $bleqinf A$. This gives us $inf A=max B$. But if a set has a maximum, this maximum is also its supremum. Thus $inf A=max B=sup B$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Aug 14 at 11:39









        Bentapair

        1




        1






















             

            draft saved


            draft discarded


























             


            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2099966%2flet-a-be-bounded-below-and-b-b-in-r-b-is-a-lower-bound-for-a-sh%23new-answer', 'question_page');

            );

            Post as a guest













































































            這個網誌中的熱門文章

            How to combine Bézier curves to a surface?

            Mutual Information Always Non-negative

            Why am i infinitely getting the same tweet with the Twitter Search API?