Scribd Logo
Upload

Welcome to Scribd!

  • 30 views

    HW5 Sol

    Uploaded by

    Jhovanny Alexander
    This document contains solutions to homework problems from a math class. It solves problems about determining the supremum and infimum of sets, properties of the supremum of a set, relationships between the bounds of subsets and their parent sets, finding the supremum and infimum of a specific set, and an inequality relating the supremum of sums of sequences to the individual supremums.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    HW5 Sol

    Uploaded by

    Jhovanny Alexander
    30 views2 pages
    This document contains solutions to homework problems from a math class. It solves problems about determining the supremum and infimum of sets, properties of the supremum of a set, relationships between the bounds of subsets and their parent sets, finding the supremum and infimum of a specific set, and an inequality relating the supremum of sums of sequences to the individual supremums.

    Original Title

    HW5sol

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains solutions to homework problems from a math class. It solves problems about determining the supremum and infimum of sets, properties of the supremum of a set, relationships between the bounds of subsets and their parent sets, finding the supremum and infimum of a specific set, and an inequality relating the supremum of sums of sequences to the individual supremums.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    30 views2 pages

    HW5 Sol

    Uploaded by

    Jhovanny Alexander
    This document contains solutions to homework problems from a math class. It solves problems about determining the supremum and infimum of sets, properties of the supremum of a set, relationships between the bounds of subsets and their parent sets, finding the supremum and infimum of a specific set, and an inequality relating the supremum of sums of sequences to the individual supremums.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Math347, Spring 2018, Homework #5, Solution

    Due to Wednesday, February 28, 2018

    HW 5.1. Determine whether S is bounded and determine sup(S) and inf(S), if


    they exist.
    a) S = {x : x2 < 5x}
    Solution: We find S = (0, 5). Then inf(S) = 0 and sup(S) = 5.
    We can use definition to verify this, using conditions (1) and (2’).

    b) S = {x : 2x2 < x3 + x}.


    Solution: We find S = {x : x > 0 and x 6= 1} = (0, 1) ∪ (1, ∞).
    We can use definition to verify that S is bounded below with inf(S) = 0.
    But it it is not bounded above and thus S does not have the least upper bound.

    HW 5.2. If a set S ⊆ R contains one of its upper bound, show this upper bound
    is the supremum of S.
    Proof: Assume that u is an upper bound of S and u is contained in S. Then
    1) u is an upper bound for S (this is given).
    2) if M 0 is an upper bound of S, we have u ≤ M 0 since u is an element in S.
    By definition, this shows that u is the least upper bound of S.

    HW 5.3. Let S ⊆ R be nonempty. Show that if u = sup(S), then for every number
    n ∈ N the number u − n1 is not an upper bound of S, but the number u + n1 is an
    upper bound of S.
    Proof: First let us show: u − n1 is not an upper bound of S. Since u − n1 < u, if we
    assume that u − n1 is an upper bound of S, then u is NOT the least upper bound
    of S, a contradiction. This shows that u − n1 is not an upper bound of S (for any
    n ∈ N).
    Next, we show: n + n1 is an upper bound of S. Since u is an upper bound of S,
    we have s ≤ u < u + n1 for all s ∈ S. This shows that u + n1 is an upper bound of
    S.

    HW 5.4. Let S be a bounded set in R and let S0 be a nonempty subset of S.


    Show that
    inf(S) ≤ inf(S0 ) ≤ sup(S0 ) ≤ sup(S).
    Proof: Let ∅ = 6 S0 ⊆ S be bounded subsets of R. Then for any s0 ∈ S0 , we have
    s0 ∈ S and thus s0 ≤ sup(S). This shows that sup(S) is an upper bound of S0 .
    Since sup(S0 ) is the least upper bound of S0 , we must have
    sup(S0 ) ≤ sup(S).
    Similarly, for any s0 ∈ S0 , we have s0 ∈ S and thus s0 ≥ inf(S). This shows that
    inf(S) is a lower bound of S0 . Since inf(S0 ) is the greatest lower bound of S0 , we
    have
    inf(S) ≤ inf(S0 ).
    Since inf(S0 ) ≤ sup(S0 ), we get
    inf(S) ≤ inf(S0 ) ≤ sup(S0 ) ≤ sup(S).
    1
    2

    HW 5.5 If S = { n1 − 1
    m : n, m ∈ N}, find inf(S) and sup(S).
    1
    Solution: Consider n = 1, 2, · · · , we get sequences {1 − m }, { 12 − m
    1
    }, · · · . We see
    that 1 is an upper bound, and we claim that sup(S) = 1. We only need to verify
    condition (2’) given in definition: For any u < 1, we have  = 1 − u > 0. It is known
    1
    from the Archimedean property that there exists m ∈ N such that m < 1 − u, or
    1
    equivalently, u < 1 − m . Therefore, any u < 1 is not an upper bound of S. This
    shows that sup(S) = 1.
    Considering m = 1, 2, · · · , we get sequences { n1 − 1}, { n1 − 12 }, · · · . It is clear
    that −1 is a lower bound of S. For any −1 < v, we get v + 1 > 0 and thus there
    exists a positive integer n ∈ N such that n1 < v + 1. It follows that we get n1 − 1 ∈ S
    such that n1 − 1 < v. This shows that inf(S) = −1.

    HW 5.6. Let (an ) and (bn ) be two bounded seuqences. Show that
    sup(an + bn ) ≤ sup(an ) + sup(bn ).
    Proof: For each n ∈ N, we have
    an ≤ sup(an ) and bn ≤ sup(bn ).
    Then an + bn ≤ sup(an ) + sup(bn ). This shows that sup(an ) + sup(bn ) is an upper
    bound of (an + bn ). Since sup(an + bn ) is the the least upper boundand of (an + bn ),
    we get
    sup(an + bn ) ≤ sup(an ) + sup(bn ).
    Remark: In this case, we can find two bounded sequences an = (−1)n−1 and
    bn = (−1)n such that
    sup(an + bn ) = 0 < sup(an ) + sup(bn ) = 2.

    You might also like