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's pole-pushing lemma
Statement
Let be compact.
- If is a pole-pushing chain from to relative to , then for every there is a rational function with at most one finite pole, at , such that .
- If is such a chain and in addition for every , then for every there is a polynomial with .
Facts & Assumptions
Given: A compact set , a pole-pushing chain as in the statement, and a tolerance .
In a pole-pushing chain, each consecutive pair lies in a closed disc disjoint from (Pole pushing along a chain of discs).
Proof
Fix one disc step of the chain, say a closed disc disjoint from and two points . [given, L1] Define to be the set of points such that can be approximated uniformly on by rational functions with only pole . Certainly .
Let . Choose so that and . [step 1.1, choose, algebra] If and , then for one has , so with uniform convergence on . Therefore every rational function with only pole can be approximated uniformly on by one with only pole . Since , this shows , so is open. The same expansion with and exchanged shows that whenever is sufficiently close to , then as well. Hence is also closed in . Because the disc is connected and is nonempty, , so in particular .
If , then , and proves clause 1 with zero error. Assume . Apply step 2.1 successively to the discs of the chain, choosing the -th local error below . [step 2.1, choose, construct, cases, algebra] The triangle inequality then produces a rational function with only pole and total error below on . This proves clause 1.
For clause 2, clause 1 gives a rational function with only pole and . [step 3.1, algebra, discharge-construct] Write the principal part of at as . Because on , each factor has a power series in that converges uniformly on . Truncating those finitely many series gives a polynomial with . Then , proving the polynomial approximation.
Depends on
Used by
Dependency tree · two levels
2 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, Lemma 9.2.2 (standard reference, not scraped)
- M. Weber, Complex Analysis, Lemma 4.4.4 (standard reference, not scraped)