A1/MATH4402/2020-21/2nd

THE UNIVERSITY OF HONG KONG

DEPARTMENT OF MATHEMATICS

MATH4402 Analysis II

Assignment 1

Due date : Feb 5, 2021 before 12:00 noon

Instructions

• Please scan and submit your work as a PDF file in moodle.

Warning: Make sure that your work is properly scanned. Oversized, blurred or upside-
down images will NOT be graded.

Remarks

• You are welcome to contact the instructor or the tutor if you have any difficulties.

• You should always give precise and adequate explanations to support your conclusions.
Note that being able to write clearly is as important a mathematical skill as being able to
solve equations and compute correct answers. Do not just give the solution in fragmentary
bits and pieces. Clarity of presentation of your argument counts.

You need only to give your answers to those questions indicated with *. Other
problems are optional and will not be marked. However, we do expect you to
eventually finish all problems.

Chapter 1
!
a b
1. Let A = ∈ R2×2 . For any u = (u1 , u2 ), v = (v1 , v2 ) ∈ R2 , define a map
c d
I : R2 × R2 −→ R by
! !
T a b u1
I(u, v) = v Au = (v1 , v2 ) .
c d u2

Prove that I is an inner product on R2 if and only if A = AT , a, d > 0 and det A > 0.

*2. Let (V, k · k) be a normed vector space. Prove that if the norm k · k is induced by an inner
product on V , then it must satisfy the parallelogram identity:

kx + yk2 + kx − yk2 = 2kxk2 + 2kyk2 for any x, y ∈ V.

1
*3. For any x = (x1 , . . . , xn ) ∈ Rn with n ≥ 2, define
1/p
kxkp := (|x1 |p + · · · + |xn |p ) for any 1 ≤ p < ∞ and kxk∞ := max {|x1 |, . . . , |xn |}.

(a) Prove Hölder’s Inequality for any 1 < p < ∞, that is, prove that for any x, y ∈ Rn ,

|hx, yi| ≤ kxkp · kykq ,

p Pn
where q ∈ R satisfies p1 + 1q = 1 (or equivalently, q = p−1 ), and hx, yi = i=1 xi yi .
(Hint: You may use without proof Young’s Inequality which states that for any
p q
nonnegative a, b ∈ R, and any p, q ∈ (1, ∞) with p1 + 1q = 1, we have ab ≤ ap + bq .)
(b) Prove Hölder’s Inequality when p = 1 (in this case we have q = ∞).
(c) Prove Minkowski’s Inequality, that is, prove that for any 1 ≤ p ≤ ∞,

kx + ykp ≤ kxkp + kykp .

Hence show that k · kp is a norm on Rn for any 1 ≤ p ≤ ∞.

(d) Use Q.2. to show that for any p 6= 2, the norm k · kp is NOT induced by any inner
product on Rn .

*4. Let A, B ⊆ Rn . Prove that

(a) ∂(A ∪ B) ⊆ ∂A ∪ ∂B.

(b) ∂(A ∩ B) ⊆ ∂A ∪ ∂B.
(c) ∂(A \ B) ⊆ ∂A ∪ ∂B.
(Hint: A \ B = A ∩ B c where B c = Rn \ B is the complement of B.)

5. Recall that a sequence {xk } in Rn is said to converge to c ∈ Rn if for any  > 0, there
exists N ∈ N such that if k ≥ N , then kxk − ck < . We write lim xk = c.
k→∞

Let A ⊆ Rn and f : A −→ Rm be a function. Suppose that c is a limit point of A. Prove

that the following two statements are equivalent.

(a) lim f (x) = b.

x→c
(b) For every sequence {xk } in A, if xk 6= c for all k ∈ N and {xk } converges to c, then
the sequence {f (xk )} converges to b, that is, lim f (xk ) = b.
k→∞

6. Let A ⊆ Rn and f : A −→ Rm be a function. Suppose that c is a limit point of A.

