Let be a sequence of sets inductively defined by
Define which means that is the union of all
Choose the best description as to which sets have the least upper bound property .
This is a part of the College Calc problem set. You can find more problems here .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We must note that each A n + 1 is indeed finite, as there are at most ∣ A n ∣ 2 choices of the pair ( x , y ) .
Each subset of a finite set is finite and thus has a maximum -- this is, in fact, the supremum of the subset, as you should check.
Hence we know that each A n must have the l.u.b. property.
As for A , however, things are different. A is an infinite set. We can easily see it by noting that 2 n − 1 1 ∈ A n ⊂ A for each n .
Sadly enough, it turns out that A does not have the l.u.b. property. The reasoning is as follows:
2 1 clearly does not belong to the set, since if it did, it must for some A n as well, which by definition only contains rationals.
Notice that 2 n − 1 k ∈ A n for each n and 0 ≤ k ≤ 2 n − 1 . We can use this as a sort of "grid" to keep inching towards 2 1 .
Let a n be the largest integer k satisfying
2 n − 1 k < 2 1 .
Note that this implies the following(can you explain why?):
0 < 2 1 − 2 n − 1 a n < 2 n − 1 1 .
From squeeze theorem , all of the expressions converge to zero, and thus we have
n → ∞ lim 2 n − 1 a n = 2 1 .
Letting
K = { 2 n − 1 a n ∣ ∣ ∣ n ∈ Z + }
we immediately see that K is bounded by 1 ∈ A , and
sup K = 2 1 ∈ / A
which proves A does not have the l.u.b. property.