Self-maps of compact metric spaces

[7/57%]
Show
LaTeX

Let XX be a compact metric space and f:X→Xf : X \to X an isometry. Show that f(X)=Xf(X) = X.

?

Let KK be a nonempty compact set in a metric space with distance function dd. Suppose that φ:K→K\varphi : K \to K satisfies

d(φ(x),φ(y))<d(x,y) d(\varphi (x), \varphi (y)) < d(x,y)

for all x≠yx \neq y in KK. Show there exists precisely one point x∈Kx \in K such that x=φ(x)x = \varphi (x).

?

Prove that if a set MM is compact in a metric space XX, and a mapping f:M→Mf: M \rightarrow M satisfies the inequality ρ(f(x),f(y))<ρ(x,y)\rho (f(x), f(y)) < \rho (x, y) for any x≠yx \neq y, then there exists a unique fixed point x∈Mx \in M (compare with problem 1.74 and Theorem 1.4).

Theorem 1.4 (contraction mapping principle): let f:X→Xf: X \rightarrow X be a contraction mapping (i.e., there exists q∈[0,1)q \in [0, 1) such that ρ(f(x1),f(x2))⩽q⋅ρ(x1,x2)\rho (f(x_{1}), f(x_{2})) \leqslant q \cdot \rho (x_{1}, x_{2}) for all x1,x2∈Xx_{1}, x_{2} \in X) on a complete metric space XX. Then there exists a unique point x0∈Xx_{0} \in X such that f(x0)=x0f(x_{0}) = x_{0}; this point is the limit of the recursively defined sequence xn=f(xn−1)x_{n} = f(x_{n-1}) with an arbitrary starting point x1∈Xx_{1} \in X.

?

Prove that in a metric space any isometric embedding of a compact into itself is an isometry of this compact (and show that this is false for an arbitrary closed bounded set).

?

Let XX be a complete metric space, MM a compact set in it, φ:M→M\varphi : M \rightarrow M a mapping satisfying the inequality ρ(φ(x),φ(y))⩾ρ(x,y)\rho (\varphi (x), \varphi (y)) \geqslant \rho (x, y). Prove that φ\varphi is an isometry of the set MM.

?

Let XX be a compact metric space and TT a mapping from XX into itself such that

ρ(T(u),T(v))<ρ(u,v) for all u,v∈X,u≠v. \rho (T(u), T(v)) < \rho (u, v) \text{ for all } u, v \in X, u \neq v .

Show that TT has a unique fixed-point.

?

Define f(x)=π/2+x−arctan⁡xf(x) = \pi / 2+x-\arctan x for all real numbers xx. Show that

∣f(u)−f(v)∣<∣u−v∣ for all u,v∈R,u≠v.  \left|f(u)-f(v)\right| < \left|u-v\right| \text{ for all } u, v \in \mathbb {R}, u \neq v \text{. }

Show that ff does not have a fixed-point. Does this contradict the preceding problem?

?

References

[deSi04] de Souza P.N., Silva J. Berkeley Problems in Mathematics. 3rd ed., Springer, 2004.
[БСШ17] Бородин П.А., Савчук А.М., Шейпак И.А. Задачи по функциональному анализу. МЦНМО, 2017.
[RoFi23] Royden H.L., Fitzpatrick P.M. Real Analysis. 5th ed., Pearson, 2023.