Runge's theorem
Runge's theorem is a theorem.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2540537319
- Described as
- theorem
- What it is
- theorem
- Wikipedias with a page
- 9
Wikidata item Q1505529 (wikidata.org/wiki/Q1505529), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1363730725
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 1885. It states the following:
Denoting by C the set of complex numbers, let K be a closed subset of ℂ∪{∞} 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 connected component of ℂ∪{∞}∖K, then there exists a sequence (rn)n∈ℕ of rational functions which converges uniformly to f on K and such that all the poles of the functions (rn)n∈ℕ are in A.
Note that not every complex number in A needs to be a pole of every rational function of the sequence (rn)n∈ℕ. We merely know that for all members of (rn)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 ℂ∪{∞}∖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 K is a compact subset of ℂ and ℂ∖K is a connected set one can pick A={∞}. Since rational functions with no poles except at infinity 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) that approaches f uniformly on K.
From the Wikipedia article “Runge's theorem” (en.wikipedia.org/wiki/Runge's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
