Riemann mapping theorem
{{Short description|Mathematical theorem}}
{{Complex analysis sidebar}}
In complex analysis, the Riemann mapping theorem states that if is a non-empty simply connected open subset of the complex number plane which is not all of , then there exists a biholomorphic mapping (i.e. a bijective holomorphic mapping whose inverse is also holomorphic) from onto the open unit disk
:
This mapping is known as a Riemann mapping.The existence of f is equivalent to the existence of a Green’s function.
Intuitively, the condition that be simply connected means that does not contain any “holes”. The fact that is biholomorphic implies that it is a conformal map and therefore angle-preserving. Such a map may be interpreted as preserving the shape of any sufficiently small figure, while possibly rotating and scaling (but not reflecting) it.
Henri Poincaré proved that the map is unique up to rotation and recentering: if is an element of and is an arbitrary angle, then there exists precisely one f as above such that and such that the argument of the derivative of at the point 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 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”.{{Citation | last=Ahlfors | first=Lars | author-link=Lars Ahlfors | title=Developments of the Theory of Conformal Mapping and Riemann Surfaces Through a Century | journal=Contributions to the Theory of Riemann Surfaces | editor1=L. Ahlfors | editor2=E. Calabi | editor3=M. Morse | editor4=L. Sario | editor5=D. Spencer | year=1953 | pages=3–4}} 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 (namely, that it is a Jordan curve) which are not valid for simply connected domains in general.
The first rigorous proof of the theorem was given by William Fogg Osgood in 1900. He proved the existence of Green's function on arbitrary simply connected domains other than itself; this established the Riemann mapping theorem.For the original paper, see {{harvnb|Osgood|1900}}. For accounts of the history, see {{harvnb|Walsh|1973|pp=270–271}}; {{harvnb|Gray|1994|pp=64–65}}; {{harvnb|Greene|Kim|2017|p=4}}. Also see {{harvnb|Carathéodory|1912|p=108|loc=footnote **}} (acknowledging that {{harvnb|Osgood|1900}} had already proven the Riemann mapping theorem).
Constantin Carathéodory gave another proof of the theorem in 1912, which was the first to rely purely on the methods of function theory rather than potential theory.{{harvnb|Gray|1994|pp=78–80}}, citing {{harvnb|Carathéodory|1912}} His proof used Montel's concept of normal families, which became the standard method of proof in textbooks.{{harvnb|Greene|Kim|2017|p=1}} Carathéodory continued in 1913 by resolving the additional question of whether the Riemann mapping between the domains can be extended to a homeomorphism of the boundaries (see Carathéodory's theorem).{{harvnb|Gray|1994|pp=80–83}}
Carathéodory's proof used Riemann surfaces and it was simplified by Paul Koebe two years later in a way that 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.{{Cite web |title=What did Riemann Contribute to Mathematics? Geometry, Number Theory and Others |url=https://www.researchgate.net/publication/344401528}}
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. One such example is the Koch curve.{{cite journal |last1=Lakhtakia |first1=Akhlesh |last2=Varadan |first2=Vijay K. |last3=Messier |first3=Russell |title=Generalisations and randomisation of the plane Koch curve |journal=Journal of Physics A: Mathematical and General |date=August 1987 |volume=20 |issue=11 |pages=3537–3541 |doi=10.1088/0305-4470/20/11/052}} 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 with
- 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 (see Liouville's theorem).
- 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 analogue of the Riemann mapping theorem in several complex variables is also not true. In
\mathbb{C}^n (n \ge 2 ), the ball and polydisk are both simply connected, but there is no biholomorphic map between them.{{harvnb|Remmert|1998}}, section 8.3, p. 187
Proof via normal families
{{main|Normal families}}
= Simple connectivity =
Theorem. For an open domain
- {{harvnb|Ahlfors|1978}}
- {{harvnb|Beardon|1979}}
- {{harvnb|Conway|1978}}
- {{harvnb|Gamelin|2001}}
G is simply connected;- the integral of every holomorphic function
f around a closed piecewise smooth curve inG vanishes; - every holomorphic function in
G is the derivative of a holomorphic function; - every nowhere-vanishing holomorphic function
f onG has a holomorphic logarithm; - every nowhere-vanishing holomorphic function
g onG has a holomorphic square root; - for any
w\notin G , the winding number ofw for any piecewise smooth closed curve inG is0 ; - the complement of
G in the extended complex plane\mathbb{C}\cup\{\infty\} is connected.
(1) ⇒ (2) because any continuous closed curve, with base point
(2) ⇒ (3) because the integral over any piecewise smooth path
(3) ⇒ (4) by integrating
(4) ⇒ (5) by taking the square root as
(5) ⇒ (6) because if
(6) ⇒ (7) for otherwise the extended plane
over
(7) ⇒ (1) This is a purely topological argument. Let
= Riemann mapping theorem =
- Weierstrass' convergence theorem. The uniform limit on compacta of a sequence of holomorphic functions is holomorphic; similarly for derivatives.
::This is an immediate consequence of Morera's theorem for the first statement. Cauchy's integral formula gives a formula for the derivatives which can be used to check that the derivatives also converge uniformly on compacta.{{harvnb|Gamelin|2001}}
- Hurwitz's theorem. If a sequence of nowhere-vanishing holomorphic functions on an open domain has a uniform limit on compacta, then either the limit is identically zero or the limit is nowhere-vanishing. If a sequence of univalent holomorphic functions on an open domain has a uniform limit on compacta, then either the limit is constant or the limit is univalent.
::If the limit function is non-zero, then its zeros have to be isolated. Zeros with multiplicities can be counted by the winding number
Definitions. A family
A family
- Montel's theorem. Every locally bounded family of holomorphic functions in a domain
G is normal.
::Let
:::
::we have that
:::
::Hence the sequence
- Riemann mapping theorem. If
G\neq\mathbb{C} is a simply connected domain anda\in G , there is a unique conformal mappingf ofG onto the unit diskD normalized such thatf(a)=0 andf'(a)>0 .
::Uniqueness follows because if
:::
::with
::To prove existence, take
:::
::where
:::
+\sqrt{|c|^{-1}}\right)/2>f'(a)=M.c
::This contradicts the maximality of
Remark. As a consequence of the Riemann mapping theorem, every simply connected domain in the plane is homeomorphic to the unit disk. If points are omitted, this follows from the theorem. For the whole plane, the homeomorphism
= Parallel slit mappings =
Koebe's uniformization theorem for normal families also generalizes to yield uniformizers
:
near
The first proof that parallel slit domains were canonical domains for in the multiply connected case was given by David Hilbert in 1909. {{harvtxt|Jenkins|1958}}, on his book on univalent functions and conformal mappings, gave a treatment based on the work of Herbert Grötzsch and René de Possel from the early 1930s; it was the precursor of quasiconformal mappings and quadratic differentials, later developed as the technique of extremal metric due to Oswald Teichmüller.{{harvnb|Jenkins|1958|pages=77–78}} Menahem Schiffer gave a treatment based on very general variational principles, summarised in addresses he gave to the International Congress of Mathematicians in 1950 and 1958. In a theorem on "boundary variation" (to distinguish it from "interior variation"), he derived a differential equation and inequality, that relied on a measure-theoretic characterisation of straight-line segments due to Ughtred Shuttleworth Haslam-Jones from 1936. Haslam-Jones' proof was regarded as difficult and was only given a satisfactory proof in the mid-1970s by Schober and Campbell–Lamoureux.{{harvnb|Schober|1975}}{{harvnb|Duren|1980}}{{harvnb|Duren|1983}}
{{harvtxt|Schiff|1993}} gave a proof of uniformization for parallel slit domains which was similar to the Riemann mapping theorem. To simplify notation, horizontal slits will be taken. Firstly, by Bieberbach's inequality, any univalent function
:
with
:
is univalent in
:
for
To prove now that the multiply connected domain
:
take
:
is the required parallel slit transformation, suppose reductio ad absurdum that
:
such that
:
and thus
:
mapping from
:
By the strict maximality for the slit mapping in the previous paragraph, we can see that
The proof of the uniqueness of the conformal parallel slit transformation is given in {{harvtxt|Goluzin|1969}} and {{harvtxt|Grunsky|1978}}. Applying the inverse of the Joukowsky transform
:
with its image a horizontal slit domain. Suppose that
:
The images under
Sketch proof via Dirichlet problem
Given
:
where
:
on the boundary. Since
The question then becomes: does a real-valued harmonic function
Uniformization theorem
The Riemann mapping theorem can be generalized to the context of Riemann surfaces: If
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{{harvnb|Bell|1992}} 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
The following is known about numerically approximating the conformal mapping between two planar domains.{{Cite journal |doi= 10.1007/s11512-007-0045-x| title=On the computational complexity of the Riemann mapping|journal=Arkiv för Matematik| volume=45 |issue=2 |pages=221| year=2007|last1=Binder|first1=Ilia|last2=Braverman|first2=Mark|last3=Yampolsky|first3=Michael|arxiv=math/0505617|bibcode=2007ArM....45..221B| s2cid=14545404}}
Positive results:
- There is an algorithm A that computes the uniformizing map in the following sense. Let
\Omega be a bounded simply-connected domain, andw_0\in\Omega .\partial\Omega is provided to A by an oracle representing it in a pixelated sense (i.e., if the screen is divided to2^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\phi:(\Omega, w_0) \to (D, 0) with precision2^{-n} in space bounded byCn^2 and time2^{O(n)} , whereC depends only on the diameter of\Omega andd(w_0, \partial\Omega). Furthermore, the algorithm computes the value of\phi(w) with precision2^{-n} as long as|\phi(w)| < 1-2^{-n}. Moreover, A queries\partial\Omega with precision of at most2^{-O(n)}. In particular, if\partial\Omega is polynomial space computable in spacen^a for some constanta\geq 1 and timeT(n) < 2^{O(n^a)}, then A can be used to compute the uniformizing map in spaceC\cdot n^{\max(a,2)} and time2^{O(n^a)}.
- There is an algorithm A′ that computes the uniformizing map in the following sense. Let
\Omega be a bounded simply-connected domain, andw_0 \in \Omega. Suppose that for somen=2^k, \partial\Omega is given to A′ with precision\tfrac{1}{n} byO(n^2) pixels. Then A′ computes the absolute values of the uniformizing map\phi:(\Omega, w_0) \to (D, 0) within an error ofO(1/n) in randomized space bounded byO(k) and time polynomial inn=2^k (that is, by a BPL({{math|n}})-machine). Furthermore, the algorithm computes the value of\phi(w) with precision\tfrac{1}{n} as long as|\phi(w)|< 1 -\tfrac{1}{n}.
Negative results:
- Suppose there is an algorithm A that given a simply-connected domain
\Omega with a linear-time computable boundary and an inner radius>1/2 and a numbern computes the first20 n digits of the conformal radiusr(\Omega, 0), then we can use one call to A to solve any instance of a #SAT({{math|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
\Omega, where the boundary of\Omega is given with precision1/n by an explicit collection ofO(n^2) pixels. Denote the problem of computing the conformal radius with precision1/n^c by\texttt{CONF}(n,n^c). Then,\texttt{MAJ}_n is AC0 reducible to\texttt{CONF}(n,n^c) for any0 < c < \tfrac{1}{2}.
See also
- Measurable Riemann mapping theorem
- Schwarz–Christoffel mapping – a conformal transformation of the upper half-plane onto the interior of a simple polygon.
- Conformal radius
Notes
{{reflist|30em}}
{{Commons category|Riemann mapping}}
References
- {{citation|last=Ahlfors|first= Lars V.|author-link=Lars Ahlfors|title=Complex analysis. An introduction to the theory of analytic functions of one complex variable|edition=3rd|series= International Series in Pure and Applied Mathematics|publisher= McGraw-Hill|year= 1978|isbn= 0070006571}}
- {{citation|last=Beardon|first= Alan F.|author-link=Alan Frank Beardon|title=Complex analysis.The argument principle in analysis and topology|publisher= John Wiley & Sons|year= 1979|isbn= 0471996718}}
- {{citation|last=Bell|first=Steven R.|title= The Cauchy transform, potential theory, and conformal mapping|series= Studies in Advanced Mathematics|publisher= CRC Press|year= 1992|isbn=0-8493-8270-X}}
- {{citation|last1=Berenstein|first1=Carlos A.|last2=Gay|first2= Roger|title=Complex variables. An introduction |series= Graduate Texts in Mathematics|volume= 125|publisher= Springer-Verlag|year= 1991|isbn= 0387973494}}
- {{citation|last=Carathéodory|first=C.|title=Untersuchungen über die konformen Abbildungen von festen und veranderlichen Gebieten|journal=Mathematische Annalen|volume=72|pages=107–144|year=1912|doi=10.1007/bf01456892 |s2cid=115544426 |url=https://zenodo.org/record/1428282}}
- {{citation|author-link=John B. Conway|last=Conway|first= John B.| year=1978|title=Functions of one complex variable|publisher=Springer-Verlag|isbn=0-387-90328-3}}
- {{citation|first=John B.|last= Conway|author-link=John B. Conway|year= 1995|title=Functions of one complex variable II|publisher=Springer-Verlag| isbn= 0-387-94460-5}}
- {{citation|last=Duren|first=P. L.|author-link=Peter Duren|chapter=Extremal problems for univalent functions|title= Aspects of contemporary complex analysis|pages= 181–208|publisher= Academic Press|year= 1980|isbn=9780121259501|editor1-first=D.A.|editor1-last=Brannan|editor2-first=J.G.|editor2-last=Clunie}}
- {{citation|last=Duren|first=P. L.|author-link=Peter Duren|title=Univalent functions|series=Grundlehren der Mathematischen Wissenschaften|volume= 259|publisher= Springer-Verlag|year= 1983|isbn= 0-387-90795-5}}
- {{citation|last=Gamelin|first=Theodore W.|author-link=Theodore Gamelin|title= Complex analysis|series= Undergraduate Texts in Mathematics|publisher= Springer|year= 2001|isbn=0-387-95069-9}}
- {{citation|last=Goluzin|first=G. M.|title= Geometric theory of functions of a complex variable|series=Translations of Mathematical Monographs|volume= 26|publisher= American Mathematical Society|year= 1969}}
- {{Citation | last=Gray | first=Jeremy | author-link=Jeremy Gray | title=On the history of the Riemann mapping theorem | url=http://www.math.stonybrook.edu/~bishop/classes/math401.F09/GrayRMT.pdf | mr=1295591 | year=1994 | journal=Rendiconti del Circolo Matematico di Palermo. Serie II. Supplemento | issue=34 | pages=47–94}}
- {{citation|last1=Greene|first1=Robert E.|author-link1=Robert Everist Greene|last2=Kim|first2=Kang‑Tae|author-link2=Kang-Tae Kim|title=The Riemann mapping theorem from Riemann's viewpoint|journal=Complex Analysis and Its Synergies|year=2017|volume=3 |doi=10.1186/s40627-016-0009-7|doi-access=free|arxiv=1604.04071}}
- {{citation|last=Grötzsch|first= Herbert|year=1932|author-link=Herbert Grötzsch|title= Über das Parallelschlitztheorem der konformen Abbildung schlichter Bereiche|journal= Berichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse |volume=84|pages=15–36|lang=de|zbl= 0005.06802}}
- {{citation|last=Grunsky|first= Helmut|title=Lectures on theory of functions in multiply connected domains|series=Studia Mathematica| volume= 4| publisher=Vandenhoeck & Ruprecht|year= 1978|isbn= 978-3-525-40142-2}}
- {{citation|last= Jänich|first= Klaus|title= Funktionentheorie. Eine Einführung|edition=3rd|series= Springer-Lehrbuch|publisher= Springer-Verlag |year= 1993|isbn= 3540563377|lang=de}}
- {{citation|last=Jenkins|first= James A.|title=Univalent functions and conformal mapping.|series=Ergebnisse der Mathematik und ihrer Grenzgebiete|volume= 18|publisher= Springer-Verlag|year= 1958}}
- {{citation|last=Kodaira|first=Kunihiko|author-link=Kunihiko Kodaira|title= Complex analysis|series=Cambridge Studies in Advanced Mathematics|volume= 107|publisher= Cambridge University Press|year= 2007|isbn= 9780521809375}}
- {{citation|author-link=Steven G. Krantz|last=Krantz|first=Steven G.|year= 2006|title=Geometric Function Theory| chapter= Riemann Mapping Theorem and its Generalizations|pages=83–108|publisher=Birkhäuser|isbn=0-8176-4339-7}}
- {{citation|author-link1=Akhlesh Lakhtakia|last1=Lakhtakia|first1=Akhlesh|last2=Varadan|first2=Vijay K.|last3=Messier|first3=Russell|author-link4=Vasundara Varadan|last4=Varadan|first4=Vasundara|year=1987|title=Generalisations and randomisation of the plane Koch curve|journal=Journal of Physics A: Mathematical and General|volume=20|issue=11|pages=3537–3541|doi=10.1088/0305-4470/20/11/052}}
- {{Citation | last=Nehari | first=Zeev |author-link=Zeev Nehari| title=Conformal mapping | year=1952 | publisher=Dover Publications |isbn=9780486611372 }}
- {{citation | author-link= W. F. Osgood|last1=Osgood | first1=W. F. | title=On the Existence of the Green's Function for the Most General Simply Connected Plane Region | jstor=1986285 | publisher=American Mathematical Society | location=Providence, R.I. | jfm=31.0420.01 | year=1900 | journal=Transactions of the American Mathematical Society | issn=0002-9947 | volume=1 | issue=3 | pages=310–314 | doi=10.2307/1986285}}
- {{citation|title=Zum Parallelschlitztheorm unendlich- vielfach zusammenhängender Gebiete |last=de Possel|first= René|author-link=René de Possel|journal=Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse |year= 1931|pages=199−202|lang=de|url=https://gdz.sub.uni-goettingen.de/id/PPN252457811_1931?tify={%22pages%22:[203],%22panX%22:0.758,%22panY%22:0.57,%22view%22:%22export%22,%22zoom%22:0.501} }}
- {{citation |author-link=Reinhold Remmert |last=Remmert |first=Reinhold |year=1998 |title=Classical topics in complex function theory |translator=Leslie M. Kay |publisher=Springer-Verlag |isbn=0-387-98221-3}}
- {{citation|author-link=Bernhard Riemann|last=Riemann|first=Bernhard| year=1851|url=http://www.emis.de/classics/Riemann/Grund.pdf|title= Grundlagen für eine allgemeine Theorie der Functionen einer veränderlichen complexen Grösse|location= Göttingen|lang=de}}
- {{citation|last=Schiff|first= Joel L.|title=Normal families|series=Universitext|publisher= Springer-Verlag|year= 1993|isbn= 0387979670}}
- {{citation|last=Schober|first=Glenn|title=Univalent functions—selected topics|series=Lecture Notes in Mathematics|volume=478| publisher=Springer-Verlag|year= 1975|pages=181–190|chapter=Appendix C. Schiffer's boundary variation and fundamental lemma}}
- {{Citation | last1=Walsh | first1=J. L. | author-link=Joseph L. Walsh | title=History of the Riemann mapping theorem | jstor=2318448 | mr=0323996 | year=1973 | journal=The American Mathematical Monthly | issn=0002-9890 | volume=80 | issue=3 | pages=270–276 | doi=10.2307/2318448}}
External links
- {{SpringerEOM|title=Riemann theorem|id=Riemann_theorem|first=E.P.|last= Dolzhenko}}
{{Bernhard Riemann}}
{{DEFAULTSORT:Riemann Mapping Theorem}}