Results 1 to 6 of 6

Math Help - Least Upper Bound Proof

  1. #1
    Newbie
    Joined
    Dec 2012
    From
    San Marcos, Tx
    Posts
    3

    Least Upper Bound Proof

    IF A is a non-empty bounded set of real numbers with least upper bound L and p is a positive real number, then the set pA has least upper bound pL.

    definition i have to use:

    The number q is an UPPER BOUND for the set A if x<=q for all x in A.
    The LEAST UPPER BOUND of the nonempty set A is L if L is an upper bound for A and if r is a number less than L, then there is a member a in A so that a > r.

    what i have so far.

    Since A is non empty and the least upper bound of A is L, then a<=L for all a in A.

    Since a<=L for all a in A and p is positive, then pa<=pL.

    therefor pL is a upper bound of pA.

    now im lost on the second part of this problem where i need to prove that pL is the least upper bound of pA. my initial thought was to just use the same trick as above but this feels flawed for some reason.

    since L is the least upper bound of A, then r < a <=L where r is a number less than L.

    since r < a <=L where r is a number less than L, and p is positive, then rp < pa <= pL.

    since rp < pa <= pL, and rp is a number less than pL, then pL is the least upper bound of pA.
    Last edited by JBrandon; December 2nd 2012 at 12:53 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,617
    Thanks
    1581
    Awards
    1

    Re: Least Upper Bound Proof

    Quote Originally Posted by JBrandon View Post
    IF A is a non-empty bounded set of real numbers with least upper bound L and p is a positive real number, then the set pA has least upper bound pL.
    Since A is non empty and the least upper bound of A is L, then a<=L for all a in A.
    Since a<=L for all a in A and p is positive, then pa<=pL.
    therefor pL is a upper bound of pA.
    now im lost on the second part of this problem where i need to prove that pL is the least upper bound of pA.

    Let \lambda=\text{LUB}(pA) . Suppose that \lambda<pL. (We know that \lambda\le pL WHY?)

    It follows that \frac{\lambda}{p}<L so (\exists a'\in A)\left[\frac{\lambda}{p}<a'\le L\right] WHY?

    How is that a contradiction?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Dec 2012
    From
    San Marcos, Tx
    Posts
    3

    Re: Least Upper Bound Proof

    Quote Originally Posted by Plato View Post
    Let \lambda=\text{LUB}(pA) . Suppose that \lambda<pL. (We know that \lambda\le pL WHY?)
    since i know pL is a upper bound of pA the least upper bound of pA must be less than or equal to pL.

    Quote Originally Posted by Plato View Post
    It follows that \frac{\lambda}{p}<L so (\exists a'\in A)\left[\frac{\lambda}{p}<a'\le L\right] WHY?
    since i know L is the least upper bound of A, then \frac{\lambda}{p}<a'

    Quote Originally Posted by Plato View Post
    How is that a contradiction?
    not to sure on this one. is it because \frac{\lambda}{p} is supposed to equal L but by the proof is less than L?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,617
    Thanks
    1581
    Awards
    1

    Re: Least Upper Bound Proof

    Quote Originally Posted by JBrandon View Post
    not to sure on this one. is it because \frac{\lambda}{p} is supposed to equal L but by the proof is less than L?

    Well that implies that \lambda<pa'. Can that be?
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Newbie
    Joined
    Dec 2012
    From
    San Marcos, Tx
    Posts
    3

    Re: Least Upper Bound Proof

    so the full proof should be.

    Let A \neq \phi, L=\text{LUB}(A),  a \in A,  pa \in pA, and p be a positive number.
    Since A \neq \phi, and L=\text{LUB}(A), then a \le L.
    Since a \le L, then pa \le pL.
    therefor pL=\text{UB}(pA).
    Assume \lambda=\text{LUB}(pA)
    since \lambda=\text{LUB}(pA), and pL=\text{UB}(pA), then \lambda \le pL.
    since \lambda \le pL, then \frac{\lambda}{p} < L
    since \frac{\lambda}{p} < L, and L=\text{LUB}(A), then \frac{\lambda}{p} < a \le L
    since \frac{\lambda}{p} < a \le L, then \lambda < pa \le pL. a contradiction as pa \le \lambda must be true for \lambda=\text{LUB}(pA)
    therefor  pL < \lambda and pL = \text{LUB}(pA)
    Follow Math Help Forum on Facebook and Google+

  6. #6
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,617
    Thanks
    1581
    Awards
    1

    Re: Least Upper Bound Proof

    Quote Originally Posted by JBrandon View Post
    so the full proof should be.
    Let A \neq \phi, L=\text{LUB}(A),  a \in A,  pa \in pA, and p be a positive number.
    Since A \neq \phi, and L=\text{LUB}(A), then a \le L.
    Since a \le L, then pa \le pL.
    therefor pL=\text{UB}(pA).
    Assume \lambda=\text{LUB}(pA)
    since \lambda=\text{LUB}(pA), and pL=\text{UB}(pA), then \lambda \le pL.
    since \lambda \le pL, then \frac{\lambda}{p} < L
    since \frac{\lambda}{p} < L, and L=\text{LUB}(A), then \frac{\lambda}{p} < a \le L
    since \frac{\lambda}{p} < a \le L, then \lambda < pa \le pL. a contradiction as pa \le \lambda must be true for \lambda=\text{LUB}(pA)
    therefor  pL < \lambda and pL = \text{LUB}(pA)
    Honestly, I don't know how to answer you questions.
    I taught analysis for more than 35 years.
    I drilled into students that if \lambda=\text{LUB}(A) then for any c>0 then it must be the case that (\exists t\in A)[\lambda-c<t\le \lambda].

    Oddly enough, that turns out to be the most important idea in analysis.

    So if \lambda<pa' because pa'\in pA that must be a contradiction because pa'\le\lambda~.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Help needed. Upper bound of a set proof
    Posted in the Advanced Math Topics Forum
    Replies: 14
    Last Post: October 31st 2012, 10:17 AM
  2. Least Upper Bound proof
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: March 30th 2011, 12:43 AM
  3. Proof of the Least Upper Bound(Supremum) of a Set
    Posted in the Differential Geometry Forum
    Replies: 3
    Last Post: January 25th 2010, 01:15 PM
  4. greatest least bound and least upper bound proof
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 4th 2009, 04:44 PM
  5. Upper bound proof
    Posted in the Calculus Forum
    Replies: 2
    Last Post: March 10th 2007, 11:05 PM

Search Tags


/mathhelpforum @mathhelpforum