Yes. An explicit holomorphic surjection is the rational function
Its denominator never vanishes inside the unit disc. To prove surjectivity, take any and choose a square root of with ; one of the two opposite roots always has this property. Define . Then and
so . Also , and consequently .
This is a holomorphic surjection from the unit disc onto the complex plane. It does not contradict part (i): it is not injective. For example, , with two distinct arguments of modulus .
Suppose were a holomorphic bijection. By the allowed nonvanishing derivative result, throughout . The holomorphic inverse function theorem gives a holomorphic inverse locally at every image point. Since is globally bijective, these local inverses agree with its global inverse .
Thus is an entire function with . The Liouville theorem forces to be constant, contradicting its being an inverse. Therefore
This is the analytic obstruction behind the fact that the complex plane and unit disc are homeomorphic but not conformally equivalent.
Let , the right half-disc from part (i). Write with and . Squaring doubles the angle and squares the radius, giving a holomorphic bijection
Its inverse is the unique square root with positive real part, and its derivative is nonzero on . The cut includes zero, because .
Next, the Möbius transformation is a conformal bijection from onto : it is the inverse Cayley transform between the half-plane and disk composed with . For , , it gives
Consequently . Since is a bijection on the whole disc, deleting this interval deletes exactly that ray in the image.
The required function composition is therefore
Each component is a conformal bijection between the indicated domains. The only possible denominator zeros of the simplified expression are , outside , and
since is on the excluded semicircle and is outside the upper half-plane. This also checks the local conformality of the conformal map from the exterior half-disc to a slit half-plane.
For , direct calculation gives
Conversely, solving gives
The denominator cannot vanish inside the unit disc, so these inverse formulas prove . This is the Cayley transform between the half-plane and disk.
For , we also require . In inverse coordinates this becomes
The equivalence holds in both directions, so
Thus the exterior of the unit semicircle maps to the right half of the unit disc. The circular arc maps to its imaginary diameter, which is excluded because the source inequality is strict.
At , complex differentiability gives
Writing , the assumption gives . Its real derivative is therefore the similarity , a rotation through followed by scaling by .
More explicitly, for two differentiable curves with and nonzero tangent vectors, the chain rule gives
Taking the complex argument of this ratio shows that the oriented angle is preserved, while nonvanishing ensures both image tangents remain regular. Thus
A conformal map at a point is a map that preserves oriented angles between regular differentiable curves through . In the differential formulation, it is real differentiable at and its derivative is an orientation-preserving similarity: a rotation followed by multiplication of lengths by a positive constant. The map is conformal on when it has this property at every point:
Here is a planar rotation. Conformality is a local property and does not itself require global injectivity. We use the oriented convention standard in complex analysis; a reflection reverses oriented angles.
A function has a pole of order at when, on a punctured neighbourhood,
Equivalently, has a removable singularity whose extension is nonzero at . After shrinking the neighbourhood so , its reciprocal extends with a zero of order . In particular, at a pole.
A holomorphic function has a zero of order at when it is holomorphic on a neighbourhood of and factors as
Equivalently, and . The order of a zero of a holomorphic function is the degree of the first nonzero term of its Taylor series.
An isolated singularity at is a removable singularity when there is a holomorphic function on a full disc agreeing with away from . Equivalently,
The Riemann removable singularity theorem also characterizes this by boundedness of on a sufficiently small punctured disc. A preassigned incorrect value at is replaced by .
A function has an isolated singularity at if, for some , it is defined and holomorphic on the punctured disc , while a holomorphic extension through has not been assumed. In particular, its domain omits , or its assigned value there fails to give such an extension. The key local condition is
The convention includes removable singularities, even when a suitable extension would eliminate the missing point.
Choose as in part (i). Since distances between iterates are nondecreasing, the triangle inequality gives
Letting and combining with the given reverse bound proves that is an isometry:
For surjectivity, fix and use part (i) with and to choose satisfying . Put , interpreting as the identity. By sequential compactness, a convergent subsequence satisfies . The assumed continuity yields
Thus every has a preimage, and . If is empty, both conclusions hold vacuously. This proves the distance-increasing self-map theorem for sequentially compact metric spaces.
By the permitted sequential compactness of the product metric space , the sequence of pairs has a convergent subsequence, and hence a Cauchy subsequence. Choose two of its indices sufficiently late that
The distance-increasing assumption iterates: . With , use , and then , to obtain
Both summands are nonnegative, so
The use of paired iterates ensures that the same positive return time works for both points.
Yes. Let be any sequence in , where . At coordinate , the values lie in the compact interval . 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 for which
The closed interval bound passes to the limit, so . Hence and .
Coordinate convergence alone would not imply supremum norm convergence. Here the common tail bound supplies the missing estimate. Given , choose with . For ,
For the finitely many , coordinate convergence makes all differences less than once is large. Therefore , and
This is an instance of compactness from uniformly vanishing sequence tails. The common bound is exactly what the coordinate vectors in part (i) lack.
The source prints in the zero case. Since the coordinates are indexed by positive integers, that overlaps its case and does not define a sequence. We use the intended coordinate vectors, with for and for .
Every belongs to , because its entries are bounded by one and its coordinate sequence eventually vanishes. If , their supremum norm distance is
Indeed, the difference is at coordinate , at coordinate , 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 .
Let be any sequence in the compact metric space . There must be an such that every open ball about contains for infinitely many indices . Otherwise, for each choose a ball 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 , a contradiction.
Now choose successively with ; infinitely many available indices make this possible. Then , so is a convergent subsequence. Thus
The proof counts indices rather than distinct points, so it also handles a value repeated infinitely often.
A metric space is a compact space if every open cover , with all open in , has a finite subcover: finitely many indices cover .
It is a sequentially compact space if every sequence in has a convergent subsequence whose limit of a sequence belongs to . In formulas,
A finite subcover is the defining test for compactness; a convergent subsequence is the defining test for sequential compactness.
Let be a Cauchy sequence for the Hausdorff distance, and put
The bounded set hypothesis makes finite, and the Cauchy sequence property gives . Each is nonempty and a closed set, with .
We need estimates that survive taking the closure. For every nonempty , the distance to a set is Lipschitz continuous with constant one: the triangle inequality gives , and interchanging proves
For every , points of have distance at most from . The same holds throughout their union and its closure, by this continuity. Since ,
More generally, if , every point in is within of . Passing to its closure again, and using , gives
Choose strictly increasing indices with . Then satisfies part (ii), so it converges in Hausdorff distance to the nonempty closed set , with .
For , the triangle inequality gives the explicit full-sequence bound
It tends to zero as . Therefore
This proves Completeness of the Hausdorff hyperspace using the proposed tail closures, rather than assuming their diameters shrink.
The intersection is a closed set because arbitrary intersections of closed sets are closed. Its nonemptiness needs a construction: bounded closed sets need not be compact sets in this setting.
Fix , , and . Recursively choose , for , using the approximation property of an infimum so that
This is possible because and . The two bounds form convergent geometric series, so the triangle inequality shows is a Cauchy sequence. By completeness it converges to some .
For each fixed , all sufficiently late lie in , by nesting. Closedness of gives , and hence . In particular, starting with any proves . Moreover,
For each starting point , let in this bound on its distance to a set . This does not assert that a nearest point exists. It proves . Since , the other directed Hausdorff distance is zero, and
This is the Summably nested Hausdorff intersection theorem; the summable movement replaces any need for compactness.
Write , so that is the Hausdorff distance. Since is a bounded set, there is a finite with . Nonemptiness of therefore gives , so is finite. Its symmetry and nonnegativity are immediate, as is .
If , then every has zero distance to a set . Since is a closed set, part (a)(iii) gives . Interchanging the sets gives . Thus implies . Closedness is essential here: without it a set and its closure have Hausdorff distance zero.
For the triangle inequality, fix and . The approximation property of an infimum supplies with , and then with . Consequently,
Let and take the supremum over to obtain . Applying this inequality in the reverse direction as well yields
All metric axioms follow. Boundedness was used to ensure finiteness, and closedness to distinguish different sets; neither was needed for the triangle inequality.
First suppose is a closed set. If , the definition in part (ii) gives an open ball disjoint from . Thus every has , and the distance to a set satisfies . Its contrapositive is the required implication.
Conversely, suppose that zero distance to a set forces membership. For we have . Choose . Then , proving is an open set. Hence
For , use the extended-real convention : both assertions hold, with the implication vacuous. Part (b) only uses nonempty sets, so all its distances to a set are ordinary finite real numbers.

There are unlisted articles, also show them or only show them.