1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Show that sup(B)=inf(A)

  1. Sep 24, 2011 #1
    1. The problem statement, all variables and given/known data

    (a) Let A be bounded below, and define B = {b[itex]\in[/itex]R : b is a lower bound for A}.
    Show that sup(B) = inf(A).

    (b) Use (a) to explain why there is no need to assert that the greatest lower bound exists as part of the Axiom of Completeness.

    (c) Propose another way to use the Axiom of Completeness to prove that sets bounded below have greatest lower bounds.

    2. Relevant equations

    We can use the Axiom of Completeness, DeMorgan's Laws, etc...

    3. The attempt at a solution

    I have shown that both sup(B) and inf(A) exist.
    I can see, logically, why they should be equal, but I cant seem to write it down clearly.
  2. jcsd
  3. Sep 24, 2011 #2


    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    You must show two things:

    1) sup(B) is a lower bound of A
    2) If x is a lower bound of A, then [itex]x\leq \sup(B)[/itex].

    Let's start with the first. How would you show that for all a in A it holds that [itex]\sup(B)\leq a[/itex]??
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Show that sup(B)=inf(A)
  1. Infs & sups (Replies: 1)

  2. Proving inf A=-sup(-A) (Replies: 2)