Scribd
Upload
8 views3 pages

HW 04

The document outlines a mathematical analysis assignment focusing on fixed-point theorems and convergence in metric spaces. It includes problems related to Newton's method, contraction mappings, and properties of continuous functions within compact subsets. The assignment requires proofs and demonstrations of various mathematical concepts and theorems.

Uploaded by

hubertkuo418
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views3 pages

HW 04

The document outlines a mathematical analysis assignment focusing on fixed-point theorems and convergence in metric spaces. It includes problems related to Newton's method, contraction mappings, and properties of continuous functions within compact subsets. The assignment requires proofs and demonstrations of various mathematical concepts and theorems.

Uploaded by

hubertkuo418
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Mathematical Analysis II

Assignment 4
1. Suppose that f : [a, b] → R is twice continuous differentiable;
that is, f 0 , f 00 : [a, b] → R are continuous, and f (a) < 0 =
f (c) < f (b), and f 0 (x) 6= 0 for all x ∈ [a, b]. Consider the
function
f (x)
Φ(x) = x − 0 .
f (x)
(i) Show that Φ : [a, b] → R satisfies
|Φ(x) − Φ(y)| ≤ k|x − y|, ∀ x, y ∈ [a, b]
for some k ∈ [0, 1) if |b − a| are small enough.
(ii) Suppose that f 00 (x) > 0 for all x ∈ [a, b]. Show that there
exists a ≤ ã < c such that Φ : [ã, b] → [ã, b].
(iii) Under the condition of (ii), show that if x0 ∈ [ã, b], then
the iteration
xk+1 = Φ(xk ), ∀ k ∈ N ∪ {0}
provides a convergent sequence {xk }∞k=1 with limit c.
(The iteration scheme above of finding the zero c of f is called
the Newton’s method.)
2. Let (M, d) be a metric space, K ⊆ M be a compact subset, and
f : M → M . Define
fk = f ◦ f ◦ · · · ◦ f
| {z }
k times

to be the k-th iterate of f .


(i) If (M, d) is complete and if there exists a sequence
 {αk }∞
k=1 ⊆
R such that lim αk = 0 and d fk (x), fk (y) ≤ αk d(x, y) for
k→∞
all k ∈ N, x, y ∈ M . Show that f has a unique fixed-point.
(ii) If f ∈ C (M ; M ) and fk has a unique fixed-point x0 . Show
that it is also a fixed-point of f .
(iii) If f ∈ C (K; K) and d f (x), f (y) < d(x, y) for all x, y ∈ K
with x 6= y. Show that f has a unique fixed-point in K.
Show that the conclusion is false if K is not compact.
(iv) If f ∈ C ([0, 1]; [0, 1]) and |f (x)−f (y)| ≤ |x−y| for all x, y ∈
[0, 1]. Given any x1 ∈ [0, 1], define a sequence {xk }∞ k=1 by
1 
xk+1 = xk + f (xk ) ∀k > 1.
2
Show that {xk }∞
k=1 converges to a fixed-point of f .

3. Let (M, d) be  a metric space, and f : M → M be such that


d f (x), f (y) < d(x, y) for all x, y ∈ M, x 6= y.
(i) Fix x0 ∈ M . Let xn+1 = f (xn ), and cn = d(xn , xn+1 ).
Show that {cn }∞ n=1 is a decreasing sequence; thus c =
lim cn exists.
n→∞
(ii) Assume that there is a subsequence {xnj }∞ ∞
j=1 ⊆ {xn }n=1
such that xnj → x as j → ∞. Show that
 
c = d x, f (x) = d f (x), f (f (x)) .
and deduce that x is a fixed-point of f .
(iii) Suppose further that M is compact. Show that the se-
quence {xn }∞
n=1 itself converges to x.

4. Find an upper bound on r > 0 such that the mapping


T : C ([0, r]; R) → C ([0, r]; R) defined by
Z x
T (f )(x) = 1 + 3 tf (t)dt
0

is a contraction mapping. What is its fixed-point?


5. Let A = [a, b] × [a, b] be a closed square in R2 , M = C ([a, b]; R),
and K : A → R be a continuous function. For f ∈ C ([a, b]; R),
define
Z b
T (f )(x) = K(x, y)f (y)dy ∀ x ∈ [a, b].
a

(i) Show that T (f ) ∈ M for all f ∈ M , and T : M → M is


Lipschitz continuous. Find a Lipschitz constant for T .
(ii) If B ⊆ M is a bounded subset of M , show that the image
T (B) = {T (f ) | f ∈ B} is uniformly bounded and equi-
continuous.
1
(iii) If the norm kKk∞ < , show that T is a contraction
b−a
mapping. What is its fixed point?
1
(iv) If kKk∞ < , show that the mapping S : M → M
b−a
defined by S(f ) = f − T (f ) is a homeomorphism, that is,
S is bijective and both S and S −1 are continuous on M .
1
(v) Let a = 0, b = 1 and K(x, y) = ex+y−1 . Show that
4
kKk∞ < 1. Given g ∈ M , find f ∈ M such that S(f ) = g.
(vi) If the continuity of f is removed from the condition that
we just consider the family of functions
 
T (f ) is well-defined and ∃M > 0
F = f : [a, b] → R
such that |f (y)| ≤ M on [a, b]
Let G = T (F). Show that each sequence of G contains a
uniformly convergent subsequences.

You might also like