How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Runge approximation with a prescribed pole set
Statement
Let be compact, let be an open neighbourhood of , let be holomorphic, and let be a Runge pole set for . Then for every there is a rational function with poles only in such that
Facts & Assumptions
Given: A compact set , a holomorphic function on a neighbourhood of , a Runge pole set , and a tolerance .
The Cauchy integral over a suitable enclosing cycle can be approximated uniformly on by rational functions with poles on that cycle (Riemann sums of the Cauchy integral give rational approximation).
A Runge pole set meets every complementary component of (Runge pole sets for rational approximation on a compact set).
A simple pole may be pushed through one complementary component to any chosen representative in that component, or to in the unbounded case (Runge's pole-pushing lemma).
Proof
By [L1], choose a rational function whose poles lie in and such that .
If , then already has no finite poles, so its poles are contained in and step 1.1 already proves the theorem. Assume from now on that .
For each pole , let be the connected component of containing it. By [L2], choose . Applying [L3] to the function inside , choose a rational function with poles only at and
Put . Then every pole of lies in , and the triangle inequality together with steps 1.1 and 3.1 gives
Depends on
Used by
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. Lebl, Guide to Cultivating Complex Analysis, Theorem 9.2.3 (standard reference, not scraped)
- M. Weber, Complex Analysis, Theorem 4.4.3 (standard reference, not scraped)