(a) Prove that if lim f (x) = b, then lim f (c + tv) = b for any nonzero v ∈ Rn .
x→c t→0

2
 (b) By considering the function

(y 2 − x)2
f (x, y) = for any (x, y) 6= (0, 0)
x2 + y 4

and its limit at (0, 0), show that the converse to the statement in (a) is false.

7. Prove or disprove that the set

  
1
A= x, sin : x ∈ (0, 1]
x

is compact in R2 .

8. Prove or disprove each of the following.

(a) A finite union of compact subsets of Rn is compact.

(b) A finite intersection of compact subsets of Rn is compact.
(c) The union of an arbitrary collection of compact subsets of Rn is compact.
(d) The intersection of an arbitrary collection of compact subsets of Rn is compact.

9. Let A ⊆ Rn . We say that A is sequentially compact if every sequence in A has a convergent

subsequence which converges to a point in A.

(a) Prove that if A ⊆ Rn is sequentially compact, then it is closed and bounded.

(b) Prove that if A ⊆ Rn is closed and bounded, then it is sequentially compact.
(Hint: You may use the Bolzano-Weierstrass Theorem which states that every bounded
sequence in Rn has a convergent subsequence.)

*10. Let (X, d) be a metric space. We say that X is separable if it has a dense countable subset
E (recall that a subset E is dense in X if E = X). Prove that if X is compact, then X
is separable.

11. Let A ⊆ Rn and f : A −→ Rm be a function. Prove that f is continuous on A if and

only if
f −1 (Int(B)) ⊆ Int(f −1 (B)) for any B ⊆ Rm .

12. Let A ⊆ Rn be a nonempty set and let f : Rn −→ R be defined by


1 if x ∈ A
f (x) =
0 if x ∈/ A.

Prove that for any x ∈ Rn , f is continuous at x if and only if x ∈

/ ∂A.

3
*13. (Contraction Mapping Principle)
Let (X, d) be a metric space and let φ : X −→ X be a function. Suppose that there is a
constant c ∈ (0, 1) such that

d(φ(x), φ(y)) ≤ c d(x, y) for any x, y ∈ X.

(Such a function is known as a contraction.)

(a) Prove that φ is continuous on X.

(b) Pick a point x1 ∈ X and construct the sequence {xn } by defining xn+1 = φ(xn ) for
any n ∈ N. Prove that {xn } is a Cauchy sequence.
(c) Now suppose that (X, d) is a complete metric space. Use (a) and (b) to prove that
φ has a fixed point. Prove also that such a fixed point is unique.

*14. Let f : A −→ Rm be a function with A ⊆ Rn compact.

(a) Prove that if f is injective and is continuous on A, then f −1 : f (A) −→ A is

continuous on f (A).
(b) Is the statement in (a) true if the compactness assumption on A is omitted?

Remark: Let X and Y be metric spaces. A bijection f : X −→ Y which is continuous

and whose inverse function f −1 is also continuous is called homeomorphism. This problem
suggests that f is a homeomorphism onto its image.

*15. Let A be a nonempty closed subset of Rn and let x ∈ Rn . Denote by d(x, A) the distance
between x and A, that is, d(x, A) = inf{kx − ak : a ∈ A}. Prove that there exists a0 ∈ A
such that
d(x, A) = kx − a0 k.

Hence show that d(x, A) = 0 if and only if x ∈ A.

*16. Let f : A −→ A be a continuous function with A ⊆ Rn compact. Suppose that f satisfies

kf (x) − f (y)k ≥ kx − yk

for any x, y ∈ A.

(a) Prove that f is injective and that the inverse f −1 : f (A) −→ A is continuous.
(b) Prove that f (A) = A.
(Hint: It suffices to show that A ⊆ f (A). Suppose there exists x ∈ A such that
x∈/ f (A). Define a sequence {xk } in A with x0 = x and xk+1 = f (xk ) for any
k ≥ 0.)