Basic Analysis I — Real Analysis · Problem 7.6.8

Metric Spaces — Jiri Lebl

Mathematics — Real Analysis · fixed-point-theorem

Problem

Suppose f:X→Xf: X \to X is a contraction for k<1k < 1. Suppose you use the iteration procedure with xn+1≔f(xn)x_{n+1} \coloneqq f(x_n) as in the proof of the fixed point theorem. Suppose xx is the fixed point of ff. a) Show that d(x,xn)≤knd(x1,x0)11−kd(x, x_n) \leq k^n d(x_1, x_0) \dfrac{1}{1-k} for all n∈Nn \in \mathbb{N}. b) Suppose d(y1,y2)≤16d(y_1, y_2) \leq 16 for all y1,y2∈Xy_1, y_2 \in X, and k=1/2k = 1/2. Find an NN such that starting at any given point x0∈Xx_0 \in X, d(x,xn)≤2−16d(x, x_n) \leq 2^{-16} for all n≥Nn \geq N.

Related theory

Browse the problem library