# Riemann mapping theorem

(Redirected from Riemann Mapping Theorem)

In complex analysis, the Riemann mapping theorem states that if U is a non-empty simply connected open subset of the complex number plane C which is not all of C, then there exists a biholomorphic mapping f (i.e. a bijective holomorphic mapping whose inverse is also holomorphic) from U onto the open unit disk

${\displaystyle D=\{z\in \mathbf {C} :|z|<1\}.}$

This mapping is known as a Riemann mapping.[1]

Intuitively, the condition that U be simply connected means that U does not contain any “holes”. The fact that f is biholomorphic implies that it is a conformal map and therefore angle-preserving. Intuitively, such a map preserves the shape of any sufficiently small figure, while possibly rotating and scaling (but not reflecting) it.

Henri Poincaré proved that the map f is essentially unique: if z0 is an element of U and φ is an arbitrary angle, then there exists precisely one f as above such that f(z0) = 0 and such that the argument of the derivative of f at the point z0 is equal to φ. This is an easy consequence of the Schwarz lemma.

As a corollary of the theorem, any two simply connected open subsets of the Riemann sphere which both lack at least two points of the sphere can be conformally mapped into each other.

## History

The theorem was stated (under the assumption that the boundary of U is piecewise smooth) by Bernhard Riemann in 1851 in his PhD thesis. Lars Ahlfors wrote once, concerning the original formulation of the theorem, that it was “ultimately formulated in terms which would defy any attempt of proof, even with modern methods”. Riemann's flawed proof depended on the Dirichlet principle (which was named by Riemann himself), which was considered sound at the time. However, Karl Weierstrass found that this principle was not universally valid. Later, David Hilbert was able to prove that, to a large extent, the Dirichlet principle is valid under the hypothesis that Riemann was working with. However, in order to be valid, the Dirichlet principle needs certain hypotheses concerning the boundary of U which are not valid for simply connected domains in general. Simply connected domains with arbitrary boundaries were first treated by William Fogg Osgood (1900).

The first proof of the theorem is due to Constantin Carathéodory, who published it in 1912. His proof used Riemann surfaces and it was simplified by Paul Koebe two years later in a way which did not require them.

Another proof, due to Lipót Fejér and to Frigyes Riesz, was published in 1922 and it was rather shorter than the previous ones. In this proof, like in Riemann's proof, the desired mapping was obtained as the solution of an extremal problem. The Fejér–Riesz proof was further simplified by Alexander Ostrowski and by Carathéodory.

## Importance

The following points detail the uniqueness and power of the Riemann mapping theorem:

• Even relatively simple Riemann mappings (for example a map from the interior of a circle to the interior of a square) have no explicit formula using only elementary functions.
• Simply connected open sets in the plane can be highly complicated, for instance the boundary can be a nowhere-differentiable fractal curve of infinite length, even if the set itself is bounded. The fact that such a set can be mapped in an angle-preserving manner to the nice and regular unit disc seems counter-intuitive.
• The analog of the Riemann mapping theorem for more complicated domains is not true. The next simplest case is of doubly connected domains (domains with a single hole). Any doubly connected domain except for the punctured disk and the punctured plane is conformally equivalent to some annulus {z : r < |z| < 1} with 0 < r < 1, however there are no conformal maps between annuli except inversion and multiplication by constants so the annulus {z : 1 < |z| < 2} is not conformally equivalent to the annulus {z : 1 < |z| < 4} (as can be proven using extremal length).
• The analogue of the Riemann mapping theorem in three or more real dimensions is not true. The family of conformal maps in three dimensions is very poor, and essentially contains only Möbius transformations.
• Even if arbitrary homeomorphisms in higher dimensions are permitted, contractible manifolds can be found that are not homeomorphic to the ball (e.g., the Whitehead continuum).
• The Riemann mapping theorem is the easiest way to prove that any two simply connected domains in the plane are homeomorphic. Even though the class of continuous functions is vastly larger than that of conformal maps, it is not easy to construct a one-to-one function onto the disk knowing only that the domain is simply connected.

## A sketch proof

Given U and a point z0 in U, we want to construct a function f which maps U to the unit disk and z0 to 0. For this sketch, we will assume that U is bounded and its boundary is smooth, much like Riemann did. Write

${\displaystyle f(z)=(z-z_{0})e^{g(z)}}$

where g = u + iv is some (to be determined) holomorphic function with real part u and imaginary part v. It is then clear that z0 is the only zero of f. We require |f(z)| = 1 for z ∈ ∂U, so we need

${\displaystyle u(z)=-\log |z-z_{0}|}$

on the boundary. Since u is the real part of a holomorphic function, we know that u is necessarily a harmonic function; i.e., it satisfies Laplace's equation.

The question then becomes: does a real-valued harmonic function u exist that is defined on all of U and has the given boundary condition? The positive answer is provided by the Dirichlet principle. Once the existence of u has been established, the Cauchy–Riemann equations for the holomorphic function g allow us to find v (this argument depends on the assumption that U be simply connected). Once u and v have been constructed, one has to check that the resulting function f does indeed have all the required properties.

