Professional Documents
Culture Documents
Instructor: Guoliang Wu
3.4 Prove that (v) 0 < 1; (vii) if 0 < a < b, then 0 < b−1 < a−1 .
1
(b) Use induction to prove
for n numbers a1 , a2 , · · · , an .
3.7 (a) Show that |b| < a if and only if −a < b < a.
(b) Show that |a − b| < c if and only if b − c < a < b + c.
(c) Show that |a − b| ≤ c if and only if b − c ≤ a ≤ b + c.
To prove a statement like “A if and only if B” (or, “A and B
are equivalent”), we need to show that (1) A implies B, and
(2) B implies A.
−|x| ≤ x ≤ |x|
for any real number x since |x| is either x, or −x. (You can use
this fact later on.)
2
(a) “⇒”: From the above inequality, −|b| ≤ b ≤ |b|. So b ≤ |b| <
a which implies b < a by O3. (b = a cannot happen since
otherwise, |b| = a.) On the other hand, −|b| ≤ b ⇒ −b ≤
|b| < a. Thus −b < a. So −a < b. We proved that
−a < b < a.
(c) The same argument as in (a) shows that |b| ≤ a if and only
if −a ≤ b ≤ a. (This is Exercise 3.5 (a).)
“⇒”: Again, we use the obvious fact that −|b| ≤ b ≤ |b|. So
b ≤ |b| ≤ a which implies b ≤ a by O3. On the other hand,
−|b| ≤ b ⇒ −b ≤ |b| ≤ a. Thus −b ≤ a. So −a ≤ b. We proved
that
−a ≤ b ≤ a.
“⇐”: If b ≥ 0, then |b| = b. Thus |b| ≤ a since b ≤ a. If b < 0,
then |b| = −b ≤ a since −a ≤ b.
Therefore,
|a − b| ≤ c if and only if − c ≤ a − b ≤ c.
|a − b| ≤ c if and only if b − c ≤ a ≤ b + c.
3
4.1 – 4.4 (b) (0, 1) is bounded above: it has lots of upper bounds. For
instance, 1, 2, 3. It has lower bounds 0, −1, −2 (or any non-
positive number.)
sup(0, 1) = 1, inf(0, 1) = 0.
(j) {1 − 31n : n ∈ N} = { 23 , 89 , 27
26
, · · · }. Upper bounds: 1, 2, 3; lower
2
bounds: 3 , 0, −1.
1 1 2
sup{1 − : n ∈ N} = 1, inf{1 − : n ∈ N} = .
3n 3n 3
(n) {r ∈ Q : r < 2}. Upper bounds: 2, 3, 4. The set is NOT
bounded below.
sup{r ∈ Q : r < 2} = 2.
(We will learn the notation −∞. This set is not bounded
below, so it does not have a lower bound/infimum. But
sometimes we write inf{r ∈ Q : r < 2} = −∞ to mean that
it is not bound below.)
(v) {cos nπ
3 : n ∈ N}. Note that this is in fact a finite set since
cos is a cyclic function:
nπ 1 1
{cos : n ∈ N} = { , − , −1, 1},
3 2 2
since cos π3 = 12 , cos 2π = − 12 , cos 3π = −1, cos 4π
3 3 3 =
− 21 , cos 5π3 = 1
2 , cos 6π
3 = 1, · · ·
Upper bounds: 1, 2, 3; lower bounds −1, −2, −3.
nπ nπ
sup{cos : n ∈ N} = 1, inf{cos : n ∈ N} = −1.
3 3
inf S ≤ sup S.
4
(b) If inf S = sup S, then the set S has only one element inf S
(same as sup S). This is because, as argued in (a), for any ele-
ment s ∈ S,
inf S ≤ s ≤ sup S = inf S.
Then it must be that
Proof. (a) In 4.6 (a), we proved that inf S ≤ sup S for any subset
S of R. So we need to prove that inf T ≤ inf S and sup S ≤ sup T .
To show that inf T ≤ inf S, it suffices to show that inf T is a
lower bound of S, then it follows that inf T ≤ inf S since inf S
is the greatest lower bound (greater than or equal to any other
lower bound of S).
For any s ∈ S, it belongs to T since S ⊂ T . Thus inf T ≤ s since
inf T is a lower bound of T and s ∈ T . Then, by definition, inf T
is a lower bound of S and therefore inf T ≤ inf S.
Similarly, to show sup S ≤ sup T , we need only to show that
sup T is an upper bound of S. For any s ∈ S, it is also in T
because S ⊂ T . Thus s ≤ sup T . Therefore sup T is an upper
bound of S.
(b) Note that S ⊂ S ∪ T and T ⊂ S ∪ T . We have
So
max{sup S, sup T } ≤ sup(S ∪ T ).
5
Otherwise (ii) happens (s ∈ T ), which implies that s ≤ sup T ≤
max{sup S, sup T }. In either case
s ≤ max{sup S, sup T }.
1
4.15 Let a, b ∈ R. Show that if a ≤ b + n for all n ∈ N, then a ≤ b.