Results 1 to 4 of 4

Math Help - analysis : infimum/supremum proof

  1. #1
    Newbie
    Joined
    Feb 2009
    Posts
    2

    analysis : infimum/supremum proof

    Let A be a nonempty subset of real numbers which is bounded below. Let -A={-x|x is an element of A). Prove that: inf(A)=-sup(-A).

    Any help would be greatly appreciated. Thank you.

    decohen
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie Halmos Rules's Avatar
    Joined
    Feb 2009
    Posts
    14
    Let (-A). Then A. So -xinf(A). This implies that x-inf(A).
    So -inf(A) is an upper bound of -A.

    Now let y be any upper bound of -A.
    Let xA. Then (-x)(-A). Because y is an upper bound of -A, -xy. This implies that x-y. This means that -y is a lower bound of A. Now, since inf(A) is the greatest lower bound of A, it follows that -yinf(A), which implies that y-inf(A).

    In this way we have proved:
    1) -inf(A) is an upper bound of -A
    2) -inf(A) is smaller than any other upper bound of -A

    This means, by definition, that sup(-A)= -inf(A).
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,607
    Thanks
    1574
    Awards
    1
    If \lambda  = \inf (A) then \left( {\forall x \in  - A} \right)\left[ {\; - x \in A \Rightarrow \lambda \; \leqslant  - x\; \Rightarrow \; - \lambda  \geqslant x} \right].
    That means that -A is bounded above so \left( {\exists \delta } \right)\left[ {\delta  = \sup ( - A)} \right]\;\& \;\delta  \leqslant  - \lambda .

    Now suppose that \delta  <  - \lambda then it follows that  - \delta  > \lambda \, \Rightarrow \,\left( {\exists b \in A} \right)\left[ { - \delta  > b \geqslant \lambda } \right].
    BUT this means that \delta  <  - b\;\& \, - b \in  - A : CONTRADICTION.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Banned
    Joined
    Feb 2009
    Posts
    18
    Quote Originally Posted by decohen@purdue.edu View Post
    Let A be a nonempty subset of real numbers which is bounded below. Let -A={-x|x is an element of A). Prove that: inf(A)=-sup(-A).

    Any help would be greatly appreciated. Thank you.

    decohen
    Let inf(A)=u.

    Let  y\in(-A)\Longrightarrow -y\in A\Longrightarrow u\leq -y\Longrightarrow y\leq -u====> -A is bounded from above by -u.

    So if sup(-A)=v \Longrightarrow v\leq -u\Longrightarrow u\leq -v......................(1)

    Let - y\in A\Longrightarrow y\in (-A)\Longrightarrow y\leq v\Longrightarrow -v\leq -y ====> -v is a lower bound of A.

    And since inf(A)=u \Longrightarrow -v\leq u...............(2)

    Combining (1) and (2) we get u=-v or inf(A)=-sup(-A)
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: November 25th 2010, 11:11 AM
  2. supremum infimum
    Posted in the Calculus Forum
    Replies: 0
    Last Post: November 12th 2010, 05:40 AM
  3. [SOLVED] supremum and infimum proof
    Posted in the Differential Geometry Forum
    Replies: 0
    Last Post: November 6th 2009, 12:25 PM
  4. infimum and supremum proof
    Posted in the Calculus Forum
    Replies: 1
    Last Post: October 5th 2008, 02:57 PM
  5. supremum and infimum of a set
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: January 14th 2008, 01:26 PM

Search Tags


/mathhelpforum @mathhelpforum