Past exam of the metric spaces and complex analysis course of the University of Oxford / 2023 / 2

A metric space $X$ is a compact space if every open cover $X={\bigcup }_{\alpha \in I}{U}_{\alpha }$, with all $U_{\alpha }$ open in $X$, has a finite subcover: finitely many indices ${\alpha }_1,\dots ,{\alpha }_r$ cover $X$.

It is a sequentially compact space if every sequence $(x_n)$ in $X$ has a convergent subsequence $(x_{n_k})$ whose limit of a sequence belongs to $X$. In formulas,A finite subcover is the defining test for compactness; a convergent subsequence is the defining test for sequential compactness.

Let $(x_n)$ be any sequence in the compact metric space $X$. There must be an $x\in X$ such that every open ball about $x$ contains $x_n$ for infinitely many indices $n$. Otherwise, for each $x\in X$ choose a ball $B(x,r_x)$ containing only finitely many terms, counted by indices. These balls are an open cover. A finite subcover would imply that only finitely many indices occur anywhere in $X$, a contradiction.

Now choose successively $n_k>n_{k-1}$ with $x_{n_k}\in B(x,1/k)$; infinitely many available indices make this possible. Then $d(x_{n_k},x)<1/k\to 0$, so $(x_{n_k})$ is a convergent subsequence. ThusThe proof counts indices rather than distinct points, so it also handles a value repeated infinitely often.

The source prints $m\ne 0$ in the zero case. Since the coordinates are indexed by positive integers, that overlaps its $m=n$ case and does not define a sequence. We use the intended coordinate vectors, with $e_m^{(n)}=1$ for $m=n$ and $e_m^{(n)}=0$ for $m\ne n$.

Every $e^{(n)}$ belongs to $X$, because its entries are bounded by one and its coordinate sequence eventually vanishes. If $n\ne k$, their supremum norm distance isIndeed, the difference is $1$ at coordinate $n$, $-1$ at coordinate $k$, and zero elsewhere. No subsequence is a Cauchy sequence, since arbitrarily late distinct terms remain distance one apart. Every convergent sequence is a Cauchy sequence, so no convergent subsequence exists. Therefore $\boxed{X\text{ is not sequentially compact}}$.

Yes. Let $(x^{(k)}{)}_{k\ge 1}$ be any sequence in $A$, where $x^{(k)}=(x_m^{(k)}{)}_{m\ge 1}$. At coordinate $m$, the values lie in the compact interval $[-1/m,1/m]$. By part (a)(ii) we can successively extract a convergent subsequence for coordinate one, a further one for coordinate two, and so on. Taking the diagonal indices gives a single subsequence $(x^{(k_j)})$ for whichThe closed interval bound passes to the limit, so $|x_m|\le 1/m$. Hence $x_m\to 0$ and $x=(x_m)\in A$.

Coordinate convergence alone would not imply supremum norm convergence. Here the common tail bound supplies the missing estimate. Given $ϵ>0$, choose $M$ with $2/(M+1)<ϵ$. For $m>M$,For the finitely many $m\le M$, coordinate convergence makes all differences less than $ϵ$ once $j$ is large. Therefore $d(x^{(k_j)},x)<ϵ$, andThis is an instance of compactness from uniformly vanishing sequence tails. The common $1/m$ bound is exactly what the coordinate vectors in part (i) lack.

By the permitted sequential compactness of the product metric space $X\times X$, the sequence of pairs $({\varphi }^{(k)}x,{\varphi }^{(k)}y)$ has a convergent subsequence, and hence a Cauchy subsequence. Choose two of its indices $r<s$ sufficiently late thatThe distance-increasing assumption iterates: $d({\varphi }^{(r)}u,{\varphi }^{(r)}v)\ge d(u,v)$. With $n=s-r\ge 1$, use $u=x,v={\varphi }^{(n)}x$, and then $u=y,v={\varphi }^{(n)}y$, to obtainBoth summands are nonnegative, soThe use of paired iterates ensures that the same positive return time works for both points.

Choose $n\ge 1$ as in part (i). Since distances between iterates are nondecreasing, the triangle inequality givesLetting $ϵ\downarrow 0$ and combining with the given reverse bound proves that $\varphi$ is an isometry:For surjectivity, fix $x\in X$ and use part (i) with $y=x$ and $ϵ=1/k$ to choose $n_k\ge 1$ satisfying $d(x,{\varphi }^{(n_k)}x)<1/k$. Put $z_k={\varphi }^{(n_k-1)}x$, interpreting ${\varphi }^{(0)}$ as the identity. By sequential compactness, a convergent subsequence satisfies $z_{k_j}\to z\in X$. The assumed continuity yieldsThus every $x$ has a preimage, and $\boxed{\varphi \text{ is surjective}}$. If $X$ is empty, both conclusions hold vacuously. This proves the distance-increasing self-map theorem for sequentially compact metric spaces.