World Library  
Flag as Inappropriate
Email this Article

Runge's theorem

Article Id: WHEBN0003199591
Reproduction Date:

Title: Runge's theorem  
Author: World Heritage Encyclopedia
Language: English
Subject: Missing science topics/ExistingMathR, Runge, Mergelyan's theorem, Carl David Tolmé Runge, Complex analysis
Publisher: World Heritage Encyclopedia

Runge's theorem

Given a holomorphic function f on the blue compact set and a point in each of the holes, one can approximate f as well as desired by rational functions having poles only at those three points.

In complex analysis, Runge's theorem (also known as Runge's approximation theorem) is named after the German mathematician Carl Runge who first proved it in the year 1885. It states the following:

Denoting by C the set of complex numbers, let K be a compact subset of C and let f be a function which is holomorphic on an open set containing K. If A is a set containing at least one complex number from every bounded connected component of C\K then there exists a sequence (r_n)_{n\in\N} of rational functions which converges uniformly to f on K and such that all the poles of the functions (r_n)_{n\in\N} are in A.

Note that not every complex number in A needs to be a pole of every rational function of the sequence (r_n)_{n\in\N}. We merely know that for all members of (r_n)_{n\in\N} that do have poles, those poles lie in A.

One aspect that makes this theorem so powerful is that one can choose the set A arbitrarily. In other words, one can choose any complex numbers from the bounded connected components of C\K and the theorem guarantees the existence of a sequence of rational functions with poles only amongst those chosen numbers.

For the special case in which C\K is a connected set (in particular when K is simply-connected), the set A in the theorem will clearly be empty. Since rational functions with no poles are simply polynomials, we get the following corollary: If K is a compact subset of C such that C\K is a connected set, and f is a holomorphic function on K, then there exists a sequence of polynomials (p_n) that approaches f uniformly on K.

Runge's theorem generalises as follows: if one takes A to be a subset of the Riemann sphere C∪{∞} and requires that A intersect also the unbounded connected component of K (which now contains ∞). That is, in the formulation given above, the rational functions may turn out to have a pole at infinity, while in the more general formulation the pole can be chosen instead anywhere in the unbounded connected component of K.


  • Proof 1
  • See also 2
  • References 3
  • External links 4


An elementary proof, given in Sarason (1998), proceeds as follows. There is a closed piecewise-linear contour Γ in the open set, containing K in its interior. By Cauchy's integral theorem

f(w)={1\over 2\pi i} \int_\Beta {f(z) \, dz\over z-w}

for w in K. Riemann approximating sums can be used to approximate the contour integral uniformly over K. Each term in the sum is a scalar multiple of (zw)−1 for some point z on the contour. This gives a uniform approximation by a rational function with poles on Γ.

To modify this to an approximation with poles at specified points in each component of the complement of K, it is enough to check this for terms of the form (zw)−1. If z0 is the point in the same component as z, take a piecewise-linear path from z to z0. If two points are sufficiently close on the path, any rational function with poles only at the first point can be expanded as a Laurent series about the second point. That Laurent series can be truncated to give a rational function with poles only at the second point uniformly close to the original function on K. Proceeding by steps along the path from z to z0 the original function (zw)−1 can be successively modified to give a rational function with poles only at z0.

If z0 is the point at infinity, then by the above procedure the rational function (zw)−1 can first be approximated by a rational function g with poles at R > 0 where R is so large that K lies in w < R. The Taylor series expansion of g about 0 can then be truncated to give a polynomial approximation on K.

See also


  • Conway, John B. (1997), A Course in Functional Analysis (2nd ed.), Springer, ISBN 0-387-97245-5 
  • Greene, Robert E.; Krantz, Steven G. (2002), Function Theory of One Complex Variable (2nd ed.), American Mathematical Society, ISBN 0-8218-2905-X 
  • Sarason, Donald (1998), Notes on complex function theory, Texts and Readings in Mathematics 5, Hindustan Book Agency, pp. 108–115, ISBN 81-85931-19-4 

External links

  • Hazewinkel, Michiel, ed. (2001), "Runge theorem",  
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.