## Uniformization theorem

The Riemann mapping theorem can be generalized to the context of Riemann surfaces: If U is a non-empty simply-connected open subset of a Riemann surface, then U is biholomorphic to one of the following: the Riemann sphere, C or D. This is known as the uniformization theorem.

## Smooth Riemann mapping theorem

In the case of a simply connected bounded domain with smooth boundary, the Riemann mapping function and all its derivatives extend by continuity to the closure of the domain. This can be proved using regularity properties of solutions of the Dirichlet boundary value problem, which follow either from the theory of Sobolev spaces for planar domains or from classical potential theory. Other methods for proving the smooth Riemann mapping theorem include the theory of kernel functions[2] or the Beltrami equation.

## Algorithms

Computational conformal mapping is prominently featured in problems of applied analysis and mathematical physics, as well as in engineering disciplines, such as image processing.

In the early 1980s an elementary algorithm for computing conformal maps was discovered. Given points ${\displaystyle z_{0},\dots ,z_{n}}$ in the plane, the algorithm computes an explicit conformal map of the unit disk onto a region bounded by a Jordan curve ${\displaystyle \gamma }$ with ${\displaystyle z_{0},\dots ,z_{n}\in \gamma }$. This algorithm converges for Jordan regions in the sense of uniformly close boundaries. There are corresponding uniform estimates on the closed region and the closed disc for the mapping functions and their inverses. Improved estimates are obtained if the data points lie on a ${\displaystyle C^{1}}$ curve or a K-quasicircle. The algorithm was discovered as an approximate method for conformal welding; however, it can also be viewed as a discretization of the Loewner differential equation.[3]

The following is known about numerically approximating the conformal mapping between two planar domains.[4]

Positive results:

• There is an algorithm A that computes the uniformizing map in the following sense. Let Ω be a bounded simply-connected domain, and w0 ∈ Ω. ∂Ω is provided to A by an oracle representing it in a pixelated sense (i.e., if the screen is divided to ${\displaystyle 2^{n}\times 2^{n}}$ pixels, the oracle can say whether each pixel belongs to the boundary or not). Then A computes the absolute values of the uniformizing map φ: (Ω, w0) → (D, 0) with precision ${\displaystyle 2^{-n}}$ in space bounded by ${\displaystyle C\cdot n^{2}}$ and time ${\displaystyle 2^{O(n)}}$, where C depends only on the diameter of Ω and d(w0, ∂Ω). Furthermore, the algorithm computes the value of φ(w) with precision ${\displaystyle 2^{-n}}$ as long as |φ(w)| < ${\displaystyle 1-2^{-n}}$. Moreover, A queries ∂Ω with precision of at most ${\displaystyle 2^{-O(n)}}$. In particular, if ∂Ω is polynomial space computable in space ${\displaystyle n^{a}}$ for some constant ${\displaystyle a\geq 1}$ and time ${\displaystyle T(n)<2^{O(n^{a})}}$, then A can be used to compute the uniformizing map in space ${\displaystyle C\cdot n^{\max(a,2)}}$ and time ${\displaystyle 2^{O(n^{a})}}$.
• There is an algorithm A' that computes the uniformizing map in the following sense. Let Ω be a bounded simply-connected domain, and w0 ∈ Ω. Suppose that for some ${\displaystyle n=2^{k}}$, ∂Ω is given to A' with precision ${\displaystyle {1 \over n}}$ by ${\displaystyle O(n^{2})}$ pixels. Then A' computes the absolute values of the uniformizing map φ: (Ω, w0) → (D,0) within an error of ${\displaystyle O(1/n)}$ in randomized space bounded by ${\displaystyle O(k)}$ and time polynomial in ${\displaystyle n=2^{k}}$ (that is, by a BPL(n)-machine). Furthermore, the algorithm computes the value of φ(w) with precision 1/n as long as |φ(w)| < 1 − 1/n.

Negative results:

• Suppose there is an algorithm A that given a simply-connected domain Ω with a linear-time computable boundary and an inner radius > 1/2 and a number ${\displaystyle n}$ computes the first ${\displaystyle 20n}$ digits of the conformal radius r(Ω,0), then we can use one call to A to solve any instance of a #SAT(n) with a linear time overhead. In other words, #P is poly-time reducible to computing the conformal radius of a set.
• Consider the problem of computing the conformal radius of a simply-connected domain Ω, where the boundary of Ω is given with precision ${\displaystyle 1/n}$ by an explicit collection of ${\displaystyle O(n^{2})}$ pixels. Denote the problem of computing the conformal radius with precision ${\displaystyle 1/n^{c}}$ by ${\displaystyle CONF(n,n^{c})}$. Then, ${\displaystyle MAJ_{n}}$ is AC0 reducible to ${\displaystyle CONF(n,n^{c})}$ for any ${\displaystyle 0.