Scribd
Upload
45 views

Assignment 10 1

1) The intersection of two intervals is always another interval. The union of two intervals is not always an interval. 2) Express the given sets as unions and intersections of intervals. For example, (a, b) ∪ [c, d] is a union of intervals. 3) If a set of numbers has an upper bound, it has infinitely many upper bounds.

Uploaded by

oli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Assignment 10 1

1) The intersection of two intervals is always another interval. The union of two intervals is not always an interval. 2) Express the given sets as unions and intersections of intervals. For example, (a, b) ∪ [c, d] is a union of intervals. 3) If a set of numbers has an upper bound, it has infinitely many upper bounds.

Uploaded by

oli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

KEITH DEVLIN: Introduction to Mathematical Thinking (Fall 2012) ASSIGNMENT 10.

1. Prove that the intersection of two intervals is again an interval. Is the same true for unions?
2. Taking R as the universal set, express the following as simply as possible in terms of intervals and
unions of intervals. (Note that A0 denotes the complement of the set A relative to the given universal
set, which in this case is R. See the module on set theory.)

(a) [1, 3]0 (b) (1, 7]0


(c) (5, 8]0 (d) (3, 7) ∪ [6, 8]
(e) (−∞, 3)0 ∪ (6, ∞) (f) {π}0
(g) (1, 4] ∩ [4, 10] (h) (1, 2) ∩ [2, 3)
(i) A0 , where A = (6, 8) ∩ (7, 9] (j) A0 , where A = (−∞, 5] ∪ (7, ∞)

3. Prove that if a set A of integers/rationals/reals has an upper bound, then it has infinitely many different
upper bounds.
4. Prove that if a set A of integers/rationals/reals has a least upper bound, then it is unique.
5. Let A be a set of integers, rationals, or reals. Prove that b is the least upper bound of A iff:
(a) (∀a ∈ A)(a ≤ b); and
(b) whenever c < b there is an a ∈ A such that a > c.
6. The following variant of the above characterization is often found. Show that b is the lub of A iff:
(a) (∀a ∈ A)(a ≤ b) ; and
(b) (∀ > 0)(∃a ∈ A)(a > b − ).

7. Give an example of a set of integers that has no upper bound.


8. Show that any finite set of integers/rationals/reals has a least upper bound.
9. Intervals: What is lub (a, b)? What is lub [a, b]? What is max (a, b)? What is max [a, b]?
10. Let A = {|x − y| | x, y ∈ (a, b)}. Prove that A has an upper bound. What is lub A ?

11. Define the notion of a lower bound of a set of integers/rationals/reals.


12. Define the notion of a greatest lower bound (glb) of a set of integers/rationals/reals by analogy with
our original definition of lub.
13. State and prove the analog of question 5 for greatest lower bounds.

14. State and prove the analog of question 6 for greatest lower bounds.
15. Show that the Completeness Property for the real number system could equally well have been defined
by the statement, “Any nonempty set of reals that has a lower bound has a greatest lower bound.”
16. The integers satisfy the Completeness Property, but for a trivial reason. What is that reason?

You might also like