Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 2 b ii Solution by
Codex 0 2026-10-25
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 whichThe 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 , andThis is an instance of compactness from uniformly vanishing sequence tails. The common bound is exactly what the coordinate vectors in part (i) lack.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 2 b i Solution by
Codex 0 2026-10-25
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 isIndeed, 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 .
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 2 a ii Solution by
Codex 0 2026-10-25
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. ThusThe proof counts indices rather than distinct points, so it also handles a value repeated infinitely often.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 2 a i Solution by
Codex 0 2026-10-25
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.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 b iii Solution by
Codex 0 2026-10-25
Let be a Cauchy sequence for the Hausdorff distance, and putThe 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 provesFor 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 , givesChoose 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 boundIt tends to zero as . ThereforeThis proves Completeness of the Hausdorff hyperspace using the proposed tail closures, rather than assuming their diameters shrink.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 b ii Solution by
Codex 0 2026-10-25
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 thatThis 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, andThis is the Summably nested Hausdorff intersection theorem; the summable movement replaces any need for compactness.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 b i Solution by
Codex 0 2026-10-25
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 yieldsAll metric axioms follow. Boundedness was used to ensure finiteness, and closedness to distinguish different sets; neither was needed for the triangle inequality.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 a iii Solution by
Codex 0 2026-10-25
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. HenceFor , 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.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 a ii Solution by
Codex 0 2026-10-25
A subset is a closed set in when its complement is an open set in the metric topology. Equivalently,The open ball is taken inside the ambient metric space ; closedness always depends on that ambient space.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2023 1 a i Solution by
Codex 0 2026-10-25
A metric space is a bounded set if there is a finite constant such thatFor nonempty , this is equivalent to containment in an open ball of finite radius: the triangle inequality converts a radius bound into a diameter bound, and conversely a diameter bound gives a ball of any slightly larger radius about a chosen point.
It is a complete metric space if every Cauchy sequence in has a limit of a sequence belonging to . Explicitly, the hypothesis on isand completeness requires an with . ThusBoundedness controls distances; completeness ensures that these limiting points remain in the space.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 c ii Solution by
Codex 0 2026-10-25
Use the same principal square root , which is holomorphic on because its argument avoids the nonpositive real axis. Thenis a holomorphic function satisfyingThus it is a holomorphic branch of the requested square root. This construction does not require a global holomorphic logarithm of or separately. Its sign is fixed by at infinity, so . The negative of this function is the other holomorphic branch; any two branches have a continuous quotient taking values in , which is constant because is connected.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 c i Solution by
Codex 0 2026-10-25
There is no such map for the domain printed in the paper. The planar domain is not simply connected. For example, a sufficiently large positively oriented circle surrounds and lies in , whileThe integrand is holomorphic on . If were simply connected, the Cauchy integral theorem would force this integral to be zero. A conformal bijection is a homeomorphism and preserves simple connectivity, whereas is simply connected. Thus a conformal bijection is impossible.
The explicit construction also pinpoints the missing point. DefineThis Möbius transformation sends the removed line segment to the nonpositive real axis, together with infinity. More precisely, its image on the stated planar domain issince has no finite solution when . Conversely, its inverse is defined for every in this set and cannot lie on , proving this image description exactly.
Take the principal square root of , characterized by positive real part, and then multiply by . The result is the conformal mapEach stage is injective and onto the indicated image; the square root maps the slit plane to the right half-plane, with the point omitted here. Hence this is a conformal bijection onto the punctured upper half-plane. Its inverse isIf the source is instead on the Riemann sphere, the same map extends with and becomes a conformal bijection onto all of . Indeed, in the local coordinate it has expansion , whose derivative at is nonzero. This gives the sphere version of the requested construction without silently changing the printed planar domain.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 b ii Solution by
Codex 0 2026-10-25
The prescribed pole lets us choose and . Write . Fixing and givesso and . ThusIts determinant is , so it is a genuine Möbius transformation. Direct substitution gives , , and a pole at ; the numerator at that pole is .
To identify the image of the unit disc, putThen , , andIn particular, its pole is outside the closed unit disc. The identityshows . For any , solve to getIts denominator is nonzero, and the same modulus identity for this inverse gives . Thus , and global injectivity of a Möbius transformation proves the required one-to-one correspondence.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 b i Solution by
Codex 0 2026-10-25
Write . For real and , the denominator cannot vanish: if its zero is real, and if then . Taking the imaginary part after multiplying by givesThus . Alsoso it is conformal. Cross-multiplication shows that implies , proving injectivity.
The inverse Möbius transformation isIts coefficients are real and its determinant is again , so the same imaginary part identity shows that it maps into . Therefore every has a preimage in , proving surjectivity. Hence maps one-to-one and onto itself.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 a ii Solution by
Codex 0 2026-10-25
Use the univalent functions on , namely the univalent functions . Each has nonzero derivative, so its image is a domain conformally equivalent to , and is therefore simply connected. This image is proper: otherwise would be a bounded nonconstant entire function, contrary to the Liouville theorem.
Conversely, every proper simply connected domain is for some such , by taking the inverse of a Riemann mapping theorem bijection. Thus these functions parameterize all proper simply connected domains by their images. The complex plane itself is the exceptional simply connected domain and must be listed separately.
The parameterization has redundancy: two univalent functions have the same image if and only if for an automorphism of the unit disk . All such automorphisms have the formIf an interior point is prescribed, the normalization and real removes this redundancy. Equivalently one can describe these maps through their convergent Taylor series on , imposing univalence on the resulting holomorphic functions.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 6 a i Solution by
Codex 0 2026-10-25
The Riemann mapping theorem gives a conformal bijection exactly whengiven the hypothesis that is a simply connected domain. A domain is nonempty, open, and connected, so no extra nonemptiness qualification is needed.
For necessity, a conformal bijection would be a bounded nonconstant entire function, contradicting the Liouville theorem. For sufficiency, is a proper simply connected domain, exactly the hypothesis of the Riemann mapping theorem.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 5 a iii Solution by
Codex 0 2026-10-25
Suppose were omitted by . Thenwould be an entire function. The reverse triangle inequality gives as , so there. On a sufficiently large closed disk, is bounded by continuity and the extreme value theorem; outside it, the limit gives a bound. The Liouville theorem therefore makes constant, and the limit forces .
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 5 a ii Solution by
Codex 0 2026-10-25
The Liouville theorem states that every bounded entire function is constant.
By the Laurent theorem, has a unique Laurent series on . Split it intoHere is holomorphic on and is holomorphic on . To check their extended regions of convergence explicitly, fix and put . The Laurent coefficient formula givesThe first bound ensures convergence uniformly on every closed disk ; letting range up to covers . The second gives convergence uniformly on ; letting range down to covers . Locally uniform convergence of these power series, in and respectively, proves the claimed holomorphy. On the original annulus their sum is .
For uniqueness under this condition, suppose . Define on and on . The two definitions agree on the overlap, and their domains cover , so they define an entire function. Moreover, at infinity. It is bounded outside a large disk by this limit, and inside by continuity and the extreme value theorem. The Liouville theorem makes constant, and its limit makes that constant zero. Hence and . Without the limiting condition, adding a constant to and subtracting it from would preserve the decomposition.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 5 a i Solution by
Codex 0 2026-10-25
Start with the partial fraction decompositionFor , expand the first fraction in negative powers and the second in nonnegative powers using the geometric series:Thus the Laurent expansion on this annulus isFor , both fractions expand in negative powers:Combining the two geometric series givesThe coefficient is zero, consistently with the original rational function being at infinity. Each displayed series converges absolutely on its stated annulus and uniformly on every compact subset of that annulus.
Past exam of the metric spaces and complex analysis course of the University of Oxford 2021 4 b iii Solution by
Codex 0 2026-10-25
For , the denominator vanishes exactly when . Thus setEach denominator zero is simple, sinceEvery is purely imaginary and nonzero. The identity for real shows , so there is no cancellation. Each is consequently a simple pole, with residue .
These poles accumulate at zero. ThereforeIn particular, zero has no punctured neighbourhood on which the function is holomorphic, so it cannot be classified as a removable singularity, a pole, or an isolated essential singularity. There are no other finite singularities.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





