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:
(rn)n\in\N
(rn)n\in\N
Note that not every complex number in A needs to be a pole of every rational function of the sequence
(rn)n\in\N
(rn)n\in\N
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 an open set containing K, then there exists a sequence of polynomials
(pn)
Runge's theorem generalises as follows: one can take A to be a subset of the Riemann sphere C∪ and require 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 C\K.
An elementary proof, inspired by, proceeds as follows. There is a closed piecewise-linear contour Γ in the open set, containing K in its interior, such that all the chosen distinguished points are in its exterior. By Cauchy's integral formula
f(w)={1\over2\pii}\int\Gamma{f(z)dz\overz-w}
for w in K. Riemann approximating sums can be used to approximate the contour integral uniformly over K (there is a similar formula for the derivative). Each term in the sum is a scalar multiple of (z − w)−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 (z − w)−1. If z0 is the point in the same component as z, take a path from z to z0.
If two points are sufficiently close on the path, we may use the formula
1 | |
z-z0 |
=
1 | |
z-w0 |
infty | |
\sum | |
n=0 |
\left(
z0-w0 | |
z-w0 |
\right)n
|z0-w0|<|z-w|
If z0 is the point at infinity, then by the above procedure the rational function (z − w)−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.