Math 403 Analysis I - Spring 2010 Solutions To Homework 1

MATH 403 ANALYSIS I - SPRING 2010
SOLUTIONS to HOMEWORK 1
Problem 1. Show that the following holds for the function f : X → Y .

(a) If A, B ⊂ X then, f (A ∩ B) ⊂ f (A) ∩ f (B) and the equality holds if f is,
in addition, injective. S
(b) If A, B ⊂ Y then f −1 A B) = f −1 (A) ∪ f −1 (B).
Solution: (a) Note that f (A ∩ B) ⊂ f (A) and f (A ∩ B) ⊂ f (B). So, f (A ∩ B) ⊂
f (A) ∩ f (B). Now assume that f is injective. Then if y ∈ f (A) ∩ f (B), then there
are a ∈ A and b ∈ B such that y = f (a) and y = f (b). Since f is an injection,
a = b ∈ A ∩ B implying that y ∈ f (A ∩ B). Hence f (A) ∩ f (B) ⊂ f (A ∩ B) which
together with f (A ∩ B) ⊂ f (A) ∩ f (B), gives f (A ∩ B) = f (A) ∩ f (B).
(b) Clearly, f −1 (A) ⊂ f −1 (A ∪ B) and f −1 (B) ⊂ f −1 (A ∪ B) so that f −1 (A) ∪
f −1 (B) ⊂ f −1 (A ∪ B). To prove the opposite inclusion, take x ∈ f −1 (A ∪ B).
Then y = f (x) ∈ A ∪ B). If y = f (x) ∈ A, then x ∈ f −1 (A) ∪ f −1 (B) and if
y = f (x) ∈ B, then x ∈ f −1 (B) ⊂−1 (A) ∪ f −1 (B).
Problem 2. If A and B ⊂ R, then A + B = {a + b | a ∈ A, b ∈ B}, A + a =

{x + a | x ∈ A}, and aA = {ax | x ∈ A}. Prove:
(a) sup(aA) = a sup A and inf(aA) = a inf A provided that a > 0.
(b) sup(A + B) = sup A + sup B and inf(A + B) = inf A + inf B.
Solution: (a) Let t = sup(aA). Then t is an upper bound of aA so that t/a
is upper bound of A. Since the supremum is the least upper bound, one gets
sup A ≤ t/a, i.e., a sup A ≤ sup(aA). Conversely, let s = sup A. Then s is an upper
bound of A so that as is an upper bound of aA. So, sup(aA) ≤ as ≤ a sup A.
Combining both inequalities one gets sup(aA) = a sup A.
(b) Let t = sup(A) and s = sup B. Then s + t is an upper bound of A + B. Conse-
quently, sup(A + B) ≤ s + t ≤ sup A + sup B. Conversely, if r = sup(A + B), then
r ≥ x+ y for all x ∈ A and y ∈ B. Fixing y ∈ B, one has −y + r ≥ x for all x ∈ A so
that −y+r is an upper bound of A. This implies that −y+r ≥ t (with t is as above).
So, r − t ≥ y for every y ∈ B. Hence r − t is an upper bound of B and r − t ≥ s
(with (s is as above). One concludes, r ≥ t + s, i.e., sup(A + B) ≥ sup A + sup B.
Combining both inequalities, one gets sup(A + B) = sup A + sup B.
Problem 3 If A is a subset of R, denote by −A = {x| − x ∈ A}.

(a) Assume that A is bounded from below. Show that −A is bounded from
above and − inf A = sup(−A).
(b) Deduce from (a) that if A is bounded from below, then a = inf A if and
only if a ≤ x for all x ∈ A and for every ε > 0, there is x ∈ A such that
x < a + ε.
Solution: (a). To see the first part note that if r is lower bound of A, then
−r is an upper bound of −A. Now if r = inf A, then r is a lower bound of A
and hence −r is an upper bound of −A. Since the supremum is the least upper
bound, one gets sup(−A) ≤ −r = − inf A. Conversely, if t = sup(−A), then −t
1
2
is a lower bound of A. Since the infimum is the greatest lower bound, one gets
− sup(−A) = −r ≤ inf A. Consequently, inf A = − sup(−A).
(b) First assume that a = inf A. By (a), −a = sup(−A) and by the characteriza-
tion of the supremum, −a ≥ −x for all x ∈ A and given ε > 0 there is −x ∈ −A
such that −a < −x + ε. From those two we obtain that a ≤ x for all x ∈ A and
x < a + ε. Conversely, assume that the number a has the properties as stated in
(b). Then −x ≤ −a for all x ∈ A which shows that −a is an upper bound of −A
and given ε > 0 there is x ∈ A such that x < a + ε which implies that −a < −x + ε.
So, −a = sup(−A) and since sup(−A) = − inf A, our claim follows.
Problem 4. Use the principle of mathematical induction to prove the following

statements:
(a) (Bernoulli’s Inequality) If a > −1 and a 6= 0, then (1 + a)n > 1 + na for
any integer n > 1.
2 2
(b) For every n ∈ N, k=1 k 3 = n (n+1)
Pn
4 .
Solution: (a) If n = 2, then (1 + a)2 = 1 + 2a + a2 > 1 + 2 since a 6= 0. Assuming
that (1 + a)n > 1 + na, we claim that (1 + a)n+1 > 1 + (n + 1)a. Indeed, since
a + 1 > 0 and (1 + a)n > 1 + na, after multiplying both sides by (1 + a), one gets
(1 + a)n+1 > (1 + na)(1 + a) = 1 + na + a + a2 > 1 + (n + 1)a again using a 6= 0.
(b) First, observe that the equality holds for n = 1. Next assume that nk=1 k 3 =
P
2 2 2 2
n (n+1)
. We claim that k=1 k 3 = (n+1) 4(n+2) . Indeed,
P n+1
4
n+1 n
X X n2 (n + 1)2
k3 = k 3 + (n + 1)3 = + (n + 1)3
4
k=1 k=1
2
(n + 1)2 2 (n + 1)2 (n + 2)2

2 n
= (n + 1) +n+1 = n + 4n + 4 = .
4 4 4
Problem 5. Prove density of irrational numbers: If x, y ∈ R satisfy x < y, then
there is an irrational number a such that x < a < y.
Solution: Recall that given real numbers s < t, there exists a rational number √ r
satisfying
√ s < r < t. So, let us consider real numbers x < y and let
√ s = x/ 2,√t =
y/ 2. Then √ s < t and there is a rational
√ number r so that x/ 2 < r < y/ 2,
Then x < r 2 < y and the number r 2 is irrational.

Math 403 Analysis I - Spring 2010 Solutions To Homework 1

Uploaded by

Copyright:

Available Formats

Math 403 Analysis I - Spring 2010 Solutions To Homework 1

Uploaded by

Document Information

Original Description:

Original Title

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

Math 403 Analysis I - Spring 2010 Solutions To Homework 1

Uploaded by

Copyright:

Available Formats

MATH 403 ANALYSIS I - SPRING 2010

Problem 1. Show that the following holds for the function f : X → Y .

Problem 2. If A and B ⊂ R, then A + B = {a + b | a ∈ A, b ∈ B}, A + a =

Problem 3 If A is a subset of R, denote by −A = {x| − x ∈ A}.

Problem 4. Use the principle of mathematical induction to prove the following

You might also like