Bounded Set Note

Bounded Sets
Definition. We say that a set of numbers is bounded if there is a number M so that the size
of every element in the set is no more than M , and unbounded if there is no such number
M . (Such a number M is called a bound on the set.
We say that a set is bounded above if there is a number M (an upper bound so that every
element in the set is no more than M , and bounded below if there is a number M (a lower
bound) so that every element in the set is no less than M .
For each of the following sets, decide whether it is bounded, and if not whether it is still
bounded below or bounded above, finding an appropriate bound in each case:
1. The set of all real numbers R.
2. The set of rational numbers Q.
3. The set of all natural numbers N = {0, 1, 2, . . .}
4. The set of all integers Z = {. . . , 2, 1, 0, 1, 2 . . .}
5. The empty set , which does not contain any numbers.
6. The set of positive integers with an odd number of divisors.

7. The set of numbers which are a root of a polynomial with integer coefficients.
n
, where n 1 is an integer. For short, we can
8. The set of numbers of the form 2n+1
n
specify this set by writing { 2n+1 | n Z, n 1}.
9. The set { n1 | 0 6= n N}.

2
n +1
10. The set { 50n7
| 1 n N}.
11. The set of numbers which are the distance from some point in the plane to the nearest
integer lattice point (m, n), where m, n Z.
12. The set of possible distances between: a point on the circle x2 + y 2 = 1 and a point on
the circle x2 + y 2 = 1002 .
13. The set of possible distances between: a point on the curve y =
curve y = x1
1
x
and a point on the
14. The set {n Z | 1000n > n!}

15. The set of numbers of the form 1 +
1
1
22
1
32
+ ... +
1
,
n2
where n 1 is an integer.2
Note that in mathematics if a true/false statement is made about all turkeys with five legs, and there
arent any turkeys with five legs, then we say the statement is true (vacuously true).
2
Try to imitate the techniques on the next page.
Two Examples
Proposition 1. The set of numbers of the form 1 +
integer, form an unbounded set.
1
2
1
3
+ . . . + n1 , where n 1 is an
Proof. Let n = 2k . Then we have

1+
1 1
1
+ + ... +
2 3 n

1 1
1 1 1 1
1
1
1
1
+
+
+
+ + +
+ ... +
+
+ ... + k
=1+
2
3 4
5 6 7 8
2k1 + 1 2k1 + 2
2
1 1
1
1 + + + ... +
2 2
2
k
=1+ .
2
There can not be any number M which is greater than 1 +

k = 2dM e is the smallest integer larger than 2M , then
1+
k
2
for all values of k because if
k
2M
1+
= 1 + M,
2
2
which is a contradiction.
Proposition 2. The set of numbers of the form 1 + 21 + 14 + 81 + . . . + 21n , where n 1 is an
integer, form a bounded set.
Proof. If we let
Sn = 1 +
1
1 1 1
+ + + ... + n
2 4 8
2
then
1
1 1 1
1
1
Sn = + + +
+ . . . + n+1 ,
2
2 4 8 16
2
so
1
Sn Sn =
2
1 1 1
1
1 + + + + ... + n
2 4 8
2
1 1 1
1
1
+ + +
+ . . . + n+1
2 4 8 16
2

,
hence
1
1
Sn = 1 n+1
2
2

1
Sn = 2 1 n+1 2.
2
Therefore M = 2 is an upper bound on the given set, while all the numbers are positive, so
0 is a lower bound.
Least Upper Bounds

The following is an important notion in understanding the standard system of real numbers:
If S is a set of numbers which is bounded above, then we say that b is a least upper bound
or supremum for S, written b = sup S, if it satisfies two properties
(A) For all x S, x b.
(B) If b0 is any other number with the previous property, then b b0 .
Informally, we may summarize these by saying that
(A) b is an upper bound on the set S.
(B) Of all upper bounds on S, it is the least.
The notion of a greatest lower bound, or infimum is defined similarly, and we write ` = inf S
if ` is a greatest lower bound on the set S.
By convention, if A = then we say sup A = , inf A = , if A is not bounded above
then we say sup A = , and if A is not bounded below we say inf A = .
The Dedekind Completeness Axiom

Every nonempty set which is bounded above has a least upper bound.
The Dedekind Completeness Axiom may be taken as a fundamental property of the standard
real number system.
Exercises
1. Show that for any set A R, sup A is unique. In other words, if b, b0 are two real
numbers satisfying the two conditions above, then b = b0 . (Thus it makes sense to say
the sup of A).
2. Find, with proof, the least upper bound of the set in the second example on the previous
page.
3. Find, with proof, but without using calculus, the value of
inf{x +
1
| x > 0}.
x
(Hint: Use the AM-GM inequality: ab 21 (a2 + b2 ).)
4. If A, B R we define their sum set as the set of all possible sums of one element of
each set:
A + B = {a + b | a A, b B}
For example [0, 1] + {1, 1} = [1, 0] [1, 2].
(a) If A is the rationals and B is the irrationals, what is A + A? What is A + B?
What is B + B?
(b) Prove that if sup A and sup B are finite, sup(A + B) = sup A + sup B.
5. Given a nonempty set A which is bounded above, define A = {a | a A}. What
is inf(A)?
6. Assuming sup A exists, prove that for all > 0 there exists a A such that a >
sup A .
7. Prove that for any a > 0, inf{ax | x R} = 0. You may use any standard properties
of exponentiation.
8. (a) Assuming the Dedekind Completeness Axiom, prove the Archimedean property of
R: For any > 0 there exists a positive integer n such that n > 1. (Hint: Argue
by contradiction, considering the supremum of an appropriate set.)
(b) Use part (a) to prove that for any x R there is an integer n such that n > x.

Bounded Set Note

Uploaded by

Copyright:

Available Formats

Bounded Set Note

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bounded Set Note

Uploaded by

Copyright:

Available Formats

Bounded Sets

6. The set of positive integers with an odd number of divisors.

9. The set { n1 | 0 6= n N}.

and a point on the

14. The set {n Z | 1000n > n!}

Proof. Let n = 2k . Then we have

There can not be any number M which is greater than 1 +

for all values of k because if

Least Upper Bounds

The Dedekind Completeness Axiom

(Hint: Use the AM-GM inequality: ab 21 (a2 + b2 ).)

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.